Performance evaluation of adaptive and static routing algorithms and contention resolution techniques in LEO satellite constellations
RAST 2005 - 2nd International Conference on Recent Advances in Space Technologies, İstanbul, Türkiye, 9 - 11 Haziran 2005, cilt.2005, ss.207-212, (Tam Metin Bildiri)
- Yayın Türü: Bildiri / Tam Metin Bildiri
- Cilt numarası: 2005
- Doi Numarası: 10.1109/rast.2005.1512563
- Basıldığı Şehir: İstanbul
- Basıldığı Ülke: Türkiye
- Sayfa Sayıları: ss.207-212
- Boğaziçi Üniversitesi Adresli: Evet
Özet
This paper evaluates static, adaptive, and semi-adaptive routing algorithms and picket contention resolution techniques in a low earth orbit (LEO) satellite constellation in terms of throughput and fairness for both uniform and bursty traffic models. In order to make such an evaluation, It is crucial to find out how thoughtput and packet drop ratio is affected by various parameters, i.e. Implementation of buffers at each satellite, number of transmitters per satellite, instantenous network traffic load, type of the traffic (bursty vs uniform), and the burst size for non-uniform traffic. Simulations are made to Investigate the effects of these parameters. Moreover, simulation results are plotted to better illustrate these effects on throughput and fairness of packet contention resolutions schemes and routing algorithms. The contention resolution schemes emloyed during simulations arc Shortest Hop Win (SHW), Oldest Packer Win (OPW)and Random Packet Win (RPW) proposed in [1]. The routing algorithms used are static routing and adaptive routing described in [2] and semi-adaptive routing developed during the simulations. © 2005 IEEE.