Sciweavers

4000 search results - page 744 / 800
» Simulation down under
Sort
View
120
Voted
ICNP
2000
IEEE
15 years 7 months 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
125
Voted
INFOCOM
2000
IEEE
15 years 7 months ago
Rainbow Fair Queueing: Fair Bandwidth Sharing Without Per-Flow State
Abstract—Fair bandwidth sharing at routers has several advantages, including protection of well-behaved flows and possible simplification of endto-end congestion control mechan...
Zhiruo Cao, Zheng Wang, Ellen W. Zegura
150
Voted
INFOCOM
2000
IEEE
15 years 7 months ago
Freeze-TCP: A True End-to-End TCP Enhancement Mechanism for Mobile Environments
Abstract— Optimizing TCP (Transport Layer) for mobility has been researched extensively. We present a brief summary of existing results which indicates that most schemes require ...
Tom Goff, James Moronski, Dhananjay S. Phatak, Vip...
SIGCOMM
1999
ACM
15 years 6 months ago
A Simple Approximation to Minimum-Delay Routing
The conventional approach to routing in computer networks consists of using a heuristic to compute a single shortest path from a source to a destination. Single-path routing is ve...
Srinivas Vutukury, J. J. Garcia-Luna-Aceves
138
Voted
ICDCS
1999
IEEE
15 years 6 months ago
Search Space Reduction in QoS Routing
To provide real-time service or engineer constrained-based paths, networks require the underlying routing algorithm to be able to find low-cost paths that satisfy given Quality-of...
Liang Guo, Ibrahim Matta