Area avoidance routing in distance-vector networks

Proceedings - IEEE INFOCOM

Volumn , Issue , 2008, Pages 1148-1156

  Zlatokrilov, Haim ^a   Levy, Hanoch ^a,b  

^a TEL AVIV UNIVERSITY   (Israel)

^b ETH ZURICH   (Switzerland)

Author keywords

Area avoidance; Distance vector; Routing; Security

Indexed keywords

AREA AVOIDANCE; DISTANCE VECTOR; REFERENCE NODES; ROUTING; SECURITY;

COMPUTER NETWORKS;

EID: 51449106275     PISSN: 0743166X     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/INFOCOM.2007.95     Document Type: Conference Paper

References (21)

1. S. Bak, and J. Cobb, "Randomized Distance-Vector Routing Protocol", Proceedings of the 1999 ACM symposum on applied computing.
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", ACM SIGCOMM Aug 1992.
4. S. Bohacek, J. P. Hespanha, K. Obraczka, J. Lee, C. Lim, "Enhancing Security Via Stochastic Routing", the 11th IEEE ICCCN, May 2002.
5. S. Capkun, M. Hamdi, J. Hubaux, "GPS-free positioning in mobile ad hoc networks", ICSC, p. 3481-3490, 2001.
6. BRITE: Boston university Representative Internet Topology gEnerator, www.cs.bu.edu/brite/.
7. M.Chay, S. Moon, Chong-Dae Parkz, and A. Shaikh, "Placing Relay Nodes for Intra-Domain Path Diversity", IEEE Infocom, April 2006.
8. J. Chen, P. Druschel, D. Subramanian, "An Efficient Multipath Forwarding Method", INFOCOM 1998: 1418-1425.
9. R. Cohen, G. Nakibli, "On the Computational Complexity and Effectiveness of N-hub Shortest-Path Routing", IEEE Infocom 2004.
10. P. Francis, S. Jamin, C. Jin, Y. Jin, D. Raz, Y. Shavitt, L. Zhang. "IDMaps: A Global Internet Host Distance Estimation Service", IEEE/ACM Transactions on Networking, 9(5):525-540, Oct- 2001.
11. Y. Guo, F. Kuipers, P Van Mieghem, "Link Disjoint Paths for reliable QoS", International Journal of Communication Systems 779-798 Nov03.
12. P. P. C. Lee, V. Misra and D. Rubenstein, "Distributed Algorithms for Secure Multipath Routing", IEEE Infocom 2005.
13. 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.
14. A. Orda, A. Spronston, "Efficient Algorithms for Computing Disjoint QoS Paths", IEEE Infocom 2004 Hong-Kong.
15. C. E. Perkins, E. M. Belding-Royer, S. Das. "Ad Hoc On Demand Distance Vector (AODV) Routing." IETF RFC 3561.
16. D. Sidhuand, R. Nairand, S. Abdallah, "Finding Disjoint Paths in Networks", In Proc. of ACM SIGCOMM' 91, 1991.
17. Villamizar, "OSPF optimized multi-path (OSPF-OMP)", draft-ietf-ospf-omp-03.
18. 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.
19. H. Zlatokrilov, H. Levy, "Privacy and Reliability by Dispersive Routing", IEEE Infocom 2006, Barcelona.
20. H. Zlatokrilov, H.Levy, "Navigation in Distance Vector Spaces and Its Use for Node Avoidance Routing", IEEE Infocom 2007.
21. H. Zlatokrilov, H. Levy, "Area Avoidance Routing in Distance-Vector Networks", Technical Report found at: http://www.cs.tau.ac.il/~zlatokri/.