Robustness analysis of an unstructured overlay for media communication

Author(s): G. Marchetto ; M.P. Manzillo ; L. Torrero ; L. Ciminiera ; F. Risso
DOI: 10.1049/iet-com.2010.0624

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

Buy article PDF

Buy Knowledge Pack

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

IET Communications — Recommend this title to your library

Thank you

Your recommendation has been sent to your librarian.

Author(s): G. Marchetto ¹ ; M.P. Manzillo ¹ ; L. Torrero ¹ ; L. Ciminiera ¹ ; F. Risso ¹
- Affiliations: 1: Dipartimento di Automatica e Informatica, Politecnico di Torino, Torino, Italy
Source: Volume 5, Issue 4, 4 March 2011, p. 409 – 417
DOI: 10.1049/iet-com.2010.0624 , Print ISSN 1751-8628, Online ISSN 1751-8636

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.

References

1. 1)
  - 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.
2. 2)
  - D. Bonfiglio , M. Mellia , M. Meo , D. Rossi . Detailed analysis of skype traffic. IEEE Trans. Multimed. , 1 , 117 - 127
3. 3)
  - F.E. Bustamante , Y. Qiao . Designing less-structured p2p systems for the expected high churn. IEEE/ACM Trans. Netw. , 3 , 617 - 627
4. 4)
  - 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.
5. 5)
  - R. Cohen , K. Erez , D. Ben-Avraham , S. Havlin . Resilience of the internet to random breakdowns. Phys. Rev. Lett. , 4626 - 4628
6. 6)
  - Rhea, S., Geels, D., Roscoe, T., Kubiatowicz, J.: `Handling churn in a dht', Proc. USENIX Annual Technical Conf., 2003.
7. 7)
  - H. Shen , C.-Z. Xu . Locality-aware and churn-resilient load-balancing algorithms in structured peer-to-peer networks. IEEE Trans. Parallel Distrib. Syst. , 6 , 849 - 862
8. 8)
  - R. Albert , A.-L. Barabasi . Statistical mechanics of complex networks. Rev. Mod. Phys. , 47 - 92
9. 9)
  - R. Morselli , B. Bhattacharjee , M.A. Marsh , A. Srinivasan . Efficient lookup on unstructured topologies. IEEE J. Sel. Areas Commun. , 1 , 62 - 72
10. 10)
  - Douceur, J.R.: `The sybil attack', Revised Papers from First Int. Workshop on Peer-to-Peer Systems, 2002, p. 251–260, Springer-Verlag.
11. 11)
  - 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.
12. 12)
  - K.P.N. Puttaswamy , H. Zheng , B.Y. Zhao . Securing structured overlays against identity attacks. IEEE Trans. Parallel Distrib. Syst. , 10 , 1487 - 1498
13. 13)
  - Chawathe, Y., Ratnasamy, S., Breslau, L., Lanham, N., Shenker, S.: `Making gnutella-like p2p systems scalable', Proc. ACM SIGCOMM’03, 2003, p. 407–418.
14. 14)
  - D. Chopra , H. Schulzrinne , E. Marocco , E. Ivov . Peer-to-peer overlays for real-time communication: security issues and solutions. IEEE Commun. Surv. Tutor. , 1 , 4 - 12
15. 15)
  - J. Seedorf . Security challenges for peer-to-peer sip. IEEE Netw. , 5 , 38 - 45
16. 16)
  - 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.
17. 17)
  - 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.
18. 18)
  - K.R.B. Butler , S. Ryu , P. Traynor , P.D. McDaniel . Leveraging identity-based cryptography for node id assignment in structured p2p systems. IEEE Trans. Parallel Distrib. Syst. , 12 , 1803 - 1815
19. 19)
  - 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.
20. 20)
  - IETF working group: ‘Peer-to-peer session initiation protocol (p2psip)’, http://ietf.org/html.charters/p2psip-charter.html.
21. 21)
  - L. Ciminiera , G. Marchetto , F. Risso , L. Torrero . Distributed connectivity service for a SIP infrastructure. IEEE Netw. , 5 , 33 - 40
22. 22)
  - Camarillo, G., Rosenberg, J., Schulzrinne, H.: `SIP session initiation protocol', IETF Request for Comment 3261, 2002.
23. 23)
  - L.A. Adamic , R.M. Lukose , A.R. Puniyani , B.A. Huberman . Search in power-law networks. Phys. Rev. E , 4
24. 24)
  - Herrera, O., Znati, T.: `Modeling churn in p2p networks', 40thAnnual Simulation Symp., 2007, ANSS’07, March 2007, p. 33–40.
25. 25)
  - R. Cohen , K. Erez , D. Ben-Avraham , S. Havlin . Breakdown of the internet under intentional attack. Phys. Rev. Lett. , 3682 - 3685
26. 26)
  - 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.
27. 27)
  - M. Srivatsa , L. Liu . Mitigating denial-of-service attacks on the chord overlay network: a location hiding approach. IEEE Trans. Parallel Distrib. Syst. , 4 , 512 - 527
28. 28)
  - 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.
29. 29)
  - 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.
30. 30)
  - 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.
31. 31)
  - 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.
32. 32)
  - R. Albert , H. Jeong , A.-L. Barabasi . Error and attack tolerance of complex networks. Nature , 378 - 382

Robustness analysis of an unstructured overlay for media communication

Robustness analysis of an unstructured overlay for media communication

Buy article PDF

Buy Knowledge Pack

Thank you

References

Related content