Academic Journal
Distance‐adaptive routing and spectrum assignment in rings
| العنوان: | Distance‐adaptive routing and spectrum assignment in rings |
|---|---|
| المؤلفون: | Sahar Talebi, Iyad Katib, George N. Rouskas |
| المصدر: | IET Networks, Vol 5, Iss 3, Pp 64-70 (2016) |
| بيانات النشر: | Wiley, 2016. |
| سنة النشر: | 2016 |
| المجموعة: | LCC:Telecommunication |
| مصطلحات موضوعية: | distance adaptive routing, ring topology, distance‐adaptive spectrum allocation, spectrum width, distance‐adaptive routing and spectrum assignment, multiprocessor scheduling problem, Telecommunication, TK5101-6720 |
| الوصف: | 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 efficient and effective DA‐RSA algorithms for ring networks, that build upon list scheduling concepts. This 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. |
| نوع الوثيقة: | article |
| وصف الملف: | electronic resource |
| اللغة: | English |
| تدمد: | 2047-4962 2047-4954 |
| Relation: | https://doaj.org/toc/2047-4954; https://doaj.org/toc/2047-4962 |
| DOI: | 10.1049/iet-net.2015.0085 |
| URL الوصول: | https://doaj.org/article/a3c9f8fe8cf5482490ec02eae09072fe |
| رقم الانضمام: | edsdoj.3c9f8fe8cf5482490ec02eae09072fe |
| قاعدة البيانات: | Directory of Open Access Journals |
Full Text Finder | تدمد: | 20474962 20474954 |
|---|---|
| DOI: | 10.1049/iet-net.2015.0085 |