Performance study of an input queueing packet switch with two priority classes

摘要: An N*N nonblocking packet switch with input queues and two priority classes that can be used to support traffic different requirements is described. The operation slotted and, at each time slot, fixed-size packets arrive the inputs distinct Bernoulli distributions for both high- low-priority classes. Two policies are discussed. In first policy, of queued when waiting service. second only queued, high-priority not delivered attempt dropped from system. Under policies, prevail over as well outputs. approximate analysis based on independence assumptions uses an equivalent queueing system estimate service capability seen presented. Using this approach, expression queue length distribution obtained. maximum throughput derived shown exceed a single switch. Numerical results compared simulations found agree. >