Results 1 - 10
of
183
A game theoretic framework for bandwidth allocation and pricing in broadband networks
- IEEE/ACM TRANS. ON NETWORKING
, 2000
"... In this paper, we present a game theoretic framework for bandwidth allocation for elastic services in high-speed networks. The framework is based on the idea of the Nash bargaining solution from cooperative game theory, which not only provides the rate settings of users that are Pareto optimal from ..."
Abstract
-
Cited by 238 (11 self)
- Add to MetaCart
(Show Context)
In this paper, we present a game theoretic framework for bandwidth allocation for elastic services in high-speed networks. The framework is based on the idea of the Nash bargaining solution from cooperative game theory, which not only provides the rate settings of users that are Pareto optimal from the point of view of the whole system, but are also consistent with the fairness axioms of game theory. We first consider the centralized problem and then show that this procedure can be decentralized so that greedy optimization by users yields the system optimal bandwidth allocations. We propose a distributed algorithm for implementing the optimal and fair bandwidth allocation and provide conditions for its convergence. The paper concludes with the pricing of elastic connections based on users ’ bandwidth requirements and users’ budget. We show that the above bargaining framework can be used to characterize a rate allocation and a pricing policy which takes into account users’ budget in a fair way and such that the total network revenue is maximized.
A Quality of Service Architecture
, 1996
"... ..................................................................... ....... i Acknowledgements ............................................................... ii 1. Introduction .................................................................... 1 2. Quality of Service Terminology, Principles and ..."
Abstract
-
Cited by 220 (23 self)
- Add to MetaCart
..................................................................... ....... i Acknowledgements ............................................................... ii 1. Introduction .................................................................... 1 2. Quality of Service Terminology, Principles and Concepts ................. 17 2.1 Terminology.......................................................... .......................17 2.2 Qos Principles........................................................... ...................18 2.2.1 Integration Principle .................................................................19 2.2.2 Separation Principle .................................................................19 2.2.3 Transparency Principle............................................................ ..19 2.2.4 Asynchronous Resource Management Principle .................................20 2.2.5 Performance Principle............................................................ ...20 2.3 QoS S...
The ERICA Switch Algorithm for ABR Traffic Management in ATM Networks
- IEEE/ACM TRANSACTIONS ON NETWORKING
, 2000
"... This paper describes the "explicit rate indication for congestion avoidance" (ERICA) scheme for rate-based feedback from asynchronous transfer mode (ATM) switches. In ERICA, the switches monitor their load on each link and determine a load factor, the available capacity, and the number of ..."
Abstract
-
Cited by 94 (30 self)
- Add to MetaCart
This paper describes the "explicit rate indication for congestion avoidance" (ERICA) scheme for rate-based feedback from asynchronous transfer mode (ATM) switches. In ERICA, the switches monitor their load on each link and determine a load factor, the available capacity, and the number of currently active virtual channels. This information is used to advise the sources about the rates at which they should transmit. The algorithm is designed to achieve high link utilization with low delays and fast transient response. It is also fair and robust to measurement errors caused by the variations in ABR demand and capacity. We present performance analysis of the scheme using both analytical arguments and simulation results. The scheme is being considered for implementation by several ATM switch manufacturers.
A Unifying Passivity Framework for Network Flow Control
- IEEE Transactions on Automatic Control
, 2002
"... Network flow control regulates the traffic between sources and links based on congestion, and plays a critical role in ensuring satisfactory performance. In recent studies, global stability has been shown for several flow control schemes. By using a passivity approach, this paper presents a unifying ..."
Abstract
-
Cited by 80 (14 self)
- Add to MetaCart
(Show Context)
Network flow control regulates the traffic between sources and links based on congestion, and plays a critical role in ensuring satisfactory performance. In recent studies, global stability has been shown for several flow control schemes. By using a passivity approach, this paper presents a unifying framework which encompasses these stability results as special cases. In addition, the new approach significantly expands the current classes of stable flow controllers by augmenting the source and link update laws with passive dynamic systems. This generality offers the possibility of optimizing the controllers, for example, to improve robustness and performance with respect to time delay, unmodeled flows, and capacity variation.
A Resource Query Interface for Network-Aware Applications
- Cluster Computing
, 1999
"... Development of portable network-aware applications demands an interface to the network that allows an application to obtain information about its execution environment. This paper motivates and describes the design of Remos, an API that allows network-aware applications to obtain relevant informatio ..."
Abstract
-
Cited by 59 (16 self)
- Add to MetaCart
(Show Context)
Development of portable network-aware applications demands an interface to the network that allows an application to obtain information about its execution environment. This paper motivates and describes the design of Remos, an API that allows network-aware applications to obtain relevant information. The major challenges in defining a uniform interface are network heterogeneity, diversity in traffic requirements, variability of the information, and resource sharing in the network. Remos addresses these issues with two abstraction levels, explicit management of resource sharing, and statistical measurements. The flows abstraction captures the communication between nodes, and the topologies abstraction provides a logical view of network connectivity. Remos measurements are made at network level, and therefore information to manage sharing of resources is available. Remos is designed to deliver best effort information to applications, and it explicitly adds statistical reliability and va...
ReMoS: A Resource Monitoring System for Network-Aware Applications
, 1997
"... Development of portable network-aware applications demands an interface to the network that allows an application to obtain information about its execution environment. This paper motivates and describes the design of Remos, an API that allows network-aware applications to obtain relevant informatio ..."
Abstract
-
Cited by 49 (8 self)
- Add to MetaCart
(Show Context)
Development of portable network-aware applications demands an interface to the network that allows an application to obtain information about its execution environment. This paper motivates and describes the design of Remos, an API that allows network-aware applications to obtain relevant information. The major challenges in defining a uniform interface are network heterogeneity, diversity in traffic requirements, variability of the information, and resource sharing in the network. Remos addresses these issues with two abstraction levels, explicit management of resource sharing, and statistical measurements. The flows abstraction captures the communication between nodes, and the topologies abstraction provides a logical view of network connectivity. Remos measurements are made at network level, and therefore information to manage sharing of resources is available. Remos is designed to deliver best effort information to applications, and it explicitly adds statistical reliability and variability measures to the core information. The paper also presents preliminary results and experience with a prototype Remos implementation for a high speed IP-based network testbed.
Maintaining High Throughput During Overload in ATM Switches
- In Proc. of the IEEE INFOCOM
, 1996
"... This paper analyzes two popular heuristics for ensur ing packet integrity in ATM switching systems In particular we analyze the behavior of packet tail dis carding in order to understand how the packet level link eciency is dependent on the rates of individual virtual circuits and the degree of t ..."
Abstract
-
Cited by 45 (7 self)
- Add to MetaCart
(Show Context)
This paper analyzes two popular heuristics for ensur ing packet integrity in ATM switching systems In particular we analyze the behavior of packet tail dis carding in order to understand how the packet level link eciency is dependent on the rates of individual virtual circuits and the degree of the imposed over load In addition we study early packet discard and show that the queue capacity needed to achieve high eciency under worstcase conditions grows with the number of virtual circuits and we determine the e ciency obtainable with more limited queue capacities Using the insights from these analyses extensions to early packet discard are proposed which achieve high eciency with dramatically smaller queue capacities
A Utility-Based Approach for Quantitative Adaptation in Wireless Packet Networks
- Wireless Networks
, 2001
"... This paper assesses the state-of-the-art in Quality-of-Service (QoS) adaptive wireless networks and proposes new adaptation techniques that better suit application specific needs. The contribution of the paper is as follows: we propose an adaptive service comprising (i) bandwidth utility functions, ..."
Abstract
-
Cited by 45 (0 self)
- Add to MetaCart
(Show Context)
This paper assesses the state-of-the-art in Quality-of-Service (QoS) adaptive wireless networks and proposes new adaptation techniques that better suit application specific needs. The contribution of the paper is as follows: we propose an adaptive service comprising (i) bandwidth utility functions, which capture the adaptive nature of mobile applications in terms of the range of bandwidth over which they prefer to operate; and (ii) adaptation scripts, which enable adaptive mobile applications to program the per-flow adaptation time scale and bandwidth granularity realizing application-specific adaptive services. To maintain adaptive services in wireless packet access networks, we propose a split level adaptation control framework that operates at the network and application levels. Network level control employs a periodic probing mechanism between mobile devices and network gateways in support of utility based max--min fair resource allocation. Application level control is managed by a set of distributed adaptation handlers that operate at mobile devices realizing application-specific adaptation strategies.
Congestion Control as a Stochastic Control Problem with Action Delays
- Automatica
, 1999
"... We consider the design of explicit rate-based congestion control for high-speed communication networks and show that this can be formulated as a stochastic control problem where the controls of different users enter the system dynamics with different delays. We discuss the existence, derivation and ..."
Abstract
-
Cited by 44 (8 self)
- Add to MetaCart
We consider the design of explicit rate-based congestion control for high-speed communication networks and show that this can be formulated as a stochastic control problem where the controls of different users enter the system dynamics with different delays. We discuss the existence, derivation and the structure of the optimal controller, as well as of suboptimal controllers of the certainty-equivalent type---a terminology that is precisely defined in the paper for the specific context of the congestion control problem considered. We consider, in particular, two certaintyequivalent controllers which are easy to implement, and show that they are stabilizing, i.e., they lead to bounded infinite-horizon average cost, and stable queue dynamics. Further, these controllers perform well in simulations. Key words: Communication networks# stochastic control# certainty equivalence# optimal control ? Research supported by NSF Grants NSF ECS 93-12807, NSF NCR 9701525 and NSF ANI 98-13710, and AFO...
