No abstract

No abstract

In this paper, we present a new proportional bandwidth allocation scheme along with its analysis. The novel approach of this scheme is that it is purely end-to-end, it does not require any processing by the network, it is adaptive to changing network conditions, it has minimum oscillations, and it works even when sources have different end-to-end propagation delays. This scheme is a function of an Adaptive RateBased (ARB) congestion control algorithm that is designed to support best-effort traffic for which the proportional bandwidth allocation function is very desirable. We will briefly describe the ARB algorithm. We then analyze the behavior of the bottleneck queue, the settings of the ARB parameters and their effects on the behavior. This analysis will lead us to two conditions that. when they are satisfied , will provide proportional bandwidth allocation among the sources that are controlled by the ARB algorithm. We will show what parameters and how they can be controlled in order to achieve the proportional bandwidth allocation . Simulation will be used to validate our analysis. KeywordsAdaptive rate-based congestion control , proportional bandwidth allocation , performance analYSis A. Tantawy (ed.), High Performance Networking VII

This paper investigates the waiting time in a token-ring local area network (LAN) with gated service discipline. It gives a n analytical approximation for a network with a n arbitrary number of stations, non-identical Poisson arrival streams and general service time distributions at each station, and non-zero switch-over (also referred to' as walk-time) between adjacent stations. T h i s approximation method is a n a l t e r n a t i v e t o t h e r e l a t i v e l y complicated numerical evaluation of the waiting time that is currently available. Extensive simulation results with different parameters are presented to show the degree of accuracy of the approximation, which is generally good for a practical range of parameters.