Loading...

Proximity-Aware balanced allocations in cache networks

Pourmiri, A ; Sharif University of Technology | 2017

404 Viewed
  1. Type of Document: Article
  2. DOI: 10.1109/IPDPS.2017.24
  3. Publisher: Institute of Electrical and Electronics Engineers Inc , 2017
  4. Abstract:
  5. We consider load balancing in a network of caching servers delivering contents to end users. Randomized load balancing via the so-called power of two choices is a well-known approach in parallel and distributed systems that reduces network imbalance. In this paper, we propose a randomized load balancing scheme which simultaneously considers cache size limitation and proximity in the server redirection process. Since the memory limitation and the proximity constraint cause correlation in the server selection process, we may not benefit from the power of two choices in general. However, we prove that in certain regimes, in terms of memory limitation and proximity constraint, our scheme results in the maximum load of order Θ(log log n) (here n is the number of servers and requests), and at the same time, leads to a low communication cost. This is an exponential improvement in the maximum load compared to the scheme which assigns each request to the nearest available replica. Finally, we investigate our scheme performance by extensive simulations. © 2017 IEEE
  6. Keywords:
  7. Balls-into-Bins ; Communication Cost ; Content Delivery Networks ; Distributed Caching Servers ; Load Balancing ; Randomized Algorithms ; Request Routing ; Distributed computer systems ; Resource allocation ; Communication cost ; Content delivery network ; Distributed caching ; Randomized Algorithms ; Request Routing ; Servers
  8. Source: 31st IEEE International Parallel and Distributed Processing Symposium, IPDPS 2017, 29 May 2017 through 2 June 2017 ; 2017 , Pages 1068-1077 ; 9781538639146 (ISBN)
  9. URL: https://ieeexplore.ieee.org/document/7967197