Abstract
The term 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 (e.g. selfconfiguration, self-optimization, self-healing, and self-protecting) are achieved by a group of autonomous entities that coordinate in a peer-to-peer (P2P) fashion, it has opened the door to migrating research techniques from P2P systems. P2P’s meaning can be better understood with a set of key characteristics similar to AC: Decentralized organization, Self-organizing nature (i.e. adaptability), Resource sharing and aggregation, and Fault-tolerance. However, not all P2P systems are compatible with AC. Unstructured systems are designed more specifically than structured systems for the heterogeneous Internet environment, where the nodes’ persistence and availability are not guaranteed. Motivated by the challenges in AC and based on comprehensive analysis of popular P2P applications, three correlative standards for evaluating the compatibility of a P2P system with AC are presented in this chapter. According to these standards, a novel Efficient, Scalable and Robust (ESR) P2P overlay is proposed. 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. Furthermore, rather than a complex game theory or incentive mechanism, asimple 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 an autonomous environment as AC.
A detailed measurement study of three popular unstructured P2P overlays and ESR is performed. Our method is to analyze performances of classical searching algorithms in various overlays. Key factors in content locations including scalability, query success rate, query messages, cost, disturbed times and fault tolerance are considered carefully. The simulation results show some characteristics in unstructured P2P overlay and prove that ESR is a highly efficient, low cost and fault tolerant overlay and a good structure for applications in AC.
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.
Similar content being viewed by others
References
S. Dobson, F. MASSACCI, F. ZAMBONELLI, A Survey of Autonomic Communications, ACM Transactions on Autonomous and Adaptive Systems (TAAS), 1(2), pp.223–259, (2006)
Gnutella Protocol Specification, version 0.4. http://www.clip2.com/GnutellaProtocol04.pdf, 2001.
I. Stoica, R. Morris, D. Karger, M. F. Kaashoek, and H. Balakrishnan, Chord: A scalable peer-to-peer lookup protocol for internet applications, IEEE/ACM Transactions on Networking, 11(1), pp.17–32, (2003)
A. Rowstron and P. Druschel, Pastry: Scalable, distributed object location and routing for large-scale peer-to-peer systems, In: Proceedings of the Middleware, (2001)
S. Ratnasamy, P. Francis, M. Handley, R. Karp, and S. Shenker, A scalable content addressable network, In: Processings of the ACM SIGCOMM, pp. 161–172, (2001)
L.A. Adamic, R.M. Lukose, A.R. Puniyani and B.A. Huberman, Search in Power-law Networks, Physical Review, E 64, pp.46135–46143, (2001)
N. Sarshar, P.O. Boykin, V.P. Roychowdhury, Percolation Search in Power Law Networks: Making Unstructured Peer-To-Peer Networks Scalable, In: Fourth International Conference on Peer-to-Peer Computing (P2P'04), Zĺźrich, Switzerland, pp.2–9, (2004)
A.Q. Al-Namiy, F.S. Majeed, Improving query answering in peer-to-peer data searching, Nineteenth International Conference on Advanced Information Networking and Applications, pp.689–694, (2005)
L. Rong, and I. Burnett, Dynamic resource adaptation in a heterogeneous peer-to-peer environment, Second IEEE Consumer Communications and Networking Conference, pp.416–420, (2005)
S. Johnstone, P. Sage, P. Milligan, iXChange - A Self-Organising Super Peer Network Model, In: Proceedings of the 10th IEEE Symposium on Computers and Communications (ISCC 2005), pp.164–169, (2005)
J.R. Douceur, The Sybil Attack, International Workshop on Peer-to-Peer Systems (IPTPS), Cambridge, MA, USA, pp.251–260, (2002)
M. Castro, P. Druschel, A. Ganesh, A. Rowstron, D.S. Wallach, Secure Routing for Structured Peer-to-Peer Overlay Networks, Symposium on Operating Systems Design and Implementation (OSDI), Boston, MA, USA, (2002)
E. Adar and B.A. Huberman, Free Riding on Gnutella, Technical Report, Xerox PARC August, (2000)
H. Daniel, C. Geoff and W. James, Free riding on Gnutella revisited: The bell tolls?, IEEE Distributed Systems Online, 6(6), (2005)
C. Courcoubetis and R. Weber, Incentives for Large Peer-to-Peer Systems, IEEE Journal on selected areas in communications, 24(5), pp.1034–1050, May (2006)
M. Feldman, C. Papadimitriou, J. Chuang, and I. Stoica, Free-Riding and Whitewashing in Peer-to-Peer Systems, IEEE Journal on selected areas in communications, 24(5), pp.1010–1019, May (2006)
D. Purandare and R. Guha, Preferential and Strata based P2P Model: Selfishness to Altruism and Fairness, Proceedings of the 12th International Conference on Parallel and Distributed Systems (ICPADS'06), (2006)
R. Guha, R. Kumar, P. Raghavan, A. Tomkins, Propagation of Trust and Distrust, In: Proceedings International WWW Conference, New York, USA, pp.403–412, (2004)
B. Cohen, Incentives build robustness in BitTorrent, Workshop on Economics of Peer-to-Peer Systems, (2003)
K.G. Anagnostakis and M.B. Greenwald, Exchange-based incentive mechanisms for peer-to-peer file sharing, In: International Conference on Distributed Computing Systems (ICDCS), pp.524–533, (2004)
D. Qiu and R. SRIKANT, Modeling and performance analysis of bittorrent-like peer-to-peer networks, In: SIGCOMM, R. Yavatkar, E. W. Zegura, and J. Rexford, Eds. ACM, pp.367–378, (2004)
C. Aperjis and R. Johari, A peer-to-peer system as an exchange economy, Workshop on Game Theory for communications and networks,Pisa, Italy, October (2006)
E.J. Friedman, J.Y. Halpern and I. Kash, Efficiency and nash equilibria in a scrip system for P2P networks, Proceedings of the 7th ACM conference on Electronic commerce, pp.140–149, (2006)
V. Srivastava, et al, Using Game Theory to Analyze Wireless Ad Hoc Networks, IEEE Communications Surveys & Tutorials, 7(4), pp.46–56, (2005)
R. Mahajan, Practical and Efficient Internet Routing with Competing Interests, Ph.D. Dissertation (also UW-CSE TR #2005-12-02), December (2005)
B. Wong, Y. Vigfusson, and E. Sirer, Hyperspaces for object clustering and approximate matching in peer-to-peer overlays, In: Proceedings of the Workshop on Hot Topics in Operating Systems, (2007)
I. Brunkhorst, H. Dhraief, A. Kemper, W. Nejdl, C. Wiesner, Distributed Queries and Query Optimization in Schema-Based P2P-Systems, In: International Workshop on Databases, Information Systems and Peer-to-Peer Computing, Berlin, Germany, (2003)
D.A. Tran, K.A. Hua and T.T. Do, A peer-to-peer architecture for media streaming, IEEE Journal on Selected Areas in Communications, 22(1), pp.1–14, January (2004)
C.M. Huang, T.H. Hsu, M.F. Hsu, Network-aware P2P file sharing over the wireless mobile networks, IEEE Journal on Selected Areas in Communications, vol.25, pp.204–210, January (2007)
J. Kleinberg, The small-world phenomenon: an algorithmic perspective, In: Proceedings of the 32nd ACM Symposium on Theory of Computing, pp.163–170, (2000)
Y.J. Joung and J.C. Wang, Reducing Maintenance Overhead in Chord via Heterogeneity, In: Proc. 5th International Workshop on Global and P2P Computing (GP2PC), Cardiff, UK, pp.221–228, May (2006)
D. Li, Z.G. Chen, H. Liu, A. V. Vasilakos, An Adaptive and Self-Supervised Structured P2P Overlay for Autonomic Communication, In: ICWN, Las Vegas, Nevada, USA, pp. 412–417, (2007)
M.A. Jovanovic, Modeling large-scale peer-to-peer networks and a case study of Gnutella, [MS. Thesis], University of Cincinnati, Cincinnati, Ohio, USA, (2001)
B.F. Cooper, An optimal overlay topology for routing peer-to-peer searches, In: Middleware, Berlin, Heidelberg: Springer-Verlag, pp. 82–101, (2005)
B. Yang and H. Garcia-Molina, Efficient Search in Peer-to-Peer Networks, In: ICDCS, Vienna, Austria, pp.5–14, July (2002)
B. Yang, H. Garcia-Molina, Improving search in peer-to-peer networks, In: ICDCS, pp.5–14, (2002)
C. Gkantsidis, M. Mihail, A. Saberi, Random walks in peer-to-peer networks, In: INFOCOM, New York, IEEE Press, pp. 120–130, (2004)
K.A. Hua, C. Lee, C.M. Hua, Dynamic load balancing in Multicomputer database systems using partition tuning, IEEE Transactions on Knowledge and Data Engineering, 7(6), pp.968–983,(1995)
E.W. Zegura, K.L. Calvert and S. Bhattacharjee, How to model an internetwork, In: INFOCOM, San Francisco, CA, USA, pp.594–602,(1996)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2009 Springer Science+Business Media, LLC
About this chapter
Cite this chapter
Li, D., Liu, H., Vasilakos, A. (2009). An Efficient, Scalable and Robust P2P Overlay for Autonomic Communication. In: Vasilakos, A., Parashar, M., Karnouskos, S., Pedrycz, W. (eds) Autonomic Communication. Springer, Boston, MA. https://doi.org/10.1007/978-0-387-09753-4_13
Download citation
DOI: https://doi.org/10.1007/978-0-387-09753-4_13
Published:
Publisher Name: Springer, Boston, MA
Print ISBN: 978-0-387-09752-7
Online ISBN: 978-0-387-09753-4
eBook Packages: Computer ScienceComputer Science (R0)