Pastry: Scalable, decentralized object location, and routing for large-scale peer-to-peer systems. This paper presents the design and evaluation of Pastry, a scalable, distributed object location and routing substrate for wide-area peer-to-peer applications. Pastry performs application-level routing and object location in a potentially very large overlay network of nodes connected via the Internet. It can be used to support a variety of peer-to-peer applications, including global data storage, data sharing, group communication and naming. par Each node in the Pastry network has a unique identifier (nodeId). When presented with a message and a key, a Pastry node efficiently routes the message to the node with a nodeId that is numerically closest to the key, among all currently live Pastry nodes. Each Pastry node keeps track of its immediate neighbors in the nodeId space, and notifies applications of new node arrivals, node failures and recoveries. Pastry takes into account network locality; it seeks to minimize the distance messages travel, according to a to scalar proximity metric like the number of IP routing hops. par Pastry is completely decentralized, scalable, and self-organizing; it automatically adapts to the arrival, departure and failure of nodes. Experimental results obtained with a prototype implementation on an emulated network of up to 100,000 nodes confirm Pastry’s scalability and efficiency, its ability to self-organize and adapt to node failures, and its good network locality properties.

References in zbMATH (referenced in 102 articles )

Showing results 1 to 20 of 102.
Sorted by year (citations)

1 2 3 4 5 6 next

  1. Ferrucci, L.; Ricci, L.; Albano, M.; Baraglia, R.; Mordacchini, M.: Multidimensional range queries on hierarchical Voronoi overlays (2016)
  2. Rocha, Vladimir; Kon, Fabio; Cobe, Raphael; Wassermann, Renata: A hybrid cloud-P2P architecture for multimedia information retrieval on VoD services (2016) ioport
  3. Brodal, Gerth Stølting; Sioutas, Spyros; Tsichlas, Kostas; Zaroliagis, Christos: $D^2$-tree: a new overlay with deterministic bounds (2015)
  4. Kapelko, Rafał; Marchwicki, Karol: Uniformity of direct unions of Chord (2015)
  5. Kniesburges, Sebastian; Koutsopoulos, Andreas; Scheideler, Christian: A deterministic worst-case message complexity optimal solution for resource discovery (2015)
  6. Kutten, Shay; Pandurangan, Gopal; Peleg, David; Robinson, Peter; Trehan, Amitabh: Sublinear bounds for randomized leader election (2015)
  7. Montanari, Ugo; Sammartino, Matteo: Network-conscious $\pi$-calculus -- a model of Pastry (2015)
  8. Joung, Yuh-Jzer; Yang, Li-Wei: On character-based index schemes for complex wildcard search in peer-to-peer networks (2014)
  9. Baldoni, Roberto; Bonomi, Silvia; Cerocchi, Adriano; Querzoni, Leonardo: Virtual tree: a robust architecture for interval valid queries in dynamic distributed systems (2013) ioport
  10. Bertier, Marin; Obrovac, Marko; Tedeschi, Cédric: Adaptive atomic capture of multiple molecules (2013) ioport
  11. Bonnaire, Xavier: Fixed interval nodes estimation: an accurate and low cost algorithm to estimate the number of nodes in Distributed Hash Tables (2013) ioport
  12. Delporte-Gallet, Carole; Fauconnier, Hugues; Guerraoui, Rachid; Kermarrec, Anne-Marie; Ruppert, Eric; Tran-The, Hung: Byzantine agreement with homonyms (2013)
  13. Kutten, Shay; Pandurangan, Gopal; Peleg, David; Robinson, Peter; Trehan, Amitabh: Sublinear bounds for randomized leader election (2013)
  14. Matos, Miguel; Schiavoni, Valerio; Felber, Pascal; Oliveira, Rui; Rivière, Etienne: Lightweight, efficient, robust epidemic dissemination (2013) ioport
  15. Nor, Rizal Mohd; Nesterenko, Mikhail; Scheideler, Christian: Corona: a stabilizing deterministic message-passing skip list (2013)
  16. Yu, Chen; Yao, Dezhong; Li, Xi; Zhang, Yan; Yang, Laurence T.; Xiong, Naixue; Jin, Hai: Location-aware private service discovery in pervasive computing environment (2013) ioport
  17. Clouser, Thomas; Nesterenko, Mikhail; Scheideler, Christian: Tiara: a self-stabilizing deterministic skip list and skip graph (2012)
  18. Gracia-Tinedo, Raúl; García-López, Pedro; Sánchez-Artigas, Marc: Sophia: a local trust system to secure key-based routing in non-deterministic DHTs (2012) ioport
  19. Klampanos, Iraklis A.; Jose, Joemon M.: Searching in peer-to-peer networks (2012) ioport
  20. Mondéjar, Rubén; García-López, Pedro; Fernández-Casado, Enrique; Pairot, Carles: TaKo: providing transparent collaboration on single-user applications (2012) ioport

1 2 3 4 5 6 next