Sciweavers

448 search results - page 5 / 90
» Modeling the Burstiness of TCP
Sort
View
INFOCOM
2009
IEEE
15 years 4 months ago
Tuning Skype's Redundancy Control Algorithm for User Satisfaction
—Determining how to transport delay-sensitive voice data has long been a problem in multimedia networking. The difficulty arises because voice and best-effort data are different...
Te-Yuan Huang, Kuan-Ta Chen, Polly Huang
INFOCOM
1998
IEEE
15 years 1 months ago
Design Considerations for Supporting TCP with Per-Flow Queueing
In this paper, we investigate the extent to which fair queueing (and its variants), in conjunction with appropriately tailored buffer management schemes, can be used to achieve th...
Bernhard Suter, T. V. Lakshman, Dimitrios Stiliadi...
61
Voted
ISCC
2006
IEEE
118views Communications» more  ISCC 2006»
15 years 3 months ago
Performance of Paced and Non-Paced Transmission Control Algorithms in Small Buffered Networks
Famous rule-of-thumb states that a buffer sized at B = RTT × BW, where RTT is the average round trip time and BW is the bandwidth of output link is necessary in order to achieve ...
Onur Alparslan, Shin'ichi Arakawa, Masayuki Murata
INFOCOM
2008
IEEE
15 years 3 months ago
Window Flow Control: Macroscopic Properties from Microscopic Factors
—This paper studies window flow control focusing on bridging the gap between microscopic factors such as burstiness in sub-RTT timescales, and observable macroscopic properties ...
Ao Tang, Lachlan L. H. Andrew, Krister Jacobsson, ...
LCN
2002
IEEE
15 years 2 months ago
On Modeling the Packet Error Statistics in Bursty Channels
Wireless channels usually face bursty errors, i.e., errors are prone to occur in clusters. These bit errors can be modeled using the Gilbert-Elliott model. When data packets are t...
Changli Jiao, Loren Schwiebert, Bin Xu