Fast time-dependent evaluation of multi-service networks

We present a numerical-analytical method to evaluate multi-service networks with adaptive routing, scheduling and admission controls. We apply our method to connection-oriented networks supporting different types of real-time connections. The network dynamics is described by difference equations which can be solved for both transient and steady-state performances. Results indicate that our method is computationally much cheaper than discrete-event simulation, and yields accurate performance measures. Connection routing algorithms are usually evaluated individually in terms of steady-state performance measures. In this paper, we also use our time-dependent evaluation method to compare several connection routing schemes in terms of instantaneous measures. Our results show that a routing scheme which defines the cost of a path as the sum of measured link utilizations yields more stable behavior and lower connection blocking probability over a wide range of workload parameters and network configurations than other traditional schemes.

[1]  F. Kelly.  Blocking probabilities in large circuit-switched networks , 1986, Advances in Applied Probability.

[2]  Masayuki Murata,et al.  Analysis of Interdeparture Processes for Bursty Traffic in ATM Networks , 1991, IEEE J. Sel. Areas Commun..

[3]  Donald F. Towsley,et al.  MDP routing in ATM networks using virtual path concept , 1994, Proceedings of INFOCOM '94 Conference on Computer Communications.

[4]  Ibrahim Matta,et al.  Fast evaluation and dynamic control of integrated services networks , 1996 .

[5]  Domenico Ferrari,et al.  Client requirements for real-time communication services , 1990, IEEE Communications Magazine.

[6]  Antonio DeSimone,et al.  Controlling Alternate Routing in General-Mesh Packet Flow Networks , 1994, SIGCOMM.

[7]  Janusz Filipiak,et al.  Modelling and control of dynamic flows in communication networks , 1988, Communications and control engineering series.

[8]  André Girard,et al.  Blocking evaluation for networks with residual capacity adaptive routing , 1989, IEEE Trans. Commun..

[9]  Matti Palo.  ROUTING IN ATM NETWORKS , 1996 .

[10]  J. Kaufman,et al.  Blocking in a Shared Resource Environment , 1981, IEEE Trans. Commun..

[11]  Jean C. Walrand,et al.  Effective bandwidths for multiclass Markov fluids and other ATM sources , 1993, TNET.

[12]  Debasis Mitra,et al.  Effective bandwidth of general Markovian traffic sources and admission control of high speed networks , 1993, IEEE INFOCOM '93 The Conference on Computer Communications, Proceedings.

[13]  J. Bernussou,et al.  An Analytical Formulation for Grade of Service Determination in Telephone Networks , 1983, IEEE Trans. Commun..

[14]  Donald F. Towsley,et al.  Local Allocation of End-to-End Quality-of-Service in High-Speed Networks , 1993, Modelling and Evaluation of ATM Networks.

[15]  Michael Mitzenmacher,et al.  Computational Complexity of Loss Networks , 1994, Theor. Comput. Sci..

[16]  Serge A. Plotkin,et al.  Routing and admission control in general topology networks with Poisson arrivals , 1995, SODA '96.

[17]  Pravin Varaiya,et al.  Throughput in multiple service, multiple resource communication networks , 1991, IEEE Trans. Commun..

[18]  Malur K. Sundareshan,et al.  Numerical Methods for Modeling Computer Networks Under Nonstationary Conditions , 1990, IEEE J. Sel. Areas Commun..

[19]  Gerald R. Ash,et al.  Teletraffic and Datatraffic in a Period of Change, Itc-13 Real-time Network Routing in a Dynamic Class-of-service Network , 2011 .

[20]  J. Douglas Faires,et al.  Numerical Analysis , 1981 .

[21]  Hamid Ahmadi,et al.  Equivalent Capacity and Its Application to Bandwidth Allocation in High-Speed Networks , 1991, IEEE J. Sel. Areas Commun..

[22]  Debasis Mitra,et al.  Comparative evaluations of randomized and dynamic routing strategies for circuit-switched networks , 1991, IEEE Trans. Commun..

[23]  Andre Girard,et al.  Routing and Dimensioning in Circuit-Switched Networks , 1990 .

[24]  David Tipper,et al.  Simulation Methods for Studying Nonstationary Behavior of Computer Networks , 1990, IEEE J. Sel. Areas Commun..

