Abstract
Autonomic Communication (AC) refers to self-managing systems which are capable of supporting self-configuration, self-healing and self-optimization. However, information reflection and collection, lack of centralized control, non-cooperation and so on are just some of the challenges within AC systems. Since many self-* properties are achieved by a group of autonomous entities that coordinate in a peer-to-peer (P2P) fashion, thus, it has opened the door to migrating research techniques from P2P systems. Motivated by the challenges in AC and based on comprehensive analysis of popular P2P applications, we present a novel Efficient, Scalable and Robust (ESR) Peer-to-Peer (P2P) overlay, which is inspired by two other scientific areas (i.e. conditioning monkeys and prime meridian). Differing from current structured and unstructured, or meshed and tree-like P2P overlay, the ESR is a whole new three-dimensional structure to improve the efficiency of routing, while information exchanges take in immediate neighbors with local information to make the system scalable and fault-tolerant. Meanwhile, rather than a complex game theory or incentive mechanism, a simple but effective punish mechanism has been presented based on a new ID structure which can guarantee the continuity of each node’s record in order to discourage negative behavior on a autonomous environment as AC. Large number of experiment results show the advantages of the ESR.
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
References
Dobson, S., et al.: A survey of autonomic communications. ACM Trans. Auton. Adapt. Syst. (TAAS) 1(2), 223–259 (2006)
Herbert, A.: What happens to pastry, pp. 10–16 2007
Magharei, N., Rejaie, R., Yang, G.: Mesh or Multiple-Tree: A comparative study of live P2P streaming approaches. In: IEEE International Conference on Computer Communications (INFOCOM 2007), pp. 1424–1432. IEEE Piscataway, NJ (2007)
Kim, K.-H., Nam, H., Singh, V., Song, D.: DYSWIS: Crowdsourcing a home network diagnosis. In: 23rd International Conference on Computer Communication and Networks (ICCCN), Shanghai, pp. 1–10 (2014)
Tutschku, K., Tran-Gia, P., Andersen, F.-U.: Trends in network and service operation for the emerging future internet. AEU – Int. J. Electron. Commun. 62(9), 705–714 (2008)
Movahedi, Z., Ayari, M., Langar, R., Pujolle, G.: A survey of autonomic network architectures and evaluation criteria. IEEE Commun. Surv. Tutorials 14(2), 464–490 (2012)
Schlosser, M.T., Sintek, M., Decker, S., Nejdl, W.: HyperCuP - hypercubes, ontologies, and efficient search on peer-to-peer networks. In: Moro, G., Koubarakis, M. (eds.) AP2PC 2002. LNCS (LNAI), vol. 2530, pp. 112–124. Springer, Heidelberg (2003)
Cheng, B., Fan, J., Jia, X., Jia, J.: Parallel construction of independent spanning trees and an application in diagnosis on Möbius cubes. J. Supercomputing 65(3), 1279–1301 (2013)
Kuo, J.-L., Shih, C.-H., Ho, C.-Y., Chen, Y.-C.: A cross-layer approach for real-time multimedia streaming on wireless peer-to-peer ad hoc network. Ad Hoc Netw. 11(1), 339–354 (2013)
Rizk, R., Saber, W., Harb, H.: Conditional clustered matrix factorization based network coordinate system. J. Netw. Comput. Appl. 45, 191–202 (2014)
Costa, M., Castro, M., A. Rowstron, A., Key, d P.: PIC: Practical internet coordinates for distance estimation. In: Proceedings of IEEE ICDCS, March 2004
Ben-Gal, I., Shavitt, Y., Weinsberg, E., Weinsberg, U.: Peer-to-peer information retrieval using shared-content clustering. Knowl. Inf. Syst. 39(2), 383–408 (2014)
Lian, J., Naik, K., Agnew, G.: A framework for evaluating the performance of clustering algorithms for table-driven hierarchical networks. IEEE/ACM Trans. Networking 15(6), 1478–1489 (2007)
Tran, D.A., Nguyen, T.: Hierarchical multidimensional search in peer-to-peer networks. Comput. Commun. 31(2), 346–357 (2008)
Tran, D.A., Hua, K.A., Do, T.T.: A peer-to-peer architecture for media streaming. J. Sel. Areas Commun. 22(1), 1–14 (2004)
Lin, J.W.: Message broadcast using multiple trees in DHT P2P networks. J. Internet Technol. 15(4), 691–698 (2014)
Shen, H., Li, Z., Li, J.: A DHT-Aided chunk-driven overlay for scalable and efficient peer-to-peer live streaming. IEEE Trans. Parallel Distrib. Syst. 24(11), 2125–2137 (2013)
Furno, A., Zimeo, E.: Self-scaling cooperative discovery of service compositions in unstructured P2P networks. J. Parallel Distrib. Comput. 74(10), 2994–3025 (2014)
Hsiao, H.-C., Hong-Wei, S.: On optimizing overlay topologies for search in unstructured peer-to-peer networks. IEEE Trans. Parallel Distrib. Syst. 23(5), 924–935 (2012)
Chandra, J., Mitra, B., Ganguly, N.: Effect of constraints on superpeer topologies. In: Proceedings IEEE INFOCOM, 2013, pp. 60–64 (2013)
Zegura, E.W., Calvert, K.L., Bhattacharjee, S.: How to model an internetwork. In: The Conference on Computer Communications (INFOCOM 1996), pp. 594–602. IEEE Computer Society, Washington (1996)
Acknowledgments
This research is supported by the National Natural Science Foundation of China under Grant No. 61272149 and No. 61309001.
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2015 Springer International Publishing Switzerland
About this paper
Cite this paper
Liu, J., Wang, G., Li, D., Liu, H. (2015). ESR: An Efficient, Scalable and Robust Overlay for Autonomic Communications. In: Wang, G., Zomaya, A., Martinez, G., Li, K. (eds) Algorithms and Architectures for Parallel Processing. ICA3PP 2015. Lecture Notes in Computer Science(), vol 9528. Springer, Cham. https://doi.org/10.1007/978-3-319-27119-4_29
Download citation
DOI: https://doi.org/10.1007/978-3-319-27119-4_29
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-27118-7
Online ISBN: 978-3-319-27119-4
eBook Packages: Computer ScienceComputer Science (R0)