Efficient P2P inspired policy to distribute resource information in large distributed systems

Abstract

The computational infrastructures are becoming larger and more complex. Their organization and interconnection are acquiring new dimensions with the increasing adoption of Cloud Technology and the establishment of Federations of cloud providers. These large interconnected systems require monitoring at different levels of the infrastructure: from the availability of hardware resources to the effective provision of services and verification of terms of the established agreements. Monitoring becomes a fundamental component of any Cloud Service or Federation, as the up-to-date information about resources in the system is extremely important to be used as an input to the scheduler component. The way in which the different members of such a distributed system obtain and distribute the resource information is what is known as Resource Information Distribution Policy. Moving towards the obtention of a scalable and easy to maintain policy leads to interaction with the Peer to Peer (P2P) paradigm. Some of the proposed policies are based on establishing a ranking according to previous communications between nodes. These policies are known as learning based methods or Best-Neighbor (BN). However, the use of this type of policies shows poor performance and limited scalability compared with defacto Hierarchical or other hybrid policies. In this work, we introduce pBN which is a fully distributed resource information policy based on P2P. We analyze some reasons that could produce the poor performance in standard BN and propose an improvement which shows performance and bandwidth consumption similar to Hierarchical policy and other hybrid variations. To compare the different policies, a specific simulation tool is used with different system sizes and exponential network topology.