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.

Congestion Control with Explicit Rate Indication

Review: H.264 video transmissions over wireless networks: Challenges and solutions

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.

Mobile agent based online bandwidth allocation scheme for multimedia communication

An agent based adaptive bandwidth allocation scheme for multimedia applications

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.

/pdf/adaptive-bandwidth-reservation-scheme-for-multimedia-traffic-2xjpyq8ncb.pdf

Adaptive bandwidth reservation scheme for multimedia traffic using mobile agents

https://www.cnsr.ictas.vt.edu/publication/1-s2.0-S1389128600001328-main.pdf

On network bandwidth allocation policies and feedback control algorithms for packet networks

This paper presents an in-depth survey on network bandwidth allocation policies and discuss design methodologies of distributed rate calculation algorithms in packet-switched networks. In particular, we discuss two rate allocation policies: the generalized max-min and the generic weight- proportional max-min policies, both of which generalize the classical max-min rate allocation policy. For the design of distributed algorithms to achieve these two rate allocation policies, we focus on rate-based distributed flow control where special control packets are employed to achieve the information exchange between a source and the network. We categorize two broad classes of distributed rate calculation algorithms in the literature using live algorithms as illustrations. We compare the design tradeoffs between these two classes of algorithms in terms of performance objectives and implementation complexities and discuss important extensions within each class of algorithms.© (1998) COPYRIGHT SPIE--The International Society for Optical Engineering. Downloading of the abstract is permitted for personal use only.

Rate allocation policies and explicit feedback control algorithms for packet networks

A novel concept in available bit rate (ABR) service model as defined by the ATM Forum is the minimum cell rate (MCR) bandwidth guarantee for each connection. In this paper, we present a network bandwidth allocation policy to support each ABR connection's MCR requirement, as well as its peak cell rate (PCR) constraint. Furthermore, we develop two explicit-rate (ER) based ABR algorithms consistent with the ATM Forum ABR traffic management framework to achieve this rate allocation policy. The first ABR implementation is a simple heuristic algorithm which does not require per-VC accounting. It requires minimal implementation complexity and offers satisfactory performance in a LAN environment. The second ABR implementation employs per-VC accounting and is proven to converge to our rate allocation policy for any network topology and any set of link distances.

/pdf/fair-network-bandwidth-allocation-with-minimum-rate-4zany1dg81.pdf

Fair network bandwidth allocation with minimum rate guarantee and its ABR implementations

https://www.cnsr.ictas.vt.edu/publication/1-s2.0-S0166531699000036-main.pdf

A generic weight-proportional bandwidth sharing policy for ATM ABR service

An important concept in the available bit rate (ABR) service model is the minimum cell rate (MCR) guarantee as well as the peak cell rate (PCR) constraint for each flow. Due to the MCR and PCR requirements, the well-known max-min rate allocation policy no longer suffices to determine the rate allocation for each flow since it does not support either MCR or PCR. In this paper, we present a generalized max-min (GMM) rate allocation policy, which supports both the MCR and PCR requirements for each flow. Furthermore, a simple distributed algorithm using the ABR flow control protocol is developed to achieve the GMM rate allocation in a distributed network environment. The effectiveness of this distributed algorithm is demonstrated by simulation results.

Henry Tzeng

Papers

On network bandwidth allocation policies and feedback control algorithms for packet networks

Rate allocation policies and explicit feedback control algorithms for packet networks

Fair network bandwidth allocation with minimum rate guarantee and its ABR implementations

A generic weight-proportional bandwidth sharing policy for ATM ABR service

Generalized max-min rate allocation: Theory and a simple implementation