Bandwidth allocation scheme in ATM networks based on virtual path for different quality of service (QoS) requirements

Abstract

We consider the bandwidth allocation scheme of ATM networks based on the virtual path (VP) concept. The bandwidth is allocated individually for supporting different traffic classes with different QoS requirements within a VP. By applying the Markov modulated deterministic process method, different models of VP combinations are proposed in order to compute the minimum capacity and buffer size required to satisfy the entire QoS requirements when multiple classes of on-off sources are multiplexed into UP. Combinations of static VP, called static bandwidth allocation, are proposed to achieve the optimum total capacity, and total buffer required for satisfying the individual QoS requirements. Further, by revising the existing algorithms and cell loss probability function, different priority assignments of VP combination, called dynamic bandwidth allocation, are also proposed to compute the minimum capacity and buffer size. Simulations of these schemes are carried out to evaluate their performance.