An efficient algorithm for designing reliable IP networks with an access/edge/core hierarchical structure

Author

Chamberland, S.

Author_Institution

Dept. of Comput. & Software Eng., Ecole Polytech. de Montreal, Montreal, QC

fYear

2008

fDate

Sept. 28 2008-Oct. 2 2008

Firstpage

1

Lastpage

20

Abstract

The article consists of a PowerPoint presentation on an efficient algorithm for designing reliable IP networks with an access/edge/core hierarchical structure. This problem consists of selecting the location of the routers and their types to install at each hierarchical level, selecting the port types to install in each router, finding the access, edge and core networks, selecting the link types, routing the traffic within the network. A tabu search algorithm to find "good" feasible solutions is presented. Finally, numerical results are presented and analyzed.

Keywords

IP networks; computer network reliability; search problems; subscriber loops; telecommunication network routing; telecommunication traffic; access network; access-edge-core hierarchical structure; link type selection; network traffic routing; port type selection; reliable IP network design; router selection; tabu search algorithm; Algorithm design and analysis; Cables; Computer network reliability; Computer networks; Costs; IP networks; Software algorithms; Switches; Telecommunication traffic;

fLanguage

English

Publisher

ieee

Conference_Titel

Telecommunications Network Strategy and Planning Symposium, 2008. Networks 2008. The 13th International

Conference_Location

Budapest

Print_ISBN

978-963-8111-68-5

Type

conf

DOI

10.1109/NETWKS.2008.4763723

Filename

4763723