By Topic

Distributed client-server assignment

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Thuan Duong-Ba ; School of EECS, Oregon State University, Corvallis, 97330, USA ; Thinh Nguyen

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.

Published in:

Local Computer Networks (LCN), 2012 IEEE 37th Conference on

Date of Conference:

22-25 Oct. 2012