Four-dimensional model for describing the status of peers in peer-to-peer distributed systems

One of the important aspects of decision making and management in distributed systems is collecting accurate information about the available resources of the peers. The previously proposed approaches for collecting such information completely depend on the system's architecture. In the server-oriented architecture, servers assume the main role of collecting comprehensive information from the peers and the system. Next, based on the information about the features of the basic activities and the system, an exact description of the peers' status is produced. Accurate decisions are then made using this description. However, the amount of information gathered in this architecture is too large, and it requires massive processing. On the other hand, updating the information takes time, causing delays and undermining the validity of the information. In addition, due to the limitations imposed by the servers, such architecture is not scalable and dynamic enough. The peer-to-peer architecture was introduced to address these concerns. However, due to a lack of complete knowledge of the peers and the system, the decisions are made without a precise description of the peers' status and are only based on the hardware data collected from the peers. Such an abstract and general image of the peers is not adequate for the purpose of decision making. In this paper, a 4-dimensional model is presented for the purpose of information collection and the exact description of the peer's status, including the features of the peer, the basic activity, the time, and the specifications of the system. The proposed model is for a server-oriented architecture, but it also adapts to the peer-to-peer serverless architecture. Based on this model, a new approach is introduced for information collection and an exact description of the peers' status in a peer-to-peer system based on the Latin square concept. We evaluate the model in the server-oriented and serverless situations. The workload is considered as the basic activity in our evaluation. Our evaluation demonstrates that in a server-oriented situation, increasing the size of the system has a direct relation with time. However, a serverless situation does not follow this behavior.

Four-dimensional model for describing the status of peers in peer-to-peer distributed systems

One of the important aspects of decision making and management in distributed systems is collecting accurate information about the available resources of the peers. The previously proposed approaches for collecting such information completely depend on the system's architecture. In the server-oriented architecture, servers assume the main role of collecting comprehensive information from the peers and the system. Next, based on the information about the features of the basic activities and the system, an exact description of the peers' status is produced. Accurate decisions are then made using this description. However, the amount of information gathered in this architecture is too large, and it requires massive processing. On the other hand, updating the information takes time, causing delays and undermining the validity of the information. In addition, due to the limitations imposed by the servers, such architecture is not scalable and dynamic enough. The peer-to-peer architecture was introduced to address these concerns. However, due to a lack of complete knowledge of the peers and the system, the decisions are made without a precise description of the peers' status and are only based on the hardware data collected from the peers. Such an abstract and general image of the peers is not adequate for the purpose of decision making. In this paper, a 4-dimensional model is presented for the purpose of information collection and the exact description of the peer's status, including the features of the peer, the basic activity, the time, and the specifications of the system. The proposed model is for a server-oriented architecture, but it also adapts to the peer-to-peer serverless architecture. Based on this model, a new approach is introduced for information collection and an exact description of the peers' status in a peer-to-peer system based on the Latin square concept. We evaluate the model in the server-oriented and serverless situations. The workload is considered as the basic activity in our evaluation. Our evaluation demonstrates that in a server-oriented situation, increasing the size of the system has a direct relation with time. However, a serverless situation does not follow this behavior.

