Sciweavers

147 search results - page 13 / 30
» General AIMD Congestion Control
Sort
View

Publication
211views
16 years 9 months ago
Congestion Avoidance in Computer Networks with A Connecitonless Network Layer: Part IV: A Selective Binary Feedback Scheme for G
With increasingly widespread use of computer networks, and the use of varied technology for the interconnection of computers, congestion is a significant problem. In this report, w...
K. Ramakrishnan and R. Jain,
SENSYS
2003
ACM
15 years 5 months ago
CODA: congestion detection and avoidance in sensor networks
Event-driven sensor networks operate under an idle or light load and then suddenly become active in response to a detected or monitored event. The transport of event impulses is l...
Chieh-Yih Wan, Shane B. Eisenman, Andrew T. Campbe...
CCR
2010
179views more  CCR 2010»
14 years 11 months ago
An argument for increasing TCP's initial congestion window
TCP flows start with an initial congestion window of at most four segments or approximately 4KB of data. Because most Web transactions are short-lived, the initial congestion wind...
Nandita Dukkipati, Tiziana Refice, Yuchung Cheng, ...
SIGMETRICS
2010
ACM
208views Hardware» more  SIGMETRICS 2010»
15 years 4 months ago
Dynamics in congestion games
Game theoretic modeling and equilibrium analysis of congestion games have provided insights in the performance of Internet congestion control, road transportation networks, etc. D...
Devavrat Shah, Jinwoo Shin
SPAA
2005
ACM
15 years 5 months ago
Oblivious routing on geometric networks
We study oblivious routing in which the packet paths are constructed independently of each other. We give a simple oblivious routing algorithm for geometric networks in which the ...
Costas Busch, Malik Magdon-Ismail, Jing Xi