An analytical approach to the dynamic topology problem

Currently, it is possible to modify (say, hourly) the topology of a data communications network by adding or deleting network links and/or by increasing or decreasing bandwidth on existing links in response to changing traffic loads and/or projected network conditions. The intent of this paper is to study a Markov decision process (MDP) model of the dynamic topology problem (DTP), the problem of activating and/or deleting links, as a function of the current traffic in the network and of the most recent network topology design. We present a decomposition of this model and structural results for the decomposition. The decomposition and structural results enhance the tractability of procedures for determining optimal link control policies. A numerical example is used to illustrate these results.Research supported by ARO Contract No. DAAG-29-85-K0089, NSF Grant No. ECS-8708183, and DCA Contract No. DCA 100-89-C-0031.