PERFORMANCE MODELING OF DISTRIBUTED AUTOMATIC CALL DISTRIBUTION-SYSTEMS

The number of businesses using Automatic Call Distribution (ACD) syste ms has grown significantly in the last five years. The industry shows all the signs of continued or greater growth in the foreseeable future . While ACD systems have proliferated they have also evolved from fund amentally local to distributed systems. An ACD manager can no longer o ptimize his traffic by using inputs from a simple set of queueing tabl es. The most common system is now a distributed network where subsyste ms interact with each other and cannot be analyzed in isolation. This paper examines the strengths and weaknesses of queueing models that ha ve been used historically with ACD systems and develops modifications to these models (including agents wrap-up times) that are combined wit h queueing network theories to construct an original ACD network perfo rmance algorithm to work with distributed systems.