Performance analysis of storage-based routing for circuit-switched networks

Circuit-switching technology has been widely used for bulky data transfers due to its advantages over packet switching, such as deterministic delay, guaranteed bandwidth, and low jitter. However, the traditional end-to-end circuit provisioning mechanism may be bottlenecked by the link that has the least amount of available bandwidth. To solve this problem, this paper proposes to deploy storage capacity at intermediate nodes along a path for circuit-switched networks and introduces an efficient routing algorithm that allows different bandwidth allocations from link to link along a path. The simulation results demonstrate that our storage-based approach can efficiently reduce the blocking rate and improve average link utilization and is well suited for delay-insensitive applications.