Reducing spare capacity through traffic splitting
Research output: Journal Publications and Reviews › RGC 21 - Publication in refereed journal › peer-review
Author(s)
Detail(s)
| Original language | English |
|---|---|
| Pages (from-to) | 594-596 |
| Journal / Publication | IEEE Communications Letters |
| Volume | 8 |
| Issue number | 9 |
| Publication status | Published - Sept 2004 |
| Externally published | Yes |
Link(s)
Abstract
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. © 2004 IEEE.
Citation Format(s)
Reducing spare capacity through traffic splitting. / Zalesky, Andrew; Vu, Hai Le; Zukerman, Moshe.
In: IEEE Communications Letters, Vol. 8, No. 9, 09.2004, p. 594-596.
In: IEEE Communications Letters, Vol. 8, No. 9, 09.2004, p. 594-596.
Research output: Journal Publications and Reviews › RGC 21 - Publication in refereed journal › peer-review
