Providing KBR service for multiple applications.
IPTPS'08: Proceedings of the 7th international conference on Peer-to-peer systems(2008)
摘要
Key based routing (KBR) enables peer-to-peer applications to create and use distributed services. KBR is more flexible than distributed hash tables (DHT). However, the broader the application area, the more important become performance issues for a KBR service. In this paper, we present a novel approach to provide a generic KBR service. Its key idea is to use a predictable address assignment scheme. This scheme allows peers to calculate the overlay address of the node that is responsible for a given key and application ID. A public DHT service such as OpenDHT can then resolve this overlay address to the transport address of the respective peer. We compare our solution to alternative proposals such as ReDiR and Diminished Chord. We conclude that our solution has a better worst case complexity for some important KBR operations and the required state. In particular, unlike ReDiR, our solution can guarantee a low latency for KBR route operations.
更多查看译文
关键词
overlay address,KBR route operation,KBR service,generic KBR service,important KBR operation,predictable address assignment scheme,transport address,key idea,public DHT service,application ID,Providing KBR service,multiple application
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络