Always acyclic distributed path computation

IEEE/ACM Transactions on Networking

Volumn 18, Issue 1, 2010, Pages 307-319

  Ray, Saikat ^a,b   Guérin, Roch ^c   Kwong, Kin Wah ^c   Sofia, Rute ^d  

^a UNIVERSITY OF PENNSYLVANIA   (United States)

^b Redback Networks   (United States)

^c UNIVERSITY OF PENNSYLVANIA   (United States)

^d UNIVERSITY OF PORTO   (Portugal)

Author keywords

Distance vector routing; Loop free routing

Indexed keywords

DIRECTED GRAPHS; DISTRIBUTED ROUTING ALGORITHM; LOOP FREEDOM; MESSAGE EXCHANGE; NEIGHBORING NODES; PATH COMPUTATION; RECOMPUTATION; ROUTING DECISIONS; SHORTEST PATH ROUTING; SIMULATION RESULT; STABILITY PROBLEM; VECTOR ROUTING;

GRAPH THEORY; PACKET NETWORKS;

ROUTING ALGORITHMS;

EID: 77249148917     PISSN: 10636692     EISSN: None     Source Type: Journal    
DOI: 10.1109/TNET.2009.2025374     Document Type: Article

References (25)

1. N. Feamster, H. Balakrishnan, J. Rexford, A. Shaikh, and K. van der Merwe, "The case for separating routing from routers," in Proc. ACM SIGCOMM Workshop FDNA, Portland, OR, Sep. 2004, pp. 5-12.
2. A. Shankar, C. Alaettinoglu, K. Dussa-Zieger, and I. Matta, "Transient and steady-state performance of routing protocols: Distance-vector versus link-state," Internetw.: Res. Exper., vol.6, no.2, pp. 59-87, Jun. 1995.
3. A. Myers, E. Ng, and H. Zhang, "Rethinking the service model: Scaling Ethernet to a million nodes," presented at the ACM SIGCOMM Hot-Nets, San Diego, CA, 2004.
4. Y. Ohba, "Issues on loop prevention in MPLS networks," IEEE Commun. Mag., vol.37, no.12, pp. 64-68, Dec. 1999.
5. P. Francois and O. Bonaventure, "Avoiding transient loops during IGP convergence in IP networks," in Proc. IEEE INFOCOM, Miami, FL, Mar. 2005, vol.1, pp. 237-247.
6. J. Moy, "OSPF version 2," Internet Engineering Task Force, RFC 2328, 1998 [Online. Available: http://www.rfc-editor.org/rfc/rfc2328.txt
7. A. Shaikh and A.Greenberg, "Experience in black-box OSPF measurement," in Proc. ACM SIGCOMM IMW, San Francisco, CA, Nov. 2001, pp. 113-125.
8. G. Malkin, "RIP version 2," Internet Engineering Task Force, RFC 2453, 1998 [Online. Available: http://www.rfc-editor.org/rfc/ rfc2453.txt
9. R. Albrightson, J. J. Garcia-Luna-Aceves, and J. Boyle, "EIGRP-A fast routing protocol based on distance vectors," presented at the Netw./ Interop. 1994.
10. E. Gafni and D. Bertsekas, "Distributed algorithms for generating loop-free routes in networks with frequently changing topology," IEEE Trans. Commun., vol.COM-29, no.1, pp. 11-18, Jan. 1981.
11. P. M. Merlin and A. Segall, "A failsafe distributed routing protocol," IEEE Trans. Commun., vol.COM-27, pp. 1280-1288, Sep. 1979.
12. J. M. Jaffe and F. M. Moss, "A responsive routing algorithm for computer networks," IEEE Trans. Commun., vol.30, pp. 1768-11762, Jul. 1982.
13. J. J. Garcia-Lunes-Aceves, "Loop-free routing using diffusing computations," IEEE/ACM Trans. Netw., vol.1,no. 1,pp. 130-141, Feb. 1993.
14. S. Vutukury and J. J. Garcia-Luna-Aceves, "A simple approximation to minimum-delay routing," in Proc. ACM SIGCOMM, 1999, pp. 227-238.
15. S. Vutukury and J. J. Garcia-Luna-Aceves, "MDVA: A distance-vector multipath routing protocol," in Proc. IEEE INFOCOM, Anchorage, AK, Apr. 2001, vol.1, pp. 557-564.
16. K. Elmeleegy, A. L. Cox, and T. S. E. Ng, "On count-to-infinity induced forwarding loops in Ethernet networks," in Proc. IEEE INFOCOM, 2006, pp. 1-13.
17. "Transparent interconnection of lots of links (trill)," [Online. Available: http://www.postel.org/rbridge/
18. "802.1aq-Shortest path bridging," [Online. Available: http://www. ieee802.org/1/pages/802.1aq.html
19. D. Bertsekas and R. Gallager, Data Networks, 2nd ed. Englewood Cliffs, NJ: Prentice-Hall, 1991.
20. W. T. Zaumen and J. J. Garcia-Luna-Aceves, "Dynamics of distributed shortest path routing algorithms," in Proc. ACM SIGCOMM, Zurich, Switzerland, Sep. 1991, pp. 31-42.
21. P. Humblet, "Another adaptive distributed shortest-path algorithm," IEEE Trans. Commun., vol.39, no.6, pp. 995-1003, Jun. 1991.
22. E. W. Dijkstra and C. S. Scholten, "Termination detection for diffusing computations," Inf. Process. Lett., vol.11, no.1, pp. 1-4, Aug. 1980.
23. V. D. Park and M. S. Corson, "A highly adaptive distributed routing algorithm for mobile wireless networks," in Proc. IEEE INFOCOM, 1997, vol.3, pp. 1405-1413.
24. A.-L. Barabási and R. Albert, "Emergence of scaling in random networks," Science, vol.286, pp. 509-512, 1999.
25. B. Fortz and M. Thorup, "Internet traffic engineering by optimizing OSPF weights," in Proc. IEEE INFOCOM, 2000, vol.2, pp. 519-528.