Results 1  10
of
37
CongestionDependent Pricing of Network Services
 IEEE/ACM Transactions on Networking
, 1998
"... Weconsider a service provider (SP) who provides access to a communication network or some other form of online services. Users access the network and initiate calls that belong to a set of diverse service classes, differing in resource requirements, demand pattern, and call duration. ..."
Abstract

Cited by 151 (0 self)
 Add to MetaCart
Weconsider a service provider (SP) who provides access to a communication network or some other form of online services. Users access the network and initiate calls that belong to a set of diverse service classes, differing in resource requirements, demand pattern, and call duration.
Computing approximate blocking probabilities for large loss networks with statedependent routing
 IEEE/ACM Transactions on Networking
, 1993
"... Abstruct — We consider a reduced load approximation (also referred to as an Erlang fixed point approximation) for estimating pointtopoint blocking probabilities in loss networks (e.g., circuit switched networks) with statedependent routing. In this approximation scheme, the idle capacity dktribu ..."
Abstract

Cited by 69 (0 self)
 Add to MetaCart
Abstruct — We consider a reduced load approximation (also referred to as an Erlang fixed point approximation) for estimating pointtopoint blocking probabilities in loss networks (e.g., circuit switched networks) with statedependent routing. In this approximation scheme, the idle capacity dktribution for each link in the network is approximated, assuming that these distributions art independent from link to link. This leads to a set of nonlinear fixedpoint equations which can be solved by repeated substitutions. We examine the accuracy and the computational requirements of the approximation procedure for a particular routing scheme, namely least loaded routing. Numerical results for sixnode and 36node asymmetric networks are given. A novel reduced load approximation for multirate networks with statedependent routing is also presented. 1. lNTRODuCTION
Virtual partitioning for robust resource sharing: computational techniques for heterogeneous traffic
 IEEE Journal on Selected Areas in Communications
, 1998
"... ..."
(Show Context)
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 29 (0 self)
 Add to MetaCart
(Show Context)
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 ...
Asymptotic Analysis of Single Resource Loss Systems in Heavy Traffic, with Applications to Integrated Networks
 Adv. Appl. Prob
, 1995
"... In this paper we consider the analysis of call blocking at a single resource with differing capacity requirements as well as differing arrival rates and holding times. We include in our analysis trunk reservation parameters which provide an important mechanism for tuning the relative call blockings ..."
Abstract

Cited by 23 (0 self)
 Add to MetaCart
(Show Context)
In this paper we consider the analysis of call blocking at a single resource with differing capacity requirements as well as differing arrival rates and holding times. We include in our analysis trunk reservation parameters which provide an important mechanism for tuning the relative call blockings to desired levels. We base our work on an asymptotic regime where the resource is in heavy traffic. We further derive, from our asymptotic analysis, methods for the analysis of finite systems. Empirical results suggest that these methods perform well for a wide class of examples. LOSS NETWORKS; INTEGRATED NETWORKS; TIMESCALE SEPARATION; TRUNK RESERVATION; BLOCKING PROBABILITIES AMS 1991 Mathematics Subject Classification Primary: 60K20 Secondary: 60K15, 60K30, 68M20, 90B12 1 Introduction Recent developments in communication networks have lead to much interest in systems where traffic of widely differing characteristics is integrated. In this paper we address one of the probabilistic issue...
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 22 (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.
Prioritized Resource Allocation for Stressed Networks
 IEEE/ACM Transactions on Networking
, 2001
"... AbstractOverloads that occur during times of network stress result in blocked access to all users, independent of importance. These overloads can occur because of degraded resource availability or abnormally high demand. Public broadband networks must dynamically recognize some multimedia connectio ..."
Abstract

Cited by 19 (10 self)
 Add to MetaCart
(Show Context)
AbstractOverloads that occur during times of network stress result in blocked access to all users, independent of importance. These overloads can occur because of degraded resource availability or abnormally high demand. Public broadband networks must dynamically recognize some multimedia connections as having greater importance than others and allocate resources accordingly. A new approach to connection admission control is proposed that uses an upper limit policy to optimize the admission of connections based on the weighted sum of blocking across traffic classes. This results in a simple algorithm suitable for multimedia and packet networks. This work is also the first to demonstrate that the use of an upper limit policy is superior to traditional approaches of adding extra capacity or partitioning capacity, both in terms of the amount of resources required and sensitivity to load variations. An upper limit policy can also be deployed much faster when a large overload occurs from a disaster event. I.
Dynamic multidrug therapies for HIV: A control theoretic approach
 J. Theor. Biol
, 1997
"... Motivated by the inability of current drug treatment to provide longterm benefit to HIVinfected individuals, we derive HIV therapeutic strategies by formulating and analyzing a mathematical control problem. The model tracks the dynamics of uninfected and infected CD4 + cells and free plasma virus, ..."
Abstract

Cited by 19 (0 self)
 Add to MetaCart
(Show Context)
Motivated by the inability of current drug treatment to provide longterm benefit to HIVinfected individuals, we derive HIV therapeutic strategies by formulating and analyzing a mathematical control problem. The model tracks the dynamics of uninfected and infected CD4 + cells and free plasma virus, and allows the virus to mutate into various strains. At each point in time, several different therapeutic options are available, where each option corresponds to a combination of reverse transcriptase inhibitors. The controller observes the individual’s current status and chooses among the therapeutic options in a dynamic fashion in order to minimize the total viral load. Our initial numerical results suggest that dynamic therapies have the potential to significantly outperform the static protocols that are currently in use; by anticipating and responding to the disease progression, the dynamic strategy reduces the total free virus, increases the uninfected CD4 + count, and delays the emergence of drugresistant strains. � 1997 Academic Press Limited 1.
Robust dynamic admission control for unified cell and call QoS in statistical multiplexers
 IEEE Journal on Select. Areas of Comm. Vol
, 1998
"... ..."
A Refinement of the HuntKurtz Theory of Large Loss Networks, with an Application to Virtual Partitioning
 In preparation
, 2000
"... This paper gives a refinement of the results of Hunt and Kurtz (1994) on the dynamical behaviour of large loss networks. We introduce a Lyapunov function technique which, under the limiting regime of Kelly (1986), enables the unique identification of limiting dynamics in many applications. This tech ..."
Abstract

Cited by 7 (1 self)
 Add to MetaCart
This paper gives a refinement of the results of Hunt and Kurtz (1994) on the dynamical behaviour of large loss networks. We introduce a Lyapunov function technique which, under the limiting regime of Kelly (1986), enables the unique identification of limiting dynamics in many applications. This technique considerably simplifies much previous work in this area. We further apply it to the study of the dynamical behaviour of large singleresource loss systems under virtual partitioning, or dynamic trunk reservation, controls. We identify limiting dynamics under the above regime, describing the behaviour of the number of calls of each type in the system. We show that all trajectories of these dynamics converge to a single fixed point, which we identify. We identify also limiting stationary behaviour, including call acceptance probabilities