Sciweavers

995 search results - page 6 / 199
» Minimizing Congestion in General Networks
Sort
View

Publication
304views
15 years 6 months ago
A Binary Feedback Scheme for Congestion Avoidance in Computer Networks with Connectionless Network Layer
We propose a scheme for congestion avoidance in networks using a connectionless protocol at the network layer. The scheme uses a minimal amount of feedback from the network to the ...
K. Ramakrishnan and R. Jain
FOCS
1997
IEEE
13 years 12 months ago
General Dynamic Routing with Per-Packet Delay Guarantees of O(distance + 1 / session rate)
A central issue in the design of modern communication networks is that of providing performance guarantees. This issue is particularly important if the networks support real-time t...
Matthew Andrews, Antonio Fernández, Mor Har...
ICNP
2000
IEEE
14 years 3 days ago
General AIMD Congestion Control
Instead of the increase-by-onedecrease-to-halfstrategy used in TCP Reno for congestion window adjustment, we consider the general case such that the increase value and decrease ra...
Yang Richard Yang, Simon S. Lam
CN
2007
123views more  CN 2007»
13 years 7 months ago
Generalized multicast congestion control
Efficient multicast congestion control (MCC) is one of the critical components required to enable the IP multicast deployment over the Internet. Previously proposed MCC schemes ca...
Jiang Li, Murat Yuksel, Xingzhe Fan, Shivkumar Kal...
WICON
2008
13 years 9 months ago
Quality of routing congestion games in wireless sensor networks
We consider congestion games in wireless sensor networks that offer quantitatively distinct classes of routing paths. Each routing class is characterized by a service cost. Within...
Costas Busch, Rajgopal Kannan, Athanasios V. Vasil...