Wide area telecommunication network design: Application to the Alberta SuperNet
Date
2008Source Title
Journal of the Operational Research Society
Print ISSN
1605682
Volume
59
Issue
11
Pages
1460 - 1470
Language
English
Type
ArticleItem Usage Stats
280
views
views
373
downloads
downloads
Abstract
This article proposes a solution methodology for the design of a wide area telecommunication network. This study is motivated by the Alberta SuperNet project, which provides broadband Internet access to 422 communities across Alberta. There are two components to this problem: the network design itself, consisting of selecting which links will be part of the solution and which nodes should house shelters; and the loading problem which consists of determining which signal transport technology should be installed on the selected edges of the network. Mathematical models are described for these two subproblems. A tabu search algorithm heuristic is developed and tested on randomly generated instances and on Alberta SuperNet data. © 2008 Operational Research Society Ltd. All rights reserved.
Keywords
HeuristicNetwork design
Telecommunications
Heuristic algorithms
Learning algorithms
Network protocols
Sensor networks
Tabu search
Telecommunication
Telecommunication networks
Telecommunication systems
Alberta
Broadband internet access
Heuristic
Loading problem
Network design
Network designs
Solution methodology
Sub-problems
Tabu search algorithm
Telecommunication network design
Telecommunications
Transport technology
Wide-area
Mathematical models
Permalink
http://hdl.handle.net/11693/22982Published Version (Please cite this version)
http://dx.doi.org/10.1057/palgrave.jors.2602479Collections
Related items
Showing items related by title, author, creator and subject.
-
Design of translucent optical networks: Partitioning and restoration
Karasan, E.; Arisoylu, M. (Kluwer, 2004)We discuss the problem of designing translucent optical networks composed of restorable, transparent subnetworks interconnected via transponders. We develop an integer linear programming (ILP) formulation for partitioning ... -
Mesh topology design in overlay virtual private networks
Karasan, E.; Ekin-Karasan, O.; Akar, N.; Pinar, M. C. (IET, 2002)The mesh topology design problem in overlay virtual private networks is studied. Given a set of customer nodes and an associated traffic matrix, tunnels that connect node pairs through a service provider network are ... -
The network design problem with relays
Cabral, E. A.; Erkut, E.; Laporte, G.; Patterson, R. A. (Elsevier, 2007)The network design problem with relays (NDPR) is defined on an undirected graph G = (V, E, K), where V = {1, ..., n} is a vertex set, E = {(i, j) : i, j ∈ V, i < j} is an edge set. The set K = {(o(k), d(k))} is a set ...