Rollback Traffic Avoidance for Snapshot routing algorithm in cyclic mobile networks

In this paper, we propose an offline rollback traffic avoidance method for the snapshot routing in cyclic mobile networks. Since the snapshot routing tables are switched simultaneously, part of the traffic may be sent back on some links if the new routing path contains the same links but with reversed forwarding direction against the old one. To avoid the rollback traffic, we first formulate the rollback traffic avoidance problem as an integer programming problem which is NP-hard, and then we propose an approximate algorithm called Inter-Snapshot Rollback Traffic Avoidance (ISRTA), to pursuit the approximate optimal solutions. Simulation results show that our method can efficiently eliminate the rollback paths and traffic in the Iridium system. Although the global average network delay is increased slightly, the extra end to end delay caused by rollback traffic is eliminated and the packet loss rate is reduced.

[1]  Ken-ichi Kawarabayashi,et al.  Message Duplication Reduction in Dense Mobile Social Networks , 2010, 2010 Proceedings of 19th International Conference on Computer Communications and Networks.

[2]  Jie Wu,et al.  Scalable Routing in Cyclic Mobile Networks , 2009, IEEE Transactions on Parallel and Distributed Systems.

[3]  Richard A. Raines,et al.  Simulation of two routing protocols operating in a low Earth orbit satellite network environment , 1997, MILCOM 97 MILCOM 97 Proceedings.

[4]  Yunhao Liu,et al.  Distributed Coverage in Wireless Ad Hoc and Sensor Networks by Topological Graph Approaches , 2010, 2010 IEEE 30th International Conference on Distributed Computing Systems.

[5]  Lloyd Wood,et al.  Internetworking with satellite constellations , 2001 .

[6]  Markus Werner,et al.  A Dynamic Routing Concept for ATM-Based Satellite Personal Communication Networks , 1997, IEEE J. Sel. Areas Commun..

[7]  H. Abu-Amara,et al.  Routing in LEO-based satellite networks , 1999, 1999 IEEE Emerging Technologies Symposium. Wireless Communications and Systems (IEEE Cat. No.99EX297).

[8]  Christophe Diot,et al.  Detection and analysis of routing loops in packet traces , 2002, IMW '02.

[9]  Zhili Sun,et al.  Routing in Delay/Disruption Tolerant Networks: A Taxonomy, Survey and Challenges , 2013, IEEE Communications Surveys & Tutorials.

[10]  Tal Mizrahi,et al.  Time-based updates in software defined networks , 2013, HotSDN '13.

[11]  Olivier Bonaventure,et al.  Graceful Convergence in Link-State IP Networks: A Lightweight Algorithm Ensuring Minimal Operational Impact , 2014, IEEE/ACM Transactions on Networking.

[12]  J. V. Evans,et al.  Satellite systems for personal communications , 1998, Proc. IEEE.

[13]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[14]  Thomas Engel,et al.  Predictable Mobile Routing for Spacecraft Networks , 2013, IEEE Transactions on Mobile Computing.

[15]  David Walker,et al.  Abstractions for network update , 2012, SIGCOMM '12.

[16]  Xiaodong Wang,et al.  A High-Throughput MAC Protocol for Wireless Ad Hoc Networks , 2008, IEEE Transactions on Wireless Communications.

[17]  Jianjun Bai,et al.  A distributed hierarchical routing protocol for non-GEO satellite networks , 2004 .