Efficient Routing For Multicasting In Packet Switching Networks
碩士 === 國立清華大學 === 資訊科學學系 === 84 === The most critical task for group communication routing lies in the establishment of a communication tree over the network. This thesis proposes a Programmable Distributed Multicast Routing Protocol (PDMRP) to establish a multicast tree for group communications....
Main Authors: | , |
---|---|
Other Authors: | |
Format: | Others |
Language: | en_US |
Published: |
1996
|
Online Access: | http://ndltd.ncl.edu.tw/handle/33006032584663960499 |
id |
ndltd-TW-084NTHU3394040 |
---|---|
record_format |
oai_dc |
spelling |
ndltd-TW-084NTHU33940402016-07-13T04:10:39Z http://ndltd.ncl.edu.tw/handle/33006032584663960499 Efficient Routing For Multicasting In Packet Switching Networks 封包交換式網路上具有效率選徑方法之群播協定 Huang, Chen-Chi 黃貞琪 碩士 國立清華大學 資訊科學學系 84 The most critical task for group communication routing lies in the establishment of a communication tree over the network. This thesis proposes a Programmable Distributed Multicast Routing Protocol (PDMRP) to establish a multicast tree for group communications. The proposed scheme is well-suited for different applications, such as Video-on-Demand and video conference, due to it is programmable. Thus, by employing the PDMRP with specific parameters, we can have different multicast trees for different applications. Simulation results indicate that the performance of the PDMRP are close to that of the well-known KMB routhing algorithm in terms of call blocking rate and the number of successfully established trees. Nevertheless, the height of the tree constructed by the PDMRP is lower than that obtained by the KMB scheme. Huang, Nen-Fu 黃能富 1996 學位論文 ; thesis 44 en_US |
collection |
NDLTD |
language |
en_US |
format |
Others
|
sources |
NDLTD |
description |
碩士 === 國立清華大學 === 資訊科學學系 === 84 ===
The most critical task for group communication routing lies in the establishment of a communication tree over the network. This thesis proposes a Programmable Distributed Multicast Routing Protocol (PDMRP) to establish a multicast tree for group communications. The proposed scheme is well-suited for different applications, such as Video-on-Demand and video conference, due to it is programmable. Thus, by employing the PDMRP with specific parameters, we can have different multicast trees for different applications. Simulation results indicate that the performance of the PDMRP are close to that of the well-known KMB routhing algorithm in terms of call blocking rate and the number of successfully established trees. Nevertheless, the height of the tree constructed by the PDMRP is lower than that obtained by the KMB scheme.
|
author2 |
Huang, Nen-Fu |
author_facet |
Huang, Nen-Fu Huang, Chen-Chi 黃貞琪 |
author |
Huang, Chen-Chi 黃貞琪 |
spellingShingle |
Huang, Chen-Chi 黃貞琪 Efficient Routing For Multicasting In Packet Switching Networks |
author_sort |
Huang, Chen-Chi |
title |
Efficient Routing For Multicasting In Packet Switching Networks |
title_short |
Efficient Routing For Multicasting In Packet Switching Networks |
title_full |
Efficient Routing For Multicasting In Packet Switching Networks |
title_fullStr |
Efficient Routing For Multicasting In Packet Switching Networks |
title_full_unstemmed |
Efficient Routing For Multicasting In Packet Switching Networks |
title_sort |
efficient routing for multicasting in packet switching networks |
publishDate |
1996 |
url |
http://ndltd.ncl.edu.tw/handle/33006032584663960499 |
work_keys_str_mv |
AT huangchenchi efficientroutingformulticastinginpacketswitchingnetworks AT huángzhēnqí efficientroutingformulticastinginpacketswitchingnetworks AT huangchenchi fēngbāojiāohuànshìwǎnglùshàngjùyǒuxiàolǜxuǎnjìngfāngfǎzhīqúnbōxiédìng AT huángzhēnqí fēngbāojiāohuànshìwǎnglùshàngjùyǒuxiàolǜxuǎnjìngfāngfǎzhīqúnbōxiédìng |
_version_ |
1718345173209972736 |