Proposal for st-routing protocol

Telecommunication Systems

Volumn 25, Issue 3-4, 2004, Pages 287-298

  Akon, Mohammad Mursalin ^a   Asaduzzaman, Shah ^a   Rahman, Md Saidur ^a   Matsumoto, Mitsuji ^b  

^a BANGLADESH UNIVERSITY OF ENGINEERING AND TECHNOLOGY   (Bangladesh)

^b WASEDA UNIVERSITY   (Japan)

Author keywords

Biconnected graph; Multi path routing; Routing protocol; St numbering

Indexed keywords

ALGORITHMS; COMPUTER NETWORKS; CONGESTION CONTROL (COMMUNICATION); GRAPH THEORY; INFORMATION RETRIEVAL SYSTEMS; NETWORK PROTOCOLS; PACKET NETWORKS; PROGRAM PROCESSORS; ROBUSTNESS (CONTROL SYSTEMS); ROUTERS; TELECOMMUNICATION LINKS;

BICONNECTED GRAPHS; MULTI-PATH ROUTING; ROUTING PROTOCOLS; ST-NUMBERINGS;

VOICE/DATA COMMUNICATION SYSTEMS;

EID: 3543117772     PISSN: 10184864     EISSN: None     Source Type: Journal    
DOI: 10.1023/B:TELS.0000014786.39265.c0     Document Type: Article

References (30)

1. R. Albrightson and J.J. Garcia-Luna-Aceves and J. Boyle, EIGRP - A fast routing protocol based on distance-vectors, in: Proc. of Networld/Interop '94, Las Vegas, NV, May 1994.
2. F.S. Annexstein and K.A. Berman, Directional routing via generalized st-numberings, SIAM Journal on Discrete Mathematics 13(2) (2000) 268-279.
3. R.F.M. Aranha and C.P. Rangan, An efficient distributed algorithm for st-numbering the vertices of a biconnected graph, Journal of Universal Computer Science 1(9) (1995) 633-651.
4. R.E. Bellman, On a routing problem, Quarterly of Applied Mathematics (1958) 87-90.
5. K.S. Booth and G.S. Lueker, Testing the consecutive ones property, interval graphs, and graph planarity testing using PQ-tree algorithms, Journal of Computer Systems Science 13 (1976) 335-379.
6. Border gateway protocol 4 (BGP-4), IETF, RFC-1654 (July 1994).
7. J. Cheriyan and S.N. Maheshwari, Finding non-separating induced cycle and independent spanning trees in 3-connected graphs, Journal of Algorithms 9 (1988) 507-537.
8. G. Di Battista, P. Eades, R. Tamassia and I.G. Tollis, Graph Drawing (Prentice-Hall, Upper Saddle River, NJ, 1999).
9. E.W. Dijkstra and C.S. Scholten, Termination detection for diffusing computations, Information Processing Letters 11 (1980) 1-4.
10. S. Even, Graph Algorithms (Computer Science Press, Maryland, MD, 1979).
11. J.J. Garcia-Luna-Aceves, A loop free path finding algorithm: Specification, verification and complexity, in: INFOCOM, IEEE, 1995.
12. J.J. Garcia-Luna-Aceves and J. Behrens, Distributed scalabe routing based on vectors of link states, IEEE Journal on Selected Areas in Communications 13(8) (1995).
13. J.J. Garcia-Luna-Aceves and M. Spohn, Scalable link-state Internet routing, in: Proc. of 6th Internat. Conf. on Internet Routing Protocols, October 1998, pp. 52-61.
14. C. Hedrick, Routing information protocol, Internet Request for Comment 1058 (June 1988).
15. Intra-domain IS-IS routing protocol, International Standards Organization, ISO/IEC JTC1/SC6 WG2 N323 (September 1989).
16. S. Keshav, An Engineering Approach to Computer Networking (Addison-Wesley, Don Mills, ON, 1997).
17. G. Malken, Version 2 - Carrying additional information, Internet Request for Comment 1723 (1994).
18. N. Maxemchuk and M. El Zarki, Routing and flow control in high speed wide area networks, in: Proc. of IEEE, 1990.
19. W. Mostafa and M. Singhal, A taxonomy of multicast protocols for Internet applications, Computer Communications 20 (1998) 1448-1457.
20. J. Moy, OSPF version 2, Internet Request for Comment 1247 (1991).
21. J.T. Moy, OSPF: Anatomy of an Internet Routing Protocol (Addison-Wesley, Reading, MA, 1998).
22. S. Nakano, M.S. Rahman and T. Nishizeki, A linear-time algorithm for four-partitioning four-connected planar graphs, Information Processing Letters 62 (1997) 315-322.
23. T. Nishizeki and N. Chiba, Planar Graphs: Theories and Algorithms (North-Holland, Amsterdam, 1988).
24. Y. Rekhter, Inter-domain routing protocol (IDRP), Inter-networking: Research and Experience 2(4) (1993) 61-80.
25. A.S. Tanenbaum, Computer Networks (Prentice-Hall, Englewood Cliffs, NJ, 2002).
26. S. Vuturuky and J.J. Garcia-Luna-Aceves, A simple approximation to minimum delay routing, in: Proc. of ACM SIGCOMM, 1999.
27. S. Vuturuky and J.J. Garcia-Luna-Aceves, MDVA: A distance-vector multipath routing protocol, in: Proc. of the 20th Annual Joint Conf. of the IEEE Computer and Communication Societies (INFOCOM 2001), Vol. 1, April 2001, pp. 557-564.
28. D.B. West, Introduction to Graph Theory (Prentice-Hall, Englewood Cliffs, NJ, 1996).
29. W.T. Zaumen and J.J. Garcia-Luna-Aceves, Loop free multipath routing using generalized diffusing computation, in: Proc. of IEEE INFOCOM, March 1998.
30. A. Zehavi and A. Itai, Three tree-paths, Journal of Graph Theory 13 (1989) 175-188.