最近幾年，疊蓋式網路已經成為一個很熱門的研究主題，而此技術也被廣泛的採用在許多點對點的應用上。而多個同時執行的點對點應用，形成了一個多重疊蓋式網路的環境。在這個環境中，不同的點對點應用有不同的維護機制與成本。因此，多重點對點的環境也就表示必須付出更多的維護成本。然而，這些維護成本確有部分是重複的。在此篇論文中，我們提出一個叫做協同式的Ｍaster-Slave雛型系統，而這個雛型系統的概念則是由一個主疊蓋式網路負責維護重複的部分，藉著這個方式，其許可以達到降低整體的維護成本。在這個雛型系統中，我們挑選一個疊蓋式網路來負責多個疊蓋式網路相同的需求，相同的機制或相同的屬性。然而，疊蓋式網路的維護包含許多種類，為了可以將此雛型系統應用的這些不同種類的維護，我們設計了兩種互動模式，來配合不同疊蓋式網路的維護需求。實驗結果顯示出，我們設計的方法大大的降低整體維護成本。然而，以上的實驗並不非常符合實際的網路狀況。由於每個疊蓋式網路的節點個數跟結點成員都不一樣，我們也評估了我們的雛型系統在不同的疊蓋式網路交集比率下的效能。根據理論的分析與實驗結果，可以證明我們的雛型系統和協同式的維護，是有效率的，而且對於結合多個疊蓋式網路是很有用的。

Overlay networks have been popular research topics and widely adopted in many P2P applications over the last few decades. The co-existence of multiple P2P applications introduces a multi-overlay environment. The varied overlays have different maintenance mechanisms. Thus, multiple overlays imply multiple times of overlay maintenance tasks. However, some of these overlay maintenance tasks are duplicated. In this paper, we attempt to exploit a cooperative model, named Master-Slave model, to leverage multiple overlays to get the duplicated overlay maintenance tasks free from maintaining. The idea behind this model is to maintain the duplicated parts by the master. To apply this model in multi-overlay environments, we choose one of the overlays as master, and the other to be the slaves. The master is responsible for maintaining the common requirements, common mechanism, or common overlay properties for the slaves. Based on this model, we developed two interaction modes for two types of overlay maintenance. The two types of overlay maintenance are periodic probe based maintenance and measurement based maintenance. Simulation results show that the proposed approaches significantly decrease the total maintenance costs. Since the amount of nodes and the participating nodes in each overlay are not the same, we consider various intersection ratios of overlays to evaluate the proposed model in a more realistic environment. According to the theoretical analysis and the simulation results, the proposed model and the cooperative approaches are efficient and useful to leverage multiple overlays.

