You are here

FAU Collections » FAU Research Repository » FAU Theses and Dissertations

YACAD: Yet Another Congestion Avoidance Design for ATM-based networks

Download pdf | Full Screen View

Date Issued:
1993
Summary:
This dissertation proposes YACAD (Yet Another Congestion Avoidance Design for ATM-based Networks), a congestion prevention model that includes admission control, traffic shaping, and link-by-link flow control for ATM-based networks. Network traffic in this model is composed of real-time traffic and data traffic. As real-time traffic is delay-sensitive and connection-oriented, its call acceptance is based upon the effective bandwidth at all nodes. Effective bandwidth is defined as a vector of bandwidth and maximum node delay. As data traffic can be either connection-oriented or connectionless, it is subject to link-by-link flow control based on a criterion known as effective buffer which is defined as a scalar of buffer size. Data traffic is not delay-sensitive but is loss-sensitive. Traffic shaping is imposed on real-time traffic to ensure a smooth inflow of real-time cells. YACAD also allocates a large buffer (fat bucket) to data traffic to accommodate sudden long bursts of data cells. Absence of data cell loss is a major feature of YACAD. Two simulation studies on the performance of the model are conducted. Analyses of the simulation results show that the proposed congestion avoidance model can achieve congestion-free networking and bounded network delays for real-time traffic at high levels of channel utilization. The maximum buffer requirements for loss-free cell delivery for data traffic, and the cell loss probabilities for real-time traffic are also obtained. In addition, results of performance comparisons to other similar models have shown that YACAD outperforms several other leaky-bucket based congestion control methods in terms of cell loss probability for real-time traffic. The simulation source program has also been verified using existing queueing theories, and the Paired-t Confidence Interval method with satisfactory results at 99% confidence level.
Title: YACAD: Yet Another Congestion Avoidance Design for ATM-based networks.
85 views
24 downloads
Name(s): Hsu, Sam
Florida Atlantic University, Degree grantor
Ilyas, Mohammad, Thesis advisor
College of Engineering and Computer Science
Department of Computer and Electrical Engineering and Computer Science
Type of Resource: text
Genre: Electronic Thesis Or Dissertation
Issuance: monographic
Date Issued: 1993
Publisher: Florida Atlantic University
Place of Publication: Boca Raton, Fla.
Physical Form: application/pdf
Extent: 150 p.
Language(s): English
Summary: This dissertation proposes YACAD (Yet Another Congestion Avoidance Design for ATM-based Networks), a congestion prevention model that includes admission control, traffic shaping, and link-by-link flow control for ATM-based networks. Network traffic in this model is composed of real-time traffic and data traffic. As real-time traffic is delay-sensitive and connection-oriented, its call acceptance is based upon the effective bandwidth at all nodes. Effective bandwidth is defined as a vector of bandwidth and maximum node delay. As data traffic can be either connection-oriented or connectionless, it is subject to link-by-link flow control based on a criterion known as effective buffer which is defined as a scalar of buffer size. Data traffic is not delay-sensitive but is loss-sensitive. Traffic shaping is imposed on real-time traffic to ensure a smooth inflow of real-time cells. YACAD also allocates a large buffer (fat bucket) to data traffic to accommodate sudden long bursts of data cells. Absence of data cell loss is a major feature of YACAD. Two simulation studies on the performance of the model are conducted. Analyses of the simulation results show that the proposed congestion avoidance model can achieve congestion-free networking and bounded network delays for real-time traffic at high levels of channel utilization. The maximum buffer requirements for loss-free cell delivery for data traffic, and the cell loss probabilities for real-time traffic are also obtained. In addition, results of performance comparisons to other similar models have shown that YACAD outperforms several other leaky-bucket based congestion control methods in terms of cell loss probability for real-time traffic. The simulation source program has also been verified using existing queueing theories, and the Paired-t Confidence Interval method with satisfactory results at 99% confidence level.
Identifier: 12336 (digitool), FADT12336 (IID), fau:9238 (fedora)
Collection: FAU Electronic Theses and Dissertations Collection
Note(s): College of Engineering and Computer Science
Thesis (Ph.D.)--Florida Atlantic University, 1993.
Subject(s): Integrated services digital networks
Broadband communications systems
Packet switching (Data transmission)
Computer networks--Management
Held by: Florida Atlantic University Libraries
Persistent Link to This Record: http://purl.flvc.org/fcla/dt/12336
Sublocation: Digital Library
Use and Reproduction: Copyright © is held by the author, with permission granted to Florida Atlantic University to digitize, archive and distribute this item for non-profit research and educational purposes. Any reuse of this item in excess of fair use or other copyright exemptions requires permission of the copyright holder.
Use and Reproduction: http://rightsstatements.org/vocab/InC/1.0/
Host Institution: FAU
Is Part of Series: Florida Atlantic University Digital Library Collections.