Abstract
In this thesis, we extend the schedulable region concept from a mission control for one link only to a network-wide routing and admission approach in ATM networks. We assume that four traffic types traverse the network, i.e., constant bit-rate traffic, voice traffic, video traffic and data traffic. Each of these traffic types has its own Quality of Service constraints which is the first, objective that needs to be satisfied. Besides guaranteeing QOS, the network facilities should be used efficiently. Therefore, our second objective is to maximize either the number of routed calls or the total amount of routed bandwidth. We show that despite our approach may lead to a conservative estimation of the actual Quality of Service, it performs significantly better than bandwidth reservation, the resource allocation method that is most commonly used in current ATM networks, since more calls can be admitted into the network. Several different combinations of a routing strategy (min-hop routing, max-min routing, and exponential routing) with admission strategies (complete sharing, hold back n) are tested for efficiency, using an extensive set of simulations. We found that exponential routing combined with the' complete sharing admission strategy performs best. Using the hold back n admission strategy results in a smaller network utilization, however, the admission rate of high-bandwidth calls (video, data) is improved.
Mennenga, Menno (1996). Multi-objective routing in ATM networks. Master's thesis, Texas A&M University. Available electronically from
https : / /hdl .handle .net /1969 .1 /ETD -TAMU -1996 -THESIS -M4635.