CALL CENTERS (CENTRES) - Faculty of Industrial Engineering and ...
CALL CENTERS (CENTRES) - Faculty of Industrial Engineering and ...
CALL CENTERS (CENTRES) - Faculty of Industrial Engineering and ...
Create successful ePaper yourself
Turn your PDF publications into a flip-book with our unique Google optimized e-Paper software.
for evaluating the consistency <strong>of</strong> the service provided to customers.<br />
We analyze force <strong>and</strong> answer consistency algorithms based on three models: Erlang C, M/G/c,<br />
<strong>and</strong> M/G/c with ab<strong>and</strong>onments. Using two weeks <strong>of</strong> directory assistance (DA) field data, we<br />
investigate how well these algorithms model the behavior <strong>of</strong> a real DA operator team. Although<br />
the M/G/c model performs best, our analysis suggests that certain modifications to the simple<br />
M/G/c model could significantly enhance its practical value.<br />
41. Levy, Y., Johri S. Durinovic <strong>and</strong> R.A. Milito. Dynamic network call distribution with periodic<br />
updates. Fundamental Role <strong>of</strong> Teletraffic in the Evolution <strong>of</strong> Telecommunications Networks.<br />
Proceedings <strong>of</strong> the 14th International Teletraffic Congress, ITC-14, Elsevier, Amsterdam, The<br />
Netherl<strong>and</strong>s, 1994, 85–94.<br />
Abstract. The ability to effectively distribute calls in the network to multiple customer sites<br />
has become one <strong>of</strong> the major challenges for the intelligent network. The general goal is to make<br />
effective use <strong>of</strong> available information to improve the load balancing across the sites <strong>and</strong> the overall<br />
service level customers provide to their own clients. This paper introduces a new approach<br />
consisting <strong>of</strong> two coupled algorithms: a traffic allocation algorithm <strong>and</strong> a call distribution algorithm.<br />
The traffic allocation algorithm dynamically generates the proportion <strong>of</strong> global traffic<br />
to be sent to each site in response to periodic updates <strong>of</strong> system state. The call distribution<br />
algorithm converts this time varying allocation into a sequence <strong>of</strong> routing decisions. The paper<br />
demonstrates that this easy-to-implement approach achieves superior performance even when<br />
only a fraction <strong>of</strong> the <strong>of</strong>fered traffic is controllable, provided that the update interval is not<br />
excessively long.<br />
Keywords: Dynamic network call distribution, Periodic updates, Multiple customer sites, Intelligent<br />
network, Load balancing, Overall service level, Coupled algorithms, Traffic allocation<br />
algorithm, Call distribution algorithm, Global traffic, System state, Time-varying allocation,<br />
Routing decisions, Update interval, Traffic management<br />
42. Perry, M. <strong>and</strong> A. Nilsson. Performance modeling <strong>of</strong> automatic call distributors: Operator services<br />
staffing with heterogeneous positions. Fundamental Role <strong>of</strong> Teletraffic in the Evolution <strong>of</strong><br />
Telecommunications Networks. Proceeding <strong>of</strong> the 14th International Teletraffic Congress, ITC-<br />
14. Elsevier, Amsterdam, The Netherl<strong>and</strong>s, 1994, 1023–1032.<br />
Abstract. The telephony industry has introduced a new generation <strong>of</strong> multi-purpose operator<br />
positions, that with their associated automatic call distributor (ACD) allow operators to serve<br />
both toll <strong>and</strong> assist (TA) <strong>and</strong> directory assistance (DA) calls from the same position. When all<br />
operators can serve both TA <strong>and</strong> DA calls <strong>and</strong> all <strong>of</strong> the positions are multi-purpose, classical<br />
Erlang-type queueing models can be used to calculate two important measures: the expected<br />
waiting time for calls <strong>and</strong> the average operator occupancy. However when all <strong>of</strong> the positions<br />
are not multi-purpose (i.e. the operators are a heterogeneous group: some can do both TA <strong>and</strong><br />
DA, some can do just TA <strong>and</strong> some can do just DA) the calculation <strong>of</strong> these two measures is<br />
a new <strong>and</strong> challenging problem. In this paper, approximations for expected waiting times <strong>and</strong><br />
average occupancies are presented, <strong>and</strong> are shown, by comparison to simulation results, to be<br />
quite accurate.<br />
16