This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
37th Annual IEEE Conference on Local Computer Networks
Distributed client-server assignment
Clearwater Beach, FL, USA USA
October 22-October 25
ISBN: 978-1-4673-1565-4
Thuan Duong-Ba, School of EECS, Oregon State University, Corvallis, 97330, USA
Thinh Nguyen, School of EECS, Oregon State University, Corvallis, 97330, USA
For many Internet systems, clients (users) interact with each other indirectly via intermediate servers. In such systems, it is crucial to assign users to servers based on the interaction patterns among the users, in such a way to reduce communication costs and to balance loads among the servers. Finding the optimal client-server assignment has been previously shown to be NP-complete, and approximate centralized solutions have been proposed. In this paper, we present a distributed scheme for finding an approximately optimal client-server assignment in which the servers exchange and update information about their loads iteratively among themselves. Based on these, they make decisions to reassign their users to others iteratively so that final client-server assignment is approximately optimal. Theoretical results on the convergence rate and complexity of the proposed algorithm are presented. Simulations results show the effectiveness of the proposed algorithm for different patterns of user interactions.
Index Terms:
Servers,Silicon,Linear programming,Approximation algorithms,Heuristic algorithms,Partitioning algorithms,Distributed algorithms,large scale application,Distributed optimization,distributed graph partitioning
Citation:
Thuan Duong-Ba, Thinh Nguyen, "Distributed client-server assignment," lcn, pp.296-299, 37th Annual IEEE Conference on Local Computer Networks, 2012
Usage of this product signifies your acceptance of the Terms of Use.