Multicast routing algorithms for real-time communication on high speed networks

Multicast routing algorithms for real-time communication on high speed networks

In this dissertation, we propose an Optimal Constrained Steiner Tree (OCST) algorithm for finding optimal solutions for the constrained Steiner tree problem. In addition, we propose some pruning schemes to reduce the size of the solution space and the running time of our proposed algorithm. Empirica...

Full description

Saved in:
Bibliographic Details
Main Author: Khin, Lay Wai.
Other Authors: Low, Chor Ping
Format: Theses and Dissertations
Language:English
Published: 2008
Subjects:
DRNTU::Engineering::Electrical and electronic engineering::Computer hardware, software and systems
DRNTU::Engineering::Computer science and engineering::Computer systems organization::Computer-communication networks
Online Access:http://hdl.handle.net/10356/13342
Tags: Add Tag
No Tags, Be the first to tag this record!
Institution: Nanyang Technological University
Language: English
Description
Summary:In this dissertation, we propose an Optimal Constrained Steiner Tree (OCST) algorithm for finding optimal solutions for the constrained Steiner tree problem. In addition, we propose some pruning schemes to reduce the size of the solution space and the running time of our proposed algorithm. Empirical studies shows that our pruning schemes are indeed effective in reducing the running time of the proposed algorithm substantially, thus making it a viable approach for constructing optimal solutions to the constrained Steiner tree problem.

Similar Items