Sciweavers

37 search results - page 7 / 8
» Practical scheduling schemes with throughput guarantees for ...
Sort
View
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
RTSS
1998
IEEE
13 years 11 months ago
Deadline-Modification-SCAN with Maximum-Scannable-Groups for Multimedia Real-Time Disk Scheduling
suitable disk layout and network transmission schedule to minimize allocated resources (buffer size, bandwidth, ..., etc.) with maximum resource utilization. In this paper, the rea...
Ray-I Chang, Wei Kuan Shih, Ruei-Chuan Chang
AHSWN
2010
130views more  AHSWN 2010»
13 years 7 months ago
How Good is Opportunistic Routing? - A Reality Check under Rayleigh Fading Channels
Considerations of realistic channel dynamics motivate the design of a new breed of opportunistic schemes, such as opportunistic transmission, scheduling and routing. Compared to t...
Rong Zheng, Chengzhi Li
PODC
2010
ACM
13 years 11 months ago
Brief announcement: towards robust medium access in multi-hop networks
This paper introduces the distributed MAC protocol Jade. We consider a multi-hop wireless network with a single communication channel in which a powerful adversary is able to jam ...
Andréa W. Richa, Jin Zhang, Christian Schei...
GLOBECOM
2010
IEEE
13 years 4 months ago
Spectrum Aware Opportunistic Routing in Cognitive Radio Networks
Cognitive radio (CR) emerges as a key technology to enhance spectrum efficiency and thus creates opportunistic transmissions over links. Supporting the routing function on top of n...
Shih-Chun Lin, Kwang-Cheng Chen