Abstract

A novel design optimization for reliable networking is investigated in Ethernet ring mesh networks with the ITU-T G.8032 Ethernet Ring Protection Recommendation. Designing an Ethernet ring mesh consisting of multiple rings to achieve the maximum network availability is an NP-complete problem. We show that a graph with vertex connectivity equal to or greater than two is a sufficient condition for designing an Ethernet ring mesh. A novel design rule with an efficient heuristic algorithm is proposed to find a design close to an optimal Ethernet ring mesh in terms of maximum network availability. Compared with an optimal network design algorithm with an exponential enumeration search cost, the heuristic algorithm achieves network availability nearly as high as that of an optimal design at a polynomial cost.

© 2012 IEEE

PDF Article

References

You do not have subscription access to this journal. Citation lists with outbound citation links are available to subscribers only. You may subscribe either as an OSA member, or as an authorized user of your institution.

Contact your librarian or system administrator
or
Login to access OSA Member Subscription

Cited By

You do not have subscription access to this journal. Cited by links are available to subscribers only. You may subscribe either as an OSA member, or as an authorized user of your institution.

Contact your librarian or system administrator
or
Login to access OSA Member Subscription