scispace - formally typeset
Proceedings ArticleDOI

Statistical bandwidth sharing: a study of congestion at flow level

Reads0
Chats0
TLDR
The statistics of the realized throughput of elastic document transfers are studied, accounting for the way network bandwidth is shared dynamically between the randomly varying number of concurrent flows.
Abstract
In this paper we study the statistics of the realized throughput of elastic document transfers, accounting for the way network bandwidth is shared dynamically between the randomly varying number of concurrent flows. We first discuss the way TCP realizes statistical bandwidth sharing, illustrating essential properties by means of packet level simulations. Mathematical flow level models based on the theory of stochastic networks are then proposed to explain the observed behavior. A notable result is that first order performance (e.g., mean throughput) is insensitive with respect both to the flow size distribution and the flow arrival process, as long as "sessions" arrive according to a Poisson process. Perceived performance is shown to depend most significantly on whether demand at flow level is less than or greater than available capacity. The models provide a key to understanding the effectiveness of techniques for congestion management and service differentiation.

read more

Content maybe subject to copyright    Report

Citations
More filters
Journal ArticleDOI

A scalable, commodity data center network architecture

TL;DR: This paper shows how to leverage largely commodity Ethernet switches to support the full aggregate bandwidth of clusters consisting of tens of thousands of elements and argues that appropriately architected and interconnected commodity switches may deliver more performance at less cost than available from today's higher-end solutions.
Book

Sizing router buffers

TL;DR: It is shown that a link with n flows requires no more than B = (overlineRTT x C) √n, for long-lived or short-lived TCP flows, because of the large number of flows multiplexed together on a single backbone link.
Proceedings Article

Less is more: trading a little bandwidth for ultra-low latency in the data center

TL;DR: The HULL (High-bandwidth Ultra-Low Latency) architecture is presented to balance two seemingly contradictory goals: near baseline fabric latency and high bandwidth utilization and results show that by sacrificing a small amount of bandwidth, HULL can dramatically reduce average and tail latencies in the data center.
Proceedings ArticleDOI

Impact of fairness on Internet performance

TL;DR: It is proved that for a broad class of fair bandwidth allocations, the total number of flows in progress remains finite if the load of every link is less than one.
Journal ArticleDOI

Distributed $\alpha$ -Optimal User Association and Cell Load Balancing in Wireless Networks

TL;DR: This work proposes and analyzes an iterative distributed user association policy that adapts to spatial traffic loads and converges to a globally optimal allocation and proves that the optimal load vector ρ* that minimizes a generalized system performance function is the fixed point of a certain mapping.
References
More filters
Book

Data networks

TL;DR: Undergraduate and graduate classes in computer networks and wireless communications; undergraduate classes in discrete mathematics, data structures, operating systems and programming languages.
Journal ArticleDOI

Rate control for communication networks: shadow prices, proportional fairness and stability

TL;DR: This paper analyses the stability and fairness of two classes of rate control algorithm for communication networks, which provide natural generalisations to large-scale networks of simple additive increase/multiplicative decrease schemes, and are shown to be stable about a system optimum characterised by a proportional fairness criterion.
Journal ArticleDOI

Wide area traffic: the failure of Poisson modeling

TL;DR: It is found that user-initiated TCP session arrivals, such as remote-login and file-transfer, are well-modeled as Poisson processes with fixed hourly rates, but that other connection arrivals deviate considerably from Poisson.
Book

Reversibility and Stochastic Networks

Frank Kelly
TL;DR: This classic in stochastic network modelling broke new ground when it was published in 1979, and it remains a superb introduction to reversibility and its applications thanks to the author's clear and easy-to-read style.
Journal ArticleDOI

Open, Closed, and Mixed Networks of Queues with Different Classes of Customers

TL;DR: Many of the network results of Jackson on arrival and service rate dependencies, of Posner and Bernholtz on different classes of customers, and of Chandy on different types of service centers are combined and extended in this paper.
Related Papers (5)