位置與興趣分群網路系統之廣播搜尋效益提升; Improvement of Broadcasting Search Efficiency in Locality-Aware and Interest-Based P2P System

NCUIR > College of Electrical Engineering & Computer Science > Graduate Institute of Computer Science and Information Engineering > Electronic Thesis & Dissertation > Item 987654321/9648

Please use this identifier to cite or link to this item: http://ir.lib.ncu.edu.tw/handle/987654321/9648

Title:	位置與興趣分群網路系統之廣播搜尋效益提升;Improvement of Broadcasting Search Efficiency in Locality-Aware and Interest-Based P2P System
Authors:	陳彥儒;Yan-Ru Chen
Contributors:	資訊工程研究所
Keywords:	最小成本生成樹;超級節點;P2P;興趣分群;位置知覺;超立方體;minimum cost spanning tree;super node;interest-based;hypercube;locality-aware
Date:	2008-10-07
Issue Date:	2009-09-22 11:52:39 (UTC+8)
Publisher:	國立中央大學圖書館
Abstract:	超立方體(Hypercube)結構近年來已被廣泛的應用在許多網路系統當中，其中應用在具有位置知覺(Locality-Aware)及興趣分群(Interest-Based)系統的同儕網路(Peer-to-Peer ; P2P)架構下，超級結點(super node)為底層結點與外界間之通訊、傳輸等橋梁。因此如何有效率的與底層結點作溝通聯繫，將攸關著此網路系統之效率。本篇將提出利用改良式最小成本生成樹演算法，來達成超級結點與其底層結點間之搜尋時間更為快速之目的。 Hypercube structures have been used in many networks in the past few years. One of these systems is locality-aware hybrid system with interest grouping. In this system, super nodes have more resources and bandwidth. Intra-peers and inter-peers are separated by super node. When intra-peers need to communicate with inter-peers, they will send messages by way of the super node. It is important to minimize the transmission time between intra-peers and the super node. In this paper, we proposed an algorithm based on the minimum cost spanning tree. Our purpose is to shorten the transmission time from the super node to intra-peers.
Appears in Collections:	[Graduate Institute of Computer Science and Information Engineering] Electronic Thesis & Dissertation

Files in This Item:

File	Size	Format

社群 sharing

Loading...