Full Text Available

Note: Clicking the button above will open the full text document at the original institutional repository in a new window.

ROLAND : a tool for the realistic optimisation of local access network design

Bibliography: p. 141-147.

Saved in:
Bibliographic Details
Main Author: Buffler, Simon
Other Authors: Kritzinger, Pieter S
Format: Thesis
Language:English
Published: Department of Computer Science 2014
Subjects:
Tags: Add Tag
No Tags, Be the first to tag this record!
_version_ 1867613188167565312
access_status_str Open Access
author Buffler, Simon
author2 Kritzinger, Pieter S
author_browse Buffler, Simon
Kritzinger, Pieter S
author_facet Kritzinger, Pieter S
Buffler, Simon
author_sort Buffler, Simon
collection Thesis
description Bibliography: p. 141-147.
format Thesis
id oai:open.uct.ac.za:11427/9067
institution University of Cape Town (South Africa)
language eng
last_indexed 2026-06-10T12:32:09.918Z
license_str Not specified — see source repository
provenance_str_mv Harvested via OAI-PMH from UCTD — University of Cape Town Open Access Repository
publishDate 2014
publishDateRange 2014
publishDateSort 2014
publisher Department of Computer Science
publisherStr Department of Computer Science
record_format dspace
source_str UCTD — University of Cape Town Open Access Repository
spelling oai:open.uct.ac.za:11427/9067 ROLAND : a tool for the realistic optimisation of local access network design Buffler, Simon Kritzinger, Pieter S Computer Science Bibliography: p. 141-147. Investment in the local access network represents between 50% and 70% of capital investment of a telecommunications company. This thesis investigates algorithms that can be used to design economical access networks and presents ROLAND: a tool that incorporates several of these algorithms into an interactive environment. The software allows a network designer to explore different approaches to solving the problem, before adopting a particular one. The family of problems that are tackled by the algorithms included in ROLAND involve determining the most economical way of installing concentrators in an access network and connecting demand nodes such as distribution points to these concentrators. The Centre-of-Mass (COM) Algorithm identifies clusters of demand in the network and suggests good locations for concentrators to be installed. The problem of determining which concentrators in a set of potential sites to install is known as the concentrator location problem (CPL) and is an instance of the classical capacitated plant location problem. Linear programming techniques such as branch-and-bound can be used to find an optimal solution to this problem, but soon becomes infeasible as the network size increases. Some form of heuristic approach is needed, and ROLAND includes two such heuristics, namely the Add and Drop Heuristic. Determining the layout of multi-drop lines, which allow a number of demand nodes to share the same connection to a concentrator, is analogous to finding minimal spanning trees in a graph. Greedy approaches such as Kruskal's algorithm are not ideal however, and heuristics such as Esau-William's algorithm achieve better results. Kruskal's algorithm and Kershenbaum's Unified Algorithm (which encapsulates a number of heuristics) have been implemented and come bundled with ROLAND. ROLAND also includes an optimal terminal assignment algorithm for associating distribution points to concentrators. A description of ROLAND's architecture and GUI are provided. The graphical elements are kept separate from the algorithm implementations, and an interface class provides common data structures and routines for use by new algorithm implementations. A test data generator, able to create random or localized data, is also included. A new hybrid concentrator location algorithm, known as the Cluster-Add Heuristic is presented. The implementation of this algorithm is included in ROLAND, and demonstrates the ease with which new solution methods can be integrated into the tool's framework. Experimentation with the concentrator location algorithms is conducted to show the Cluster-Add Heuristic's relative performance. 2014-11-04T08:48:57Z 2014-11-04T08:48:57Z 1999 Master Thesis Masters MSc http://hdl.handle.net/11427/9067 eng application/pdf Department of Computer Science Faculty of Science University of Cape Town
spellingShingle Computer Science
Buffler, Simon
ROLAND : a tool for the realistic optimisation of local access network design
thesis_degree_str Master's
title ROLAND : a tool for the realistic optimisation of local access network design
title_full ROLAND : a tool for the realistic optimisation of local access network design
title_fullStr ROLAND : a tool for the realistic optimisation of local access network design
title_full_unstemmed ROLAND : a tool for the realistic optimisation of local access network design
title_short ROLAND : a tool for the realistic optimisation of local access network design
title_sort roland a tool for the realistic optimisation of local access network design
topic Computer Science
url http://hdl.handle.net/11427/9067
work_keys_str_mv AT bufflersimon rolandatoolfortherealisticoptimisationoflocalaccessnetworkdesign