Arpeggio: Metadata Searching and Content Sharing with Chord

  • Austin T. Clements
  • Dan R. K. Ports
  • David R. Karger
Part of the Lecture Notes in Computer Science book series (LNCS, volume 3640)


Arpeggio is a peer-to-peer file-sharing network based on the Chord lookup primitive. Queries for data whose metadata matches a certain criterion are performed efficiently by using a distributed keyword-set index, augmented with index-side filtering. We introduce index gateways, a technique for minimizing index maintenance overhead. Because file data is large, Arpeggio employs subrings to track live source peers without the cost of inserting the data itself into the network. Finally, we introduce postfetching, a technique that uses information in the index to improve the availability of rare files. The result is a system that provides efficient query operations with the scalability and reliability advantages of full decentralization, and a content distribution system tuned to the requirements and capabilities of a peer-to-peer network.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    BitTorrent protocol specification,
  2. 2.
    Dabek, F., Kaashoek, M.F., Karger, D., Morris, R., Stoica, I.: Wide-area cooperative storage with CFS. In: Proc. SOSP 2001 (October 2001)Google Scholar
  3. 3.
    Dabek, F., Li, J., Sit, E., Robertson, J., Kaashoek, M.F., Morris, R.: Designing a DHT for low latency and high throughput. In: Proc. NSDI 2004 (March 2004)Google Scholar
  4. 4.
  5. 5.
    Freedman, M.J., Freudenthal, E., Mazières, D.: Democratizing content publication with Coral. In: Proc. NSDI 2004 (March 2004)Google Scholar
  6. 6.
    Gnawali, O.: A keyword set search system for peer-to-peer networks. Master’s thesis, Massachusetts Institute of Technology (June 2002)Google Scholar
  7. 7.
    Gummadi, K.P., Dunn, R.J., Sariou, S., Gribble, S.D., Levy, H.M., Zahorjan, J.: Measurement, modeling, and analysis of a peer-to-peer file-sharing workload. In: Proc. SOSP 2003 (October 2003)Google Scholar
  8. 8.
    Karger, D.R., Ruhl, M.: Diminished Chord: A protocol for heterogeneous subgroup formation in peer-to-peer networks. In: Voelker, G.M., Shenker, S. (eds.) IPTPS 2004. LNCS, vol. 3279, pp. 288–297. Springer, Heidelberg (2005)CrossRefGoogle Scholar
  9. 9.
    Li, J., Loo, B.T., Hellerstein, J.M., Kaashoek, M.F., Karger, D., Morris, R.: On the feasibility of peer-to-peer web indexing and search. In: Kaashoek, M.F., Stoica, I. (eds.) IPTPS 2003. LNCS, vol. 2735. Springer, Heidelberg (2003)CrossRefGoogle Scholar
  10. 10.
    Maymounkov, P., Mazières, D.: Kademlia: A peer-to-peer information system based on the XOR metric. In: Druschel, P., Kaashoek, M.F., Rowstron, A. (eds.) IPTPS 2002. LNCS, vol. 2429, p. 53. Springer, Heidelberg (2002)CrossRefGoogle Scholar
  11. 11.
    Muthitacharoen, A., Chen, B., Mazières, D.: A low-bandwidth network file system. In: Proc. SOSP 2001 (October 2001)Google Scholar
  12. 12.
  13. 13.
    Reynolds, P., Vahdat, A.: Efficient peer-to-peer keyword searching. In: Endler, M., Schmidt, D.C. (eds.) Middleware 2003. LNCS, vol. 2672. Springer, Heidelberg (2003)CrossRefGoogle Scholar
  14. 14.
    Stoica, I., Morris, R., Liben-Nowell, D., Karger, D.R., Kaashoek, M.F., Dabek, F., Balakrishnan, H.: Chord: a scalable peer-to-peer lookup protocol for internet applications. IEEE/ACM Trans. Netw. 11(1), 17–32 (2003)CrossRefGoogle Scholar
  15. 15.
    Tang, C., Dworkadas, S.: Hybrid local-global indexing for efficient peer-to-peer information retrieval. In: Proc. NSDI 2004 (March 2004)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2005

Authors and Affiliations

  • Austin T. Clements
    • 1
  • Dan R. K. Ports
    • 1
  • David R. Karger
    • 1
  1. 1.MIT Computer Science and Artificial Intelligence LaboratoryCambridgeUSA

Personalised recommendations