The performance of a link with multipriority traffic

Author

Shi, Victor T S ; Chu, Wang ; Perrizo, William

Author_Institution

Dept. of Comput. Sci., North Dakota State Univ., Fargo, ND, USA

Volume

46

Issue

6

fYear

1998

fDate

6/1/1998 12:00:00 AM

Firstpage

743

Lastpage

746

Abstract

This letter discusses the performance of a link carrying calls of preemptive priorities. General κ-dimensional steady-state balance equations are deduced and the computational complexity of two solution methods are compared through an example of three priorities. The performance of the link is studied through two conventional metrics for blocking probabilities and preempting probabilities. The “peaking” phenomenon of the preempting line discussed can be used in the design of switches and networks. The coincidence of the preempting probability line with the blocking probability line, displayed in the discussion of numerical results, suggests that better metrics for preemptive performance must be found

Keywords

circuit switching; computational complexity; probability; telecommunication traffic; blocking probabilities; circuit switched link performance; computational complexity; design; general κ-dimensional steady-state balance equations; metrics; multipriority traffic; networks; peaking phenomenon; preempting line; preempting probabilities; preemptive priorities; switches; Communication switching; Communication system control; Communication system traffic control; Computational complexity; Equations; Integrated circuit measurements; Performance analysis; Steady-state; Switches; Switching circuits;

fLanguage

English

Journal_Title

Communications, IEEE Transactions on

Publisher

ieee

ISSN

0090-6778

Type

jour

DOI

10.1109/26.681405

Filename

681405