Sciweavers

15 search results - page 1 / 3
» Predicting bottleneck bandwidth sharing by generalized TCP f...
Sort
View
CN
2002
102views more  CN 2002»
13 years 4 months ago
Predicting bottleneck bandwidth sharing by generalized TCP flows
The paper presents a technique for computing the individual throughputs and the average queue occupancy when multiple TCP connections share a single bottleneck buffer. The bottlene...
Archan Misra, Teunis J. Ott, John S. Baras
CN
2007
146views more  CN 2007»
13 years 4 months ago
TCP self-clocking and bandwidth sharing
— We propose a simple queueing model for TCP transfers sharing a bottleneck link and examine its behavior when the buffer at the bottleneck is large compared to the bandwidth-del...
Allen B. Downey
INFOCOM
2002
IEEE
13 years 9 months ago
Probabilistic Packet Scheduling: Achieving Proportional Share Bandwidth Allocation for TCP Flows
— This paper describes and evaluates a probabilistic packet scheduling (PPS) algorithm for providing different levels of service to TCP flows. With our approach, each router deï...
Ming Zhang, Randolph Y. Wang, Larry L. Peterson, A...
CCR
2008
170views more  CCR 2008»
13 years 4 months ago
Probe-Aided MulTCP: an aggregate congestion control mechanism
An aggregate congestion control mechanism, namely ProbeAided MulTCP (PA-MulTCP), is proposed in this paper. It is based on MulTCP, a proposal for enabling an aggregate to emulate ...
Fang-Chun Kuo, Xiaoming Fu
INFOCOM
2003
IEEE
13 years 9 months ago
Flow Level Simulation of Large IP Networks
— The aim of this paper is to simulate the interaction of a large number of TCP controlled flows and UDP flows sharing many routers/links, from the knowledge of the network par...
François Baccelli, Dohy Hong