___

  • R. Ranjan, A. Harwood, R. Buyya, “Peer-to-peer based resource discovery in global grids: a tutorial”, IEEE Communications Surveys and Tutorials, Vol. 10, pp. 6–33, 2008.
  • D. Grosu, A.T. Chronopoulos, “Noncooperative load balancing in distributed systems”, Journal of Parallel and Distributed Computing, Vol. 65, pp. 1022–1034, 2005.
  • S. Viswanathan, B. Veeravalli, T.G. Robertazzi, “Resource-aware distributed scheduling strategies for large-scale computational cluster/grid systems”, IEEE Transactions on Parallel and Distributed Systems, Vol. 18, pp. 1450– 1461, 2007.
  • A. Iamnitchi, I. Foster, “On fully decentralized resource discovery in grid environments”, Computer Science, Vol. 2242, pp. 51–62, 2001.
  • D.P. Anderson, J. Cobb, E. Korpela, M. Lebofsky, D. Werthimer, “SETI@home: an experiment in public-resource computing”, Communications of the ACM, Vol. 45, pp. 56–61, 2002.
  • Avaki Corporation, AVAKI Grid Software: Concepts and Architecture, 2002.
  • C. Roncancio, M.P. Villamil, C. Labb´ e, P. Serrano-Alvarado, “Data sharing in DHT based P2P systems”, Transactions on Large-Scale Data- and Knowledge-Centered Systems, Vol. 1, pp. 327–352, 2009.
  • R. Huebsch, B. Chun, J. Hellerstein, B. Loo, P. Maniatis, T. Roscoe, S. Shenker, I. Stoica, A. Yumerefendi, “The architecture of PIER: an internet-scale query processor”, International Conference on Innovative Data Systems Research, pp. 28–43, 2005.
  • M. Ripeanu, I. Foster, A. Iamnitchi, “Mapping the Gnutella network: properties of large-scale peer-to-peer systems and implications for system design”, Journal of IEEE Internet Computing, Vol. 6, pp. 50–57, 2002.
  • I. Clarke, O. Sandberg, B. Wiley, T.W. Hong, “Freenet: a distributed anonymous information storage and retrieval system”, Workshop on Design Issues in Anonymity and Unobservability, pp. 46–66, 2000.
  • G. Bolcer, “Magi: architecture for mobile and disconnected work?ow”, IEEE Internet Computing, Vol. 4, pp. 46–54, 2000.
  • P. Stanhope, Get in the Groove: Building Tools and Peer-To-Peer Solutions with the Groove Platform, New York, Wiley, 2002.
  • H. Wang, J. Liu, K. Xu, “Measurement and enhancement of BitTorrent-based video file swarming”, Peer-to-Peer Networking and Applications, Vol. 3, pp. 237–253, 2010.
  • C. Kaleli, H. Polat, “P2P collaborative filtering with privacy”, Turkish Journal of Electrical Engineering & Computer Sciences, Vol. 8, pp. 101–116, 2010.
  • L. Huang, M. Garofalakis, A.D. Joseph, N. Taft, “Approximate decision making in large-scale distributed systems”, NIPS Workshop: Statistical Learning Techniques for Solving Systems Problems, 2007.
  • D.S. Milojicic, V. Kalogeraki, R. Lukose, K. Nagaraja, J. Pruyne, B. Richard, S. Rollins, Z. Xu, “Peer-to-peer computing”, HP Laboratories, Palo Alto, CA, USA, Technical Report, 2003.
  • E. Anderson, D. Patterson, “Extensible, scalable monitoring for clusters of computers”, The 11th USENIX Conference on System Administration, 1997.
  • F. Zhu, M.W Mutka, L.M. Ni, “Service discovery in pervasive computing environments”, IEEE Pervasive Computing, Vol. 4, pp. 81–90, 2005.
  • X. Zheng, V.R. Oleshchuk, “A survey on peer-to-peer SIP based communication systems”, Peer-to-Peer Networking and Applications, Vol. 3, pp. 257–264, 2010.
  • D.R. Kumari, H. Guclu, M.T. Yuksel, “Ad-hoc limited scale-free models for unstructured peer-to-peer networks”, Peer-to-Peer Networking and Applications, Vol. 4, pp. 92–105, 2008.
  • E. Meshkova, J. Riihij¨ arvi, M. Petrova, P. M¨ ah¨ onen, “A survey on resource discovery mechanisms, peer-to-peer and service discovery frameworks”, Computer Networks: The International Journal of Computer and Telecommunications Networking, Vol. 52, pp. 2097–2128, 2008.
  • A. Iamnitchi, I. Foster, D.C. Nurmi, “A peer-to-peer approach to resource discovery in grid environments”, 10th IEEE International Symposium on High Performance Distributed Computing, 2002.
  • J.R. Albrecht, D.L. Oppenheimer, A. Vahdat, D.A. Patterson, “Design and implementation trade-offs for wide-area resource discovery”, ACM Transactions on Internet Technology, Vol. 8, pp. 1–44, 2008.
  • I. Foster, C. Kesselman, “Globus: a metacomputing infrastructure toolkit”, International Journal of Supercomputer Applications, Vol. 11, pp. 115–128, 1996.
  • C. Doulkeridis, A. Vlachou, K. Nİrv˚ ag, Y. Kotidis, M. Vazirgiannis, “Efficient search based on content similarity over self-organizing P2P networks”, Peer-to-Peer Networking and Applications, Vol. 3, pp. 67–79, 2010.
  • A. Barak, O. La’adan, “The MOSIX multicomputer operating system for high performance cluster computing”, Future Generation Computer Systems, Vol. 13, pp. 361–372, 1998.
  • R. Raman, M. Livny, M. Solomon, “Matchmaking: distributed resource management for high throughput computing”, High Performance Distributed Computing, pp. 140–146, 2002.
  • C.F. Laywine, Discrete Mathematics Using Latin Squares, Hoboken, NJ, USA, Wiley Interscience, 1998.
  • M. Sharifi, S.L. Mirtaheri, E. Mousavi Khaneghah, “A dynamic framework for integrated management of all types of resources in P2P systems”, Journal of Supercomputing, Vol. 52, pp. 149–170, 2010.
  • R. Noronha, D.K. Panda, “Performance evaluation of MM5 on clusters with modern interconnects: scalability and impact”, Proceedings of the 11th International Euro-Par Conference on Parallel Processing, pp. 134–145, 2005. D. Morton, O. Nudson, D. Bahls, P. Johnsen, D. Arnold, I. Schicker, “Grand-scale WRF testing on the Cray XT5 and XE6”, Cray User Group Proceedings, 2011.