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 2024-03-01 09:20
Asynchronous UDP Random Walk method with path reuse for geo-distributed graph analysis
Shun Takizawa, Tsuyoshi Yamashita, Kunitake Kaneko (Keio Univ.) IN2023-88
Abstract (in Japanese) (See Japanese page) 
(in English) Random Walk (RW) is widely used in graph analysis. Graph data for analysis has been getting larger and larger in recent years, and it is not unusual for them to be kept in a geographically dispersed environment instead of being concentrated in a single location due to the limitation of transfer cost over WANs and privacy regulations. However, in such a WAN environment, not only do RTT and packet loss rate increase, but also graph partitioning, which requires an overall understanding of the graph, becomes difficult to apply. As a result, the existing RW method, which mainly targets graph data stored in a single datacenter, results in a significant degradation of computing performance when applied to a WAN environment. In this research, we propose a distributed graph RW engine that adapts to geographically distributed environments. The proposed method employs asynchronous processing using UDP communication, by paying attention to features of RW operations. Furthermore, the proposed method reduces the amount of communication by reusing Random Walker routes. Experimental results under the RTT of 100ms and packet loss ratio of 0.03% show that the proposed method is 1.6 (without route reuse) to 7.1 (with route reuse) times faster than the existing methods. Unlike existing methods, the proposed method is effective when the RTT, and packet loss rate are large and the accuracy of graph partitioning is poor. The proposed method is also found to have good scalability with respect to the system size because, in the experiment when the number of servers is increased from 3 to 7, the performance of the proposed method is improved by 4%, while that of the existing methods is degraded by 39%.
Keyword (in Japanese) (See Japanese page) 
(in English) Random Walk / graph analysis / asynchronous processing / distributed processing / UDP / Geo-Distributed / /  
Reference Info. IEICE Tech. Rep., vol. 123, no. 398, IN2023-88, pp. 136-141, Feb. 2024.
Paper # IN2023-88 
Date of Issue 2024-02-22 (IN) 
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 IN2023-88

Conference Information
Committee NS IN  
Conference Date 2024-02-29 - 2024-03-01 
Place (in Japanese) (See Japanese page) 
Place (in English) Okinawa Convention Center 
Topics (in Japanese) (See Japanese page) 
Topics (in English) General 
Paper Information
Registration To IN 
Conference Code 2024-02-NS-IN 
Language Japanese 
Title (in Japanese) (See Japanese page) 
Sub Title (in Japanese) (See Japanese page) 
Title (in English) Asynchronous UDP Random Walk method with path reuse for geo-distributed graph analysis 
Sub Title (in English)  
Keyword(1) Random Walk  
Keyword(2) graph analysis  
Keyword(3) asynchronous processing  
Keyword(4) distributed processing  
Keyword(5) UDP  
Keyword(6) Geo-Distributed  
Keyword(7)  
Keyword(8)  
1st Author's Name Shun Takizawa  
1st Author's Affiliation Keio University (Keio Univ.)
2nd Author's Name Tsuyoshi Yamashita  
2nd Author's Affiliation Keio University (Keio Univ.)
3rd Author's Name Kunitake Kaneko  
3rd Author's Affiliation Keio University (Keio Univ.)
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 2024-03-01 09:20:00 
Presentation Time 25 minutes 
Registration for IN 
Paper # IN2023-88 
Volume (vol) vol.123 
Number (no) no.398 
Page pp.136-141 
#Pages 6 
Date of Issue 2024-02-22 (IN) 

[Return to Top Page]

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