DocumentCode
2809598
Title
An Analysis of Three-Level IP Network Topologies
Author
Chamberland, Steven
Author_Institution
Ecole Polytech. de Montreal, Montreal
fYear
2007
fDate
22-26 April 2007
Firstpage
336
Lastpage
340
Abstract
In this paper, we propose an analysis of three-level network topologies, in the context of the topological optimization problem of Internet protocol (IP) networks. This problem consists in selecting the number of routers and their types to install at each level, selecting the port types to install in each router and finding the access, edge and core networks. Considering that IP networks are still expensive, network optimization is an important issue for the service providers to remain competitive. A mathematical programming model is proposed for this problem. Next, the model is adapted and analyzed for each topology considered. An illustrative example is solved using a commercial implementation of the branch-and-bound algorithm.
Keywords
IP networks; mathematical programming; telecommunication network routing; telecommunication network topology; tree searching; Internet protocol networks; access networks; branch-and-bound algorithm; core networks; edge networks; mathematical programming; routers; three-level IP network topologies; Access protocols; Bit rate; Cables; Central office; Costs; Helium; IP networks; Joining processes; Mathematical model; Network topology;
fLanguage
English
Publisher
ieee
Conference_Titel
Electrical and Computer Engineering, 2007. CCECE 2007. Canadian Conference on
Conference_Location
Vancouver, BC
ISSN
0840-7789
Print_ISBN
1-4244-1020-7
Electronic_ISBN
0840-7789
Type
conf
DOI
10.1109/CCECE.2007.90
Filename
4232749
Link To Document