Sciweavers

25 search results - page 4 / 5
» Combinatorics of TCP reordering
Sort
View
COCOON
2010
Springer
14 years 9 days ago
Tracking a Generator by Persistence
The persistent homology provides a mathematical tool to describe “features” in a principled manner. The persistence algorithm proposed by Edelsbrunner et al. [9] can compute n...
Oleksiy Busaryev, Tamal K. Dey, Yusu Wang
INFOCOM
2010
IEEE
13 years 6 months ago
Enhancing Wireless TCP: A Serialized-Timer Approach
— In wireless networks, TCP performs unsatisfactorily since packet reordering and random losses may be falsely interpreted as congestive losses. This causes TCP to trigger fast r...
Chengdi Lai, Ka-Cheong Leung, Victor O. K. Li
BROADNETS
2006
IEEE
14 years 1 months ago
Accuracy and Dynamics of Hash-Based Load Balancing Algorithms for Multipath Internet Routing
— This paper studies load balancing for multipath Internet routing. We focus on hash-based load balancing algorithms that work on the flow level to avoid packet reordering which...
Rüdiger Martin, Michael Menth, Michael Hemmke...
CCR
2004
84views more  CCR 2004»
13 years 7 months ago
On making SCTP robust to spurious retransmissions
Network anomalies such as packet reordering and delay spikes can result in spurious retransmissions and degrade performance of reliable transport protocols such as TCP and SCTP. P...
Sourabh Ladha, Stephan Baucke, Reiner Ludwig, Paul...
DSN
2008
IEEE
14 years 1 months ago
TCP covert timing channels: Design and detection
Exploiting packets’ timing information for covert communication in the Internet has been explored by several network timing channels and watermarking schemes. Several of them em...
Xiapu Luo, Edmond W. W. Chan, Rocky K. C. Chang