Recursive algorithm for selecting optimum routing tables to solve offline routing and spectrum assignment problem
The Routing and Spectrum Assignment (RSA) problem is NP-Hard so searching the entire problem space is not applicable. Many decomposition algorithms rely on reducing the search space in the routing space and applying heuristics algorithm in the spectrum assignment sub-problem. This is not necessarily...
| الحاوية / القاعدة: | Ain Shams Engineering Journal |
|---|---|
| المؤلفون الرئيسيون: | , , , , , |
| التنسيق: | مقال |
| اللغة: | الإنجليزية |
| منشور في: |
Elsevier
2020-06-01
|
| الموضوعات: | |
| الوصول للمادة أونلاين: | http://www.sciencedirect.com/science/article/pii/S2090447919301443 |