Sciweavers

6 search results - page 1 / 2
» Optimal Sliding-Window Strategies in Networks with Long Roun...
Sort
View
INFOCOM
2003
IEEE
13 years 10 months ago
Optimal Sliding-Window Strategies in Networks with Long Round-Trip Delays
— A method commonly used for packet flow control over connections with long round-trip delays is “sliding windows”. In general, for a given loss rate, a larger window size a...
Lavy Libman, Ariel Orda
QSHINE
2005
IEEE
13 years 10 months ago
Retransmission Strategies for Wireless Connections with Resource-Limited Devices
Protocols designed to provide error-free communications over lossy links, at both data link and transport layers, commonly employ the idea of sliding windows, which is based on th...
Lavy Libman
CORR
2010
Springer
123views Education» more  CORR 2010»
13 years 3 months ago
A Stackelberg Strategy for Routing Flow over Time
Routing games are used to to understand the impact of individual users’ decisions on network efficiency. Most prior work on routing games uses a simplified model of network fl...
Umang Bhaskar, Lisa Fleischer, Elliot Anshelevich
TON
2002
75views more  TON 2002»
13 years 4 months ago
Optimal retrial and timeout strategies for accessing network resources
The notion of timeout (namely, the maximal time to wait before retrying an action) turns up in many networking contexts, such as packet transmission, connection establishment, etc....
Lavy Libman, Ariel Orda
INFOCOM
2003
IEEE
13 years 10 months ago
Optimizing Route-Cache Lifetime in Ad Hoc Networks
—On-demand routing reduces the control overhead in mobile ad hoc networks, but it has the major drawback of introducing latency between route-request arrival and the determinatio...
Ben Liang, Zygmunt J. Haas