[25]  Sally Floyd,et al.  Wide area traffic: the failure of Poisson modeling , 1995, TNET.

[26]  Yossi Azar,et al.  Throughput-competitive on-line routing , 1993, Proceedings of 1993 IEEE 34th Annual Foundations of Computer Science.

[27]  Amarnath Mukherjee,et al.  Analysis of dynamic congestion control protocols: a Fokker-Planck approximation , 1991, SIGCOMM 1991.

[28]  Debasis Mitra,et al.  Probabilistic Models of Database Locking: Solutions, Computational Algorithms, and Asymptotics , 1984, JACM.

[29]  Keith W. Ross,et al.  Computing approximate blocking probabilities for large loss networks with state-dependent routing , 1993, TNET.

[30]  Saewoong Bahk,et al.  Dynamic Multi-Path Routing and How It Compares With Other Dynamic Routing Algorithms for High Speed Wide Area Network , 1992, SIGCOMM.

[31]  Martin de Prycker,et al.  Asynchronous Transfer Mode, Solution for Broadband Isdn , 1991 .

[32]  D.C. Verma,et al.  Delay jitter control for real-time communication in a packet switching network , 1991, Proceedings of TRICOMM `91: IEEE Conference on Communications Software: Communications for Distributed Applications and Systems.

[33]  A. Udaya Shankar,et al.  Analysis of a fluid approximation to flow control dynamics , 1992, [Proceedings] IEEE INFOCOM '92: The Conference on Computer Communications.

[34]  Leonard Kleinrock,et al.  Communication Nets: Stochastic Message Flow and Delay , 1964 .

[35]  Keith W. Ross,et al.  Reduced load approximations for multirate loss networks , 1993, IEEE Trans. Commun..

[36]  Kumar Jayantilal Parekn Abhay,et al.  A generalized processor sharing approach to frow control in integrated services networks , 1992 .

[37]  J.E. Weiselthier,et al.  Optimal admission control in circuit-switched multihop radio networks , 1992, [1992] Proceedings of the 31st IEEE Conference on Decision and Control.

[38]  W. Cheney,et al.  Numerical analysis: mathematics of scientific computing (2nd ed) , 1991 .

[39]  Aurel A. Lazar,et al.  A Separation Principle Between Scheduling and Admission Control for Broadband Switching , 1993, IEEE J. Sel. Areas Commun..

[40]  Keith W. Ross,et al.  Routing in virtual path based ATM networks , 1992, [Conference Record] GLOBECOM '92 - Communications for Global Users: IEEE.

[41]  Sally Floyd,et al.  Wide-area traffic: the failure of Poisson modeling , 1994 .

[42]  Zbigniew Dziong,et al.  Congestion Probabilities in a Circuit-Switched Integrated Services Network , 1987, Perform. Evaluation.

[43]  Mohamed G. Gouda,et al.  Flow theory: Verification of rate-reservation protocols , 1993, 1993 International Conference on Network Protocols.

[44]  D. Mitra,et al.  Stochastic theory of a data-handling system with multiple sources , 1982, The Bell System Technical Journal.

[45]  C StrikwerdaJohn,et al.  Analysis of dynamic congestion control protocols , 1991 .

[46]  Hong Chen,et al.  Stochastic discrete flow networks : diffusion approximations and bottlenecks , 1991 .

[47]  Douglas Comer,et al.  FLOWS: performance guarantees in best effort delivery systems , 1989, IEEE INFOCOM '89, Proceedings of the Eighth Annual Joint Conference of the IEEE Computer and Communications Societies.

[48]  Sanjay Gupta.  Performance modeling and management of high-speed networks , 1993 .

[49]  Satish K. Tripathi,et al.  Time-Dependent Analysis Of Queueing Systems , 1986 .

[50]  Albert G. Greenberg,et al.  Design and Analysis of Master/Slave Multiprocessors , 1991, IEEE Trans. Computers.

[51]  Domenico Ferrari,et al.  Rate-controlled static-priority queueing , 1993, IEEE INFOCOM '93 The Conference on Computer Communications, Proceedings.

[52]  Ren-Hung Hwang.  Routing in high-speed networks , 1993 .

[53]  K ParekhAbhay,et al.  A generalized processor sharing approach to flow control in integrated services networks , 1993 .

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