In the present talk we focus on α-fair bandwidth-sharing networks where the load on one or several of the links exceeds the capacity. In order to characterize the overload behavior, we examine the fluid limit, which emerges from a suitably scaled version of the number of flows of the various classes. We prove that the fluid limit is a linear function of time, and derive a fixed-point equation f...

Recent congestion control protocols such as XCP and RCP achieve fair bandwidth sharing, high utilization, small queue sizes and nearly zero packet loss by implementing an explicit bandwidth share mechanism in the network routers. This paper develops new quantitative techniques for achieving the same results using only end-host measures. We develop new methods of computing bottleneck link charac...

| This paper is concerned with the design of a class of bandwidth scheduling policies that are suitable for public, wide-area ATM networks. We specify design goals for such strategies including ease of implementation and the ability to guarantee minimum bandwidths to individual buuers. Packetized generalized processor sharing is brieey discussed and a minimum-bandwidth result for self-clocked f...

approved: Bechir Hamdaoui The enormous success of wireless technology has recently led to an explosive demand for, and hence a shortage of, bandwidth resources. This expected shortage problem is reported to be primarily due to the inefficient, static nature of current spectrum allocation methods. As an initial step towards solving this shortage problem, Federal Communications Commission (FCC) o...

Traditionally TCP bandwidth sharing has been investigated mainly by stochastic approaches due to its seemingly chaotic nature. Even though of great generality, the theories deal mainly with expectation values, which is prone to misinterpretation with respect to the Quality-of-Experience (QoE). We disassemble TCP operating conditions into dominating scenarios and show that bandwidth sharing alon...

The Low Bandwidth Network File System (LBFS) was designed to minimize the bandwidth requirements for running interactive applications and accessing remote files over bandwidthconstrained network links. We present a simplified implementation of the original LBFS in which we concentrate on the analysis of the chunking algorithm used to exploit similarities across files. We propose an optimized ve...