[1] "The Gnutella Protocol Specification," 2000.
[2] M. Cai, M. Frank, J. Chen, and P. Szekely, "MAAN: A Multi-Attribute Addressable Network for Grid Information Services," Journal of Grid Computing, vol. 2, pp. 3-14, 2004.
[3] W. Chuan and L. Baochun, "Strategies of Conflict in Coexisting Streaming Overlays," in INFOCOM 2007. 26th IEEE International Conference on Computer Communications. IEEE, 2007, pp. 481-489.
[4] A. David, B. Hari, K. Frans, and M. Robert, "Resilient overlay networks," in Proceedings of the eighteenth ACM symposium on Operating systems principles Banff, Alberta, Canada: ACM, 2001.
[5] Z. Hai, C. Xue, S. Xiaoping, and Y. Erlin, "HRing: A Structured P2P Overlay Based on Harmonic Series," IEEE Transactions on Parallel and Distributed Systems, vol. 19, pp. 145-158, 2008.
[6] M. Jelasity, A. Montresor, Gian P. Jesi, and S. Voulgaris, "The {Peersim} Simulator."
[7] W. Jiang, D. M. Chiu, and J. C. S. Lui, "On the interaction of multiple overlay routing," Performance Evaluation, vol. 62, pp. 229-246, 2005.
[8] R. Keralapura, C. Chen-Nee, N. Taft, and G. Iannaccone, "Race Conditions in Coexisting Overlay Networks," IEEE/ACM Transactions on Networking, vol. 16, pp. 1-14, 2008.
[9] M. Kwon and S. Fahmy, "Synergy: an overlay internetworking architecture," in IEEE ICCCN, 2005, pp. 401-406.
[10] B. Maniymaran, M. Bertier, and A. M. Kermarrec, "Build One, Get One Free: Leveraging the Coexistence of Multiple P2P Overlay Networks," in Distributed Computing Systems, 2007. ICDCS '07. 27th International Conference on, 2007, pp. 33-33.
[11] Y. Mao, B. T. Loo, Z. G. Ives, and J. M. Smith, "MOSAIC: Unified Platform for Dynamic Overlay Selection and Composition," Technical Reports (CIS), p. 883, 2008.
[12] J. Risson and T. Moors, "Survey of research towards robust peer-to-peer networks: Search methods," Computer Networks, vol. 50, pp. 3485-3521, 2006.
[13] A. Rowstron and P. Druschel, "Pastry: Scalable, Decentralized Object Location, and Routing for Large-Scale Peer-to-Peer Systems," in Middleware 2001, 2001, pp. 329-350.
[14] R. Sean, G. Dennis, R. Timothy, and K. John, "Handling churn in a DHT," in Proceedings of the annual conference on USENIX Annual Technical Conference Boston, MA: USENIX Association, 2004.
[15] K. Sripanidkulchai, B. Maggs, and H. Zhang, "Efficient content location using interest-based locality in peer-to-peer systems," in INFOCOM. vol. 3: IEEE, 2003, pp. 2166-2176.
[16] I. Stoica, R. Morris, D. Liben-Nowell, D. R. Karger, M. F. Kaashoek, F. Dabek, and H. Balakrishnan, "Chord: a scalable peer-to-peer lookup protocol for Internet applications," IEEE/ACM Transactions on Networking, vol. 11, pp. 17-32, 2003.
[17] R. Sylvia, F. Paul, H. Mark, K. Richard, and S. Scott, "A scalable content-addressable network," in Proceedings of the 2001 conference on Applications, technologies, architectures, and protocols for computer communications San Diego, California, United States: ACM, 2001.
[18] D. A. Tran, K. A. Hua, and T. Do, "ZIGZAG: an efficient peer-to-peer scheme for media streaming," in INFOCOM 2003. Twenty-Second Annual Joint Conference of the IEEE Computer and Communications Societies. IEEE, 2003, pp. 1283-1292 vol.2.
[19] V. Vishnumurthy and P. Francis, "On Heterogeneous Overlay Construction and Random Node Selection in Unstructured P2P Networks," in INFOCOM 2006. 25th IEEE International Conference on Computer Communications. Proceedings, 2006, pp. 1-12.
[20] S. Voulgaris, D. Gavidia, and M. van Steen, "CYCLON: Inexpensive Membership Management for Unstructured P2P Overlays," Journal of Network and Systems Management, vol. 13, pp. 197-217, 2005.
[21] C. Wu, B. Li, and Z. Li, "Dynamic Bandwidth Auctions in Multioverlay P2P Streaming with Network Coding," IEEE Transactions on Parallel and Distributed Systems, vol. 19, pp. 806-820, 2008.
[22] Z. Xin Yan, Z. Qian, Z. Zhensheng, S. Gang, and Z. Wenwu, "A construction of locality-aware overlay network: mOverlay and its performance," IEEE Journal on Selected Areas in Communications, vol. 22, pp. 18-28, 2004.
[23] Z. Xinyan, L. Jiangchuan, L. Bo, and Y. S. P. Yum, "CoolStreaming/DONet: a data-driven overlay network for peer-to-peer live media streaming," in Proceedings IEEE INFOCOM 2005. 24th Annual Joint Conference of the IEEE Computer and Communications Societies, 2005, pp. 2102-2111 vol. 3.
[24] B. T. L. Yun Mao, Zachary G. Ives, Jonathan M. Smith, "MOSAIC: Multiple Overlay Selection and Intelligent Composition," 2007.
[25] B. Y. Zhao, H. Ling, J. Stribling, S. C. Rhea, A. D. Joseph, and J. D. Kubiatowicz, "Tapestry: a resilient global-scale overlay for service deployment," IEEE Journal on Selected Areas in Communications, vol. 22, pp. 41-53, 2004.
[26] L. Zhi and P. Mohapatra, "QRON: QoS-aware routing in overlay networks," Selected Areas in Communications, IEEE Journal on, vol. 22, pp. 29-40, 2004.
[27] S. Q. Zhuang, D. Geels, I. Stoica, and R. H. Katz, "On failure detection algorithms in overlay networks," in INFOCOM 2005. 24th Annual Joint Conference of the IEEE Computer and Communications Societies. Proceedings IEEE, 2005, pp. 2112-2123 vol. 3.