Change search
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • harvard1
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf
Latency Dataset for the paper "The Nearest Replica Can Be Farther Than You Think"
KTH, School of Information and Communication Technology (ICT), Communication Systems, CoS, Network Systems Laboratory (NS Lab).ORCID iD: 0000-0001-7642-6591
2015 (English)Data set
Place, publisher, year
2015.
Version
1.0
Keyword [en]
Latency
National Category
Communication Systems Computer Systems
Research subject
Computer Science
Identifiers
URN: urn:nbn:se:kth:diva-193698OAI: oai:DiVA.org:kth-193698DiVA: diva2:1033721
Funder
EU, European Research Council, 259110
Available from: 2016-10-09 Created: 2016-10-09 Last updated: 2016-12-05

Open Access in DiVA

No full text

Search in DiVA

By author/editor
Bogdanov, Kirill
By organisation
Network Systems Laboratory (NS Lab)
Communication SystemsComputer Systems
Bogdanov, K., Peón-Quirós, M., Maguire Jr., G. Q. & Kostic, D. (2015). The Nearest Replica Can Be Farther Than You Think. In: Proceedings of the ACM Symposium on Cloud Computing 2015: . Paper presented at ACM Symposium on Cloud Computing August 27 - 29, 2015,Hawaii (pp. 16-29). Association for Computing Machinery (ACM).

Search outside of DiVA

GoogleGoogle Scholar

urn-nbn

Altmetric score

urn-nbn
Total: 192 hits
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • harvard1
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf