Title :
Markov decision algorithms for dynamic routing (telephone networks)
Author_Institution :
Bellcore, Redbank, NJ, USA
Abstract :
The nature of the traffic-routing problem is described, and early studies of state-dependent routing are noted. A state-dependent scheme seeks to route each call so as to minimize the risk of blocking future calls, and thus responds to the current state of the network on the basis of certain assumptions about future traffic demands. State-dependent routing is considered as a Markov decision process. How the relative costs can be determined for the case of direct routing is shown.<>
Keywords :
Markov processes; circuit switching; decision theory; switching networks; telephone networks; telephone traffic; Markov decision algorithms; direct routing; dynamic routing; state-dependent routing; telephone networks; traffic-routing; Communication system traffic control; Error correction; Feedback control; Heuristic algorithms; Load forecasting; Routing; Telecommunication traffic; Telephony; Time measurement;
Journal_Title :
Communications Magazine, IEEE
