A Tree-Like Multicast Search Mechanism for a Voronoi-based Overlay Network Virtual Environment
碩士 === 淡江大學 === 資訊工程學系碩士在職專班 === 94 === This paper proposed a tree-like search mechanism that based on VON to solve the redundancy problem. Voronoi-based Overlay Network (VON) is a fully distributed peer-to-peer architecture and based on the mathematical construct Voronoi diagram. In this mechanism,...
Main Authors: | , |
---|---|
Other Authors: | |
Format: | Others |
Language: | zh-TW |
Published: |
2006
|
Online Access: | http://ndltd.ncl.edu.tw/handle/04890253397934606574 |
id |
ndltd-TW-094TKU05392027 |
---|---|
record_format |
oai_dc |
spelling |
ndltd-TW-094TKU053920272016-05-30T04:21:19Z http://ndltd.ncl.edu.tw/handle/04890253397934606574 A Tree-Like Multicast Search Mechanism for a Voronoi-based Overlay Network Virtual Environment 在Voronoi-basedOverlayNetwork虛擬環境中樹狀群組廣播的搜尋機制 Jing-Ping Chen 陳晶萍 碩士 淡江大學 資訊工程學系碩士在職專班 94 This paper proposed a tree-like search mechanism that based on VON to solve the redundancy problem. Voronoi-based Overlay Network (VON) is a fully distributed peer-to-peer architecture and based on the mathematical construct Voronoi diagram. In this mechanism, one server being center controller will never be needed, and users can search data more effectively by passing query message from enclosing neighbor. By constructing APSTT (All-Path Search Table) and TPT (Transfer Path Table), every node in VON can check TPT to pass the query message. In this way, we can improve performance and reduce the loading of network bandwidth. Jui-Fa Chen 陳瑞發 2006 學位論文 ; thesis 58 zh-TW |
collection |
NDLTD |
language |
zh-TW |
format |
Others
|
sources |
NDLTD |
description |
碩士 === 淡江大學 === 資訊工程學系碩士在職專班 === 94 === This paper proposed a tree-like search mechanism that based on VON to solve the redundancy problem. Voronoi-based Overlay Network (VON) is a fully distributed peer-to-peer architecture and based on the mathematical construct Voronoi diagram. In this mechanism, one server being center controller will never be needed, and users can search data more effectively by passing query message from enclosing neighbor.
By constructing APSTT (All-Path Search Table) and TPT (Transfer Path Table), every node in VON can check TPT to pass the query message. In this way, we can improve performance and reduce the loading of network bandwidth.
|
author2 |
Jui-Fa Chen |
author_facet |
Jui-Fa Chen Jing-Ping Chen 陳晶萍 |
author |
Jing-Ping Chen 陳晶萍 |
spellingShingle |
Jing-Ping Chen 陳晶萍 A Tree-Like Multicast Search Mechanism for a Voronoi-based Overlay Network Virtual Environment |
author_sort |
Jing-Ping Chen |
title |
A Tree-Like Multicast Search Mechanism for a Voronoi-based Overlay Network Virtual Environment |
title_short |
A Tree-Like Multicast Search Mechanism for a Voronoi-based Overlay Network Virtual Environment |
title_full |
A Tree-Like Multicast Search Mechanism for a Voronoi-based Overlay Network Virtual Environment |
title_fullStr |
A Tree-Like Multicast Search Mechanism for a Voronoi-based Overlay Network Virtual Environment |
title_full_unstemmed |
A Tree-Like Multicast Search Mechanism for a Voronoi-based Overlay Network Virtual Environment |
title_sort |
tree-like multicast search mechanism for a voronoi-based overlay network virtual environment |
publishDate |
2006 |
url |
http://ndltd.ncl.edu.tw/handle/04890253397934606574 |
work_keys_str_mv |
AT jingpingchen atreelikemulticastsearchmechanismforavoronoibasedoverlaynetworkvirtualenvironment AT chénjīngpíng atreelikemulticastsearchmechanismforavoronoibasedoverlaynetworkvirtualenvironment AT jingpingchen zàivoronoibasedoverlaynetworkxūnǐhuánjìngzhōngshùzhuàngqúnzǔguǎngbōdesōuxúnjīzhì AT chénjīngpíng zàivoronoibasedoverlaynetworkxūnǐhuánjìngzhōngshùzhuàngqúnzǔguǎngbōdesōuxúnjīzhì AT jingpingchen treelikemulticastsearchmechanismforavoronoibasedoverlaynetworkvirtualenvironment AT chénjīngpíng treelikemulticastsearchmechanismforavoronoibasedoverlaynetworkvirtualenvironment |
_version_ |
1718284386730770432 |