Flow-constrained Dual-cast Routing Algorithms

碩士 === 國立雲林科技大學 === 電子與資訊工程技術研究所 === 85 ===   This thesis investigates the dual-cast problem in which a source node synchronously delivers multicast and unicast data flows that can be specified individually by each destination. Given a network with [D] destinations out of n nodes, we present an O (N...

Full description

Bibliographic Details
Main Authors: Lai, Jin-Fong, 賴錦峰
Other Authors: Lin, Long-Song
Format: Others
Language:zh-TW
Published: 1997
Online Access:http://ndltd.ncl.edu.tw/handle/13753018824299066172
id ndltd-TW-085YUNT3393009
record_format oai_dc
spelling ndltd-TW-085YUNT33930092016-07-01T04:16:05Z http://ndltd.ncl.edu.tw/handle/13753018824299066172 Flow-constrained Dual-cast Routing Algorithms 流量限制的雙播路由演算法 Lai, Jin-Fong 賴錦峰 碩士 國立雲林科技大學 電子與資訊工程技術研究所 85   This thesis investigates the dual-cast problem in which a source node synchronously delivers multicast and unicast data flows that can be specified individually by each destination. Given a network with [D] destinations out of n nodes, we present an O (N2[D]) polynomial-time heuristic to generate a multicast tree that minimizes the tree cost and satisfies the different requirements, subject to the constraint that the flow in each link should not exceed a given bound We also present two distributed algorithms that has commensurable performance as the centralized one.The results are verified by the simulations on a class of random graphs using PVM message passing library.   To empirically quantify the performance results, we conduct experiments on class of stochastic networks representing a family of random, unreliable networks. It is shown that our algorithms outperform other modified multicast algorithms in terms of the feasibility, a measure of the existence of a feasible solution, and robustness, a measure of the existence of a feasible solution when running on unreliable networks. Lin, Long-Song 林榮松 1997 學位論文 ; thesis 115 zh-TW
collection NDLTD
language zh-TW
format Others
sources NDLTD
description 碩士 === 國立雲林科技大學 === 電子與資訊工程技術研究所 === 85 ===   This thesis investigates the dual-cast problem in which a source node synchronously delivers multicast and unicast data flows that can be specified individually by each destination. Given a network with [D] destinations out of n nodes, we present an O (N2[D]) polynomial-time heuristic to generate a multicast tree that minimizes the tree cost and satisfies the different requirements, subject to the constraint that the flow in each link should not exceed a given bound We also present two distributed algorithms that has commensurable performance as the centralized one.The results are verified by the simulations on a class of random graphs using PVM message passing library.   To empirically quantify the performance results, we conduct experiments on class of stochastic networks representing a family of random, unreliable networks. It is shown that our algorithms outperform other modified multicast algorithms in terms of the feasibility, a measure of the existence of a feasible solution, and robustness, a measure of the existence of a feasible solution when running on unreliable networks.
author2 Lin, Long-Song
author_facet Lin, Long-Song
Lai, Jin-Fong
賴錦峰
author Lai, Jin-Fong
賴錦峰
spellingShingle Lai, Jin-Fong
賴錦峰
Flow-constrained Dual-cast Routing Algorithms
author_sort Lai, Jin-Fong
title Flow-constrained Dual-cast Routing Algorithms
title_short Flow-constrained Dual-cast Routing Algorithms
title_full Flow-constrained Dual-cast Routing Algorithms
title_fullStr Flow-constrained Dual-cast Routing Algorithms
title_full_unstemmed Flow-constrained Dual-cast Routing Algorithms
title_sort flow-constrained dual-cast routing algorithms
publishDate 1997
url http://ndltd.ncl.edu.tw/handle/13753018824299066172
work_keys_str_mv AT laijinfong flowconstraineddualcastroutingalgorithms
AT làijǐnfēng flowconstraineddualcastroutingalgorithms
AT laijinfong liúliàngxiànzhìdeshuāngbōlùyóuyǎnsuànfǎ
AT làijǐnfēng liúliàngxiànzhìdeshuāngbōlùyóuyǎnsuànfǎ
_version_ 1718330883273916416