Presentation 2013-01-25
A Skip Graph-Based Overlay Network That Allows Fast Key Insertion and Lookup
Yuta HARIMA, Kota ABE, Hayato ISHIBASHI, Toshio MATSUURA,
PDF Download Page PDF download Page Link
Abstract(in Japanese) (See Japanese page)
Abstract(in English) In this paper, we propose techniques to improve insertion and lookup time of skip graphs, a kind of structured overlay network that consist of multiple levels of doubly-linked lists. We introduce several techniques such as (1) each node maintains multiple pointers for leftward nodes in addition to the immediate left and right pointers, and (2) a routing table at each level maintains the information about the linked lists at the next higher level. The effectiveness of the method was experimentally confirmed by simulations.
Keyword(in Japanese) (See Japanese page)
Keyword(in English) P2P / Structured Overlay Network / Skip Graph / DDLL
Paper # IN2012-148
Date of Issue

Conference Information
Committee IN
Conference Date 2013/1/17(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 Information Networks (IN)
Language JPN
Title (in Japanese) (See Japanese page)
Sub Title (in Japanese) (See Japanese page)
Title (in English) A Skip Graph-Based Overlay Network That Allows Fast Key Insertion and Lookup
Sub Title (in English)
Keyword(1) P2P
Keyword(2) Structured Overlay Network
Keyword(3) Skip Graph
Keyword(4) DDLL
1st Author's Name Yuta HARIMA
1st Author's Affiliation Graduate School for Creative Cities, Osaka City University()
2nd Author's Name Kota ABE
2nd Author's Affiliation Graduate School for Creative Cities, Osaka City University
3rd Author's Name Hayato ISHIBASHI
3rd Author's Affiliation Graduate School for Creative Cities, Osaka City University
4th Author's Name Toshio MATSUURA
4th Author's Affiliation Graduate School for Creative Cities, Osaka City University
Date 2013-01-25
Paper # IN2012-148
Volume (vol) vol.112
Number (no) 393
Page pp.pp.-
#Pages 6
Date of Issue