One of the major problems in the realization of ATM is traffic management, in particular, the resource allocation for an efficient network. Many approaches to the bandwidth management problems [2] and buffer management problems have been proposed. Boyer [IO] suggested a "Fast Bandwidth Reservation" protocol, while Turner [2] applied the same technique to the buffer allocation for the bursty traffic. In this thesis, we extend Turner's scheme in order to make it more efficient with respect to buffer allocation. We define a new parameter "Reduction Factor'', which has the potential of saving a significant amount of buffer space in a commonly shared pool of buffers. It is observed that the amount of savings depends upon the cell loss probability (CLP) bound on the network, Source Activity Probability (SAP) and number of connections supported by the network (N) at particular instant. The performance of the scheme is evaluated under various QoS requirements. It is seen that this scheme leads to approximately 38% of savings in the buffer space under certain circumstances. For supporting multimedia services, we also employ the scheme of partitioning the total buffer space. The results show that it leads to 10 % less savings as compared to single buffer scheme under certain conditions. As usage policing is very critical in this scheme, we outline a suitable mechanism and hardware implementation for Usage Parameter Control. The algorithm for acceptance of virtual circuit in the network is also described.
| Identifer | oai:union.ndltd.org:pdx.edu/oai:pdxscholar.library.pdx.edu:open_access_etds-6309 |
| Date | 15 March 1996 |
| Creators | Deshpande, Nikhil Mukund |
| Publisher | PDXScholar |
| Source Sets | Portland State University |
| Detected Language | English |
| Type | text |
| Format | application/pdf |
| Source | Dissertations and Theses |
Page generated in 0.0021 seconds