On the POP Optimization Problem in IP Networks

S. Chamberland, M. St-Hilaire, and S. Pierre (Canada)


Internet protocol (IP) networks, point of presence (POP)optimization, mathematical model, branch-and-bound algorithm.


In this paper, we propose a model for the point of pres ence (POP) optimization problem in Internet protocol (IP) networks, where a POP is a node composed of several in terconnected co-located backbone routers. 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. Finally, we present a de tailed example solved by using a branch-and-bound algo rithm and results for a set of randomly generated problems.

Important Links:

Go Back