Journal ArticleDOI
Bounds on the Performance of Dynamic Routing Schemes for Highly Connected Networks
Reads0
Chats0
TLDR
The bound emerges as a solution to a dual pair of convex programming problems, where the primal problem describes mean flows through the network and the dual problem describes implied costs and surplus values at resources of the network.Abstract:
We describe a procedure for bounding the performance of dynamic routing schemes for loss or queueing networks The bound is developed from a network flow synthesis of a collection of Markov decision processes, one for each resource of the network The bound emerges as a solution to a dual pair of convex programming problems, where the primal problem describes mean flows through the network and the dual problem describes implied costs and surplus values at resources of the network The bound is particularly appropriate for large highly connected networks, where it may be approached by simple trunk reservation or threshold routing schemesread more
Citations
More filters
Journal ArticleDOI
Utility-based rate control in the Internet for elastic traffic
Richard J. La,Venkat Anantharam +1 more
TL;DR: This work investigates the fundamental problem of achieving the system optimal rates in the sense of maximizing aggregate utility, in a distributed manner, using only the information available at the end hosts of the network by introducing a pricing scheme.
Book ChapterDOI
On the Least Upper Bound of Discount Factors that are Compatible with Optimal Period-Three Cycles
Kazuo Nishimura,Makoto Yano +1 more
TL;DR: In this article, the authors derived the least upper bound of discount factors of future utilities for which a cyclical optimal path of period 3 may emerge in the standard class of optimal growth models.
Proceedings ArticleDOI
Insensitive load balancing
TL;DR: This paper identifies the class of load balancing policies which preserve insensitivity and characterize optimal strategies in some specific cases and addresses the issue of dynamic load balancing.
Book
ATM Network Resource Management
TL;DR: This book covers ATM network management in both technical and dollars and cents terms to help network managers optimize their resources in implementing and maintaining ATM.
Journal ArticleDOI
Incomplete Markets and Volatility
TL;DR: In this paper, a CARA-normal exchange economy with many periods and endogenous interest rates is considered, and the authors show that when there is an intermediate level of market incompleteness and sufficient investor impatience, fluctuations in the real interest rate can be large, even though the aggregate endowment is constant.
References
More filters
Journal ArticleDOI
Applying a New Device in the Optimization of Exponential Queuing Systems
TL;DR: A new definition of the time of transition is provided, which is able to utilize the inductive approach in a manner characteristic of inventory theory, and a policy optimal for all sufficiently small discount factors can be obtained from the usual average cost functional equation without recourse to further computation.
Journal ArticleDOI
Routing in circuit-switched networks: optimization, shadow prices and decentralization
TL;DR: It is shown that there exist implicit shadow prices associated with each route and with each link of the network, and that the equations defining these prices have a local or decentralized character.
Journal ArticleDOI
Dynamic routing in open queueing networks: Brownian models, cut constraints and resource pooling
Frank Kelly,C. N. Laws +1 more
TL;DR: The main conclusion is that in many respects dynamic routingsimplifies the behaviour of networks, and that under good control policies it may well be possible to model the aggregate behaviour of a network quite straightforwardly.
Journal ArticleDOI
Routing and capacity allocation in networks with trunk reservation
TL;DR: Using a simplified analytical model of a circuit-switched network incorporating trunk reservation, it is shown that there exist implied costs associated with the priority and nonpriority calls routed through a link, and shadow prices associated withThe capacity for priority andnonpriority traffic through a links.