School of Computer and Information Science, Southwest University, Chongqing, China

---

Abstract—Satellite IP network (SIPN), which includes satellites whose orbit information is known or unknown is a kind of Delay- and Disruption-Tolerant Networking. This paper introduces a new Partially Known Routing (PKR) for SIPN since there is no efficient routing method for this partially known network. Available orbit information is used by PKR to estimate next meeting time between satellites. The meeting time is mapped to the edge weight of a graph. Then a satellite set which includes all satellites in the shortest path is outputted by PKR algorithm, which is a based on extended Dijkstra algorithm. Finally, PKR routes packets based on the satellite set. If the satellite set is not null, PKR forwards just one copy of a packet to only one satellite in the satellite. Otherwise, PKR will send multicopies of a packet to other satellites. The simulation result shows that PKR has better performance on packet loss rate and transferring throughput under all traffic loads; the average end-to-end delays of PKR is a little higher than Epidemic routing under lower traffic loads, but the delays is close to and even better than Epidemic routing under higher traffic loads. PKR fits for the routing where higher loss rate and throughput are required. It also routes packets timely when the traffic load is high.

Index Terms—Partially Known Routing; satellite IP networks; Epidemic routing; DTN.

[PDF]

Cite: Yu Zhang, Feng Liu, "Partially Known Routing for Satellite IP Networks," Journal of Software vol. 8, no. 8, pp. 1851-1858, 2013.