Performance study of adaptive routing algorithms for LEO satellite constellations under Self-Similar and Poisson traffic

Authors:
Ioannis Gragopoulos;Evangelos Papapetrou;Fotini-Niovi Pavlidou
Affiliations:
Department of Electrical & Computer Engineering, Aristotle University of Thessaloniki, P.O. Box 1641, 54006 Thessaloniki, Greece Tel.:+30 31 996285/ E-mail: {grag,epapet}@egnatia.ee.auth.gr/ niovi ...;Department of Electrical & Computer Engineering, Aristotle University of Thessaloniki, P.O. Box 1641, 54006 Thessaloniki, Greece Tel.:+30 31 996285/ E-mail: {grag,epapet}@egnatia.ee.auth.gr/ niovi ...;(Correspd.) Department of Electrical & Computer Engineering, Aristotle University of Thessaloniki, P.O. Box 1641, 54006 Thessaloniki, Greece Tel.:+30 31 996285/ E-mail: {grag,epapet}@egnatia.ee.au ...
Venue:
Space Communications
Year:
2000

Citing 3
Cited 3

Data networks

Data networks
On self-similar traffic in ATM queues: definitions, overflow probability bound, and cell delay distribution

IEEE/ACM Transactions on Networking (TON)
Multicommodity flow models, failure propagation, and reliable loss network design

IEEE/ACM Transactions on Networking (TON)

Distributed on-demand routing for LEO satellite systems

Computer Networks: The International Journal of Computer and Telecommunications Networking
Routing decisions independent of queuing delays in broadband LEO networks

GLOBECOM'09 Proceedings of the 28th IEEE conference on Global telecommunications
Agent-based load balancing routing for LEO satellite networks

Computer Networks: The International Journal of Computer and Telecommunications Networking

Quantified Score

Hi-index	0.00

Visualization

Abstract

A comparative study of routing techniques is carried out for LEO constellations interconnecting high speed terrestrial networks, assuming Poisson and Self-Similar input traffic. Shortest path routing as well as optimal routing (flow deviation) methods are applied for balanced and unbalanced traffic load and for uniform and non uniform distribution of the earth stations. The performance of flow deviation method is shown to be very successful even for the LEO complicated networks, for both Poisson or Self-Similar input. A modification of the classic flow deviation algorithm regarding the number of paths we work with is proposed. Indeed, it is proved that a k-paths flow deviation method is always easy to obtain and gives robust results for any traffic pattern at a very affordable algorithmic complexity.