博碩士論文 955202070 完整後設資料紀錄

DC 欄位 語言
DC.contributor資訊工程學系zh_TW
DC.creator陳彥儒zh_TW
DC.creatorYan-Ru Chenen_US
dc.date.accessioned2008-10-22T07:39:07Z
dc.date.available2008-10-22T07:39:07Z
dc.date.issued2008
dc.identifier.urihttp://ir.lib.ncu.edu.tw:444/thesis/view_etd.asp?URN=955202070
dc.contributor.department資訊工程學系zh_TW
DC.description國立中央大學zh_TW
DC.descriptionNational Central Universityen_US
dc.description.abstract超立方體(Hypercube)結構近年來已被廣泛的應用在許多網路系統當中,其中應用在具有位置知覺(Locality-Aware)及興趣分群(Interest-Based)系統的同儕網路(Peer-to-Peer ; P2P)架構下,超級結點(super node)為底層結點與外界間之通訊、傳輸等橋梁。因此如何有效率的與底層結點作溝通聯繫,將攸關著此網路系統之效率。本篇將提出利用改良式最小成本生成樹演算法,來達成超級結點與其底層結點間之搜尋時間更為快速之目的。zh_TW
dc.description.abstractHypercube 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.en_US
DC.subject最小成本生成樹zh_TW
DC.subject超級節點zh_TW
DC.subjectP2Pzh_TW
DC.subject興趣分群zh_TW
DC.subject位置知覺zh_TW
DC.subject超立方體zh_TW
DC.subjectminimum cost spanning treeen_US
DC.subjectsuper nodeen_US
DC.subjectinterest-baseden_US
DC.subjecthypercubeen_US
DC.subjectlocality-awareen_US
DC.title位置與興趣分群網路系統之廣播搜尋效益提升zh_TW
dc.language.isozh-TWzh-TW
DC.titleImprovement of Broadcasting Search Efficiency in Locality-Aware and Interest-Based P2P Systemen_US
DC.type博碩士論文zh_TW
DC.typethesisen_US
DC.publisherNational Central Universityen_US

若有論文相關問題,請聯絡國立中央大學圖書館推廣服務組 TEL:(03)422-7151轉57407,或E-mail聯絡  - 隱私權政策聲明