Please use this identifier to cite or link to this item: http://localhost/handle/Hannan/183614
Full metadata record
DC FieldValueLanguage
dc.contributor.authorChanglin Dengen_US
dc.contributor.authorWei Guoen_US
dc.contributor.authorWeisheng Huen_US
dc.contributor.authorWeige Zhuen_US
dc.contributor.authorBilei Zhouen_US
dc.date.accessioned2013en_US
dc.date.accessioned2020-04-06T07:35:38Z-
dc.date.available2020-04-06T07:35:38Z-
dc.date.issued2017en_US
dc.identifier.other10.1364/JOCN.9.000658en_US
dc.identifier.urihttp://localhost/handle/Hannan/183614-
dc.description.abstractWe 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.en_US
dc.format.extent658,en_US
dc.format.extent668en_US
dc.publisherIEEEen_US
dc.relation.haspart8005557.pdfen_US
dc.titleAlgorithm for the lightpath reservation provisioning of data relay services in a GEO networken_US
dc.typeArticleen_US
dc.journal.volume9en_US
dc.journal.issue8en_US
Appears in Collections:2017

Files in This Item:
File SizeFormat 
8005557.pdf1.02 MBAdobe PDF
Full metadata record
DC FieldValueLanguage
dc.contributor.authorChanglin Dengen_US
dc.contributor.authorWei Guoen_US
dc.contributor.authorWeisheng Huen_US
dc.contributor.authorWeige Zhuen_US
dc.contributor.authorBilei Zhouen_US
dc.date.accessioned2013en_US
dc.date.accessioned2020-04-06T07:35:38Z-
dc.date.available2020-04-06T07:35:38Z-
dc.date.issued2017en_US
dc.identifier.other10.1364/JOCN.9.000658en_US
dc.identifier.urihttp://localhost/handle/Hannan/183614-
dc.description.abstractWe 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.en_US
dc.format.extent658,en_US
dc.format.extent668en_US
dc.publisherIEEEen_US
dc.relation.haspart8005557.pdfen_US
dc.titleAlgorithm for the lightpath reservation provisioning of data relay services in a GEO networken_US
dc.typeArticleen_US
dc.journal.volume9en_US
dc.journal.issue8en_US
Appears in Collections:2017

Files in This Item:
File SizeFormat 
8005557.pdf1.02 MBAdobe PDF
Full metadata record
DC FieldValueLanguage
dc.contributor.authorChanglin Dengen_US
dc.contributor.authorWei Guoen_US
dc.contributor.authorWeisheng Huen_US
dc.contributor.authorWeige Zhuen_US
dc.contributor.authorBilei Zhouen_US
dc.date.accessioned2013en_US
dc.date.accessioned2020-04-06T07:35:38Z-
dc.date.available2020-04-06T07:35:38Z-
dc.date.issued2017en_US
dc.identifier.other10.1364/JOCN.9.000658en_US
dc.identifier.urihttp://localhost/handle/Hannan/183614-
dc.description.abstractWe 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.en_US
dc.format.extent658,en_US
dc.format.extent668en_US
dc.publisherIEEEen_US
dc.relation.haspart8005557.pdfen_US
dc.titleAlgorithm for the lightpath reservation provisioning of data relay services in a GEO networken_US
dc.typeArticleen_US
dc.journal.volume9en_US
dc.journal.issue8en_US
Appears in Collections:2017

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