Sciweavers

182 search results - page 10 / 37
» Approximation algorithms for time-constrained scheduling on ...
Sort
View
ICC
2009
IEEE
128views Communications» more  ICC 2009»
14 years 2 months ago
Approximate Flow-Aware Networking
—A new variation of the Flow-Aware Networking (FAN) concept is presented in the paper. The proposed solution is based on the Approximate Fair Dropping algorithm and called by us ...
Jerzy Domzal, Andrzej Jajszczyk
TCOM
2010
167views more  TCOM 2010»
13 years 6 months ago
On distributed scheduling in wireless networks exploiting broadcast and network coding
—In this paper, we consider cross-layer optimization in wireless networks with wireless broadcast advantage, focusing on the problem of distributed scheduling of broadcast links....
Tao Cui, Lijun Chen, Tracey Ho
CCR
2006
122views more  CCR 2006»
13 years 7 months ago
Low complexity, stable scheduling algorithms for networks of input queued switches with no or very low speed-up
The delay and throughput characteristics of a packet switch depend mainly on the queueing scheme and the scheduling algorithm deployed at the switch. Early research on scheduling ...
Claus Bauer
INFOCOM
2009
IEEE
14 years 2 months ago
Minimum-Latency Beaconing Schedule in Multihop Wireless Networks
— Minimum-latency beaconing schedule (MLBS) in synchronous multihop wireless networks seeks a schedule for beaconing with the shortest latency. This problem is NP-hard even when ...
Peng-Jun Wan, Xiao-Hua Xu, Lixin Wang, Xiaohua Jia...
ICC
2008
IEEE
126views Communications» more  ICC 2008»
14 years 2 months ago
Joint Stream Control and Scheduling in Multihop Wireless Networks with MIMO Links
—MIMO links can significantly improve network throughput by supporting multiple concurrent data streams between a pair of nodes and suppressing wireless interference. In this pa...
Brendan Mumey, Jian Tang, Timothy Hahn