Dynamic bandwidth allocation plays an important role in integrated services networks. Effective bandwidth management can improve the overall performance of the network significantly. In integrated services networks, different types of traffic coexist. To serve these different types of traffic satisfactorily, hybrid switching is commonly used. Hybrid switching is an integration of circuit switching and packet switching in the same network. In this thesis, dynamic bandwidth allocation is studied to provide satisfactory hybrid switching performance. Specifically, we will study how to allocate bandwidths for continuous bit rate (CBR) traffic served by circuit switching and variable bit rate traffic (VBR) served by packet switching. The performance measure is based on the blocking probability of CBR traffic and the time delay of VBR traffic. Therefore, the objective of the dynamic bandwidth allocation is to maintain balance between blocking probability and delay under various traffic conditions. To accomplish this, the dynamic bandwidth allocation algorithms consists of traffic intensity estimation, traffic performance prediction, and performance optimization. A simulation is written to demonstrate the algorithm for various traffic scenarios.
| Identifer | oai:union.ndltd.org:arizona.edu/oai:arizona.openrepository.com:10150/278037 |
| Date | January 1991 |
| Creators | Kishen, Sunil Kumar, 1966- |
| Contributors | Liu, Ming-Kang |
| Publisher | The University of Arizona. |
| Source Sets | University of Arizona |
| Language | en_US |
| Detected Language | English |
| Type | text, Thesis-Reproduction (electronic) |
| Rights | Copyright © is held by the author. Digital access to this material is made possible by the University Libraries, University of Arizona. Further transmission, reproduction or presentation (such as public display or performance) of protected items is prohibited except with permission of the author. |
Page generated in 0.0089 seconds