Sciweavers

11348 search results - page 64 / 2270
» On time-scale designs for networks
Sort
View
NETWORKING
2007
15 years 1 months ago
Beyond Proportional Fair: Designing Robust Wireless Schedulers
Abstract. Proportional Fair (PF), a frequently used scheduling algorithm in 3G wireless networks, can unnecessarily starve “well-behaved” users in practice. One of the main cau...
Soshant Bali, Sridhar Machiraju, Hui Zang
ICALP
2009
Springer
15 years 3 months ago
Efficient Methods for Selfish Network Design
Intuitively, Braess's paradox states that destroying a part of a network may improve the common latency of selfish flows at Nash equilibrium. Such a paradox is a pervasive phe...
Dimitris Fotakis, Alexis C. Kaporis, Paul G. Spira...
GLOBECOM
2007
IEEE
15 years 6 months ago
On the Long-Range Dependent Behaviour of Unidirectional Packet Delay of Wireless Traffic
— In contrast to aggregate inter-packet metrics that quantify the arrival processes of aggregate traffic at a single point in the network, intraflow end-to-end per-packet perform...
Dimitrios P. Pezaros, Manolis Sifalakis, David Hut...
TRIDENTCOM
2005
IEEE
15 years 5 months ago
Divide and Conquer: PC-Based Packet Trace Replay at OC-48 Speeds
Today’s Internet backbone networking devices need to be tested under realistic traffic conditions at transmission rates of OC-48 and above. While commercially available synthet...
Tao Ye, Darryl Veitch, Gianluca Iannaccone, Suprat...
SIGMETRICS
2000
ACM
145views Hardware» more  SIGMETRICS 2000»
14 years 11 months ago
The incremental deployability of RTT-based congestion avoidance for high speed TCP Internet connections
Our research focuses on end-to-end congestion avoidance algorithms that use round trip time (RTT) fluctuations as an indicator of the level of network congestion. The algorithms a...
Jim Martin, Arne A. Nilsson, Injong Rhee