First Advisor

Y. C. Jenq

Term of Graduation

Winter 1996

Date of Publication

3-15-1996

Document Type

Thesis

Degree Name

Master of Science (M.S.) in Electrical and Computer Engineering

Department

Electrical Engineering

Language

English

Subjects

Asynchronous transfer mode, Local area networks (Computer networks)

DOI

10.15760/etd.7110

Physical Description

1 online resource (vi, 44 pages)

Abstract

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 [10] 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.

Rights

In Copyright. URI: http://rightsstatements.org/vocab/InC/1.0/ This Item is protected by copyright and/or related rights. You are free to use this Item in any way that is permitted by the copyright and related rights legislation that applies to your use. For other uses you need to obtain permission from the rights-holder(s).

Comments

If you are the rightful copyright holder of this dissertation or thesis and wish to have it removed from the Open Access Collection, please submit a request to pdxscholar@pdx.edu and include clear identification of the work, preferably with URL.

Persistent Identifier

https://archives.pdx.edu/ds/psu/30386

Download

Share

COinS