Paper Info
Title
Robust and optimal opportunistic scheduling for downlink 2-flow inter-session network coding with varying channel quality
Abstract
This paper considers the downlink traffic from a base station to two different clients. Assuming infinite backlog, it is known that inter-session network coding (INC) can significantly increase the throughput of each flow. However, the corresponding scheduling solution (assuming dynamic arrivals and requiring bounded delay) is still nascent. For the 2-flow downlink scenario, we propose the first opportunistic INC + scheduling solution that is provably optimal for time-varying channels, i.e., the corresponding stability region matches the optimal linear-INC capacity. To that end, we first introduce a new binary INC operation, which is distinctly different from the traditional wisdom of XORing two overheard packets. We then develop a queue-length-based scheduling scheme, which, with the help of the new INC operation, can robustly and optimally adapt to time-varying channel quality. A byproduct of our results is a scheduling scheme for stochastic processing networks (SPNs) with random departure. The new SPN results relax the previous assumption of deterministic departure, a major limitation of the existing SPN model, by considering stochastic packet departure behavior, and could further broaden the applications of SPN scheduling to other real-world scenarios.
Year
DOI
Venue
2014
10.1109/INFOCOM.2014.6847991
INFOCOM
Keywords
Field
DocType
time-varying channel quality,bounded delay,scheduling,dynamic arrivals,spn scheduling application,infinite backlog,optimal opportunistic scheduling,robust opportunistic scheduling,time-varying channels,queue length based scheduling scheme,stability region,downlink traffic,inc,stochastic processing networks,telecommunication traffic,downlink 2-flow intersession network coding,network coding
Linear network coding,Fixed-priority pre-emptive scheduling,Fair-share scheduling,Computer science,Scheduling (computing),Computer network,Rate-monotonic scheduling,Earliest deadline first scheduling,Dynamic priority scheduling,Round-robin scheduling,Distributed computing
Conference
ISSN
Citations 
PageRank 
0743-166X
9
0.48
References 
Authors
10
2
Name
Order
Citations
PageRank
Wei-cheng Kuo1141.90
Chih-Chun Wang279555.20