AMUDALA BHASKER, AJAY BABU. Tiered-Service Fair Queueing (TSFQ): A Practical and Efficient Fair Queueing Algorithm. (Under the direction of Professor George N. Rouskas.) A router in today’s Internet has to satisfy two important properties in order to efficiently provide the Quality of Service (QoS) requested by the users. It should be fair among flows and also have low operational complexity. T...

AMUDALA BHASKER, AJAY BABU. Tiered-Service Fair Queueing (TSFQ): A Practical and Efficient Fair Queueing Algorithm. (Under the direction of Professor George N. Rouskas.) A router in today’s Internet has to satisfy two important properties in order to efficiently provide the Quality of Service (QoS) requested by the users. It should be fair among flows and also have low operational complexity. T...

The blocking protocols of "stopping service" and of "recirculating" jobs through an entire system are shown to be equivalent for Jacksonian queueing networks with blocked departures. Queueing networks * product-form * stopping and recirculating blocking protocol •* partial balance.

Under the last-in, first-out (LIFO) discipline, jobs arriving later at a class always receive priority of service over earlier arrivals any belonging to same station. Subcritical LIFO queueing networks with Poisson external are known be stable, but an open problem has been whether this is also case when given by renewal processes. Here, we show that weaker assumption not sufficient for stabilit...

A general framework for aggregation and decomposition of product form queueing networks with state dependent routing and servicing is presented. By analogy with electrical circuit theory, the stations are grouped into clusters or subnetworks such that the process decomposes into a global process and a local process. Moreover, the local process factorizes into the subnetworks. The global process...