EUVIMEDEUVIMED entdecken
Crossref

Looking for hypergiants in peeringDB

Timm Böttger, Felix Cuadrado, Steve Uhlig

ACM SIGCOMM Computer Communication Review · 07.09.2018 · 48 (3) · 13-19

DOI: 10.1145/3276799.3276801 ↗

Kurz gefasst

Fachartikel in der Zeitschrift ACM SIGCOMM Computer Communication Review, online erschienen am 07.09.2018. Verfasst von Timm Böttger und 2 weiteren Autor:innen. Die Arbeit wurde bisher 34-mal zitiert (Crossref) und nennt 12 Literaturangaben.

AbstractBibliografische AngabenZitierenVerwandte Studien

Abstract (Originalsprache)

Hypergiants, such as Google or Netflix, are important organisations in the Internet ecosystem, due to their sheer impact in terms of traffic volume exchanged. However, beyond naming specific instances, the research community still lacks a sufficiently crisp understanding of them. In this paper we analyse PeeringDB data and identify features that differentiate hypergiants from the other organisations. To this end, we first characterise the organisations present in PeeringDB, allowing us to identify discriminating properties of these organisations. We then use these properties to separate the data in two clusters, differentiating hypergiants from other organisations. We conclude this paper by investigating how hypergiants and other organisations exploit the IXP ecosystem to reach the global IPv4 space.

Zitieren

APA

Böttger, T., Cuadrado, F., & Uhlig, S. (2018). Looking for hypergiants in peeringDB. ACM SIGCOMM Computer Communication Review, 48(3), 13-19. https://doi.org/10.1145/3276799.3276801

Vancouver

Böttger T, Cuadrado F, Uhlig S. Looking for hypergiants in peeringDB. ACM SIGCOMM Computer Communication Review. 2018;48(3):13-19. doi:10.1145/3276799.3276801

BibTeX
@article{Bttger2018,
  author = {Böttger, Timm and Cuadrado, Felix and Uhlig, Steve},
  title = {Looking for hypergiants in peeringDB},
  journal = {ACM SIGCOMM Computer Communication Review},
  year = {2018},
  volume = {48},
  number = {3},
  pages = {13--19},
  doi = {10.1145/3276799.3276801}
}
Kostenlos starten →