Chapter

Peer-to-Peer Systems

Volume 2429 of the series Lecture Notes in Computer Science pp 34-44

Date:

Brocade: Landmark Routing on Overlay Networks

  • Ben Y. ZhaoAffiliated withComputer Science Division, U. C. Berkeley
  • , Yitao DuanAffiliated withComputer Science Division, U. C. Berkeley
  • , Ling HuangAffiliated withComputer Science Division, U. C. Berkeley
  • , Anthony D. JosephAffiliated withComputer Science Division, U. C. Berkeley
  • , John D. KubiatowiczAffiliated withComputer Science Division, U. C. Berkeley

* Final gross prices may vary according to local VAT.

Get Access

Abstract

Recent work such as Tapestry, Pastry, Chord and CAN provide efficient location utilities in the form of overlay infrastructures. These systems treat nodes as if they possessed uniform resources, such as network bandwidth and connectivity. In this paper, we propose a systemic design for a secondaryoverlay of super-nodes which can be used to deliver messages directly to the destination’s local network, thus improving route efficiency. We demonstrate the potential performance benefits by proposing a name mapping scheme for a Tapestry-Tapestry secondary overlay, and show preliminary simulation results demonstrating significant routing performance improvement.