A Markov decision problem in Clos switch networks

Formulates the dynamic internal blocking problem in a Clos switch network as a standard Markov decision problem. To this end, the authors introduce a connection matrix to represent the connection status of a Clos network and define a blocking coefficient to measure the possibility of internal blockings for future calls. The author proposes a strategy as a suboptimal solution to this problem. The analysis provides a rationale for the well-known packing approach, and the proposed strategy is its extension. Simulation results are given to illustrate the performance of the proposed strategy