Results 1  10
of
132
Fair endtoend windowbased congestion control
 IEEE/ACM TRANS. ON NETWORKING
, 2000
"... In this paper, we demonstrate the existence of fair endtoend windowbased congestion control protocols for packetswitched networks with first comefirst served routers. Our definition of fairness generalizes proportional fairness and includes arbitrarily close approximations of maxmin fairness. T ..."
Abstract

Cited by 676 (3 self)
 Add to MetaCart
In this paper, we demonstrate the existence of fair endtoend windowbased congestion control protocols for packetswitched networks with first comefirst served routers. Our definition of fairness generalizes proportional fairness and includes arbitrarily close approximations of maxmin fairness. The protocols use only information that is available to end hosts and are designed to converge reasonably fast. Our study is based on a multiclass fluid model of the network. The convergence of the protocols is proved using a Lyapunov function. The technical challenge is in the practical implementation of the protocols.
Bandwidth Sharing: Objectives and Algorithms
 IEEE/ACM Transactions on Networking
, 1999
"... This paper concerns the design of distributed algorithms for sharing network bandwidth resources among contending flows. The classical fairness notion is the socalled maxmin fairness; F. Kelly [8] has recently introduced the alternative proportional fairness criterion; we introduce a third crit ..."
Abstract

Cited by 336 (11 self)
 Add to MetaCart
(Show Context)
This paper concerns the design of distributed algorithms for sharing network bandwidth resources among contending flows. The classical fairness notion is the socalled maxmin fairness; F. Kelly [8] has recently introduced the alternative proportional fairness criterion; we introduce a third criterion, which is naturally interpreted in terms of the delays experienced by ongoing transfers. We prove that fixed size window control can achieve fair bandwidth sharing according to any of these criteria, provided scheduling at each link is performed in an appropriate manner. We next consider a distributed random scheme where each traffic source varies its sending rate randomly, based on binary feedback information from the network. We show how to select the source behaviour so as to achieve an equilibrium distribution concentrated around the considered fair rate allocations. This stochastic analysis is then used to assess the asymptotic behaviour of deterministic rate adaption proc...
Making Greed Work in Networks: A GameTheoretic Analysis of Switch Service Disciplines
 IEEE/ACM TRANSACTIONS ON NETWORKING
, 1994
"... This paper discusses congestion control from a gametheoretic perspective. There are two basic premises: (1) users are assumed to be independent and selfish, and (2) central administrative control is exercised only at the network switches. The operating points resulting from selfish user behavior ..."
Abstract

Cited by 220 (11 self)
 Add to MetaCart
This paper discusses congestion control from a gametheoretic perspective. There are two basic premises: (1) users are assumed to be independent and selfish, and (2) central administrative control is exercised only at the network switches. The operating points resulting from selfish user behavior depend crucially on the service disciplines implemented in network switches. This effect is investigated in a simple model consisting of a single exponential server shared by many Poisson sources. We discuss the extent to which one can guarantee, through the choice of switch service disciplines, that these selfish operating points will be efficient and fair. We also discuss to what extent the choice of switch service disciplines can ensure that these selfish operating points are unique and are easily and rapidly accessible by simple selfoptimization techniques. We show that no service discipline can guarantee optimal efficiency. As for the other properties, we show that the traditio...
On Path Selection for Traffic with Bandwidth Guarantees
 In Proceedings of IEEE International Conference on Network Protocols
, 1997
"... Transmission of multimedia streams imposesa minimumbandwidth requirementon the path being used to ensureendtoend QualityofService (QoS) guarantees. While any shortestpath algorithm can be used to select a feasible path, additional constraints that limit resource consumption and balance the netw ..."
Abstract

Cited by 190 (7 self)
 Add to MetaCart
(Show Context)
Transmission of multimedia streams imposesa minimumbandwidth requirementon the path being used to ensureendtoend QualityofService (QoS) guarantees. While any shortestpath algorithm can be used to select a feasible path, additional constraints that limit resource consumption and balance the network load are needed to achieve efficient resource utilization. We present a systematic evaluation of four routing algorithms that offer different tradeoffs between limiting the path hop count and balancing the network load. Our evaluation considers not only the call blocking rate but also the fairness to requests for different bandwidths, robustness to inaccurate routing information, and sensitivity to the routing information update frequency. It evaluates not only the performance of these algorithms for the sessions with bandwidth guarantees, but also their impact on the lower priority besteffort sessions. Our results show that a routing algorithm that gives preference to limiting the hop ...
Congestion Control With Explicit Rate Indication
 PROC. ICC'95
, 1995
"... As the speed and the dynamic range of computer networks evolve, the issue of efficient traffic management becomes increasingly important. This work describes an approach to traffic management using explicit rate information provided to the source by the network. We present an asynchronous distribute ..."
Abstract

Cited by 143 (15 self)
 Add to MetaCart
As the speed and the dynamic range of computer networks evolve, the issue of efficient traffic management becomes increasingly important. This work describes an approach to traffic management using explicit rate information provided to the source by the network. We present an asynchronous distributed algorithm for optimal rate calculation across the network, where optimality is understood in the maxmin sense. The algorithm quickly converges to the optimal rates and is shown to be wellbehaved in transience. 1 Introduction 1.1 Background In the past decade several mechanisms for congestion control have been developed and implemented. DECbit [34] and Slow Start [20] are perhaps the best known. Both of these schemes were developed for connectionless networks with window flow control, in which the routers had no knowledge of the individual flows and their demands, the routes changed frequently and the header space was scarce. With the rapid increase of the ratio of propagation delay to...
Maxmin Fair Scheduling in Wireless Networks
, 2002
"... We consider scheduling policies for maxmin fair allocation of bandwidth in wireless adhoc networks. We formalize the maxmin fair objective under wireless scheduling constraints. We propose a fair scheduling which assigns dynamic weights to the flows such that the weights depend on the congestion in ..."
Abstract

