Optimal buffer allocation in ATM switches by effective cell loss.
Item
-
Title
-
Optimal buffer allocation in ATM switches by effective cell loss.
-
Identifier
-
AAI9830681
-
identifier
-
9830681
-
Creator
-
Ahn, David S.
-
Contributor
-
Adviser: Myung J. Lee
-
Date
-
1998
-
Language
-
English
-
Publisher
-
City University of New York.
-
Subject
-
Engineering, Electronics and Electrical
-
Abstract
-
One of the important issues in an ATM switch design is how to allocate the given buffer budget to ensure compliance with negotiated traffic contracts of each ATM connection. This problem owes mainly to the conflicting buffer requirements of different QoS parameters, such as cell loss, cell transfer delay, and cell delay variation. For example, in the event of network congestion, the cell loss due to buffer overflow can be reduced by adding more buffers to the connection. However the ensuing QoS guarantee for the connection may not be realized due to the excessive queueing delay accompanied by the increased buffer length. In this dissertation, an optimal buffer allocation in a generic nonblocking ATM switch is achieved for the required QoS guarantee of the connection by satisfying a single nodal QoS parameter called Effective Cell Loss (ECL). The ECL is an integral QoS parameter that properly incorporates both the cell loss due to buffer overflow and the cell loss due to excessive delay. Hence, an optimal buffer allocation is found by minimizing ECL given the acceptable cell loss probability, the maximum cell delay tolerance, and the fixed buffer budget at an ATM switch. The immediate benefit of using ECL is that it is simple to quantify the conflicting buffer requirements of different QoS parameter in any network condition. One can simply choose a buffer allocation that satisfies the ECL requirement in order to guarantee all other QoS requirements. Some simulation results and numerical examples are presented to demonstrate the effective usage of ECL.
-
Type
-
dissertation
-
Source
-
PQT Legacy CUNY.xlsx
-
degree
-
Ph.D.
