Abstract

Recent studies of digital network traffic have shown that arrival processes in such an environment are more accurately modeled as a statistically self-similar process, rather than as a Poisson-based one. We present a simulation of a combination sharedoutput queueing ATM switch fabric, sourced by two models of self-similar input. The effect of self-similarity on the average queue length and cell loss probability for this multi-stage queue is examined for varying load, buffer size, and internal speedup. The results using two self-similar input models, Pareto-distributed interarrival times and a Poisson-Zeta ON-OFF model, are compared with each other and with results using Poisson interarrival times and an ON-OFF bursty traffic source with Ge ometrically distributed burst lengths. The results show that at a high utilization and at a high degree of self-similarity, switch performance improves slowly with increasing buffer size and speedup, as compared to the improvement using Poisson-based traffic.

Library of Congress Subject Headings

Asynchronous transfer mode; Switching theory; Broadband communication systems; Computer network architectures

Publication Date

6-1-1999

Document Type

Thesis

Department, Program, or Center

Computer Engineering (KGCOE)

Advisor

Chang, Wendy

Advisor/Committee Member

Kumar, Seshavadhani

Comments

Note: imported from RIT’s Digital Media Library running on DSpace to RIT Scholar Works. Physical copy available through RIT's The Wallace Library at: TK5105.35 .L36 1999

Campus

RIT – Main Campus

Download

Share

COinS