Name
Abstract | ||
|---|---|---|
Distance adaptive spectrum allocation exploits the tradeoff between spectrum width and reach to improve resource utilization by tailoring the modulation format to the level of impairments along the path. We first show that the distance-adaptive routing and spectrum assignment (DA-RSA) problem in mesh networks is a special case of a multiprocessor scheduling problem. We then develop a suite of efficient and effective DA-RSA algorithms that build upon list scheduling concepts. Our work explores the tradeoffs involved in DA-RSA algorithm design, and opens up new research directions that may leverage the vast literature in scheduling theory. |
Year | DOI | Venue |
|---|---|---|
2015 | 10.1109/GLOCOM.2015.7417037 | IEEE Global Communications Conference |
Field | DocType | ISSN |
Multiprocessor scheduling,Fair-share scheduling,Computer science,Static routing,Computer network,Real-time computing,Two-level scheduling,Rate-monotonic scheduling,Frequency allocation,Dynamic priority scheduling,Round-robin scheduling,Distributed computing | Conference | 2334-0983 |
Citations | PageRank | References |
0 | 0.34 | 0 |
Authors | ||
3 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Sahar Talebi | 1 | 2 | 1.09 |
| Iyad Katib | 2 | 84 | 13.00 |
| George N. Rouskas | 3 | 990 | 88.88 |