Abstract
Users of large-scale testbeds often need a group of nodes with a reasonable level of stability to execute applications and experiments. Although monitoring the stability of nodes themselves is certainly part of the solution, it is important to classify and select groups of nodes according to their ability to communicate among themselves. In this work we call such groups of nodes “stable wormholes”, and describe strategies to find those wormholes based on monitoring end-to-end pairwise interactions. Data acquired is used to find five different types of wormholes, each with a different stability pattern. The system was implemented in PlanetLab. Extensive experimental results are reported evaluating the proposed strategies. A comparison with another tool that selects nodes based on node stability alone is also presented. The execution of a MapReduce application shows that nodes selected with the proposed strategy ran the application significantly faster.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Apache Hadoop, http://hadoop.apache.org (accessed at July 29, 2011)
NTP: The Network Time Protocol, http://www.ntp.org/ (accessed em April 18, 2011)
Albrecht, J., Oppenheimer, D., Vahdat, A., Patterson, D.A.: Design and Implementation Trade-offs for Wide-area Resource Discovery. ACM Trans. Internet Technol (2008)
Bona, L.C.E., Fonseca, K.V.O., Duarte Jr., E.P., Mello, S.L.V.: HyperBone: A Scalable Overlay Network Based on a Virtual Hypercube. In: Proc. of the 8th IEEE Int. Symp. Cluster Computing and the Grid, CCGRID (2008)
Chun, B., Culler, D., Roscoe, T., Bavier, A., Peterson, L., Wawrzoniak, M., Bowman, M.: PlanetLab: An Overlay Testbed for Broad-coverage Services. SIGCOMM Comput. Commun. Rev. (2003)
Dabek, F., Cox, R., Kaashoek, F., Morris, R.: Vivaldi: A Decentralized Network Coordinate System. In: SIGCOMM 2004: Proceedings of the 2004 Conference on Applications, Technologies, Architectures, and Protocols for Computer Communications, New York, NY, USA. ACM (2004)
Dean, J., Ghemawat, S.: MapReduce: simplified data processing on large clusters. In: Proceedings of the 6th conference on Symposium on Opearting Systems Design & Implementation, Berkeley, CA, USA, vol. 6. USENIX Association (2004)
Diestel, R.: Graph Theory, 3rd edn. Springer (2005)
Duarte Jr., E.P., Garrett, T., Bona, L.C.E., Carmo, R.J.S., Zuge, A.: Finding Stable Cliques of PlanetLab Nodes. In: The 40th Annual IEEE/IFIP International Conference on Dependable Systems and Networks, DSN 2010 DCCS (2010)
Fischer, M.J., Lynch, N.A., Paterson, M.S.: Impossibility of distributed consensus with one faulty process. Journal of the ACM (1985)
Garey, M.R., Johnson, D.S.: Computers and Intractability: A Guide to the Theory of NP-Completeness. W.H. Freeman (1979)
Gorender, S., de Araújo Macêdo, R.J., Raynal, M.: An Adaptive Programming Model for Fault-Tolerant Distributed Computing. IEEE Transactions on Dependable and Secure Computing (2007)
Liang, J., Ko, S.Y., Gupta, I., Nahrstedt, K.: MON: On-demand Overlays for Distributed System Management. In: Proceedings of USENIX WORLDS (2005)
Lo, V., Zhou, D., Liu, Y., GauthierDickey, C., Li, J.: Scalable Supernode Selection in Peer-to-Peer Overlay Networks. In: Proceedings of the 2005 Second International Workshop on Hot Topics in Peer-to-Peer Systems, HOT-P2P 2005 (2005)
Londoño, J., Bestavros, A.: netEmbed: A Network Resource Mapping Service for Distributed Applications. In: Proceedings of the IEEE/ACM IPDPS High-Performance Grid Computing Workshop, Miami, Florida, USA (2008)
Macedo, R.A., Gorender, S.: Perfect Failure Detection in the Partitioned Synchronous Distributed System Model. In: International Conference on Availability Reliability and Security, ARES (2009)
Massie, M.L., Chun, B.N., Culler, D.E.: The Ganglia Distributed Monitoring System: Design, Implementation And Experience. Parallel Computing (2003)
Ortiz, H., Casimiro, A., Veríssimo, P.: Architecture and Implementation of an Embedded Wormhole. In: Proceedings of the 2007 Symposium on Industrial Embedded Systems. IEEE Industrial Electronics Society (2007)
Park, K., Pai, V.S.: CoMon: A Mostly-scalable Monitoring System for PlanetLab. SIGOPS Oper. Syst. Rev. (2006)
Tomita, E., Tanaka, A., Takahashi, H.: The worst-case time complexity for generating all maximal cliques and computational experiments. Theoretical Computer Science (2006)
Veríssimo, P., Casimiro, A.: The Timely Computing Base model and architecture. IEEE Transactions on Computers. SIGACTN: SIGACT News (ACM Special Interest Group on Automata and Computability Theory) (2006)
Veríssimo, P.: Travelling through Wormholes: a new look at Distributed Systems Models. SIGACTN: SIGACT News (ACM Special Interest Group on Automata and Computability Theory) (2006)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2012 ICST Institute for Computer Science, Social Informatics and Telecommunications Engineering
About this paper
Cite this paper
Bona, L.C.E., Duarte, E.P., Garrett, T. (2012). Monitoring Pairwise Interactions to Discover Stable Wormholes in Highly Unstable Networks. In: Korakis, T., Zink, M., Ott, M. (eds) Testbeds and Research Infrastructure. Development of Networks and Communities. TridentCom 2012. Lecture Notes of the Institute for Computer Sciences, Social Informatics and Telecommunications Engineering, vol 44. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-35576-9_15
Download citation
DOI: https://doi.org/10.1007/978-3-642-35576-9_15
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-35575-2
Online ISBN: 978-3-642-35576-9
eBook Packages: Computer ScienceComputer Science (R0)