Change search
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • 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
Shuffling with a Croupier: Nat-Aware Peer-Sampling
KTH, School of Information and Communication Technology (ICT), Electronic, Computer and Software Systems, ECS.
KTH, School of Information and Communication Technology (ICT), Electronic, Computer and Software Systems, ECS.ORCID iD: 0000-0002-9484-6714
2012 (English)In: Proceedings of the 2012 32nd IEEE International Conference on Distributed Computing Systems (ICDCS 2012) / [ed] Lisa O'Conner, IEEE Computer Society, 2012, p. 102-111Conference paper, Published paper (Refereed)
Abstract [en]

Despite much recent research on peer-to-peer (P2P) protocols for the Internet, there have been relatively few practical protocols designed to explicitly account for Network Address Translation gateways (NATs). Those P2P protocols that do handle NATs circumvent them using relaying and hole-punching techniques to route packets to nodes residing behind NATs. In this paper, we present Croupier, a peer sampling service (PSS) that provides uniform random samples of nodes in the presence of NATs in the network. It is the first NAT-aware PSS that works without the use of relaying or hole-punching. By removing the need for relaying and hole-punching, we decrease the complexity and overhead of our protocol as well as increase its robustness to churn and failure. We evaluated Croupier in simulation, and, in comparison with existing NAT-aware PSS', our results show similar randomness properties, but improved robustness in the presence of both high percentages of nodes behind NATs and massive node failures. Croupier also has substantially lower protocol overhead.

Place, publisher, year, edition, pages
IEEE Computer Society, 2012. p. 102-111
Keyword [en]
Gossip peer sampling, NAT, P2P networks
National Category
Computer Systems
Identifiers
URN: urn:nbn:se:kth:diva-92085DOI: 10.1109/ICDCS.2012.19ISI: 000309229600011Scopus ID: 2-s2.0-84866901273OAI: oai:DiVA.org:kth-92085DiVA: diva2:511993
Conference
The 32nd IEEE International Conference on Distributed Computing Systems (ICDCS), Macau, China, June 2012
Note

QC 20121121

Available from: 2012-03-27 Created: 2012-03-26 Last updated: 2012-11-21Bibliographically approved

Open Access in DiVA

croupier(274 kB)42 downloads
File information
File name FULLTEXT01.pdfFile size 274 kBChecksum SHA-512
594b2aec01e73d44021f4af95a61e9f6d8da4e94eb1eec6a992d3f26fb13d7aa275f2457211becab52d859f08163d3d4fd027d8c4ece80e00e59db4a8db8eac5
Type fulltextMimetype application/pdf

Other links

Publisher's full textScopusICDCS 2012

Search in DiVA

By author/editor
Payberah, Amir H.Dowling, Jim
By organisation
Electronic, Computer and Software Systems, ECS
Computer Systems

Search outside of DiVA

GoogleGoogle Scholar
Total: 42 downloads
The number of downloads is the sum of all downloads of full texts. It may include eg previous versions that are now no longer available

doi
urn-nbn

Altmetric score

doi
urn-nbn
Total: 109 hits
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • 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