Performance analysis of burst level bandwidth allocation using multipath routing reservation

The use of high-speed networks to carry bursty traffic, such as IP packets, image, compressed video etc., over ATM networks, requires a new thinking. Instead of controlling connections, we are faced with the problem of controlling the bursts. Thus the new problem is how to control the bursts and how the resources are allocated optimally for the bursty applications. This paper provides performance analysis of a burst level bandwidth allocation algorithm based on multipath/multilinks routing to allocate resources efficiently for real time traffic, where fast reservation of resources in the network is crucial, as the resource availability changes rapidly. In this scheme, different predetermined paths are searched for the extra required resources to accommodate bursts from real time applications in multiple path routes. In the paper, the performance of multipath routing is compared to a single path reservation approach without reattempt (i.e., retry after a failure) and with reattempt allowed. The main performance metrics considered in this paper are network throughput, blocking probability and reservation time delay. The analysis shows that while the multipath reservation algorithm has better performance compared to single path reservation algorithms (either persistent or non persistent), the burst-by-burst connection setup time using multipath reservation is significantly lower than for the single path reservation approaches.