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. Key words: Multi-service networks, transient performance, dynamic flow models, queueing models, resource allocation algorithms, routing.
|
1447
|
A Generalized Processor Sharing Approach to Flow Control
– Parekh
- 1992
|
|
1131
|
S.: Wide Area Traffic: The Failure of Poisson Modeling
– Paxson, Floyd
- 1995
|
|
381
|
Equivalent capacity and its application to bandwidth allocation in high-speed networks
– Guerin, Ahmadi, et al.
- 1991
|
|
325
|
Stochastic Theory of a Data-Handling System with Multiple Sources
– Anick, Mitra, et al.
|
|
284
|
A calculus for network delay, part II: network analysis
– Cruz
- 1991
|
|
253
|
Effective bandwidth of general Markovian traffic sources and admission control of high speed networks. submitted
– ELWALID, MITRA
- 1992
|
|
229
|
Client Requirements for Real-Time Communication Services
– Ferrari
- 1990
|
|
221
|
Throughout-Competitive On-Line Routing
– Awerbuch, Azar, et al.
- 1993
|
|
194
|
Effective bandwidths for multiclass Markov fluids and other ATM sources
– Kesidis, Walrand, et al.
- 1993
|
|
133
|
Blocking probabilities in large circuit-switched networks
– KELLY
- 1986
|
|
131
|
Blocking in a shared resource environment
– KAUFMAN
- 1981
|
|
115
|
Routing and Dimensioning in Circuit-Switched Networks
– Girard
- 1990
|
|
100
|
Delay Jitter Control for Real-Time Communication in a Packet Switching Network
– Verma, Zhang, et al.
- 1991
|
|
95
|
Rate-Controlled Static-Priority Queueing
– Zhang, Ferrari
- 1993
|
|
67
|
A separation principle between scheduling and admission control for broadband switching
– Hyman, Lazar, et al.
- 1993
|
|
64
|
Communication Nets: Stochastic Message Flow and Delay
– Kleinrock
- 1964
|
|
52
|
Numerical Analysis
– Kincaid, Cheney
- 1991
|
|
51
|
Queueing Systems, Volume I
– Kleinrock
- 1976
|
|
47
|
Dynamic routing and call control in high-speed integrated networks,” in Teletraffic and Datatraffic in a Period of Change
– Ahmadi, Chen, et al.
- 1991
|
|
46
|
Routing and Admission Control in General Topology Networks
– Gawlick, Kamath, et al.
- 1995
|
|
45
|
Computing Approximate Blocking Probability for Large Loss Networks with State-Dependent Routing
– Chung, Kashper, et al.
- 1993
|
|
45
|
Asyncronous Transfer Mode, Solution for Broadband ISDN, Third Edition
– Prycker
- 1997
|
|
42
|
A service system with heterogeneous user requirements: application to multi-services telecommunications systems
– Roberts
- 1981
|
|
40
|
Real-time Network Routing in a Dynamic Class-of-Service Network
– Ash, Chen, et al.
- 1991
|
|
40
|
Local allocation of end-toend quality-of-service in high-speed networks
– Nagarajan, Kurose, et al.
- 1993
|
|
38
|
and P.Varaiya. Control of multiple service, multiple resource communication networks
– Jordan
- 1994
|
|
38
|
Analysis of Interdeparture Processes for Bursty Traffic in ATM Networks
– Ohba, Murata, et al.
- 1991
|
|
36
|
Reduced load approximations for multirate loss networks
– Chung, Ross
- 1993
|
|
34
|
Dynamic Multi-path Routing and How it Compares with other Dynamic Routing Algorithms for High Speed Wide Area Networks
– Bahk, Zarki
- 1992
|
|
34
|
Analysis of dynamic congestion control protocols-A fokker-plank approximation
– Mukherjee, Stikwerda
- 1991
|
|
33
|
Congestion Probabilities in a Circuit-Switched Integrated Services Network”, Performance Evaluation Journal 7
– Dziong, Roberts
- 1987
|
|
30
|
A simulation study of adaptive source routing in integrated services networks
– Breslau, Estrin, et al.
- 1993
|
|
30
|
Modeling and Control of Dynamic Flows in Communication Networks
– Filipiak
- 1988
|
|
30
|
Comparative Evaluations of Randomized and Dynamic Routing Strategies for Circuit-Switched Networks
– Mitra, Seery
- 1991
|
|
29
|
Numerical Methods for Modeling Computer Networks Under Nonstationary Conditions
– Tipper, Sundareshan
- 1990
|
|
27
|
Analysis and Optimal Design of Aggregated-Least-Busy-Alternative Routing on Symmetric Loss Networks with Trunk Reservation
– Mitra, Gibbens, et al.
- 1991
|
|
27
|
Controlling Alternate Routing in General-Mesh Packet Flow Networks
– Sibal, Desimone
- 1994
|
|
24
|
Real-time communication in packet switching wide-area networks
– Ferrari
- 1989
|
|
23
|
Analysis of a Fluid Approximation to Flow Control Dynamics
– Bolot, Shankar
- 1992
|
|
22
|
Zarki, &Routing in virtual path based ATM networks
– Gupta, Ross, et al.
|
|
21
|
Discrete flow networks: diffusion approximations and bottlenecks
– Chen, Mandelbaum
- 1991
|
|
20
|
Performance modeling and management of high-speed networks
– Gupta
- 1993
|
|
16
|
FLOWS: Performance Guarantees in Best Effort Delivery Systems
– Comer, Yavatkar
- 1989
|
|
16
|
MDP routing in ATM networks using virtual path concept
– Hwang, Kurose, et al.
- 1994
|
|
16
|
Simulation methods for studying nonstationary behavior of computer networks
– Lovegrove, Hammond, et al.
- 1990
|
|
13
|
On Routing in ATM Networks
– Gupta, Ross, et al.
- 1993
|
|
11
|
Blocking evaluation for networks with residual capacity adaptive routing
– Girard, Bell
- 1989
|
|
11
|
Routing in High-Speed Networks
– Hwang
- 1993
|
|
9
|
An Analytical Formulation for Grade of Service Determination in Telephone Networks
– Gall, Bernussou
- 1983
|
|
8
|
Flow Theory: Verification of RateReservation Protocols
– Cobb, Gouda
- 1993
|
|
