DocumentCode
3336471
Title
Greedy design of resilient multi-layer networks
Author
Duelli, Michael ; Qin, Xiaohua ; Menth, Michael
Author_Institution
Inst. of Comput. Sci., Univ. of Wurzburg, Wurzburg, Germany
fYear
2010
fDate
2-4 June 2010
Firstpage
1
Lastpage
8
Abstract
In this paper, we propose a deterministic greedy heuristic providing a construction layout for a cost-efficient multi-layer network that is able to carry a given set of traffic demands with and without protection on different layers. We apply the heuristic to different reference network topologies and protection requirements. Evaluations are conducted regarding equipment cost on different layers, blocking probability, path lengths, and number of demands affected by specific failures.
Keywords
greedy algorithms; optical fibre networks; probability; telecommunication network topology; telecommunication traffic; blocking probability; deterministic greedy heuristic Design; path lengths; protection requirements; reference network topology; resilient multi-layer networks; traffic; Costs; Ethernet networks; Network topology; Nonhomogeneous media; Optical fiber networks; Protection; Resilience; Spine; Telecommunication traffic; Traffic control;
fLanguage
English
Publisher
ieee
Conference_Titel
Next Generation Internet (NGI), 2010 6th EURO-NF Conference on
Conference_Location
Paris
Print_ISBN
978-1-4244-8167-5
Electronic_ISBN
978-1-4244-8166-8
Type
conf
DOI
10.1109/NGI.2010.5534460
Filename
5534460
Link To Document