以階層式叢集聲譽為基礎之行動同儕網路拓撲架構

以作者查詢圖書館館藏

、以作者查詢臺灣博碩士

、以作者查詢全國書目

、勘誤回報

、線上人數：11

、訪客IP：3.17.6.75

姓名

郭子涵(Tzu-Han Kuo) 查詢紙本館藏

畢業系所

通訊工程學系

論文名稱

以階層式叢集聲譽為基礎之行動同儕網路拓撲架構
(HiCO: A Mobile Peer-to-Peer Overlay with Cluster-Based Reputation Hierarchy)

相關論文

★ 非結構同儕網路上以特徵相似度為基準之搜尋方法	★ 線上RSS新聞資料流中主題性事件監測機制之設計與實作
★ 耐延遲網路下具密度感知的路由方法	★ 整合P2P與UPnP內容分享服務之家用多媒體閘道器：設計與實作
★ 家庭網路下簡易無縫式串流影音播放服務之設計與實作	★ 耐延遲網路下訊息傳遞時間分析與高效能路由演算法設計
★ BitTorrent P2P 檔案系統下載端網路資源之可調式配置方法與效能實測	★ 耐延遲網路中利用訊息編碼重組條件之資料傳播機制
★ 耐延遲網路中基於人類移動模式之路由機制	★ 車載網路中以資料匯集技術改善傳輸效能之封包傳送機制
★ 適用於交叉路口環境之車輛叢集方法	★ 車載網路下結合路側單元輔助之訊息廣播機制
★ 耐延遲網路下以靜態中繼節點（暫存盒）最佳化訊息傳遞效能之研究	★ 耐延遲網路下以動態叢集感知建構之訊息傳遞機制
★ 跨裝置影音匯流平台之設計與實作	★ 耐延遲網路下基於封包複製模式的路由機制之模擬及效能比較

檔案

[Endnote RIS 格式]

[Bibtex 格式]

[相關文章]

[文章引用]

[完整記錄]

[館藏目錄]

[檢視]

[下載]

本電子論文使用權限為同意立即開放。
已達開放權限電子全文僅授權使用者為學術研究之目的，進行個人非營利性質之檢索、閱讀、列印。
請遵守中華民國著作權法之相關規定，切勿任意重製、散佈、改作、轉貼、播送，以免觸法。

摘要(中)

此篇論文提出一個以叢集為基礎的階層式同儕網路拓撲架構。此架構在龐大數量的參與節點中依然擁有可程式化之特性，且於高動態的網路環境中可自我調節。此拓撲架構的組成考慮了節點在網路中的實體位置關係與鄰近關係，且屬於同儕網路中的部份集中式與半結構化架構。在擁有多種特性的動態網路環境中，節點的不可預期性、移動性、搜尋效率及成本將成為此類研究必須克服之問題，然而本篇論文的設計可以讓此架構保有優良的效率與彈性。此外本系統中還加入了聲譽觀念以改善節點不願提出貢獻的問題。以聲譽為考量的特別階層式樹狀架構擁有將節點分群、分割及合併叢集，並減少不公平與不平衡的資源利用。另外，此階層式架構擁有一些緊密合作的程序，以確保在發生節點錯誤時擁有自我修復的彈性。至此，我們研究出了一個強健且有效率的階層式行動同儕網路拓撲架構。在實驗模擬中，此架構將在模擬程式中被驗證，且被證實具有在不降低網路效能的情況下，擁有對抗上述各種問題的能力。

摘要(英)

This paper proposes a hierarchical cluster-based peer-to-peer overlay scheme which is not only scalable to tremendous peer population, but also sustainable to high network dynamics in a large-scale network environment. This scheme is based on both partially-centralized and semi-structured overlay models by exploiting network locality and proximity. This joint design can keep up system efficacy and flexibility in dynamic network environments where several issues, peer churn, peer mobility, search redundancy and traffic overhead become stickier. In addition, reputation notion is integrated
to mitigate the free-riding problem. According to special reputation tree hierarchy, the process of peer clustering elegantly operates cluster division and union to adjust the overall cluster hierarchy so as to somewhat moderate unfair or imbalanced resource utilization over the large-scale system. Furthermore, the hierarchical overlay is resilient to any single point of failure at any cluster. A tie-in process is able to link up the broken paths automatically. Therefore, our effort results in a robust,
efficient hierarchical overlay in dynamic peer-to-peer networks. By simulation results, the proposed scheme can react to above issues without compromise of prominent performance.

