On distributed, geographic-based packet routing for LEO satellitenetworks
Henderson, T.R.; Katz, R.H.
Global Telecommunications Conference, 2000. GLOBECOM apos;00. IEEE
Volume 2, Issue , 2000 Page(s):1119 - 1123 vol.2
Digital Object Identifier 10.1109/GLOCOM.2000.891311
Summary:Advances in satellite technology are enabling the deployment of
large constellations of low Earth Orbiting (LEO) satellites.
Next-generation systems will be tailored for broadband, packet-switched
services, and therefore require either distributed or centralized packet
routing mechanisms. Some researchers have hypothesized that the
semi-regular mesh topology of a polar-orbiting constellation admits a
simple distributed routing protocol based on using geographic
information embedded in the node address. We take a closer look at this
hypothesis in the context of commercially-proposed constellation
designs. Using simulation, we study a distributed routing protocol that
selects the next hop based on a minimization of the remaining distance
to the destination. Our numerical results indicate that this routing
strategy usually yields good routes, with an average latency degradation
of less than 10 ms when compared with the optimal route. However, there
are locations in the topology, most notably around the counter-rotating
seams, the polar regions, and close to the destination of a packet,
where the assumption of a regular mesh topology breaks down and it is
difficult to guarantee robustness without adding significant additional
complexity to the protocol
View citation and abstract |
Cart
