Abstract
“Minimizing path delay” is one of the challenges in low Earth orbit (LEO) satellite network routing algo-rithms. Many authors focus on propagation delays with the distance vector but ignore the status information and processing delays of inter-satellite links. For this purpose, a new discrete-time traffic and topology adap-tive routing (DT-TTAR) algorithm is proposed in this paper. This routing algorithm incorporates both inher-ent dynamics of network topology and variations of traffic load in inter-satellite links. The next hop decision is made by the adaptive link cost metric, depending on arrival rates, time slots and locations of source-destination pairs. Through comprehensive analysis, we derive computation formulas of the main per-formance indexes. Meanwhile, the performances are evaluated through a set of simulations, and compared with other static and adaptive routing mechanisms as a reference. The results show that the proposed DT-TTAR algorithm has better performance of end-to-end delay than other algorithms, especially in high traffic areas.
Highlights
To meet the rapidly growing real-time multimedia services, satellite networks should offer quality of service (QoS) guarantees
The results show that the proposed discrete-time traffic and topology adaptive routing (DT-TTAR) algorithm has better performance of end-to-end delay than other algorithms, especially in high traffic areas
A centralized routing scheme geared toward ATM-based low Earth orbit (LEO)/MEO networks, called dynamic virtual topology routing (DVTR) [6], was proposed, which relied on the Dijkstra shortest path algorithm to compute the optimal path for any pair of satellites
Summary
To meet the rapidly growing real-time multimedia services, satellite networks should offer quality of service (QoS) guarantees. A discrete-time traffic and topology adaptive routing (DT-TTAR) algorithm is derived without considering fractional handover but integer handover for a LEO satellite system. In DT-TTAR algorithm, the routing programs are kept “fixed” in each discrete interval Such discrete-time topology still exhibits dynamic features in terms of considerable ISLs’ distance variations, and the traffic patterns on both up-down and inter-satellite links show variations due to the rapid relative movements between serving satellites and served (global and inhomogeneous) users’ distributions. The traffic model [13] incorporated into the DT-TTAR algorithm, takes into account both geographic and demographic factors Another important aspect of the study is that Jackson queuing network model [14] is adopted to obtain the ISLs’ queuing delay. When satellite S3,2 (the second satellite in the third orbit in Figure 1) approaches the polar area, the ISLs S3,2 S2,2 and S3,2 S 4,2 should be switched-off
Sign-in/Register to view highlights & summary Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callMore From: International Journal of Communications, Network and System Sciences
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
