Navigation in distance vector spaces and its use for node avoidance routing

Proceedings - IEEE INFOCOM

Volumn , Issue , 2007, Pages 1253-1261

  Zlatokrilov, Haim ^a   Levy, Hanoch ^a  

^a TEL AVIV UNIVERSITY   (Israel)

Author keywords

Beacon; Distance vector; Multipath; Node avoidance; Routing; Virtual position

Indexed keywords

COMPUTER SIMULATION; NETWORK SECURITY; ROUTING ALGORITHMS; ROUTING PROTOCOLS;

BEACONS; DISTANCE VECTORS; NODE AVOIDANCE; VIRTUAL POSITION;

VECTORS;

EID: 34548335245     PISSN: 0743166X     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/INFCOM.2007.149     Document Type: Conference Paper

References (26)

1. S. Bak, and J. Cobb, "Randomized Distance-Vector Routing Protocol", Proceedings of the 1999 ACM symposum on applied computing: 1999.
2. A. Bagchi, A. Chaudhary, M. T. Goodrich, S. Xu, "Constructing Disjoint Paths for Secure Communication", DISC 2003: 181-195.
3. S. Bahk, M.El Zarki, "Dynamic Multi-path Routing and How it Compares with other Dynamic Routing Algorithms for High Speed Wide Area Networks", in Proceedings of ACM SIGCOMM '92, Aug. 1992.
4. S. Bohacek, J. P. Hespanha, K. Obraczka, J. Lee, C. Lim, "Enhancing Security Via Stochastic Routing", In Proc. of the 11th IEEE ICCCN, May 2002.
5. BRITE: Boston university Representative Internet Topology gEnerator, www.cs.bu.edu/brite/
6. M.Chay, S. Moon, Chong-Dae Parkz, and Aman Shaikh, "Placing Relay Nodes for Intra-Domain Path Diversity", IEEE Infocom, April 2006.
7. J. Chen, P. Druschel, D. Subramanian, "An Efficient Multipath Forwarding Method", INFOCOM 1998: 1418-1425.
8. R. Cohen, G. Nakibli, "On the Computational Complexity and Effectiveness of N-hub Shortest-Path Routing", IEEE Infocom 2004.
9. Y. Guo, F. Kuipers, P. Van Mieghem, "Link Disjoint Paths for reliable QoS", International Journal of Communication Systems 779-798 NOV 2003.
10. J. P. Hespanha and S. Bohacek, "Preliminary results in routing games," in Proc. Of the 2001 American Control Conference, June, 2001.
11. C. Hoops, "Analyzis of an equal-cost, multi-path algorithm", RFC 2992, Nov. 2000.
12. B. Karp, H.T Kung, "Greedy Perimeter Stateless Routing for Wireless Networks", in Proceedings MobiCom 2000, Boston, MA, August, 2000, pp. 243-254.
13. P. P. C. Lee, Vishal Misra and D. Rubenstein, "Distributed Algorithms for Secure Multipath Routing", IEEE Infocom 2005.
14. H. Levy and H. Zlatokrilov, "The Effect of Packet Dispersion on Voice Applications in IP Networks", IEEE/ACM Transactions on Networking, April 2006, Vol. 14.
15. H. Lim, J. C. Hau, C. Hoi, "Constructing Internet Coordinate System Based On Delay Measurment", Internet Measurment Conference 2003.
16. M. Mauve, J. Widmer, H. Hartenstein, "A Survey on Position-Based Routing in Mobile Ad-Hoc Networks," In IEEE Network. Vol. 15 (2001), Nr. 6, S. 30-39.
17. T. Nguyen, A.Zakhor, "Path Diversity with Forward Error Correction (PDF) System for Packet Switched Networks", IEEE Infocom 2003.
18. A. Orda, A. Spronston, "Efficient Algorithms for Computing Disjoint QoS Paths", IEEE Infocom 2004 Hong-Kong.
19. M. O. Rabin, "Efficient dispersal of information for security, load balancing, and fault tolerance", J. Assoc. Comput. Mach., vol. 36, no. 2, pp. 335-348, Apr. 1989.
20. S. D. Servetto and G. Barrenechea, "Constrained Random walks on random graphs: Routing algorithms for large scale wireless sensor networks", In Proc 1st ACM Int. Workshop on Wireless Sensor Networks and Applications (WSNA), Sept. 2002.
21. D. Sidhuand, R. Nairand, S. Abdallah, "Finding Disjoint Paths in Networks", In Proc. of ACM SIGCOMM' 91, 1991.
22. Villamizar, "OSPF optimized multi-path (OSPF-OMP)", draft-ietf-ospf-omp-03.
23. J. Wang, "Load Balancing in Hop-by-Hop Routing with and without traffic splitting", Ph.D. Thesis, Department of Computer Science, University of Illinois at Urbana-Champaign, October, 2003.
24. D. Xu, Y. Chen, Y. Xiong, C. Qiao, X. He, "On Finding Disjoint Paths in Single and Dual Link Cost Network", IEEE Infocom, Mar. 2004, HK.
25. H. Zlatokrilov, H. Levy, "Privacy and Reliability by Dispersive Routing", IEEE Infocom 2006, Barcelona.
26. H. Zlatokrilov, H. Levy, "Navigating in Distance Vector Spaces and Its Use for Node Avoiding Routing", Technical Report, available at: http://www.cs.tau.ac.il/~zlatokri/.