Research Of Storage-based Routing And Resource Allocation Algorithms In Circuit Switching Networks

Nowadays,the rapid development of the Internet leads to the exponential increase of Internet users and applications.The contradiction between the large volume of network traffic and the limited network resources has become inceasingly severe.To address this problem,it is of great significance to make full use of network resources to efficiently serve massive data transmission.Circuit switching technology has been widely used for bulky data transfer,due to its advantages over packet switching such as deterministic delay,guaranteed bandwidth and low jitter.However,the end-to-end circuit provisioning mechanism will cause bandwidth resource wastage.Traditional circuit switching requires each link along a path to provide the same bandwidth capacity during the path establishment process.But the fact is,due to the diversity of internet users' needs(different bandwidth required,different source and destination addresses,and different request durations),network resource distribution is in an imbalance state.As a result,the traditional end-to-end circuit provisioning mechanism may be bottlenecked by the link that has the least amount of available bandwidth.Therefore,the link utilization can be fundamentally improved if we can solve the problem of bandwidth wastage brought by traditional end-to-end circuit provisioning mechanism.This paper proposes to deploy storage capacity at intermediate nodes along a path for circuit switched networks and introduces an efficient routing and resoure allocation algorithm Store Wait Forward(SWF)that allows different bandwidth allocations from link to link along a path.Simulation results demonstrate that our storage-based approach can efficiently reduce blocking rate,improve average link utilization,and is well suited for delay-insensitive applications.