Dynamic capacity allocation and optimal rearrangement for reconfigurable networks

Abstract

This paper presents some suitable techniques for assigning and managing bandwidth demands on a logically meshed network so as to enhance the network's traffic carrying ability. The techniques are used to: (a) generate eligible paths for capacity allocation, (b) allocate capacity and (c) reconfigure the logical network. They were tested through simulation studies on a sample network. Selected numerical results are presented. A good dynamic capacity allocation (DCA) scheme will minimise the frequency of global reconfigurations required to maintain a low blocking rate. This is desirable because reconfiguration incurs costly computational and management overheads. DCA is performed on a demand by demand basis. For each of the DCA schemes, if a direct route (1 hop) exists and has sufficient available capacity, it is used for routing. The relevant DCA scheme only comes into play when no such direct route exists.