Show simple item record

dc.rights.licenseCC-BY-NC-ND
dc.contributor.advisorHoogeveen, J.A.
dc.contributor.advisorBodlaender, H.L.
dc.contributor.authorBoers, M.
dc.date.accessioned2015-12-15T18:01:03Z
dc.date.available2015-12-15T18:01:03Z
dc.date.issued2015
dc.identifier.urihttps://studenttheses.uu.nl/handle/20.500.12932/21466
dc.description.abstractThe 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.
dc.description.sponsorshipUtrecht University
dc.format.extent674168
dc.format.mimetypeapplication/pdf
dc.language.isoen_US
dc.titleFinding Geographically Separated Paths Through Fiber Networks
dc.type.contentMaster Thesis
dc.rights.accessrightsOpen Access
dc.subject.keywordsflow problem, graph theory, pathfinding, MILP, simulated annealing
dc.subject.courseuuComputing Science


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record