By Topic

An efficient algorithm for the minimum cost min-max load terminal assignment problem

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

1 Author(s)
Chor Ping Low ; Sch. of Electr. & Electron. Eng., Nanyang Technol. Univ., Singapore, Singapore

One of the main issues to be addressed in topological design of centralized networks is that of assigning terminals to concentrators in such a way that each terminal is assigned to one (and only one) concentrator and the total number of terminals assigned to any concentrator (which is referred to as load in this paper) does not overload that concentrator, i.e. is within the concentrator's capacity. Under these constraints, an assignment with the lowest possible cost is sought. An assignment of terminals to concentrators which minimizes the maximum load among the concentrators (which qualitatively represents congestion at some hot spots in a network service area) is referred to as a min-max load assignment. In this paper, we consider the problem of finding a min-max load assignment with the-lowest cost. We call this problem the Minimum Cost Min-Max Load Terminal Assignment Problem (MCMLTAP). We present an algorithm for MCMLTAP and prove that the problem is optimally solvable in polynomial time using our proposed algorithm.

Published in:

IEEE Communications Letters  (Volume:9 ,  Issue: 11 )