DIVA: A DIstributed & dynamic VP management Algorithm
S. Srinivasan, Malathi Veeraraghavan · 1997
The concept of preestablishing Virtual Path Connections (VPCs) in ATM networks offers a number of advantages, such as simplified on-demand connection setup and fault management. However, preallocation of bandwidth resources to VPCs minimizes resource sharing and leads to poor resource utilization. This is especially true if the VPC bandwidth allocations are computed allowing for some uncertainty in traffic characterization. In this paper, we propose DIVA, an algorithm for distributed and dynamic VPC bandwidth management. DIVA alleviates the problem of poor VPC resource utilization by dynamically adjusting VPC bandwidth allocations, thus minimizing the effect of traffic uncertainty. This algorithm is proposed for hierarchical networks based on the ATM Forum’s PNNI routing standard. Using hooks provided by PNNI routing, network nodes monitor VPC bandwidth usage, make dynamic VPC bandwidth/buffer modifications, and set up and remove VPCs dynamically. This algorithm also handles the additions and failures of network elements such as links and switches.