TY - GEN
T1 - Spectrum expansion/contraction problem for multipath routing with time-varying traffic on elastic optical networks
AU - Din, Der Rong
AU - Wu, Yi Fen
AU - Guo, Bo Jun
AU - Chen, Ching
AU - Wu, Pei Jung
PY - 2017/3/22
Y1 - 2017/3/22
N2 - The spectrum allocated to an end-to-end connection between source and destination nodes varies dynamically with time (denoted as time-varying traffic). For serving time varying traffic in an Elastic optical network (EON), the spectrum allocated for the connection can be expanded or contracted to meet the traffic requirement. Moreover, multipath routing algorithms can more flexibly utilize spectrum resources than single-path routing algorithms in dynamic scenario, since it splits a traffic request into multiple small-size connections and individually transmitting them through several optical paths. In this paper, the spectrum expansion /contraction problem (SECP) for multipath routing on EONs is studied with time-varying traffic. The expansion and contraction algorithms are proposed to solve this problem and these algorithms are examined through simulations. Simulations show that the proposed algorithms can achieve good results.
AB - The spectrum allocated to an end-to-end connection between source and destination nodes varies dynamically with time (denoted as time-varying traffic). For serving time varying traffic in an Elastic optical network (EON), the spectrum allocated for the connection can be expanded or contracted to meet the traffic requirement. Moreover, multipath routing algorithms can more flexibly utilize spectrum resources than single-path routing algorithms in dynamic scenario, since it splits a traffic request into multiple small-size connections and individually transmitting them through several optical paths. In this paper, the spectrum expansion /contraction problem (SECP) for multipath routing on EONs is studied with time-varying traffic. The expansion and contraction algorithms are proposed to solve this problem and these algorithms are examined through simulations. Simulations show that the proposed algorithms can achieve good results.
UR - http://www.scopus.com/inward/record.url?scp=85044622964&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=85044622964&partnerID=8YFLogxK
U2 - 10.1145/3018896.3018946
DO - 10.1145/3018896.3018946
M3 - Conference contribution
AN - SCOPUS:85044622964
T3 - ACM International Conference Proceeding Series
BT - Proceedings of the 2nd International Conference on Internet of Things and Cloud Computing, ICC 2017
A2 - Hamdan, Hani
A2 - Boubiche, Djallel Eddine
A2 - Hidoussi, Faouzi
PB - Association for Computing Machinery
T2 - 2nd International Conference on Internet of Things and Cloud Computing, ICC 2017
Y2 - 22 March 2017 through 23 March 2017
ER -