Quo Vadis - A Framework for Intelligent Routing in Large Communication Networks

Modern communication networks contain hundreds if not thousands of interconnected nodes. Traffic management mechanisms must be able to support a cost-effective, responsive, flexible, robust, customer-oriented high speed communication environment while minimizing the overhead associated with management functions. Conventional traffic management mechanisms for routing and congestion control algorithms entail tremendous resource overhead in storage and update of network state information. Quo Vadis is an evolving framework for intelligent traffic management in very large communication networks. It is designed to exploit topological properties of large networks as well as their spatio-temporal dynamics to optimize multiple performance criteria through cooperation among nodes in the network. It employs a distributed representation of network state information using local load measurements supplemented by a less precise global summary. Routing decisions in Quo Vadis are based on parameterized heuristics designed to optimize various performance metrics in an anticipatory or pro-active as well as compensatory or reactive mode and to minimize the overhead associated with traffic management. The complexity of modern networks in terms of the number of entities, their interaction, and the resulting dynamics make an analytical study often impossible. Hence, we have designed and implemented an object oriented simulation toolbox to facilitate the experimental studies of Quo Vadis. Our efforts to design such a simulation environment were driven by the need to evaluate heuristic routing strategies and knowledge representation as employed by Quo Vadis. The results of simulation experiments within a grid network clearly demonstrate the ability of Quo Vadis to avoid congestion and minimize message delay under a variety of network load conditions. In order to provide a theoretical framework for the design and analytical study of decision mechanisms as employed by Quo Vadis, we draw upon concepts from the field of utility theory. Based on the concept of reward and cost incurred by messages in the network, utility functions which bias routing decisions so as to yield routes that circumvent congested areas have been designed. The existence of utility functions which yield minimum cost routes in uniform cost networks with a single congested node has been proven rigorously.

[1]  R. Syski,et al.  Fundamentals of Queueing Theory , 1999, Technometrics.

[2]  Lionel M. Ni,et al.  A survey of wormhole routing techniques in direct networks , 1993, Computer.

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

[4]  J. M. Synder A routing architecture for very large networks undergoing rapid reconfiguration , 1989, SIGCOMM '89.

[5]  Youngdon Kang,et al.  Distributed and Fail-Safe Routing Algorithms in Toroidal-Based Metropolitan Area Networks , 1989, Comput. Networks ISDN Syst..

[6]  Radia Perlman Interconnections: Bridges and Routers , 1992 .

[7]  Vasant Honavar,et al.  Quo Vadis - Adaptive Heuristics for Routing in Large Communication Networks , 1995 .

[8]  W. P. Salman,et al.  How to Program , 1983 .

[9]  David Finkel Brief review: Computer Networks & Systems: Queueing Theory and Performance Evaluation by Thomas Robertazzi (Springer-Verlag, 1990) , 1991, PERV.

[10]  R. M. Adelson,et al.  Utility Theory for Decision Making , 1971 .

[11]  Farouk Kamoun,et al.  Stochastic Performance Evaluation of Hierarchical Routing for Large Networks , 1979, Comput. Networks.

[12]  A. Udaya Shankar,et al.  Design and implementation of MaRS: a routing testbed , 1992 .

[13]  Dimitri P. Bertsekas,et al.  Data networks (2nd ed.) , 1992 .

[14]  Jesfis Peral,et al.  Heuristics -- intelligent search strategies for computer problem solving , 1984 .

[15]  Sheldon M. Ross,et al.  Introduction to Probability Models (4th ed.). , 1990 .

[16]  Judea Pearl,et al.  Probabilistic reasoning in intelligent systems - networks of plausible inference , 1991, Morgan Kaufmann series in representation and reasoning.

[17]  Carl M. Harris,et al.  Fundamentals of queueing theory (2nd ed.). , 1985 .

[18]  Oryal Tanir,et al.  Defining requirements for a standard simulation environment , 1994, Computer.

[19]  Jeffrey M. Jaffe,et al.  A Responsive Distributed Routing Algorithm for Computer Networks , 1982, ICDCS.

[20]  M. Schwartz,et al.  Routing Techniques Used in Computer Communication Networks , 1980, IEEE Trans. Commun..

[21]  G. Sicuranza,et al.  The landmark hierarchy: A new hierarchy for routing in very large networks , 1988 .

[22]  Jon Crowcroft,et al.  Shortest Path First with Emergency Exits , 1990, SIGCOMM.

[23]  Radia J. Perlman Hierarchical Networks and the Subnetwork Partition Problem , 1985, Comput. Networks.

[24]  Adrian Segall,et al.  A Failsafe Distributed Routing Protocol , 1979, IEEE Trans. Commun..

[25]  Ray Jain,et al.  The art of computer systems performance analysis - techniques for experimental design, measurement, simulation, and modeling , 1991, Wiley professional computing.

[26]  Rudolf Seising,et al.  Simulation of learning in communication networks , 1993, Simul. Pract. Theory.

[27]  T. Keerthi,et al.  A Tutorial Survey of Reinforcement Learn , 2022 .

[28]  Vasant Honavar,et al.  Books-Received - Artificial Intelligence and Neural Networks - Steps Toward Principled Integration , 1994 .

[29]  B Ravindran,et al.  A tutorial survey of reinforcement learning , 1994 .

[30]  Farouk Kamoun,et al.  Hierarchical Routing for Large Networks; Performance Evaluation and Optimization , 1977, Comput. Networks.

[31]  E. Rowland Theory of Games and Economic Behavior , 1946, Nature.

[32]  S. Jørgensen The art of computer systems performance analysis: Techniques for Experimental Design, Measurement, Simulation and Modeling. Raj Jain. John Wiley, New York. Hardcover, 720 p. U.S. $52.95. , 1992 .

[33]  Vasant Honavar,et al.  Toward learning systems that integrate multiple strategies and representations , 1994 .

[34]  Sheldon M. Ross,et al.  Introduction to probability models , 1975 .

[35]  R. Jain Congestion control in computer networks: issues and trends , 1990, IEEE Network.

[36]  Michael L. Littman,et al.  A Distributed Reinforcement Learning Scheme for Network Routing , 1993 .

[37]  Suk-Gwon Chang Fair integration of routing and flow control in communication networks , 1992, IEEE Trans. Commun..

[38]  S. French Decision Theory: An Introduction to the Mathematics of Rationality , 1986 .

[39]  Mario Gerla,et al.  Flow Control: A Comparative Survey , 1980, IEEE Trans. Commun..

[40]  Joshua Alspector,et al.  Proceedings of the International Workshop on Applications of Neural Networks to Telecommunications 3 , 1997 .

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

[42]  Judea Pearl,et al.  Heuristics : intelligent search strategies for computer problem solving , 1984 .

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