On network bandwidth allocation policies and feedback control algorithms for packet networks
TL;DR: This paper summarizes the experience on the design of network bandwidth allocation policies and distributed rate calculation algorithms for packet-switched networks and discusses two rate allocation policies: the generalized max–min (GMM) and the weight-proportional max-min (WPMM) policies, both of which generalize the classical max–Min rate allocation policy.
About: This article is published in Computer Networks.The article was published on 2000-09-01. It has received 18 citations till now. The article focuses on the topics: Distributed algorithm & Bandwidth allocation.
Citations
More filters
Posted Content•
TL;DR: An asynchronous distributed algorithm is presented for optimal rate calculation across the network, where optimality is understood in the maxmin sense and the algorithm quickly converges to the optimal rates and is shown to be well-behaved in transience.
Abstract: 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 well-behaved in transience.
262 citations
TL;DR: This paper considers challenges of providing the desired quality of service or improving the transmission efficiency for H.264 video transmissions over wireless networks, and surveys existing mechanisms based on the protocol layers they work on.
26 citations
Cites background from "On network bandwidth allocation pol..."
...Previous works on wired networks focus on the resource reservation among network devices [1,2], providing differentiated services [3–5] and the codec enhancements [6,7]....
[...]
...In addition, IDR slice and Partition A are mapped onto to AC [2] (i....
[...]
25 Nov 2001
TL;DR: A mobile agent based approach for bandwidth allocation in multimedia communication based on the the network congestion monitored by the agents at the clients is proposed, which reduces the network control traffic used in traditional online bandwidth allocation policies.
Abstract: The allocation of bandwidth for multimedia traffic poses a technical challenge due to bursty and isochronous nature of applications. We propose a mobile agent based approach for bandwidth allocation in multimedia communication. It is based on the the network congestion monitored by the agents at the clients. The mobile agent hosted by the server will allocate bandwidth online to the applications within the requested range at regular intervals. Also, it keeps the aggregated bandwidth below the link bandwidth of server and clients. The approach reduces the network control traffic used in traditional online bandwidth allocation policies. The scheme is simulated and its performance is evaluated in terms of several parameters, like, bandwidth utilization, application rejection, agent response time, and agent migrations. The simulation results show that the use of agents increase flexibility and efficiency in end-to-end bandwidth allocation and operate asynchronously. The flexibility in using this technology is that, the allocation policies can be changed, customized and implemented easily.
20 citations
Cites methods from "On network bandwidth allocation pol..."
...Several approaches such as RTCP (Real time control protocol) based allocation, RSVP (resource reservation protocol) based flow reservation, RCBR (renegotiated constant bit rate), explicit rate feedback (for Available bit rate services in ATM networks), variations of max-min rate policy, dynamic search algorithm and agent based approaches are used for allocation of bandwidth [2-8]....
[...]
TL;DR: This work proposes an adaptive bandwidth allocation scheme for multimedia applications by deploying the static and mobile agents that functions at the network nodes and adaptively finds an alternate patchup route for every congested/failed link and reallocates the bandwidth for the affected multimedia applications.
17 citations
07 Nov 2002
TL;DR: This paper considers joint problems of adaptive bandwidth reservation and link rearrangement (rerouting) for multimedia traffic under the event of congestion/failures of link, and proposes a mobile agent based approach to achieve these objectives.
Abstract: The bandwidth reservation for multimedia traffic poses technical challenges due to the bursty and delay sensitive nature of applications. The objectives of bandwidth reservation schemes are: optimize network utilization, and minimize the packet losses and delays. The growth of multimedia services on the Internet and the possible discovery of programmable networks has made us investigate new techniques for resolving bandwidth issues in multimedia communication. Mobile agent technology seems to be a promising solution for network management and QoS control. In this paper, we consider joint problems of adaptive bandwidth reservation and link rearrangement (rerouting) for multimedia traffic under the event of congestion/failures of link, and propose a mobile agent based approach to achieve these objectives. The scheme is simulated using a multimedia traffic model. Simulation results show that the use of agents increases the network utilization, acceptance ratio of applications, flexibility and efficiency of bandwidth reservation. The flexibility in using agent technology is that the policies can be changed and implemented easily by encoding in the agents.
16 citations
Cites background from "On network bandwidth allocation pol..."
...Adaptive bandwidth reservation schemes reserve bandwidth online according to the implicit or explicit feedback about the network state from intermediate nodes and receivers [2, 3 ], pricing policies, application priorities, queuing based reservation, etc....
[...]
References
More filters
Book•
[...]
TL;DR: Undergraduate and graduate classes in computer networks and wireless communications; undergraduate classes in discrete mathematics, data structures, operating systems and programming languages.
Abstract: Undergraduate and graduate classes in computer networks and wireless communications; undergraduate classes in discrete mathematics, data structures, operating systems and programming languages. Also give lectures to both undergraduate-and graduate-level network classes and mentor undergraduate and graduate students for class projects.
6,991 citations
TL;DR: In this article, the authors present the selection criterion for selection between rate-based and credit-based approach and the key points of the debate between these two approaches are presented. And several other schemes that were considered are described.
Abstract: Congestion control mechanisms for ATM networks as selected by the ATM Forum traffic management group are described. Reasons behind these selections are explained. In particular, selection criterion for selection between rate-based and credit-based approach and the key points of the debate between these two approaches are presented. The approach that was finally selected and several other schemes that were considered are described.
520 citations
TL;DR: A new ATM service category, the available bit rate service, is currently the subject of intense development and the rate-based flow control framework has been identified as the most appropriate for the support of this new service.
Abstract: A new ATM service category, the available bit rate service, is currently the subject of intense development This new service will systematically and dynamically allocate available bandwidth to users by controlling the flow of traffic with feedback The rate-based flow control framework has been identified as the most appropriate for the support of this new service >
491 citations
"On network bandwidth allocation pol..." refers methods in this paper
...In particular, we discuss two rate allocation policies: the generalized max±min (GMM) and the weight-proportional max±min (WPMM) policies, both of which generalize the classical max±min rate allocation policy....
[...]
IBM1
TL;DR: The problem of optimally choosing message rates for users of a store-and-forward network is analyzed and a generalized definition of ideal tradeoff is introduced to provide more flexibility in the choice of message rates.
Abstract: The problem of optimally choosing message rates for users of a store-and-forward network is analyzed. Multiple users sharing the links of the network each attempt to adjust their message rates to achieve an ideal network operating point or an "ideal tradeoff point between high throughput and low delay." Each user has a fixed path or virtual circuit. In this environment, a basic definition of "ideal delay-throughput tradeoff" is given and motivated. This definition concentrates on a fair allocation of network resources at network bottlenecks. This "ideal policy" is implemented via a decentralized algorithm that achieves the unique set of optimal throughputs. All sharers constrained by the same bottleneck are treated fairly by being assigned equal throughputs. A generalized definition of ideal tradeoff is then introduced to provide more flexibility in the choice of message rates. With this definition, the network may accommodate users with different types of message traffic. A transformation technique reduces the problem of optimizing this performance measure to the problem of optimizing the basic measure.
483 citations
TL;DR: The results suggest that the transmission capacity not used by the small window session will be approximately fairly divided among the large window sessions, and the worst-case performance of round-robin scheduling with windows is shown to approach limits that are perfectly fair in the max-min sense.
Abstract: The author studies a simple strategy, proposed independently by E.L. Hahne and R.G. Gallager (1986) and M.G.H. Katevenis (1987), for fairly allocating link capacity in a point-to-point packet network with virtual circuit routing. Each link offers its packet transmission slots to its user sessions by polling them in round-robin order. In addition, window flow control is used to prevent excessive packet queues at the network nodes. As the window size increases, the session throughput rates are shown to approach limits that are perfectly fair in the max-min sense. If each session has periodic input (perhaps with jitter) or has such heavy demand that packets are always waiting to enter the network, then a finite window size suffices to produce perfectly fair throughput rates. The results suggest that the transmission capacity not used by the small window session will be approximately fairly divided among the large window sessions. The focus is on the worst-case performance of round-robin scheduling with windows. >
337 citations