scispace - formally typeset
Journal ArticleDOI

The overload performance of engineered networks with nonhierarchical and hierarchical routing

J. M. Akinpelu
- 01 Sep 1984 - 
- Vol. 63, Iss: 7, pp 1261-1281
TLDR
The analysis of comparably engineered hierarchical networks shows that these networks do not exhibit a drop in carried load under overloads (in the absence of switching system dynamics), and it is shown that using trunk reservation for first-routed traffic allows the formulation of a control strategy that provides a high level of network carried load during overloads.
Abstract
We report the results of a study of the performance of engineered nonhierarchical and hierarchical routing networks under overloads. This study was motivated by results obtained from mathematical models for small, symmetric, uniformly loaded, nonhierarchical networks with transparent switching systems, showing the existence of network instabilities. We extend the mathematical models to more general nonhierarchical networks, and show with analysis and an extant simulation model that such instabilities are also found in nonsymmetric, nonhierarchical networks. We then use our models to consider whether engineered nonhierarchical networks exhibit such unstable behavior. No instabilities are found in the engineered nonhierarchical networks considered here. However, the nonhierarchical networks consistently demonstrate a drop in carried load between 10- and 15-percent overloads. Our analysis of comparably engineered hierarchical networks shows that these networks do not exhibit a drop in carried load under overloads (in the absence of switching system dynamics). Finally, we show that using trunk reservation for first-routed traffic allows the formulation of a control strategy that provides a high level of network carried load during overloads.

read more

Citations
More filters
Journal ArticleDOI

Fundamental design issues for the future Internet

TL;DR: This work addresses some of the fundamental architectural design issues facing the future Internet, including whether the Internet should adopt a new service model, how this service model should be invoked, and whether this service models should include admission control.

A Framework for QoS-based Routing in the Internet

TL;DR: In this article, the authors describe some of the QoS-based routing issues and requirements, and propose a framework for QoSbased routing in the internet, which does not specify an Internet standard of any kind.
Journal ArticleDOI

Blocking probabilities in large circuit-switched networks

TL;DR: It is shown that when the capacity of links and the offered traffic are increased together, a limiting regime emerges in which loss probabilities are as if links block independently, with blocking probabilities given by the solution of a simple convex programming problem.
Journal ArticleDOI

Stochastic Models of Computer Communication Systems

TL;DR: This paper describes some examples of the stochastic models found useful in the design and analysis of advanced computer and communication systems and discusses concurrency control procedures for databases, dynamic channel assignment for cellular radio, and random access schemes for the control of a broadcast channel.
Journal ArticleDOI

Computing approximate blocking probabilities for large loss networks with state-dependent routing

TL;DR: A reduced load approximation for estimating point-to-point blocking probabilities in loss networks (e.g., circuit switched networks) with state-dependent routing is considered and results for six-node and 36-node asymmetric networks are given.
References
More filters
Journal ArticleDOI

Design and optimization of networks with dynamic routing

TL;DR: An efficient heuristic optimization method is introduced for solution of the LP routing problems, which greatly improves computational speed with minimal loss of accuracy and project computational requirements for a 200-node design problem, which is the estimated size of the intercity Bell System dynamic routing network in the 1990s.
Journal ArticleDOI

A simulation study of routing and control in communications networks

TL;DR: In this article, a set of studies has been undertaken to develop guidelines for the design and operation of communications networks with automatic alternate routing, and compared the engineered costs and overload capability of networks using several alternate routing configurations, and employing a number of different operating and control procedures.
Journal ArticleDOI

Traffic engineering techniques for determining trunk requirements in alternate routing trunk networks

TL;DR: In this article, the Bell System embarked on an extensive study with the purpose of developing a program for operator toll dialing on a nationwide basis, which would handle traffic at high speed between any two points in the United States and Canada, even in the busier hours of the day.
Journal ArticleDOI

Overload model of telephone network operation

TL;DR: An analytic model for the steady-state behavior of an overloaded telephone network is given, which includes trunk and machine congestion, retrials, “don't answer and busy,” and some network management controls.