Please use this identifier to cite or link to this item: http://localhost/handle/Hannan/183614
Title: Algorithm for the lightpath reservation provisioning of data relay services in a GEO network
Authors: Changlin Deng;Wei Guo;Weisheng Hu;Weige Zhu;Bilei Zhou
Year: 2017
Publisher: IEEE
Abstract: We study the lightpath provisioning problem of data relay services (DRSs) in a geostationary Earth orbit (GEO) satellite network. In DRS, a low Earth orbit (LEO) satellite user (e.g., remote sensing satellite) delivers the image data to a dedicated ground station (GS) through a GEO network. The LEO satellite needs to circle the Earth several rounds in order to fulfill the transmission, which results in it being connected to different GEO satellites at different times. This phenomenon reveals a fundamental difference between DRS and the services in a terrestrial network, where the source and destination nodes are typically fixed. The lightpath provisioning problem of DRSs is challenging, as we should jointly address routing, bandwidth assignment, and the time schedule of the lightpaths for each DRS. In this paper, we first devise the problem mathematically as a mixed integer linear program (MILP) and then propose a heuristic algorithmcalled data relay request provisioning as the MILP does not scale well. In the numerical analysis, we demonstrate the effectiveness of the heuristic algorithm and provide a sensitivity analysis on several parameters of our problem.
URI: http://localhost/handle/Hannan/183614
volume: 9
issue: 8
More Information: 658,
668
Appears in Collections:2017

Files in This Item:
File SizeFormat 
8005557.pdf1.02 MBAdobe PDF
Title: Algorithm for the lightpath reservation provisioning of data relay services in a GEO network
Authors: Changlin Deng;Wei Guo;Weisheng Hu;Weige Zhu;Bilei Zhou
Year: 2017
Publisher: IEEE
Abstract: We study the lightpath provisioning problem of data relay services (DRSs) in a geostationary Earth orbit (GEO) satellite network. In DRS, a low Earth orbit (LEO) satellite user (e.g., remote sensing satellite) delivers the image data to a dedicated ground station (GS) through a GEO network. The LEO satellite needs to circle the Earth several rounds in order to fulfill the transmission, which results in it being connected to different GEO satellites at different times. This phenomenon reveals a fundamental difference between DRS and the services in a terrestrial network, where the source and destination nodes are typically fixed. The lightpath provisioning problem of DRSs is challenging, as we should jointly address routing, bandwidth assignment, and the time schedule of the lightpaths for each DRS. In this paper, we first devise the problem mathematically as a mixed integer linear program (MILP) and then propose a heuristic algorithmcalled data relay request provisioning as the MILP does not scale well. In the numerical analysis, we demonstrate the effectiveness of the heuristic algorithm and provide a sensitivity analysis on several parameters of our problem.
URI: http://localhost/handle/Hannan/183614
volume: 9
issue: 8
More Information: 658,
668
Appears in Collections:2017

Files in This Item:
File SizeFormat 
8005557.pdf1.02 MBAdobe PDF
Title: Algorithm for the lightpath reservation provisioning of data relay services in a GEO network
Authors: Changlin Deng;Wei Guo;Weisheng Hu;Weige Zhu;Bilei Zhou
Year: 2017
Publisher: IEEE
Abstract: We study the lightpath provisioning problem of data relay services (DRSs) in a geostationary Earth orbit (GEO) satellite network. In DRS, a low Earth orbit (LEO) satellite user (e.g., remote sensing satellite) delivers the image data to a dedicated ground station (GS) through a GEO network. The LEO satellite needs to circle the Earth several rounds in order to fulfill the transmission, which results in it being connected to different GEO satellites at different times. This phenomenon reveals a fundamental difference between DRS and the services in a terrestrial network, where the source and destination nodes are typically fixed. The lightpath provisioning problem of DRSs is challenging, as we should jointly address routing, bandwidth assignment, and the time schedule of the lightpaths for each DRS. In this paper, we first devise the problem mathematically as a mixed integer linear program (MILP) and then propose a heuristic algorithmcalled data relay request provisioning as the MILP does not scale well. In the numerical analysis, we demonstrate the effectiveness of the heuristic algorithm and provide a sensitivity analysis on several parameters of our problem.
URI: http://localhost/handle/Hannan/183614
volume: 9
issue: 8
More Information: 658,
668
Appears in Collections:2017

Files in This Item:
File SizeFormat 
8005557.pdf1.02 MBAdobe PDF