Point of presence design in Internet protocol networks with performance guarantees

Authors:
Steven Chamberland
Affiliations:
CRT and Computer Engineering Department, ícole Polytechnique de Montréal, C.P. 6079, Succ. Centre-Ville, Montréal, Qué., Canada H3C 3A7
Venue:
Computers and Operations Research - Articles presented at the conference on routing and location (CORAL)
Year:
2005

Citing 7
Cited 0

A shortest augmenting path algorithm for dense and sparse linear assignment problems

Computing
Integer and combinatorial optimization

Integer and combinatorial optimization
OSPF: Anatomy of an Internet Routing Protocol

OSPF: Anatomy of an Internet Routing Protocol
Tabu Search

Tabu Search
Data Network Design: Management and Technical Perspectives

Data Network Design: Management and Technical Perspectives
Is-Is: Deployment in IP Networks

Is-Is: Deployment in IP Networks
Topological Design of Two-Level Telecommunication Networks with Modular Switches

Operations Research

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper, we propose a model for the point of presence (POP) design problem in Internet protocol (IP) networks with performance guarantees, where a POP is a node composed of several interconnected co-located backbone routers within a central office. This problem consists of selecting the number of routers and their types, selecting the interface card types, connecting the access and the backbone links to the ports and selecting the link types between the co-located routers. Furthermore, the model considers the routing of the IP traffic. The performance guarantees we refer to are bandwidth guarantees between the routers for the normal state of the POP and also for all failure scenarios of interest to the network planner. A tabu search heuristic to find solutions for real-size instances of the problem is proposed. Finally, we present a systematic set of experiments designed to assess the performance of the proposed heuristic.