Inverse shortest path algorithms in protected UMTS access networks

Authors:
István Gódor;János Harmatos;Alpár Jüttner
Affiliations:
Ericsson Research, Traffic Analysis and Network Performance Laboratory, P.O. Box 107, H-1300 Budapest, Hungary;Ericsson Research, Traffic Analysis and Network Performance Laboratory, P.O. Box 107, H-1300 Budapest, Hungary;Ericsson Research, Traffic Analysis and Network Performance Laboratory, P.O. Box 107, H-1300 Budapest, Hungary
Venue:
Computer Communications
Year:
2005

Citing 4
Cited 0

Cooling schedules for optimal annealing

Mathematics of Operations Research
Wideband CDMA For Third Generation Mobile Communications: Universal Personal Communications

Wideband CDMA For Third Generation Mobile Communications: Universal Personal Communications
Narrowband and broadband infrastructure design for wireless networks

IEEE Communications Magazine
Planning reliable UMTS terrestrial access networks

IEEE Communications Magazine

Quantified Score

Hi-index	0.24

Visualization

Abstract

In this paper, the application questions of Open Shortest Path First (OSPF) routing protocols in the all-IP based protected Universal Mobile Telecommunications System (UMTS) access networks is investigated. The basic problem here is how the OSPF administrative weights should be adjusted in an adequate way, resulting near-optimal overall network performance both in nominal network operation and in case of single link failures. Currently, there are known algorithms which are able to solve the topology planning and dimensioning related problems of UMTS access networks, but they do not consider the special properties of the OSPF protocol. We formulate the problem as an Integer Linear Programming (ILP) task. Furthermore, we propose an advanced heuristic algorithm and compare its results with the ILP solution and other existing algorithms.