2002•Unpublished venueRequires access

Queueing analysis for shared buffer switching networks for non-uniform traffic

E. Valdimarsson

Open publisher page 6 citations

Abstract

Uniform traffic does not represent a realistic view of traffic patterns in real systems. Non-uniform traffic models better reflect the traffic patterns that need to be accommodated. Such traffic may cause the network performance to deteriorate to much lower levels than the ones predicted by uniform traffic analysis. The authors extend the queueing analysis for buffered networks by providing methods for analyzing the queueing behavior of switching networks under non-uniform traffic patterns. They focus on shared buffer switch elements because they have better performance than input or output buffered elements. The analytical method for performance evaluation is compared with simulation on the basis of accuracy, where the performance is measured in terms of maximum throughput and probability of cell loss.

About this research paper

What this paper is about

Uniform traffic does not represent a realistic view of traffic patterns in real systems. Non-uniform traffic models better reflect the traffic patterns that need to be accommodated. Such traffic may cause the network performance to deteriorate to much lower levels than the ones predicted by uniform traffic analysis. The authors extend the queueing analysis for buffered networks by providing methods for analyzing the queueing behavior of switching networks under non-uniform traffic patterns. They focus on shared buffer switch elements because they have better performance than input or output buffered elements. The analytical method for performance evaluation is compared with simulation on the basis of accuracy, where the performance is measured in terms of maximum throughput and probability of cell loss.

Why it matters

OpenAlex reports 6 citations for this work. Citation counts describe recorded attention and do not establish research quality.

Key contribution

A contribution statement is not available in the OpenAlex record.

Method / approach

Method details are not available in the OpenAlex metadata.

Main findings

Findings are not separately available in the OpenAlex metadata.

Limitations

Limitations are not available in the OpenAlex metadata.

Applications

Application details are not available in the OpenAlex metadata.

Available abstract

Uniform traffic does not represent a realistic view of traffic patterns in real systems. Non-uniform traffic models better reflect the traffic patterns that need to be accommodated. Such traffic may cause the network performance to deteriorate to much lower levels than the ones predicted by uniform traffic analysis. The authors extend the queueing analysis for buffered networks by providing methods for analyzing the queueing behavior of switching networks under non-uniform traffic patterns. They focus on shared buffer switch elements because they have better performance than input or output buffered elements. The analytical method for performance evaluation is compared with simulation on the basis of accuracy, where the performance is measured in terms of maximum throughput and probability of cell loss.

Key concepts: Queueing theory, Computer science, Throughput, Computer network, Traffic equations, Layered queueing network, Airfield traffic pattern, Traffic generation model

Related papers

Back to paper searchBrowse research topicsOriginal source
Queueing analysis for shared buffer switching networks for non-uniform traffic — Research Paper | ScholarLens