Abstract

Currently, data center has become one of the most important application resources. Meanwhile, there is huge amount of data streams within a data center or among different data centers, which requires the transmission channel with high bandwidth and good reliability. Optical networks become the essential solution for the data center interconnection. Especially for intra data center networks, there are too many links for a limited number of nodes, which make the network so complex and vulnerable. A K-dimensional protection structure (KDPS) is proposed against multi-link failure in data center optical networks, and 3DPS is mainly introduced and analyzed in the paper. Two greedy algorithms are proposed to construct KDPS in static and dynamic optical networks respectively. Numerical results show that 3DPS can be constructed with more difficulty in dynamic optical networks, and the greedy algorithm can find the 3DPS much easier under three-link failures than under dual-link failures.

Full Text
Paper version not known

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call