關鍵字(中)

★ 覆蓋網路建構
★ 混合覆蓋網路
★ 聲譽系統
★ 同儕網路
★ 內容散佈

關鍵字(英)

★ hybrid overlay
★ overlay construction
★ reputation system
★ content distribution
★ P2P

論文目次

1 Introduction 1
1.1 P2P Critique . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 1
1.2 Our Scheme and Contribution . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 3
2 HiCO System Model 7
3 HiCO Architecture and Organization 11
3.1 Design Abstraction . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 11
3.2 Basic Overlay Organization Processes . . . . . . . . . . . . . . . . . . . . . . . . . . . 12
3.2.1 Join_System Process . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 12
3.2.2 Change_Cluster Process . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 14
3.2.3 Join_Cluster Process . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 14
3.2.4 Election Process . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 15
3.3 Topology Control Processes . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 16
3.3.1 Cluster Reputation Formulation . . . . . . . . . . . . . . . . . . . . . . . . . . 17
3.3.2 Cluster_Division Process . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 17
3.3.3 Cluster_Union Process . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 19
3.3.4 Re-election Process . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 19
3.4 Content Search Process . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 20
3.4.1 Query Handle . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 20
3.4.2 Usage on Cluster Signature . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 21
3.5 Resilience Process . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 23
3.5.1 Recovery Process to Single Point of Failure . . . . . . . . . . . . . . . . . . . . 23
3.5.2 Recovery Process to Multiple Points of Failure . . . . . . . . . . . . . . . . . . 25
4 Performance Results 29
4.1 Simulation Environment . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 29
4.2 Sensitivity to Cluster Scale . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 30
4.3 Sensitivity to Peer Churn/Mobility . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 31
4.4 E¤ect by Query Process . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 33
4.5 E¤ect by Signatures Bitwise Length . . . . . . . . . . . . . . . . . . . . . . . . . . . . 34
4.6 E¤ect by Reputation Incentive . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 34
5 Conclusion 39

參考文獻

