Multi-objective routing in ATM networks /
a mission control for one link only to a network-wide
| Main Author: | |
|---|---|
| Format: | Thesis eBook |
| Language: | English |
| Published: |
[Place of publication not identified] :
[publisher not identified] ;
1996.
|
| Subjects: | |
| Online Access: | Link to OAKTrust copy |
| Summary: | a mission control for one link only to a network-wide actual Quality of Service, it performs significantly better admission strategies (complete sharing, hold back n) are back n admission strategy results in a smaller network bit-rate traffic, voice traffic, video traffic and data calls (video, data) is improved. different combinations of a routing strategy (min-hop facilities should be used efficiently. Therefore, our second In this thesis, we extend the schedulable region concept from more calls can be admitted into the network. Several objective is to maximize either the number of routed calls or our approach may lead to a conservative estimation of the routing and admission approach in ATM networks. We assume routing, max-min routing, and exponential routing) with Service constraints which is the first, objective that needs sharing admission strategy performs best. Using the hold tested for efficiency, using an extensive set of simulations. than bandwidth reservation, the resource allocation method that four traffic types traverse the network, i.e., constant that is most commonly used in current ATM networks, since the total amount of routed bandwidth. We show that despite to be satisfied. Besides guaranteeing QOS, the network traffic. Each of these traffic types has its own Quality of utilization, however, the admission rate of high-bandwidth We found that exponential routing combined with the' complete |
|---|---|
| Item Description: | "Major subject: Electrical Engineering". Vita. |
| Physical Description: | x, 96 leaves : illustrations ; 28 cm. Also available online. Issued also on microfiche from Lange Micrographics. |
| Bibliography: | Includes bibliographical references: pages 91-95. |