Presentation 2004/7/8
On Lookup Algorithm with a Generalized Kautz-based Distributed Hash Table
Aya OKASHITA, Masayoshi ARITSUGI, Yukio SHIBATA,
PDF Download Page PDF download Page Link
Abstract(in Japanese) (See Japanese page)
Abstract(in English) In peer-to-peer(P2P) networks, it is important to efficiently locate nodes assigned to data items. This paper proposes lookup algorithm with a distributed hash table(DHT) based on generalized Kautz digraphs as a routing table. This is a family of constant-degree routing networks of logarithmic diameter. Generalized Kautz digraphs have an optimal diameter and higher scalability than de Bruijn digraphs. In our method, each node needs to store routing information about only 2 other nodes. Our algorithm guarantees O(log n) hops, for the nurnber of nodes n.
Keyword(in Japanese) (See Japanese page)
Keyword(in English) Peer-to-Peer Network / Distributed Hash Table / Generalized Kautz Digraph / Lookup Algorithm
Paper # DE2004-101
Date of Issue

Conference Information
Committee DE
Conference Date 2004/7/8(1days)
Place (in Japanese) (See Japanese page)
Place (in English)
Topics (in Japanese) (See Japanese page)
Topics (in English)
Chair
Vice Chair
Secretary
Assistant

Paper Information
Registration To Data Engineering (DE)
Language JPN
Title (in Japanese) (See Japanese page)
Sub Title (in Japanese) (See Japanese page)
Title (in English) On Lookup Algorithm with a Generalized Kautz-based Distributed Hash Table
Sub Title (in English)
Keyword(1) Peer-to-Peer Network
Keyword(2) Distributed Hash Table
Keyword(3) Generalized Kautz Digraph
Keyword(4) Lookup Algorithm
1st Author's Name Aya OKASHITA
1st Author's Affiliation Department of Computer Science, Faculty of Engineering, Gunma University()
2nd Author's Name Masayoshi ARITSUGI
2nd Author's Affiliation Department of Computer Science, Faculty of Engineering, Gunma University
3rd Author's Name Yukio SHIBATA
3rd Author's Affiliation Department of Computer Science, Faculty of Engineering, Gunma University
Date 2004/7/8
Paper # DE2004-101
Volume (vol) vol.104
Number (no) 178
Page pp.pp.-
#Pages 6
Date of Issue