Robustness analysis of an unstructured overlay for media communication

Robustness analysis of an unstructured overlay for media communication

For access to this article, please select a purchase option:

Buy article PDF
(plus tax if applicable)
Buy Knowledge Pack
10 articles for $120.00
(plus taxes if applicable)

IET members benefit from discounts to all IET publications and free access to E&T Magazine. If you are an IET member, log in to your account and the discounts will automatically be applied.

Learn more about IET membership 

Recommend Title Publication to library

You must fill out fields marked with: *

Librarian details
Your details
Why are you recommending this title?
Select reason:
IET Communications — Recommend this title to your library

Thank you

Your recommendation has been sent to your librarian.

The wide diffusion of network address translators (NATs) (and, in some respect, firewalls) may prevent some applications that require direct end-to-end connectivity (e.g. real-time media) from being able to connect to the remote party. Although the solutions currently adopted rely on centralised nodes as third party relays, the distributed connectivity service (DISCOS) architecture has been recently proposed and aims at distributing such functionalities across a peer-to-peer (P2P) overlay. The original study presented some performance characteristics of the overlay, but the ability to resist to both failures and attacks was not taken into consideration. This study illustrates the robustness feature of the DISCOS overlay and suggests some minor modifications to the original mechanisms, in order to improve the overall robustness. The key component of DISCOS is its dynamic scale-free topology. Hence, the study also extends the existing literature concerning the robustness of scale-free networks, which considers only static graphs.


    1. 1)
      • Ford, B., Srisuresh, P., Kegel, D.: `Peer-to-peer communication across network address translators', Proc. Annual Conf. on USENIX Annual Technical Conf., 2005, Anaheim, CA, USENIX Association.
    2. 2)
    3. 3)
      • Camarillo, G., Rosenberg, J., Schulzrinne, H.: `SIP session initiation protocol', IETF Request for Comment 3261, 2002.
    4. 4)
    5. 5)
      • Rhea, S., Geels, D., Roscoe, T., Kubiatowicz, J.: `Handling churn in a dht', Proc. USENIX Annual Technical Conf., 2003.
    6. 6)
    7. 7)
      • Herrera, O., Znati, T.: `Modeling churn in p2p networks', 40thAnnual Simulation Symp., 2007, ANSS’07, March 2007, p. 33–40.
    8. 8)
      • Fu, S., Xu, C.-Z., Shen, H.: `Random choices for churn resilient load balancing in peer-to-peer networks', Parallel Distrib. Process., 2008. IEEE Int. Symp. on IPDPS 2008, April 2008, p. 1–12.
    9. 9)
      • Hoang, G.N., Chan, H.N., Van, K.N.: `Performance improvement of chord distributed hash table under high churn rate', Int. Conf. on Advanced Technologies for Communications, 2009, ATC’09, October 2009, p. 191–196.
    10. 10)
      • Xie, J., Li, Z., Chen, G., Wu, J.: `On maximum stability with enhanced scalability in high-churn dht deployment', Int. Conf. on Parallel Processing, 2009, ICPP’09, September 2009, p. 502–509.
    11. 11)
      • Baldoni, R., Bonomi, S., Rippa, A., Querzoni, L., Piergiovanni, S.T., Virgillito, A.: `Evaluation of unstructured overlay maintenance protocols under churn', 26thIEEE Int. Conf. on Distributed Computing Systems Workshops, 2006, ICDCS Workshops 2006, July 2006, p. 13.
    12. 12)
    13. 13)
    14. 14)
      • Dinger, J., Hartenstein, H.: `Defending the sybil attack in p2p networks: taxonomy, challenges, and a proposal for self-registration', First Int. Conf. on Availability, Reliability and Security, 2006, ARES 2006, April 2006, p. 8.
    15. 15)
      • Liang, J., Naoumov, N., Ross, K.W.: `The index poisoning attack in p2p file sharing systems', Proc. 25th IEEE Int. Conf. on Computer Communications, INFOCOM 2006, April 2006, p. 1–12.
    16. 16)
      • Li, Z., Xu, X., Shi, L., Liu, J., Liang, C.: `Authentication in peer-to-peer network: Survey and research directions', Int. Conf. on Network and System Security, 2009, p. 115–122.
    17. 17)
    18. 18)
    19. 19)
    20. 20)
      • Sanchez-Artigas, M., Garcia-Lopez, P.: `On routing in distributed hash tables: is reputation a shelter from malicious behaviour and churn?', IEEE International Conference on Peer-to-Peer Computing, 2009 (P2P '09), September 2009, p. 31–40.
    21. 21)
      • Chawathe, Y., Ratnasamy, S., Breslau, L., Lanham, N., Shenker, S.: `Making gnutella-like p2p systems scalable', Proc. ACM SIGCOMM’03, 2003, p. 407–418.
    22. 22)
    23. 23)
    24. 24)
    25. 25)
      • IETF working group: ‘Peer-to-peer session initiation protocol (p2psip)’,
    26. 26)
      • Jennings, C., Lowekamp, B., Rescorla, E., Baset, S., Schulzrinne, H.: `Resource location and discovery (reload) base protocol', Internet Draft draft-ietf-p2psip-base-06, Internet Engineering Task Force, October 2010.
    27. 27)
    28. 28)
    29. 29)
    30. 30)
      • Casado, M.: `Peering through the shroud: the effect of edge opacity on IP-based client identification', Proc. Int. Symp. on Networked Systems Design and Implementation, 2007.
    31. 31)
    32. 32)
      • Douceur, J.R.: `The sybil attack', Revised Papers from First Int. Workshop on Peer-to-Peer Systems, 2002, p. 251–260, Springer-Verlag.

Related content

This is a required field
Please enter a valid email address