Cited by 114 (5 self)
 Add to MetaCart
(Show Context)
We consider scheduling policies for maxmin fair allocation of bandwidth in wireless adhoc networks. We formalize the maxmin fair objective under wireless scheduling constraints. We propose a fair scheduling which assigns dynamic weights to the flows such that the weights depend on the congestion in the neighborhood and schedule the flows which constitute a maximum weighted matching. It is possible to analytically prove that this policy attains both short term and long term fairness. We consider more generalized fairness notions, and suggest mechanisms to attain these objectives. I.
An Algorithm for Rate Allocation in PacketSwitching Network with Feedback
"... As the speed and complexity of computer networks evolve, sharing network resources becomes increasingly important. Thus, the issue of how to allocate the available bandwidth among the multitude of users needs to be addressed. Such allocation needs to be in some sense efficient and fair to different ..."
Abstract

Cited by 82 (3 self)
 Add to MetaCart
(Show Context)
As the speed and complexity of computer networks evolve, sharing network resources becomes increasingly important. Thus, the issue of how to allocate the available bandwidth among the multitude of users needs to be addressed. Such allocation needs to be in some sense efficient and fair to different users. In this work the socalled maxmin fairness is chosen as the optimality criterion. A new distributed and asynchronous algorithm is suggested. The algorithm is shown to converge to the optimal rate allocation in a network with general topology under dynamic changes in the set of network users, individual user load and occasional route changes. An upper bound on convergence time is given. The algorithm is shown to be wellbehaved in transience. Unlike previous work, the algorithm takes bandwidth consumed by feedback traffic into account. Further, an extension of the algorithm is suggested to address the problem of policing misbehaved users.
Transporting Compressed Video over ATM Networks with Explicit Rate Feedback Control
 in Proc. of IEEE Infocom
, 1997
"... AbstractWe propose a scheme for transmission of variablebitrate compressed video for interactive applications, using the ExplicitRate congestion control mechanisms proposed for the Available Bit Rate (ABR) service in ATM networks. Compressed video is inherently bursty with rate fluctuations over ..."
Abstract

Cited by 68 (5 self)
 Add to MetaCart
(Show Context)
AbstractWe propose a scheme for transmission of variablebitrate compressed video for interactive applications, using the ExplicitRate congestion control mechanisms proposed for the Available Bit Rate (ABR) service in ATM networks. Compressed video is inherently bursty with rate fluctuations over both short and long time scales. This source behavior can be accommodated by by the ABR service, since the explicitrate scheme allows sources to request varying amounts of bandwidth over time. Moreover, when the bandwidth demand cannot be met, the network provides feedback indicating the bandwidth currently available to a connection. In our scheme, the video source rate is matched to the available bandwidth by modifying the quantization level used during compression. We use trace driven simulations to examine how effective the enhanced explicit rate scheme is in &quot;rate matching &quot; between the network and the source and the effect on endend delay. We also look at the sensitivity of the proposed scheme to the estimates of the network roundtrip times and to inaccuracies in the rate requests made by sources. Keywords Packet video, ATM, congestion control.
Priority Service and MaxMin Fairness
, 2003
"... We study a priority service where users are free to choose the priority of their traffic, but are charged accordingly by the network. We assume that each user chooses priorities to maximize its own net benefit, and model the resulting interaction among users as a noncooperative game. We show that t ..."
Abstract

Cited by 62 (1 self)
 Add to MetaCart
We study a priority service where users are free to choose the priority of their traffic, but are charged accordingly by the network. We assume that each user chooses priorities to maximize its own net benefit, and model the resulting interaction among users as a noncooperative game. We show that there exists an unique equilibrium for this game and that in equilibrium the bandwidth allocation is weighted maxmin fair.
A Unified Framework for MaxMin and MinMax Fairness with Applications
 in Proceedings of 40th Annual Allerton Conference on Communication, Control, and Computing
, 2002
"... Maxmin fairness is widely used in various areas of networking. In every case where it is used, there is a proof of existence and one or several algorithms for computing the maxmin fair allocation; in most, but not all cases, they are based on the notion of bottlenecks. In spite of this wide app ..."
Abstract

Cited by 60 (1 self)
 Add to MetaCart
Maxmin fairness is widely used in various areas of networking. In every case where it is used, there is a proof of existence and one or several algorithms for computing the maxmin fair allocation; in most, but not all cases, they are based on the notion of bottlenecks. In spite of this wide applicability, there are still examples, arising in the context of mobile or peertopeer networks, where the existing theories do not seem to apply directly. In this paper, we give a unifying treatment of maxmin fairness, which encompasses all existing results in a simplifying framework, and extends its applicability to new examples. First, we observe that the existence of maxmin fairness is actually a geometric property of the set of feasible allocations (uniqueness always holds). There exist sets on which maxmin fairness does not exist, and we describe a large class of sets on which a maxmin fair allocation does exist. This class contains the compact, convex sets of , but not only. Second, we give a general purpose, centralized algorithm, called Maxmin Programming, for computing the maxmin fair allocation in all cases where it exists (whether the set of feasible allocations is in our class or not). Its complexity is of the order of linear programming steps in , in the case where the feasible set is defined by linear constraints. We show that, if the set of feasible allocations has the freedisposal property, then Maxmin Programming degenerates to a simpler algorithm, called Water Filling, whose complexity is much less. Free disposal corresponds to the cases where a bottleneck argument can be made, and Water Filling is the general form of all previously known centralized algorithms for such cases. Our derivations are based on the relation betwe...