Journal of Beijing University of Posts and Telecommunications

  • EI核心期刊

JOURNAL OF BEIJING UNIVERSITY OF POSTS AND TELECOM ›› 2017, Vol. 40 ›› Issue (s1): 48-52.doi: 10.13190/j.jbupt.2017.s.011

Previous Articles     Next Articles

Parallel Routing Algorithm for Call Centers Based on Local Mutual Exclusion

ZHANG Wen-tao1,2, SHUANG Kai1, WAN Neng3, ZHAN Shu-bo1, SU Sen1   

  1. 1. State Key Laboratory of Networking and Switching, Beijing University of Posts and Telecommunications, Beijng 100876, China;
    2. China Electronics Technology Group Corporation 54 th Research Institute, Science and Technology on Information Transmission and Dissemination in Communication Networks Laboratory, Shijiazhuang 050081, China;
    3. Electric Engineer School, Beijing University of Posts and Telecommunications, Beijng 100876, China
  • Received:2016-05-03 Online:2017-09-28 Published:2017-09-28

Abstract: A parallel routing method named parallel call center routing method(PCCRM) was proposed to promote the multiprocessing performance of call center system with multi-skill model. Through refinement of resource, PCCRM reduced the general mutual exclusion to local mutual exclusion, which can markedly reduce the waiting of process synchronization. Meanwhile an orderly competition model was introduced to guarantee the algorithm to meet the requirement of general principle of call center's agents. The experimental results showed that the PCCRM could increase system performance and scalability of routing algorithm.

Key words: call center routing, agent skills, critical resource, mutual exclusion

CLC Number: