Input queuing of an internally nonblocking packet switch with two priority classes

摘要: An N*N nonblocking packet switch with two priority classes which can be used to support traffics different requirements is analyzed. Real-time traffic such as voice assigned high satisfy its strict delay requirement, while data uses a lower and utilizes the remaining system capacity. The operation slotted, at each time slot packets arrivals inputs have Bernoulli distributions probabilities for high-priority low-priority classes. Packets of both queued when waiting service; service discipline FCFS (first-come first-served) within class. authors provide explicit expressions blocking average delays. They also study stability show that maximum throughput in fact higher than no priority. >