Reducing spare capacity through traffic splitting

Andrew Zalesky, Hai Le Vu, Moshe Zukerman

Research output: Contribution to journalArticleResearchpeer-review

3 Citations (Scopus)


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.

Original languageEnglish
Pages (from-to)594-596
Number of pages3
JournalIEEE Communications Letters
Issue number9
Publication statusPublished - 1 Sep 2004
Externally publishedYes

Cite this