近幾年來，大型的分散式資源共享系統使用P2P技術來提供多屬性範圍查詢。然而，因為資源的異質性以及資源提供者有著不同的分享策略，容易在這種以點對點為基礎的資源搜尋系統上造成負載的不平衡。在本篇論文中，我們提出一個自我調適之分散式資源記錄與搜尋系統(SARIDS)並可達到負載上的平衡。SARIDS採用以結構性點對點網路為主的兩層式架構。一層是Intra-overlay是由普通端點所構成，用來存放同一種資源屬性；另一層為Inter-overlay是由超級端點所構成，用來分類各種資源屬性到不同的Intra-overlay中。SARIDS不僅可以支援多屬性範圍查詢，而且可以自動地調整在同一個Intra-overlay與不同Intra-overlay中的負載。實驗結果證明SARIDS的負載平衡機制是有效率的並且可以適應在端點分布為不均一的大型分散式資源共享系統中。

Recently, the resource sharing systems apply the P2P to provide scalable multi-attribute range queries. However, due to the heterogeneity of resources and the variation of sharing policies in different providers, current P2P-based resource discovery systems may bring the load imbalance in large scale distributed system. In this thesis, we propose a self-adaptive resource index and discovery system (SARIDS) to achieve load balancing. SARIDS adopts a two-tier architecture based on the structured P2P overlay. The intra-overlay is constructed by normal peers with the same attribute via the locality preserving hash function; and the inter-overlay is constructed by super-peers with classified attributes in different intra-overlays. SARIDS supports not only the multi-attribute range queries but also the self-adaptive mechanisms for load balancing in the intra-overlay and among the intra-overlays. The simulation results show that SARIDS is scalable and efficient for load balancing even in a non-uniform peer range environment.

[1] R. B. Ashwin, A. Mukesh, and S. Srinivasan, "Mercury: supporting scalable multi-attribute range queries," in ACM SIGCOMM Computer Communication Review. vol. 34, 2004, pp. 353-366.
[2] J. ASpnes and G. Shah, "Skip Graphs," in Proceedings of the Fourteeneth Annual ACM-SIAM Symposium on Discreate Algorithms, 2003, pp. 384-393.
[3] Y. Z. Ben, D. K. John, and D. J. Anthony, "Tapestry: An Infrastructure for Fault-tolerant Wide-area Location and," University of California at Berkeley 2001.
[4] S. El-Ansary, L. Alima, P. Brand, and S. Haridi, "Efficient Broadcast in Structured P2P Networks," in Peer-to-Peer Systems II, 2003, pp. 304-314.
[5] S. Fitzgerald, I. Foster, C. Kesselman, G. von Laszewski, W. Smith, and S. Tuecke, "A directory service for configuring high-performance distributed computations," in High Performance Distributed Computing, 1997. Proceedings. The Sixth IEEE International Symposium on, 1997, pp. 365-375.
[6] Gnutella, "http://www9.limewire.com/developer/gnutella_protocol_0.4.pdf."
[7] N. J. A. Harvey, M. B. Jones, S. Sariou, M. Theimer, and A. Wolman, "SkipNet: A Scalable Overlay Network with Practical Locality Properties," in Proceedings of the Fourth USENIX Symposium on Internet Technologies andd Systems, 2003, pp. 113-126.
[8] A. Iamnitchi and I. Foster, "On Fully Decentralized Resource Discovery in Grid Environments," in Grid Computing — GRID 2001, 2001, pp. 51-62.
[9] S. Ion, M. Robert, K. David, M. F. Kaashoek, and B. Hari, "Chord: A scalable peer-to-peer lookup service for internet applications," in Proceedings of the ACM SIGCOMM, 2001, pp. 149-160.
[10] D. R. Karger and M. Ruhl, "Simple Efficient Load-Balancing Algorithms for Peer-to-Peer Systems," in Theory of Computing Systems, 2006, pp. 787-804.
[11] Kazaa, "http://www.kazaa.com."
[12] V. Lo, Z. Dayi, L. Yuhong, C. GauthierDickey, and L. Jun, "Scalable supernode selection in peer-to-peer overlay networks," in Second International Workshop on Hot Topics in Peer-to-Peer Systems, 2005, pp. 18-25.
[13] M. Marzolla, M. Mordacchini, and S. Orlando, "Resource Discovery in a Dynamic Grid Environment," in Proceedings of the Sixteenth International Workshop on Database and Expert Systems Applications. , 2005, pp. 356-360.
[14] C. Mastroianni, D. Talia, and O. Verta, "A super-peer model for resource discovery services in large-scale Grids," Future Generation Computer Systems, vol. 21, pp. 1235-1248, 2005.
[15] C. Min, F. Martin, C. Jinbo, and S. Pedro, "MAAN: A Multi-Attribute Addressable Network for Grid Information Services," in Proceedings of the Fourth International Workshop on Grid Computing, 2003, pp. 184-191.
[16] D. Oppenheimer, J. Albrecht, D. Patterson, and A. Vahdat, "Scalable Wide-Area Resource Discovery," EECS Department, University of California, Berkeley UCB/CSD-04-1334, 2004.
[17] D. Puppin, S. Moncelli, R. Baraglia, N. Tonellotto, and F. Silvestri, "A Grid Information Service Based on Peer-to-Peer," in Euro-Par 2005 Parallel Processing, 2005, pp. 454-464.
[18] R. Ranjan, A. Harwood, and R. Buyya, "Peer-to-peer-based resource discovery in global grids: a tutorial," IEEE Communications Surveys & Tutorials, vol. 10, pp. 6-33, 2008.
[19] A. Rao, K. Lakshminarayanan, S. Surana, R. Karp, and I. Stoica, "Load Balancing in Structured P2P Systems," in Peer-to-Peer Systems II, 2003, pp. 68-79.
[20] A. Rowstron and P. Druschel, "Pastry: Scalable, Decentralized Object Location, and Routing for Large-Scale Peer-to-Peer Systems," in Proceedings of the Middleware, 2001, pp. 329-350.
[21] C. Schmidt and M. Parashar, "Squid: Enabling search in DHT-based systems," Journal of Parallel and Distributed Computing, vol. 68, pp. 962-975, 2008.
[22] M. Su-Hong, J. Holliday, and C. Dong-Sub, "Optimal Super-peer Selection for Large-scale P2P System," in International Conference on Hybrid Information Technology, 2006, pp. 588-593.
[23] R. Sylvia, F. Paul, H. Mark, K. Richard, and S. Scott, "A scalable content-addressable network," ACM SIGCOMM Computer Communication Review, vol. 31, pp. 161-172, 2001.
[24] D. Talia and P. Trunfio, "Peer-to-Peer protocols and Grid services for resource discovery on Grids," in Advances in Parallel Computing, L. Grandinetti ed. vol. 14: Elsevier Science, 2005.
[25] P. Trunfio, D. Talia, H. Papadakis, P. Fragopoulou, M. Mordacchini, M. Pennanen, K. Popov, V. Vlassov, and S. Haridi, "Peer-to-Peer resource discovery in Grids: Models and systems," Future Generation Computer Systems, vol. 23, pp. 864-878, 2007.