By splitting traffic across an optimal number of disjoint paths, it is shown a capacity saving of up to 11% is possible in randomly generated networks relative to the most capacity efficient mesh-based restoration scheme available to date. An algorithm yielding the optimal number of disjoint paths is developed.
|Number of pages||3|
|Journal||IEEE Communications Letters|
|Publication status||Published - 1 Sep 2004|