A constrained steiner tree approach for reconstructions of multicast trees.

Sun Tong. === Thesis (M.Phil.)--Chinese University of Hong Kong, 2004. === Includes bibliographical references (leaves 77-81). === Abstracts in English and Chinese. === Chinese Abstract --- p.I === Abstract --- p.II === Acknowledgements --- p.III === List of Contents --- p.IV === List of Figures...

Full description

Bibliographic Details
Other Authors: Sun, Tong.
Format: Others
Language:English
Chinese
Published: 2004
Subjects:
Online Access:http://library.cuhk.edu.hk/record=b5891874
http://repository.lib.cuhk.edu.hk/en/item/cuhk-324849
id ndltd-cuhk.edu.hk-oai-cuhk-dr-cuhk_324849
record_format oai_dc
spelling ndltd-cuhk.edu.hk-oai-cuhk-dr-cuhk_3248492019-03-05T03:34:10Z A constrained steiner tree approach for reconstructions of multicast trees. Multicasting (Computer networks) Sun Tong. Thesis (M.Phil.)--Chinese University of Hong Kong, 2004. Includes bibliographical references (leaves 77-81). Abstracts in English and Chinese. Chinese Abstract --- p.I Abstract --- p.II Acknowledgements --- p.III List of Contents --- p.IV List of Figures --- p.VII Chapter Chapter 1 --- Introduction --- p.1 Chapter 1.1 --- Multicast Routing Problem --- p.1 Chapter 1.2 --- Constrained multicast routing problem and SSRA algorithm --- p.4 Chapter 1.3 --- Thesis organization --- p.7 Chapter Chapter 2 --- Constrained Multicast Routing Algorithms --- p.8 Chapter 2.1 --- Steiner tree heuristic --- p.8 Chapter 2.1.1 --- Shortest Paths Heuristic --- p.9 Chapter 2.1.2 --- Distance Network Heuristic --- p.10 Chapter 2.2 --- Review of existing constrained multicast routing algorithms --- p.10 Chapter 2.2.1 --- Static group member --- p.10 Chapter 2.2.2 --- Dynamic group member --- p.14 Chapter 2.2.2.1 --- Non-rearrangeable --- p.15 Chapter 2.2.2.2 --- Rearrangeable --- p.23 Chapter Chapter 3 --- Small Scale Rearrangement Algorithm for Multicast Routing --- p.32 Chapter 3.1 --- Problem formulation --- p.32 Chapter 3.1.1 --- Network Model --- p.32 Chapter 3.1.2 --- Problem Specification --- p.33 Chapter 3.1.3 --- Definitions and Notations --- p.36 Chapter 3.2 --- Local Checking Scheme (LCS) --- p.37 Chapter 3.3 --- Small Scale Rearrangement Algorithm (SSRA) for Multicast Routing --- p.41 Chapter 3.3.1 --- Static group membership --- p.42 Chapter 3.3.2 --- Dynamic group membership --- p.43 Chapter 3.3.2.1 --- Node addition --- p.44 Chapter 3.3.2.2 --- Node removal --- p.44 Chapter 3.3.2.3 --- General steps --- p.45 Chapter 3.3.2.4 --- Example --- p.47 Chapter Chapter 4 --- Analysis --- p.50 Chapter Chapter 5 --- Simulations --- p.54 Chapter 5.1 --- Simulation Model --- p.54 Chapter 5.2 --- Simulation Parameters Parameter Default Value/Generating Method --- p.56 Chapter 5.3 --- Performance Metrics --- p.58 Chapter 5.4 --- Discussion of Results --- p.59 Chapter 5.4.1 --- Group 1: static group membership --- p.59 Chapter 5.4.2 --- Group 2: dynamic group membership --- p.63 Chapter 5.4.3 --- Comparison --- p.69 Chapter 5.5 --- Implementation Issue --- p.73 Chapter Chapter 6 --- Conclusion --- p.75 Reference --- p.77 Sun, Tong. Chinese University of Hong Kong Graduate School. Division of Information Engineering. 2004 Text bibliography print vii, 81 leaves : ill. ; 30 cm. cuhk:324849 http://library.cuhk.edu.hk/record=b5891874 eng chi Use of this resource is governed by the terms and conditions of the Creative Commons “Attribution-NonCommercial-NoDerivatives 4.0 International” License (http://creativecommons.org/licenses/by-nc-nd/4.0/) http://repository.lib.cuhk.edu.hk/en/islandora/object/cuhk%3A324849/datastream/TN/view/A%20%20constrained%20steiner%20tree%20approach%20for%20reconstructions%20of%20multicast%20trees.jpghttp://repository.lib.cuhk.edu.hk/en/item/cuhk-324849
collection NDLTD
language English
Chinese
format Others
sources NDLTD
topic Multicasting (Computer networks)
spellingShingle Multicasting (Computer networks)
A constrained steiner tree approach for reconstructions of multicast trees.
description Sun Tong. === Thesis (M.Phil.)--Chinese University of Hong Kong, 2004. === Includes bibliographical references (leaves 77-81). === Abstracts in English and Chinese. === Chinese Abstract --- p.I === Abstract --- p.II === Acknowledgements --- p.III === List of Contents --- p.IV === List of Figures --- p.VII === Chapter Chapter 1 --- Introduction --- p.1 === Chapter 1.1 --- Multicast Routing Problem --- p.1 === Chapter 1.2 --- Constrained multicast routing problem and SSRA algorithm --- p.4 === Chapter 1.3 --- Thesis organization --- p.7 === Chapter Chapter 2 --- Constrained Multicast Routing Algorithms --- p.8 === Chapter 2.1 --- Steiner tree heuristic --- p.8 === Chapter 2.1.1 --- Shortest Paths Heuristic --- p.9 === Chapter 2.1.2 --- Distance Network Heuristic --- p.10 === Chapter 2.2 --- Review of existing constrained multicast routing algorithms --- p.10 === Chapter 2.2.1 --- Static group member --- p.10 === Chapter 2.2.2 --- Dynamic group member --- p.14 === Chapter 2.2.2.1 --- Non-rearrangeable --- p.15 === Chapter 2.2.2.2 --- Rearrangeable --- p.23 === Chapter Chapter 3 --- Small Scale Rearrangement Algorithm for Multicast Routing --- p.32 === Chapter 3.1 --- Problem formulation --- p.32 === Chapter 3.1.1 --- Network Model --- p.32 === Chapter 3.1.2 --- Problem Specification --- p.33 === Chapter 3.1.3 --- Definitions and Notations --- p.36 === Chapter 3.2 --- Local Checking Scheme (LCS) --- p.37 === Chapter 3.3 --- Small Scale Rearrangement Algorithm (SSRA) for Multicast Routing --- p.41 === Chapter 3.3.1 --- Static group membership --- p.42 === Chapter 3.3.2 --- Dynamic group membership --- p.43 === Chapter 3.3.2.1 --- Node addition --- p.44 === Chapter 3.3.2.2 --- Node removal --- p.44 === Chapter 3.3.2.3 --- General steps --- p.45 === Chapter 3.3.2.4 --- Example --- p.47 === Chapter Chapter 4 --- Analysis --- p.50 === Chapter Chapter 5 --- Simulations --- p.54 === Chapter 5.1 --- Simulation Model --- p.54 === Chapter 5.2 --- Simulation Parameters Parameter Default Value/Generating Method --- p.56 === Chapter 5.3 --- Performance Metrics --- p.58 === Chapter 5.4 --- Discussion of Results --- p.59 === Chapter 5.4.1 --- Group 1: static group membership --- p.59 === Chapter 5.4.2 --- Group 2: dynamic group membership --- p.63 === Chapter 5.4.3 --- Comparison --- p.69 === Chapter 5.5 --- Implementation Issue --- p.73 === Chapter Chapter 6 --- Conclusion --- p.75 === Reference --- p.77
author2 Sun, Tong.
author_facet Sun, Tong.
title A constrained steiner tree approach for reconstructions of multicast trees.
title_short A constrained steiner tree approach for reconstructions of multicast trees.
title_full A constrained steiner tree approach for reconstructions of multicast trees.
title_fullStr A constrained steiner tree approach for reconstructions of multicast trees.
title_full_unstemmed A constrained steiner tree approach for reconstructions of multicast trees.
title_sort constrained steiner tree approach for reconstructions of multicast trees.
publishDate 2004
url http://library.cuhk.edu.hk/record=b5891874
http://repository.lib.cuhk.edu.hk/en/item/cuhk-324849
_version_ 1718990219497177088