On routing and spectrum allocation in spectrum-sliced optical networks

Proceedings - IEEE INFOCOM

Volumn , Issue , 2013, Pages 385-389

  Shirazipourazad, Shahrzad ^a   Zhou, Chenyang ^a   Derakhshandeh, Zahra ^a   Sen, Arunabha ^a  

^a ARIZONA STATE UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ARBITRARY TOPOLOGY; EXTENSIVE SIMULATIONS; NETWORK TOPOLOGY; OFDM- TECHNOLOGIES; OPTICAL TRANSPORT NETWORKS; RESOURCE UTILIZATIONS; ROUTING AND SPECTRUM ALLOCATIONS; SPECTRUM EFFICIENT;

APPROXIMATION ALGORITHMS; COMPUTER SIMULATION; ELECTRIC NETWORK TOPOLOGY; ORTHOGONAL FREQUENCY DIVISION MULTIPLEXING; RESOURCE ALLOCATION; SIGNAL SYSTEMS;

NETWORK ARCHITECTURE;

EID: 84883076213     PISSN: 0743166X     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/INFCOM.2013.6566800     Document Type: Conference Paper

References (15)

1. W. Shieh, Ofdm for flexible high-speed optical networks, Journal of Lightwave Technology, vol. 29, no. 10, pp. 1560-1577, 2011.
2. M. Jinno, H. Takara, B. Kozicki, Y. Tsukishima, Y. Sone, and S. Matsuoka, Spectrum-efficient and scalable elastic optical path network: architecture, benefits, and enabling technologies, IEEE Communications Magazine, vol. 47, no. 11, pp. 66-73, 2009.
3. Y. Wang, X. Cao, and Y. Pan, A study of the routing and spectrum allocation in spectrum-sliced elastic optical path networks, in INFOCOM, 2011, pp. 1503-1511.
4. A. N. Patel, P. N. Ji, J. P. Jue, and T. Wang, Routing, wavelength assignment, and spectrum allocation in transparent flexible optical wdm (fwdm) networks, in Photonics in Switching, 2010.
5. M. Jinno, B. Kozicki, H. Takara, A. Watanabe, Y. Sone, T. Tanaka, and A. Hirano, Distance-adaptive spectrum resource allocation in spectrumsliced elastic optical path network
6. [topics in optical communications], IEEE Communications Magazine, vol. 48, no. 8, pp. 138-145, 2010.
7. K. Christodoulopoulos, I. Tomkos, and E. A. Varvarigos, Routing and spectrum allocation in ofdm-based optical networks with elastic bandwidth allocation, in GLOBECOM, 2010, pp. 1-6.
8. M. Klinkowski and K. Walkowiak, Routing and spectrum assignment inspectrum sliced elastic optical path network, IEEE Communications Letters, vol. 15, no. 8, pp. 884-886, 2011.
9. H. A. Kierstead, A polynomial time approximation algorithm for dynamic storage allocation, Discrete Mathematics, vol. 87, no. 2-3, pp. 231-237, 1991.
10. S. Shirazipourazad, C. Zhou, Z. Derakhshandeh, and A. Sen. On routing and spectrum allocation in spectrum-sliced optical networks.[Online]. Available: http://www.public.asu.edu/ sshiraz1/RSA.pdf
11. A. L. Buchsbaum, H. Karloff, C. Kenyon, N. Reingold, and M. Thorup, Opt versus load in dynamic storage allocation, SIAM Journal on Computing, vol. 33, no. 3, pp. 632-646, 2004.
12. M. C. Golumbic, M. Lipshteyn, and M. Stern, Representing edge intersection graphs of paths on degree 4 trees, Discrete Mathematics, vol. 308, no. 8, pp. 1381-1387, 2008.
13. S. V. Pemmaraju, S. Penumatcha, and R. Raman, Approximating interval coloring and max-coloring in chordal graphs, Journal of Experimental Algorithmics, vol. 10, 2005.
14. T. Erlebach and K. Jansen, The complexity of path coloring and call scheduling, Theoretical Computer Science, vol. 255, no. 1-2, pp. 33-50, 2001.
15. Level 3 Communications, Network Map.[Online]. Available: http://nsssc.superb.net/img/l3-usmap.gif