Technical Report CS0527

Title: Analyzing a Packet Switch as a Non-Conservative Exhaustive-Service Polling System I: Cycle-Time and Capacity Analysis
Authors: Micha Hofri
Abstract: We present a queueing model of a switching element, that is a variation on often-treated models of exhaustive-service polling systems, except that the seryice mechanism is more complex: each polling station consists of two queues that are fed by independent arrival processes. The switch has a cycle of N phases; at each phase the two queues are served in parallel, and a phase only terminates when both queues are simultaneously empty. There is no time penalty when switching between phases. The analysis employs mostly familiar techniques, but leads to interesting functional equations, not all of which are easy to solve.
CopyrightThe above paper is copyright by the Technion, Author(s), or others. Please contact the author(s) for more information

Remark: Any link to this technical report should be to this page (, rather than to the URL of the PDF files directly. The latter URLs may change without notice.

To the list of the CS technical reports of 1988
To the main CS technical reports page

Computer science department, Technion