[1] E. Adar and B. A. Huberman. Free riding on gnutella. First Monday, 5(10), October 2000.
[2] S. Androutsellis-Theotokis and D. Spinellis. A survey of peer-to-peer content distribution tech-
nologies. ACM Computing Surveys, 36(4):335–371, December 2004.
[3] C. Bettstetter, G. Resta, and P. Santi. The node distribution of the random waypoint mobility
model for wireless ad hoc networks. IEEE Transactions on Mobile Computing, 2(3):257–269,
July-September 2003.
[4] B. BISKUPSKI, J. DOWLING, and J. SACHA. Properties and mechanisms of self-organizing
manet and p2p systems. ACM Transactions on Autonomous and Adaptive Systems, 2(1):Article
1, March 2007.
[5] R. Bolla, R. Gaeta, A. Magnetto, M. Sciuto, and M. Sereno. A measurement study supporting
p2p …le-sharing community models. Computer Networks, 53(4):485–500, March 2009.
[6] D. Braun, et al. UP2P: A peer-to-peer overlay architecture for ubiquitous communications and
networking. IEEE Communications Magazine, 46(12):32–39, December 2008.
[7] F. E. Bustamante and Y. Qiao. Designing less-structured p2p systems for the expected high
churn. IEEE/ACM Transactions on Networking, 16(3):617–627, June 2008.
[8] H. Byun and M. Lee. Howto: A hybrid overlay approach with tree optimization. In Proceedings
of 2009 WRI World Congress on Computer Science and Information Engineering, pages 311 –
315, March 2009.
[9] C.-Y. Chow, H. V. Leong, and A. T. Chan. Grococa: group-based peer-to-peer cooperative
caching in mobile environment. IEEE Journal on Selected Areas in Communications, 25(1):179–
191, January 2007.
[10] B. Cohen. Incentives build robustness in bittorrent. In Proceedings of the 1st Workshop on
Economics of Peer-to-Peer Systems, June 2003.
[11] C. Cramer, K. Kutzner, and T. Fuhrmann. Bootstrapping locality-aware p2p networks. In
Networks, 2004. (ICON 2004). Proceedings. 12th IEEE International Conference on, volume 1,
pages 357 –361 vol.1, 16-19 2004.
[12] K. Eger and U. Killat. Bandwidth trading in bittorrent-like p2p networks for content distribu-
tion. Computer Communications, 31(2):201–211, February 2008.
[13] N. Fedotova and L. Veltri. Reputation management algorithms for dht-based peer-to-peer envi-
ronment. Computer Communications, 32(12):1400–1409, July 2009.
[14] M. Feldman and J. Chuang. Overcoming free-riding behavior in peer-to-peer systems. ACM
SIGecom Exchanges, 5(4):41–50, July 2005.
[15] E. Fourquet, K. Larson, and W. Cowan. A reputation mechanism for layered communities. ACM
SIGecom Exchanges, 6(1):11–22, June 2006.
[16] W. Frakes and R. Baeza-Yates. Information Retrieval: Data Structures and Algorithms. Prentice
Hall, New Jersey, USA, 1992.
[17] P. Francis, et al. An architecture for a global internet host distance estimation service. In
Proceedings of IEEE INFOCOM’99, March 1999.
[18] P. Golle, K. Leyton-Brown, I. Mironov, and M. Lillibridge. Incentives for sharing in peer-to-peer
networks. In Proceedings of the 2nd International Workshop on Electronic Commerce, volume
2232, pages 75–87. Lecture Notes In Computer Science, October 2001.
[19] J. Han, D.Watson, and F. Jahanian. Topology aware overlay networks. In Proceedings of IEEE
INFOCOM,05, volume 4, pages 2554–2565, March 2005.
[20] C.-M. Huang, T.-H. Hsu, and M.-F. Hsu. Network-aware p2p …le sharing over the wireless mobile
networks. IEEE Journal on Selected Areas in Communications, 25(1):72–93, January 2007.
[21] D. Hughes, G. Coulson, and J. Walkerdine. Free riding on gnutella revisited: The bell tolls?
IEEE Distributed Systems Online, 6(6), June 2005.
[22] Y.-J. Joung and Z.-W. Lin. On the self-organization of a hybrid peer-to-peer system. Journal of
Network and Computer Applications, pages Article in Press, via doi:10.1016/j.jnca.2009.08.002,
2009.
[23] S. Jun and M. Ahamad. Incentives in bittorrent induce free riding. In Proceedings of the 2005
ACM SIGCOMM workshop on Economics of peer-to-peer systems, pages 116–121, August 2005.
[24] R. Jurca and B. Faltings. Reputation-based pricing of p2p services. In Proceedings of the 2005
ACM SIGCOMM workshop on Economics of peer-to-peer systems, pages 144–149, August 2005.
[25] J. S. Kong, J. S. A. Bridgewater, and V. P. Roychowdhury. Resilience of structured p2p systems
under churn: The reachable component method. Computer Communications, 31(10):2109–2123,
June 2008.
[26] A. Legout, G. Urvoy-Keller, and P. Michiardi. Rarest …rst and choke algorithms are enough. In
Proceedings of the 6th ACM SIGCOMM conference on Internet measurement, pages 203–216,
October 2006.
[27] M. Li, W.-C. Lee, and A. Sivasubramaniam. Performance evaluation of neighborhood signature
techniques for peer-to-peer search. Journal of Computers, 17(4):11–36, January 2007.
[28] X. Liao, H. Jin, Y. Liu, L. M. Ni, and D. Deng. Anysee: Peer-to-peer live streaming. In
Proceedings of IEEE INFOCOM’06, pages 1–10, April 2006.
[29] Y. Liu, Y. Guo, and C. Liang. A survey on peer-to-peer video streaming systems. Peer-to-Peer
Networking and Applications, 1(1):18–28, March 2008.
[30] Y. Liu, L. Xiao, X. Liu, L. M. Ni, and X. Zhang. Location awareness in unstructured peer-to-
peer systems. IEEE Transactions on Parallel and Distributed Systems, 16(2):163–174, February
2005.
[31] J. Liu, et al. Distributed distance measurement for large-scale networks. Int’l Journal of Com-
puter and Telecommunications Networking, 41, 2003.
[32] E. K. Lua, J. Crowcroft, M. Pias, R. Sharma, and S. Lim. A survey and comparison of peer-to-
peer overlay network schemes. IEEE Communications Tutorials and Surveys, 7(2):72–93, July
2005.
[33] E. K. Lua and X. Zhou. Network-aware superpeers-peers geometric overlay network. In Pro-
ceedings of 16th International Conference on Computer Communications and Networks, pages
141–148, August 2007.
[34] Q. Lv, P. Cao, E. Cohen, K. Li, and S. Shenker. Search and replication in unstructured peer-to-
peer networks. In Proceedings of the 16th ACM International Conference on Supercomputing,
pages 84–95, June 2002.
[35] S. Marti and H. Garcia-Molina. Taxonomy of trust: categorizing peer-to-peer reputation sys-
tems. Computer Networks, 50(4):472–484, March 2006.
[36] A. Nayebi, M. R. Rahimi, and H. S. Azad. Analysis of time-based random waypoint mobility
model for wireless mobile networks. In Proceedings of the 4th International Conference on
Information Technology : New Generations, pages 42–47, April 2007.
[37] T. Qiu, G. Chen, M. Ye, E. Chan, and B. Y. Zhao. Towards location-aware topology in both
unstructured and structured p2p systems. In Proceedings of International Conference on Parallel
Processing, pages 133–144, September 2007.
[38] P. Resnick, K. Kuwabara, R. Zeckhauser, and E. Friedman. Reputation systems. Communica-
tions of the ACM, 43, issue. 12:45–48, December 2000.
[39] M. Ripeanu, I. Foster, and A. Iamnitchi. Mapping the gnutella network: properties of large-scale
peer-to-peer systems and implications for system design. IEEE Internet Computing, 6(1):50–57,
2002.
[40] P. Sharma, Z. Xu, S. Banerjee, and S.-J. Lee. Estimating network proximity and latency. ACM
SIGCOMM Computer Communication Review, 36(3):39–50, July 2006.
[41] R. So…a and P. Mendes. User-provided networks: Consumer vs. provider. IEEE Communications
Magazine, 46(12):86–91, December 2008.
[42] D. Stutzbach and R. Rejaie. Understanding churn in peer-to-peer networks. In Proceedings of
the 6th ACM SIGCOMM conference on Internet measuremen, pages 189–202, October 2006.
[43] W. Theilmann and K. Rothermel. Dynamic distance maps of internet. In Proceedings of IEEE
INFOCOM’00, volume 1, March 2000.
[44] F. Wang, Y. Xiong, and J. Liu. mtreebone: A hybrid tree/mesh overlay for application-layer
live video multicast. In Proceedings of the 27th IEEE International Conference on Distributed
Computing Systems, June 2007.
[45] C. Xie, G. Chen, A. Vandenberg, and Y. Pan. Analysis of hybrid p2p overlay network topology.
Computer Communications, 31(2):190–200, February 2008.
[46] M. Yang and Z. Fei. A novel approach to improving search e¢ ciency in unstructured peer-to-peer
networks. Journal of Parallel and Distributed Computing, 69(11):877–884, November 2009.

指導教授

胡誌麟(Chih-Lin Hu)

審核日期

2010-7-27

推文