Spectrum-sliced elastic optical path (SLICE) networks distribute data on a number of sub-carriers overlapped in frequency domain to provide efficient sub-wavelength and super-wavelength traffic accommodation. In SLICE networks, a routing and spectrum allocation algorithm assigns a spectrum path (SP) to any demand with just enough contiguous sub-carriers while following the spectrum continuity and the sub-carrier consecutiveness constraints. In this paper, we propose efficient sub-carrier allocation algorithms to assign sub-carriers to SPs whose spectrum demands could fluctuate with time. An integer linear programming model is developed to minimize the network reconfiguration and spectrum usage. Based on the historic traffic profile, an interference graph technique is proposed to facilitate the sub-carrier assignment. Simulation results show that the proposed schemes can effectively accommodate the dynamic time-varying traffic while minimizing the network reconfiguration cost in SLICE networks.
Photonic Network Communications – Springer Journals
Published: Mar 24, 2015
It’s your single place to instantly
discover and read the research
that matters to you.
Enjoy affordable access to
over 18 million articles from more than
15,000 peer-reviewed journals.
All for just $49/month
Query the DeepDyve database, plus search all of PubMed and Google Scholar seamlessly
Save any article or search result from DeepDyve, PubMed, and Google Scholar... all in one place.
All the latest content is available, no embargo periods.
“Whoa! It’s like Spotify but for academic articles.”@Phil_Robichaud