Sciweavers

75 search results - page 13 / 15
» A Study of Burstiness in TCP Flows
Sort
View
CCR
2004
116views more  CCR 2004»
14 years 9 months ago
End-to-end congestion control for TCP-friendly flows with variable packet size
Current TCP-friendly congestion control mechanisms adjust the packet rate in order to adapt to network conditions and obtain a throughput not exceeding that of a TCP connection op...
Jörg Widmer, Catherine Boutremans, Jean-Yves ...
ISCC
2003
IEEE
113views Communications» more  ISCC 2003»
15 years 2 months ago
Channel Sharing of Competing Flows in Ad Hoc Networks
This paper studies the fairness with which competing flows share the channel in ad hoc networks using collision avoidance protocols. It is shown that the required multihop coordi...
Yu Wang, J. J. Garcia-Luna-Aceves
65
Voted
PE
2006
Springer
79views Optimization» more  PE 2006»
14 years 9 months ago
Parallel downloads for streaming applications - a resequencing analysis
Several recent studies have proposed methods to accelerate the receipt of a file by downloading its parts from different servers in parallel. The schemes suggested in most propose...
Yoav Nebat, Moshe Sidi
COMCOM
2004
110views more  COMCOM 2004»
14 years 9 months ago
On the latency and fairness characteristics of pre-order deficit round Robin
In the emerging high-speed packet-switched networks, fair packet scheduling algorithms in switches and routers will form an important component of the mechanisms that seek to sati...
Salil S. Kanhere, Harish Sethu
98
Voted
CN
2002
112views more  CN 2002»
14 years 9 months ago
State-dependent M/G/1 type queueing analysis for congestion control in data networks
Abstract--We study in this paper a TCP-like linear-increase multiplicative-decrease flow control mechanism. We consider congestion signals that arrive in batches according to a Poi...
Eitan Altman, Konstantin Avrachenkov, Chadi Baraka...