Abstract
Previous work developed the concept of 'pre-cross-connected trails' (PXTs), which are fully pre-connected linear structures of spare capacity used to protect one or more paths end-to-end. To date, the only approach for designing PXT-based restorable networks is a heuristic algorithm suited for the dynamic protection of demands as they arrive in a network. The heuristic can also be used as a 'green fields' planning algorithm for a known set of demands by running through the set and protecting them in order. In both cases, however, recent work has shown that the resulting PXT structures can be looping, as well as long and complex. While the capacity efficiency of the designs was high, the practicality of using such convoluted structures in any real network is doubtful. In this work we propose a semi-heuristic approach based on integer linear programming methods that allows important properties of the PXTs (such as length and degree of looping) to be tightly controlled. We also show how this method may be adapted to the dynamic protection of incrementally arriving random demands. Results show that even when PXTs are restricted to be totally non-looping and of much lower maximum length, we still attain capacity efficiencies near those of the original PXT design heuristic. A notable extra finding is that, in an efficient PXT network design in general, many PXTs are equivalent to standalone 1+1 APS arrangements for certain demand flows.
© 2007 Optical Society of America
PDF Article
More Like This
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 Optica member, or as an authorized user of your institution.
Contact your librarian or system administrator
or
Login to access Optica Member Subscription
Add to BibSonomy