By Topic

Performance model directed call assignment algorithm in a distributed system of dissimilar processors

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
$31 $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)
Bhat, K.V. ; Network Wireless Syst., Lucent Technol., Naperville, IL, USA

In this paper, a new algorithm for scheduling call processing (CP) requests in a distributed system of disparate application processors (AP) connected by any high-speed interconnect is presented. Such systems have applications in wireless communication, automatic call distribution in center applications. The algorithm QR is based on a performance model of the CP scenario within the underlying architecture. It assigns a new CP request to an AP that has the highest promise of completing the task in the least time within the stipulated deadline. It focuses on each CP request in real time, and turns it down only if the system can not handle the call. Further its inability to process a call will have no impact on the decision on the next CP request arrival. The system performance and capacity gains effected by the algorithm are analyzed and illustrated. Thus, in a 2-AP system where one is ten times faster than the other, the QR algorithm processes 17% more busy hour calls (BHC) per second at 1 second mean delay cut-off and 100% more BHC per second at 0.3 second delay cut-off than the existing AP utilization equalization heuristic

Published in:

Computer Communications and Networks, 1999. Proceedings. Eight International Conference on

Date of Conference:

1999