2000
DOI: 10.1109/90.865078
|View full text |Cite
|
Sign up to set email alerts
|

Worst-case traffic in a tree network of ATM multiplexers

Abstract: In this paper we study tree networks of discrete-time queues loaded with periodic traffic sources. By using the so-called Beneš method, exact closed-form expressions are obtained for the queue length distributions. The models developed can be used to study the superposition of periodic sources emitting bursts of cells in ATM networks. The results obtained show the significant effect that this kind of traffic can have on the performance of these systems.

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2

Citation Types

0
2
0

Year Published

2001
2001
2005
2005

Publication Types

Select...
3

Relationship

0
3

Authors

Journals

citations
Cited by 3 publications
(2 citation statements)
references
References 14 publications
(27 reference statements)
0
2
0
Order By: Relevance
“…Again, with this performance measure, the issue is discussed of whether the on-off pattern is the worst one passing through the leaky bucket. Reference [43] studies the traffic pattern consisting of periodic bursts of a maximum length under the cell delay variation constraint at the peak rate followed by a silence period. This is an on-off pattern, and the papers study the queue length distribution for the cases that multiple sources with such traffic patterns are multiplexed.…”
Section: Related Workmentioning
confidence: 99%
See 1 more Smart Citation
“…Again, with this performance measure, the issue is discussed of whether the on-off pattern is the worst one passing through the leaky bucket. Reference [43] studies the traffic pattern consisting of periodic bursts of a maximum length under the cell delay variation constraint at the peak rate followed by a silence period. This is an on-off pattern, and the papers study the queue length distribution for the cases that multiple sources with such traffic patterns are multiplexed.…”
Section: Related Workmentioning
confidence: 99%
“…References [40], [43], [44] consider as a performance measure the queue length distribution of the multiplexer with an infinite buffer. Again, with this performance measure, the issue is discussed of whether the on-off pattern is the worst one passing through the leaky bucket.…”
Section: Related Workmentioning
confidence: 99%