Routing in Packet-Switched Networks Using Path-Finding Algorithms

Abstract : Route assignment is one of the operational problems of a communication network. The function of a routing algorithm is to guide packets through the communication network to their correct destinations. This dissertation is on the design and analysis of distributed, adaptive routing algorithms and protocols for packet switching networks. We introduce the general framework on which these algorithms are based. Using this general model, we propose several routing techniques to suit heterogeneous environments. In this dissertation, we concentrate on distance-vector algorithms. One important drawback of previous distance-vector algorithms based on the distributed Bellman-Ford algorithm for shortest-path computation is that they suffer from counting-to-infinity problem and the bouncing effect. Recently, distributed shortest-path algorithms which utilize information about distance and second-to-last hop along the shortest-path to each destination have been proposed. This class of algorithms are called path-finding algorithms. Our proposals are based on path-finding algorithms.

[1]  Shree N. Murthy.  Design and Analysis of Distributed Routing Algorithms , 1994 .

[2]  Trevor Blackwell,et al.  Credit-based flow control for ATM networks: credit update protocol, adaptive credit allocation and statistical multiplexing , 1994, SIGCOMM 1994.

[3]  Charles L. Hedrick,et al.  Routing Information Protocol , 1988, RFC.

[4]  Robert M. Hinden,et al.  DARPA Internet gateway , 1982, RFC.

[5]  Anthony Ephremides,et al.  A distributed routing algorithm for mobile wireless networks , 1995, Wirel. Networks.

[6]  J. J. Garcia-Luna-Aceves,et al.  A loop-free extended Bellman-Ford routing protocol without bouncing effect , 1989, SIGCOMM '89.

[7]  J. J. Garcia-Luna-Aceves,et al.  Distributed routing with labeled distances , 1992, [Proceedings] IEEE INFOCOM '92: The Conference on Computer Communications.

[8]  Dimitri P. Bertsekas,et al.  Dynamic behavior of shortest path routing algorithms for communication networks , 1982 .

[9]  F.A. Tobagi,et al.  Issues in packet radio network design , 1987, Proceedings of the IEEE.

[10]  Farouk Kamoun,et al.  Design considerations for large computer communication networks. , 1976 .

[11]  J. J. Garcia-Luna-Aceves.  A More Eecient Path-finding Algorithm , 1994 .

[12]  Abhay Parekh,et al.  A generalized processor sharing approach to flow control in integrated services networks: the multiple node case , 1994, TNET.

[13]  T. Cegrell,et al.  A Routing Procedure for the TIDAS Message-Switching Network , 1975, IEEE Trans. Commun..

[14]  Yakov Rekhter,et al.  A Border Gateway Protocol 4 (BGP-4) , 1994, RFC.

[15]  R. Perlman.  A comparison between two routing protocols: OSPF and IS-IS , 1991, IEEE Network.

[16]  Van Jacobson,et al.  The synchronization of periodic routing messages , 1993, SIGCOMM '93.

[17]  J. J. Garcia-Luna-Aceves,et al.  Area-based, loop-free internet routing , 1994, Proceedings of INFOCOM '94 Conference on Computer Communications.

[18]  J.J. Garcia-Luna-Aceves.  LIBRA: a distributed routing algorithm for large internets , 1992, [Conference Record] GLOBECOM '92 - Communications for Global Users: IEEE.

[19]  Jeffrey M. Jaffe,et al.  Establishing Virtual Circuits in Large Computer Networks , 1986, Comput. Networks.

[20]  Stephen E. Deering,et al.  Internet Protocol, Version 6 (IPv6) Specification , 1995, RFC.

[21]  John M. Mcquillan,et al.  Adaptive routing algorithms for distributed computer networks , 1974 .

[22]  Eric C. Rosen,et al.  ARPANET Routing Algorithm Improvements , 1978 .

[23]  Dimitri P. Bertsekas,et al.  Data Networks , 1986 .

[24]  Gary Scott Malkin,et al.  RIP Version 2 Carrying Additional Information , 1993, RFC.

[25]  Christian Huitema,et al.  Routing in the Internet , 1995 .

[26]  John Moy,et al.  OSPF Version 2 , 1998, RFC.

[27]  Gregory S. Lauer,et al.  Hierarchical Routing Design for Suran , 1986, International Conference on Intelligent Cloud Computing.

[28]  D. Estrin,et al.  RSVP: a new resource reservation protocol , 1993, IEEE Communications Magazine.

[29]  C. V. Ramamoorthy,et al.  ADAPTIVE HIERARCHICAL ROUTING ALGORITHM. , 1983 .

[30]  J. J. Garcia-Luna-Aceves,et al.  A loop-free path-finding algorithm: specification, verification and complexity , 1995, Proceedings of INFOCOM'95.

[31]  Jeffrey M. Jaffe.  Hierarchical Clustering with Topology Databases , 1988, Comput. Networks.

[32]  A. Khanna,et al.  Reducing Routing Overhead in a Growing DDN , 1986, MILCOM 1986 - IEEE Military Communications Conference: Communications-Computers: Teamed for the 90's.

[33]  Rene L. Cruz,et al.  A calculus for network delay, Part II: Network analysis , 1991, IEEE Trans. Inf. Theory.

[34]  David R. Oran,et al.  OSI IS-IS Intra-domain Routing Protocol , 1990, RFC.

[35]  Eric C. Rosen,et al.  The New Routing Algorithm for the ARPANET , 1980, IEEE Trans. Commun..

[36]  J. J. Garcia-Luna-Aceves,et al.  A path-finding algorithm for loop-free routing , 1997, TNET.

[37]  J. J. Garcia-Luna-Aceves,et al.  A Minimum-Hop Routing Algorithm Based on Distributed Information , 1989, Comput. Networks.

[38]  Van Jacobson,et al.  The synchronization of periodic routing messages , 1994, TNET.

[39]  Charles E. Perkins,et al.  Highly dynamic Destination-Sequenced Distance-Vector routing (DSDV) for mobile computers , 1994, SIGCOMM.

[40]  Nsf Ncr,et al.  A Generalized Processor Sharing Approach to Flow Control in Integrated Services Networks: The Single Node Case* , 1991 .

[41]  D. A. Beyer,et al.  Accomplishments of the DARPA SURAN Program , 1990, IEEE Conference on Military Communications.

[42]  BERNARD M. WAXMAN,et al.  Routing of multipoint connections , 1988, IEEE J. Sel. Areas Commun..

[43]  David L. Mills.  DCN Local-Network Protocols , 1983, RFC.