Summary: Proceedings of 24th Conference
on Decision and Control
Ft. Lauderdale, FL 9 December 1985
FP11 - 5:30
A GEXERALIZATION OF THE ERLASG FORXIULA OF TRAFFIC ENGINEERING
\'. i\nantharam* and B.Gopinath**
* Department of Electrical Engineering and Computer Science
and Electronics Research Laboratory
University of California, Berkeley.
** Bell Communications Research Inc., Morristown. New Jersey.
Consideranode in a communication network with n out-
going links grouped into k trunks of n1....nA links respectively.
n lt...+nA= n . Calls arrive in a Poisson stream of rate X. The
state of the node is specified by the number of idle links in each
trunk.A policy is arulebywhichacall, finding thenode in
some state, is assigned to one of the available links in one of the
exponentialholdingtimeswith mean -. whichareindepen-
dent, and are independent of the arrival process. Further. a call