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...
Saved in:
Main Author: | |
---|---|
Other Authors: | |
Format: | Theses and Dissertations |
Language: | English |
Published: |
2008
|
Subjects: | |
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 |
id |
sg-ntu-dr.10356-13342 |
---|---|
record_format |
dspace |
spelling |
sg-ntu-dr.10356-133422023-07-04T15:55:01Z Multicast routing algorithms for real-time communication on high speed networks Khin, Lay Wai. Low, Chor Ping School of Electrical and Electronic Engineering DRNTU::Engineering::Electrical and electronic engineering::Computer hardware, software and systems DRNTU::Engineering::Computer science and engineering::Computer systems organization::Computer-communication 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. 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. Master of Science (Communication and Network Systems) 2008-07-09T04:04:32Z 2008-10-20T07:25:41Z 2008-07-09T04:04:32Z 2008-10-20T07:25:41Z 1999 1999 Thesis http://hdl.handle.net/10356/13342 en 76 p. application/pdf |
institution |
Nanyang Technological University |
building |
NTU Library |
continent |
Asia |
country |
Singapore Singapore |
content_provider |
NTU Library |
collection |
DR-NTU |
language |
English |
topic |
DRNTU::Engineering::Electrical and electronic engineering::Computer hardware, software and systems DRNTU::Engineering::Computer science and engineering::Computer systems organization::Computer-communication networks |
spellingShingle |
DRNTU::Engineering::Electrical and electronic engineering::Computer hardware, software and systems DRNTU::Engineering::Computer science and engineering::Computer systems organization::Computer-communication networks Khin, Lay Wai. Multicast routing algorithms for real-time communication on high speed networks |
description |
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. |
author2 |
Low, Chor Ping |
author_facet |
Low, Chor Ping Khin, Lay Wai. |
format |
Theses and Dissertations |
author |
Khin, Lay Wai. |
author_sort |
Khin, Lay Wai. |
title |
Multicast routing algorithms for real-time communication on high speed networks |
title_short |
Multicast routing algorithms for real-time communication on high speed networks |
title_full |
Multicast routing algorithms for real-time communication on high speed networks |
title_fullStr |
Multicast routing algorithms for real-time communication on high speed networks |
title_full_unstemmed |
Multicast routing algorithms for real-time communication on high speed networks |
title_sort |
multicast routing algorithms for real-time communication on high speed networks |
publishDate |
2008 |
url |
http://hdl.handle.net/10356/13342 |
_version_ |
1772828170518528000 |