Results 1  10
of
26
Effective bandwidths at multiclass queues
 Queueing Systems
, 1991
"... Consider a queue which serves traffic from a number of distinct sources and which is required to deliver a performance guarantee, expressed in terms of the mean delay or the probability the delay exceeds a threshold. For various simple models we show that an effective bandwidth can be associated wit ..."
Abstract

Cited by 182 (4 self)
 Add to MetaCart
Consider a queue which serves traffic from a number of distinct sources and which is required to deliver a performance guarantee, expressed in terms of the mean delay or the probability the delay exceeds a threshold. For various simple models we show that an effective bandwidth can be associated with each source, and that the queue can deliver its performance guarantee by limiting the sources served so that their effective bandwidths sum to less than the capacity of the queue. Keywords: large deviations, M/G/1 queue, circuitswitched network, connection acceptance control. 1.
Controlling Alternate Routing in GeneralMesh Packet Flow Networks
 In Proc. ACM SIGCOMM '94
, 1994
"... Highspeed packet networks will begin to support services that need QualityofService (QoS) guarantees. Guaranteeing QoS typically translates to reserving resources for the duration of a call. We propose a statedependent routing scheme that builds on any base stateindependent routing scheme, by rou ..."
Abstract

Cited by 28 (0 self)
 Add to MetaCart
Highspeed packet networks will begin to support services that need QualityofService (QoS) guarantees. Guaranteeing QoS typically translates to reserving resources for the duration of a call. We propose a statedependent routing scheme that builds on any base stateindependent routing scheme, by routing flows which are blocked on their primary paths (as selected by the stateindependent scheme) onto alternate paths in a manner that is guaranteedunder certain Poisson assumptionsto improve on the performance of the base stateindependent scheme. Our scheme only requires each node to have state information of those links that are incident on it. Such a scheme is of value when either the base stateindependent scheme is already in place and a complete overhaul of the routing algorithm is undesirable, or when the state (reserved flows) of a link changes fast enough that the timely update of state information is infeasible to all possible calloriginators. The performance improvements ...
Network Routing
 Phil. Trans. R. Soc. Lond. A,337
, 1991
"... How should flows through a network be organized, so that the network responds sensibly to failures and overloads? The question is currently of considerable technological importance in connection with the development of computer and telecommunication networks, while in various other forms it has a lo ..."
Abstract

Cited by 24 (2 self)
 Add to MetaCart
How should flows through a network be organized, so that the network responds sensibly to failures and overloads? The question is currently of considerable technological importance in connection with the development of computer and telecommunication networks, while in various other forms it has a long history in the fields of physics and economics. In all of these areas there is interest in how simple, local rules, often involving random actions, can produce coherent and purposeful behaviour at the macroscopic level. This paper describes some examples from these various fields, and indicates how analogies with fundamental concepts such as energy and price can provide powerful insights into the design of routing schemes for communication networks.
Modelling communication networks, present and future
 THE CLIFFORD PATTERSON LECTURE
, 1995
"... Modern communication networks are able to respond to randomly uctuating demands and failures by allowing bu ers to ll, by rerouting tra c and by reallocating resources. They are able to do this so well that, in many respects, largescale networks appear as coherent, almost intelligent, organisms. The ..."
Abstract

Cited by 21 (0 self)
 Add to MetaCart
Modern communication networks are able to respond to randomly uctuating demands and failures by allowing bu ers to ll, by rerouting tra c and by reallocating resources. They are able to do this so well that, in many respects, largescale networks appear as coherent, almost intelligent, organisms. The design and control of such networks present challenges of a mathematical, engineering and economic nature. In this lecture I describe some of the models that have proved useful in the analysis of stability, statistical sharing and pricing, in systems ranging from the telephone networks of today to the information superhighways of tomorrow.
On blocking in loss networks
 Adv. Appl. Probab
, 1991
"... We review the theory of loss networks, including recent results on their dynamical behaviour. We give also some new results. ..."
Abstract

Cited by 14 (2 self)
 Add to MetaCart
We review the theory of loss networks, including recent results on their dynamical behaviour. We give also some new results.
Critical Thresholds for Dynamic Routing in Queueing Networks
, 2002
"... This paper studies dynamic routing in a parallel server queueing network with a single Poisson arrival process and two servers with exponential processing times of different rates. Each customer must be routed at the time of arrival to one of the two queues in the network. We establish that this sys ..."
Abstract

