Optimal dynamic virtual path bandwidth allocation and restoration in ATM networks
Alexander Gersht, Alex Shulman · 2002
This paper presents an optimal dynamic virtual path (VP) bandwidth allocation and restoration scheme for mesh ATM networks (in the context of the layered traffic control architecture). The scheme integrates the dynamics of demand admission, VP bandwidth allocation, and logical spare capacity assignment for maximizing network throughput while ensuring full traffic restorability. We present an optimal parallel algorithm that minimizes the total rejected bandwidth demand and cell loss while satisfying the maximal cell loss, delay, and 100% restorability requirements for a given set of failure scenarios. The optimal spare capacity assignment in the presented approach follows directly from the network admission and bandwidth allocation decisions. The algorithm also equalizes cell losses on the VPs thus providing cell-level fairness.