Sciweavers

212 search results - page 17 / 43
» Fair and Efficient Packet Scheduling in Wormhole Networks
Sort
View
IAJIT
2010
124views more  IAJIT 2010»
13 years 6 months ago
Uplink Downlink Limited Round Robin Scheduling Algorithms
: Several polling algorithms have been proposed to overcome the slot wastage problem due to the exchange of POLL or NULL packets in the case of no data to transmit. However, most o...
Rawya Rizk
ICCCN
2008
IEEE
14 years 2 months ago
Work-Conserving Fair-Aggregation with Rate-Independent Delay
—Flow aggregation has been proposed as a technique to improve the scalability of QoS scheduling in the core of the Internet, by reducing the amount of per-flow state necessary a...
Jorge Arturo Cobb
JSAC
2006
104views more  JSAC 2006»
13 years 7 months ago
Queue Proportional Scheduling via Geometric Programming in Fading Broadcast Channels
For fading broadcast channels (BC), a throughput optimal scheduling policy called queue proportional scheduling (QPS) is presented via geometric programming (GP). QPS finds a data ...
Kibeom Seong, Ravi Narasimhan, John M. Cioffi
INFOCOM
2003
IEEE
14 years 28 days ago
Core-stateless Guaranteed Throughput Networks
— End-to-end throughput guarantee is an important service semantics that network providers would like to offer to their customers. A network provider can offer such service seman...
Jasleen Kaur, Harrick M. Vin
ICC
2009
IEEE
135views Communications» more  ICC 2009»
13 years 5 months ago
Load Aware Broadcast in Mobile Ad Hoc Networks
In a wireless ad hoc network, the main issue of a good broadcast protocol is to attain maximum reachability with minimal packet forwarding. Existing protocols address this issue by...
Md. Tanvir Al Amin, Sukarna Barua, Sudip Vhaduri, ...