Sciweavers

448 search results - page 41 / 90
» Modeling the Burstiness of TCP
Sort
View
IDEAS
2006
IEEE
218views Database» more  IDEAS 2006»
15 years 7 months ago
PBIRCH: A Scalable Parallel Clustering algorithm for Incremental Data
We present a parallel version of BIRCH with the objective of enhancing the scalability without compromising on the quality of clustering. The incoming data is distributed in a cyc...
Ashwani Garg, Ashish Mangla, Neelima Gupta, Vasudh...
INFOCOM
1995
IEEE
15 years 5 months ago
A Fast Bypass Algorithm for High-Speed Networks
In this work we suggest an algorithm that increases the reservation success probability for bursty tra c in high speed networks by adding exibility to the construction of the rout...
Israel Cidon, Raphael Rom, Yuval Shavitt
INFOCOM
2007
IEEE
15 years 8 months ago
When TCP Friendliness Becomes Harmful
Abstract— Short TCP flows may suffer significant responsetime performance degradations during network congestion. Unfortunately, this creates an incentive for misbehavior by cl...
Amit Mondal, Aleksandar Kuzmanovic
WADS
2007
Springer
89views Algorithms» more  WADS 2007»
15 years 7 months ago
Dynamic TCP Acknowledgment with Sliding Window
The dynamic TCP acknowledgement problem formulated by Dooly et al. has been intensively studied in the area of competitive analysis. However, their framework does not consider the ...
Hisashi Koga
HSNMC
2003
Springer
120views Multimedia» more  HSNMC 2003»
15 years 6 months ago
Comparing Performance of SRAMT-LE Vs. Other Layered Encoding Schemes Regarding TCP Friendliness
In this paper we describe a hybrid sender and receiver-based adaptation scheme for multicast transmission of multimedia data using layered encoding, which we call SRAMT-LE (Sender-...
Christos Bouras, Apostolos Gkamas