Sciweavers

150 search results - page 13 / 30
» Analysis and Simulation of a Fair Queueing Algorithm
Sort
View
COMCOM
2004
110views more  COMCOM 2004»
13 years 8 months ago
On the latency and fairness characteristics of pre-order deficit round Robin
In the emerging high-speed packet-switched networks, fair packet scheduling algorithms in switches and routers will form an important component of the mechanisms that seek to sati...
Salil S. Kanhere, Harish Sethu
INFOCOM
2000
IEEE
14 years 25 days ago
Effort-limited Fair (ELF) Scheduling for Wireless Networks
— While packet scheduling for wired links is a maturing area, scheduling of wireless links is less mature. A fundamental difference between wired and wireless links is that wirel...
David A. Eckhardt, Peter Steenkiste
CN
2008
100views more  CN 2008»
13 years 8 months ago
Stability-throughput tradeoff and routing in multi-hop wireless ad hoc networks
We study the throughput of multi-hop routes and stability of forwarding queues in a wireless ad-hoc network with random access channel. We focus on a wireless network with static ...
Arzad Alam Kherani, Ralph El Khoury, Rachid El Azo...
TMC
2011
158views more  TMC 2011»
13 years 3 months ago
Explicit Congestion Control Algorithms for Time Varying Capacity Media
—Explicit congestion control (XCC) is emerging as one potential solution for overcoming limitations inherent to the current TCP algorithm, characterized by unstable throughput, h...
Filipe Abrantes, João Taveira Araujo, Manue...
CCR
2006
96views more  CCR 2006»
13 years 8 months ago
XCP for shared-access multi-rate media
The eXplicit Control Protocol (XCP) was developed to overcome some of the limitations of TCP, such as low utilization in high bandwidth delay product networks, unstable throughput...
Filipe Abrantes, Manuel Ricardo