This paper considers networks operating under α-fair bandwidth sharing. When imposing a peak rate (i.e., an upper bound on the users' transmission rates, which could be thought of as access rates), the equilibrium point of the uid limit is explicitly identi ed, for both the single-node network as well as the linear network. More speci cally, a criterion is derived that indicates, for each speci...

Currently there is not enough work on the Internet weighted fair bandwidth sharing without per-flow management, especially when both UDP and TCP flows of different RTTs and different bandwidth targets coexist. This paper contains two contributions: 1) A mechanism called SCALE-WFS, Scalable Core with Aggregation Level labEling Weighted Fair bandwidth-Sharing, is presented to achieve near-optimal...

This paper reviews the engineering solutions and economic models for fair allocation of network bandwidth to elastic flows. By using examples, it gives insight to Proportional Fairness, and how it compares to the fairness achieved by TCP. The second topic is a discussion of fair bandwidth allocation between multicast and unicast flows. By separating the discussion into economic and engineering ...

The objective of recent research in fair queueing schemes has been to efficiently emulate a fluid-flow generalized (weighted) processor sharing (GPS) system, as closely as possible. A primary motivation for the use of fair-queueing has been its use as a means of providing bandwidth guarantees and as a consequence end-to-end delay bounds for traffic with bounded burstiness. The rate guarantees t...

Customers of bandwidth services can be divided into two distinct groups: those customers requesting bandwidth for the future and those desiring bandwidth immediately. We develop a dynamic network provisioning methodology that minimally satis es the QoS (blocking probability) requirements for the 'on-demand' customers. Our method is suf ciently general and captures time varying trends in the dem...

While existing research shows that feedback-based congestion control mechanisms are capable of providing better video quality and higher link utilization for rate-adaptive packet video, there has been relatively little study on how to share network bandwidth among competing rate-adaptive video connections, when feedback control is used in a fully distributed network. This paper addresses this i...

We consider bandwidth-sharing networks, and show how the SRPT (Shortest Remaining Processing Time) discipline can be used in order to improve the delay performance of the system. Our main idea is not to use SRPT globally between the traffic classes, which has been shown to induce instability, but rather deploy SRPT only locally within each traffic class. We show that with this approach, the per...

Applications using TCP, such as web-browsers, ftp, and various P2P programs, dominate most of the Internet traffic today. In many cases the last-hop access links are bottlenecks due to their limited bandwidth capability with users running many simultaneous network applications. Standard TCP shares bottleneck link capacity according to connection round-trip time (RTT), and may result in a bandwi...

We consider the problem of bulk data transfers and bandwidth sharing in the context of grid infrastructures. Grid computing empowers high-performance computing in a large-scale distributed environment. Network bandwidth, which makes the expensive computational and storage resources work in concert, plays an active role on performance. Due to specific traffic patterns, network topology and appli...

Empirical work has shown that up to 20% of the volume transferred on data networks might correspond to ‘aborted’ connections, i.e., badput. With this in mind, we propose two generic models that capture a variety of user impatience behaviors, and investigate their impact on user perceived and system performance achieved by various bandwidth sharing schemes. Our study suggests that differentiatin...