Reducing spare capacity through traffic splitting
Article Ecrit par: Zalesky, Andrew ; Zukerman, Moshe ; Hai, Le Vu ;
Résumé: 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.
Langue:
Anglais