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 |
| Summary: | 碩士 === 淡江大學 === 資訊工程學系碩士在職專班 === 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.
|
|---|