SOLARE: Self-Organizing Latency-Aware Resource Ensemble

This paper proposes and evaluates Self-Organizing Latency-Aware Resource Ensemble (SOLARE), a peer-to-peer self-organizing and self-managing cluster system based upon network coordinates and utility functions. In contrast to previous works, SOLARE is a fully decentralized clustering algorithm without any central units such as servers, super peers, cluster heads or landmarks. Furthermore, SOLARE allows for adaptability to dynamic network changes by monitoring the utility of a cluster and migrating nodes to other higher-utility clusters when the utility of an existing cluster is low. Quantitative, simulation-driven evaluations show that SOLARE is able to satisfy user demands expressed by utility functions that integrate system parameters in terms of intra cluster latencies and the number of cluster members. Also, we verify the ability of SOLARE to adapt to dynamic network changes through simulation based experiments that consider the number of nodes which migrate into another cluster and average utility value as nodes join SOLARE.

[1]  Donald F. Towsley,et al.  On distinguishing between Internet power law topology generators , 2002, Proceedings.Twenty-First Annual Joint Conference of the IEEE Computer and Communications Societies.

[2]  Rajarshi Das,et al.  Utility functions in autonomic systems , 2004, International Conference on Autonomic Computing, 2004. Proceedings..

[3]  Giorgio Ventre,et al.  Network Simulator NS2 , 2008 .

[4]  Giuseppe Valetto,et al.  Elicitation and utilization of application-level utility functions , 2009, ICAC '09.

[5]  Robert Tappan Morris,et al.  Vivaldi: a decentralized network coordinate system , 2004, SIGCOMM '04.

[6]  T. Kelly Utility-Directed Allocation , 2003 .

[7]  Aditya Akella,et al.  On the treeness of internet latency and bandwidth , 2009, SIGMETRICS '09.

[8]  Jia Wang,et al.  A measurement study of Internet bottlenecks , 2005, Proceedings IEEE 24th Annual Joint Conference of the IEEE Computer and Communications Societies..

[9]  Ittai Abraham,et al.  A Unified Network Coordinate System for Bandwidth and Latency , 2008 .

[10]  Hui Zhang,et al.  Predicting Internet network distance with coordinates-based approaches , 2002, Proceedings.Twenty-First Annual Joint Conference of the IEEE Computer and Communications Societies.

[11]  Gurmeet Singh Manku,et al.  Symphony: Distributed Hashing in a Small World , 2003, USENIX Symposium on Internet Technologies and Systems.

[12]  P. Oscar Boykin,et al.  Deetoo: Scalable unstructured search built on a structured overlay , 2010, 2010 IEEE International Symposium on Parallel & Distributed Processing, Workshops and Phd Forum (IPDPSW).

[13]  P. Oscar Boykin,et al.  A Symphony Conducted by Brunet , 2007, ArXiv.

[14]  Sohail Jabbar,et al.  Adaptive intra cluster routing for wireless sensor networks , 2009, ICHIT '09.

[15]  Suresh Jagannathan,et al.  Locality in structured peer-to-peer networks , 2006, J. Parallel Distributed Comput..

[16]  David Wolinsky,et al.  Parallel Processing Framework on a P2P System Using Map and Reduce Primitives , 2011, 2011 IEEE International Symposium on Parallel and Distributed Processing Workshops and Phd Forum.

[17]  David Wolinsky,et al.  On the design of autonomic, decentralized VPNs , 2010, 6th International Conference on Collaborative Computing: Networking, Applications and Worksharing (CollaborateCom 2010).

[18]  Rajarshi Das,et al.  Achieving Self-Management via Utility Functions , 2007, IEEE Internet Computing.

[19]  Ben Y. Zhao,et al.  Tapestry: a resilient global-scale overlay for service deployment , 2004, IEEE Journal on Selected Areas in Communications.

[20]  Sohail Jabbar,et al.  Energy Aware Intra Cluster Routing for Wireless Sensor Networks , 2010 .

[21]  Sajid Hussain,et al.  Hierarchical Cluster-based Routing in Wireless Sensor Networks , 2006 .

[22]  Rajarshi Das,et al.  Utility-function-driven energy-efficient cooling in data centers , 2010, ICAC '10.

[23]  Gade Krishna,et al.  A scalable peer-to-peer lookup protocol for Internet applications , 2012 .

[24]  Mark Handley,et al.  A scalable content-addressable network , 2001, SIGCOMM '01.

[25]  Krishna P. Gummadi,et al.  King: estimating latency between arbitrary internet end hosts , 2002, IMW '02.

[26]  Sanjay Ghemawat,et al.  MapReduce: Simplified Data Processing on Large Clusters , 2004, OSDI.

[27]  Robin Kravets,et al.  Cluster-Based Forwarding for Reliable End-to-End Delivery in Wireless Sensor Networks , 2007, IEEE INFOCOM 2007 - 26th IEEE International Conference on Computer Communications.

[28]  Steve R. White,et al.  Unity: experiences with a prototype autonomic computing system , 2004, International Conference on Autonomic Computing, 2004. Proceedings..

[29]  Pierre St. Juste,et al.  Addressing the P2P Bootstrap Problem for Small Overlay Networks , 2010, 2010 IEEE Tenth International Conference on Peer-to-Peer Computing (P2P).

[30]  Anne-Marie Kermarrec,et al.  Clustering in Peer-to-Peer File Sharing Workloads , 2004, IPTPS.

[31]  Mohamed Ali Kâafar,et al.  A Self-Organized Clustering Scheme for Overlay Networks , 2008, IWSOS.

[32]  Piotr Karwaczynski,et al.  IP-based Clustering for Peer-to-Peer Overlays , 2007, J. Softw..