Name
Abstract | ||
|---|---|---|
Distance adaptive spectrum allocation exploits the tradeoff between spectrum width and reach to improve resource utilisation by tailoring the modulation format to the level of impairments along the path. The authors first show that the distance-adaptive routing and spectrum assignment (DA-RSA) problem is a special case of a multiprocessor scheduling problem. The authors then develop a suite of eff... |
Year | DOI | Venue |
|---|---|---|
2016 | 10.1049/iet-net.2015.0085 | IET Networks |
Keywords | Field | DocType |
optical fibre networks,channel allocation,telecommunication network routing,telecommunication scheduling,telecommunication network topology,processor scheduling | Algorithm design,Multiprocessor scheduling,Suite,Computer science,Destination-Sequenced Distance Vector routing,Exploit,Frequency allocation,Ring network,Special case,Distributed computing | Journal |
Volume | Issue | ISSN |
5 | 3 | 2047-4954 |
Citations | PageRank | References |
0 | 0.34 | 10 |
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 |