Cited by 11 (1 self)
 Add to MetaCart
This paper studies dynamic routing in a parallel server queueing network with a single Poisson arrival process and two servers with exponential processing times of different rates. Each customer must be routed at the time of arrival to one of the two queues in the network. We establish that this system operating under a threshold policy can be well approximated by a onedimensional reflected Brownian motion when the arrival rate to the network is close to the processing capacity of the two servers. As the heavy traffic limit is approached, thresholds which grow at a logarithmic rate are critical in determining the behavior of the limiting system. We provide necessary and sufficient conditions on the growth rate of the threshold for (i) approximation of the network by a reflected Brownian motion (ii) positive recurrence of the limiting Brownian diffusion and (iii) asymptotic optimality of the threshold policy.
Delinquent Networks
 Journal of the European Economic Association
, 2010
"... This paper considers the problem of designing ATM networks that are nonblocking with respect to virtual circuit requests, subject to speci ed constraints on the tra c. In this paper, we focus on global tra c constraints that simply limit the total entering and exiting tra c at each switching system. ..."
Abstract

Cited by 7 (2 self)
 Add to MetaCart
This paper considers the problem of designing ATM networks that are nonblocking with respect to virtual circuit requests, subject to speci ed constraints on the tra c. In this paper, we focus on global tra c constraints that simply limit the total entering and exiting tra c at each switching system. After reviewing prior results for linear link costs, we introduce a more realistic link cost model, and develop anumber of results using it. We also describe a technique for converting treestructured networks to nonblocking hierarchical networks satisfying limits on the capacity ofanysingle switch 0
On The Design Of Reliable Efficient Information Systems
, 2001
"... ..................................................................................................................... ix CHAPTER I. ..."
Abstract

Cited by 5 (0 self)
 Add to MetaCart
..................................................................................................................... ix CHAPTER I.
Dynamic Routing in Stochastic Networks
, 1995
"... . This paper reviews some current work on routing in loss and queueing networks. We describe two classes of bound on the performance of any dynamic routing scheme, together with some open questions concerning whether the bounds can be approached under certain limiting regimes. The first class of bou ..."
Abstract

Cited by 5 (0 self)
 Add to MetaCart
. This paper reviews some current work on routing in loss and queueing networks. We describe two classes of bound on the performance of any dynamic routing scheme, together with some open questions concerning whether the bounds can be approached under certain limiting regimes. The first class of bound is particularly appropriate for networks in heavy traffic, where the key feature of a good routing scheme is its effective utilization of various pooled resources identified by a fluid version of the routing problem. The second class of bound is particularly appropriate for highly connected networks, with many alternative paths. Again, a network flow representation is central, but this time involving a collection of Markov decision processes, one for each resource of the network. Despite their simplicity, the bounds are able to identify the great variety of qualitatively distinct behaviour expected of a good dynamic routing scheme, depending on a network's size, connectivity, asymmetry an...
Predictive routing to enhance QoS for streambased flows sharing excess bandwidth
 Computer Networks
, 2003
"... We propose a newrouBqN algorithm based on online estimation of the link load dynamics and prior information on flow holding times. The motivation for this proposal lies insu((z(4kj tra#c flows sus as VBR or associated with rate adaptive applications.Sul tra#crequ4B) a minimalgumal4qN) bandwidth ..."
Abstract

Cited by 3 (0 self)
 Add to MetaCart
We propose a newrouBqN algorithm based on online estimation of the link load dynamics and prior information on flow holding times. The motivation for this proposal lies insu((z(4kj tra#c flows sus as VBR or associated with rate adaptive applications.Sul tra#crequ4B) a minimalgumal4qN) bandwidth,bu can see improved performance when sharing excess bandwidth not ut4 to meet gu4q#Nq4k The key ideaua4j#BNj4 ou approach is torouB tra#c flows so that they see minimal expected flowperceived loads duds4 theirsojouq in the network. To this end we establish a rou5() framework where links estimate and advertise the parameters associated with their load dynamics in addition to their current load. New flows arerouB( based on this information and prior knowledge of their holding times so as to minimize the expected flowperceived load.SimuqB#(B4 of thisrou4q scheme in a (weighted) maxmin bandwidth sharing framework show gains of 2050% in the average flow bandwidth share over baselineroulin schemes.