Reducing spare capacity through traffic splitting

Andrew Zalesky; Hai Le Vu; Moshe Zukerman

doi:10.1109/LCOMM.2004.833800

Reducing spare capacity through traffic splitting

Andrew Zalesky, Hai Le Vu, Moshe Zukerman

Research output: Journal Publications and Reviews › RGC 21 - Publication in refereed journal › peer-review

3 Citations (Scopus)

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.

Original language	English
Pages (from-to)	594-596
Journal	IEEE Communications Letters
Volume	8
Issue number	9
DOIs	https://doi.org/10.1109/LCOMM.2004.833800
Publication status	Published - Sept 2004
Externally published	Yes

Access Output

10.1109/LCOMM.2004.833800

Other Access Options

Check CityUHK Library

Permanent Link

Right click to copy link

Cite this

@article{735623073e3848d398a06450714216dd,

title = "Reducing spare capacity through traffic splitting",

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. {\textcopyright} 2004 IEEE.",

author = "Andrew Zalesky and Vu, {Hai Le} and Moshe Zukerman",

year = "2004",

month = sep,

doi = "10.1109/LCOMM.2004.833800",

language = "English",

volume = "8",

pages = "594--596",

journal = "IEEE Communications Letters",

issn = "1089-7798",

publisher = "IEEE",

number = "9",

}

TY - JOUR

T1 - Reducing spare capacity through traffic splitting

AU - Zalesky, Andrew

AU - Vu, Hai Le

AU - Zukerman, Moshe

PY - 2004/9

Y1 - 2004/9

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=4744376553&partnerID=8YFLogxK

UR - https://www.scopus.com/record/pubmetrics.uri?eid=2-s2.0-4744376553&origin=recordpage

U2 - 10.1109/LCOMM.2004.833800

DO - 10.1109/LCOMM.2004.833800

M3 - RGC 21 - Publication in refereed journal

SN - 1089-7798

VL - 8

SP - 594

EP - 596

JO - IEEE Communications Letters

JF - IEEE Communications Letters

IS - 9

ER -

Reducing spare capacity through traffic splitting

Abstract

Access Output

Other Access Options

Permanent Link

Other Files and Links

Fingerprint

Cite this