Finding Geographically Separated Paths Through Fiber Networks

Publication date

DOI

Document Type

Master Thesis

Collections

Open Access logo

License

CC-BY-NC-ND

Abstract

The KPN fiber network is a network of fiber cables in The Netherlands. Since only a part of the capacities of the cables are used for KPN's own services, the unused fibers can be interconnected to create and sell fiber connections to clients. Clients often request two connections such that if a connection fails, there is still one working connection left. To reduce the probability of both connections failing simultaneously, these connections need to be geographically separated as much as possible. Currently, finding these routes is a manual task. This thesis introduces and compares various ways to automate this process.

Keywords

flow problem, graph theory, pathfinding, MILP, simulated annealing

Citation