Information: Join today and make your research activities more affordable! Technical workshop participation fees and annual registration fees are available at member rates.
Notice: [Important] Announcement of Changes to Registration Fee Payment and Manuscript Upload Procedures for IEICE Technical Meetings
IEICE Technical Committee Submission System
Conference Paper's Information		 Online Proceedings
[Sign in]
Tech. Rep. Archives
 Go Top Page Go Previous   [Japanese] / [English] 

Paper Abstract and Keywords
Presentation 2018-09-04 14:40
Reducing Average Path Lengths of Range Queries on Skip Graphs
Ryohei Banno, Kazuyuki Shudo (Tokyo Tech) IA2018-27
Abstract (in Japanese) (See Japanese page) 
(in English) Structured overlay networks are useful techniques to enable a large number of nodes to discover each other in an autonomous manner. Skip Graph is one of the algorithms of structured overlay networks, which has the capability of range queries. Although there are some existing methods for routing range queries, they have problems of long path length or a large number of messages. In this paper, we propose a novel routing method for range queries in Skip Graph. In the proposed method, each node which receives a range query divides its target range into subranges by the keys of its neighbor nodes, and delegates the subranges to the nodes. The proposed method enables to deliver a range query to all nodes within its target range with a shorter average path length and the minimum number of messages. By simulation experiments, we confirmed that our method can reduce the average path length roughly 30% or more compared to an existing method.
Keyword (in Japanese) (See Japanese page) 
(in English) Skip Graph / Overlay networks / Peer-to-peer networks / Routing algorithms / Range queries / / /  
Reference Info. IEICE Tech. Rep., vol. 118, no. 204, IA2018-27, pp. 69-76, Sept. 2018.
Paper # IA2018-27 
Date of Issue 2018-08-27 (IA) 
ISSN Online edition: ISSN 2432-6380
Copyright
and
reproduction		 All rights are reserved and no part of this publication may be reproduced or transmitted in any form or by any means, electronic or mechanical, including photocopy, recording, or any information storage and retrieval system, without permission in writing from the publisher. Notwithstanding, instructors are permitted to photocopy isolated articles for noncommercial classroom use without fee. (License No.: 10GA0019/12GB0052/13GB0056/17GB0034/18GB0034)
Download PDF IA2018-27

Conference Information
Committee IA  
Conference Date 2018-09-03 - 2018-09-04 
Place (in Japanese) (See Japanese page) 
Place (in English) Hokkaido Univ. Conference Hall 
Topics (in Japanese) (See Japanese page) 
Topics (in English) Internet Operation and Management, etc. 
Paper Information
Registration To IA 
Conference Code 2018-09-IA 
Language Japanese 
Title (in Japanese) (See Japanese page) 
Sub Title (in Japanese) (See Japanese page) 
Title (in English) Reducing Average Path Lengths of Range Queries on Skip Graphs 
Sub Title (in English)  
Keyword(1) Skip Graph  
Keyword(2) Overlay networks  
Keyword(3) Peer-to-peer networks  
Keyword(4) Routing algorithms  
Keyword(5) Range queries  
Keyword(6)  
Keyword(7)  
Keyword(8)  
1st Author's Name Ryohei Banno  
1st Author's Affiliation Tokyo Institute of Technology (Tokyo Tech)
2nd Author's Name Kazuyuki Shudo  
2nd Author's Affiliation Tokyo Institute of Technology (Tokyo Tech)
3rd Author's Name  
3rd Author's Affiliation ()
4th Author's Name  
4th Author's Affiliation ()
5th Author's Name  
5th Author's Affiliation ()
6th Author's Name  
6th Author's Affiliation ()
7th Author's Name  
7th Author's Affiliation ()
8th Author's Name  
8th Author's Affiliation ()
9th Author's Name  
9th Author's Affiliation ()
10th Author's Name  
10th Author's Affiliation ()
11th Author's Name  
11th Author's Affiliation ()
12th Author's Name  
12th Author's Affiliation ()
13th Author's Name  
13th Author's Affiliation ()
14th Author's Name  
14th Author's Affiliation ()
15th Author's Name  
15th Author's Affiliation ()
16th Author's Name  
16th Author's Affiliation ()
17th Author's Name  
17th Author's Affiliation ()
18th Author's Name  
18th Author's Affiliation ()
19th Author's Name  
19th Author's Affiliation ()
20th Author's Name  
20th Author's Affiliation ()
21st Author's Name  
21st Author's Affiliation ()
22nd Author's Name  
22nd Author's Affiliation ()
23rd Author's Name  
23rd Author's Affiliation ()
24th Author's Name  
24th Author's Affiliation ()
25th Author's Name  
25th Author's Affiliation ()
26th Author's Name / /
26th Author's Affiliation ()
()
27th Author's Name / /
27th Author's Affiliation ()
()
28th Author's Name / /
28th Author's Affiliation ()
()
29th Author's Name / /
29th Author's Affiliation ()
()
30th Author's Name / /
30th Author's Affiliation ()
()
31st Author's Name / /
31st Author's Affiliation ()
()
32nd Author's Name / /
32nd Author's Affiliation ()
()
33rd Author's Name / /
33rd Author's Affiliation ()
()
34th Author's Name / /
34th Author's Affiliation ()
()
35th Author's Name / /
35th Author's Affiliation ()
()
36th Author's Name / /
36th Author's Affiliation ()
()
Speaker Author-1 
Date Time 2018-09-04 14:40:00 
Presentation Time 25 minutes 
Registration for IA 
Paper # IA2018-27 
Volume (vol) vol.118 
Number (no) no.204 
Page pp.69-76 
#Pages 8 
Date of Issue 2018-08-27 (IA) 

[Return to Top Page]

[Return to IEICE Web Page]
The Institute of Electronics, Information and Communication Engineers (IEICE), Japan