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 2014-04-17 13:20
Comparison of Load Balancing Designed for Requests Following Zipfian Distribution and Hybrid Load Balancer Using Round-Robin and Consistent Hashing
Takao Yamashita, Hiroyuki Kurita, Naoki Takada, Kenji Ota (NTT) NS2014-7
Abstract (in Japanese) (See Japanese page) 
(in English) In this paper, we evaluate, by simulation, how much amount of memory a load balancing method we previously proposed to process requests that follow a Zipfian distribution can decrease compared with a hybrid load balancing method that is composed of round-robin and consistent hashing. A Zipfian distribution has extremely large variance. This large variance of a Zipfian distribution leads to the imbalance of server loads. To solve this problem, we previously proposed a method that achieves load balancing among servers processing requests with a Zipf-like distribution, where every request has a key used to identify a service. In the previously proposed method, the range of key ranks, which are the places in the order of how frequently the key is used, is divided into three regions: hot, normal, and cold zones, where one of three different ways to process requests is used for every zone. To process requests with keys in the hot and cold zones, round-robin load balancing and consistent hashing are used, respectively. In addition, in order to process requests with keys in the normal zone, requests are processed by a number of servers that is less than the number of all servers. The simulation showed that the previously proposed method can significantly decrease the amount of memory compared with the hybrid method under some conditions and it needs almost the same amount of memory as the previously proposed method does under the other conditions.
Keyword (in Japanese) (See Japanese page) 
(in English) Zipfian distribution / scale out / round robin / consistent hashing / load balancing / / /  
Reference Info. IEICE Tech. Rep., vol. 114, no. 6, NS2014-7, pp. 33-38, April 2014.
Paper # NS2014-7 
Date of Issue 2014-04-10 (NS) 
ISSN Print edition: ISSN 0913-5685    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 NS2014-7

Conference Information
Committee NS  
Conference Date 2014-04-17 - 2014-04-18 
Place (in Japanese) (See Japanese page) 
Place (in English) Ishigaki-City-Hall 
Topics (in Japanese) (See Japanese page) 
Topics (in English) Traffic, Network evaluation, Performance, Resource Management/Control, Traffic Engineering, Reliability, Resiliency 
Paper Information
Registration To NS 
Conference Code 2014-04-NS 
Language Japanese 
Title (in Japanese) (See Japanese page) 
Sub Title (in Japanese) (See Japanese page) 
Title (in English) Comparison of Load Balancing Designed for Requests Following Zipfian Distribution and Hybrid Load Balancer Using Round-Robin and Consistent Hashing 
Sub Title (in English)  
Keyword(1) Zipfian distribution  
Keyword(2) scale out  
Keyword(3) round robin  
Keyword(4) consistent hashing  
Keyword(5) load balancing  
Keyword(6)  
Keyword(7)  
Keyword(8)  
1st Author's Name Takao Yamashita  
1st Author's Affiliation Nippon Telegraph and Telephone Corporation (NTT)
2nd Author's Name Hiroyuki Kurita  
2nd Author's Affiliation Nippon Telegraph and Telephone Corporation (NTT)
3rd Author's Name Naoki Takada  
3rd Author's Affiliation Nippon Telegraph and Telephone Corporation (NTT)
4th Author's Name Kenji Ota  
4th Author's Affiliation Nippon Telegraph and Telephone Corporation (NTT)
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 2014-04-17 13:20:00 
Presentation Time 25 minutes 
Registration for NS 
Paper # NS2014-7 
Volume (vol) vol.114 
Number (no) no.6 
Page pp.33-38 
#Pages 6 
Date of Issue 2014-04-10 (NS) 

[Return to Top Page]

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