Optimal scaling of average queue sizes in an input‐queued switch: an open problem

Optimal scaling of average queue sizes in an input‐queued switch: an open problem

0.00 Avg rating0 Votes
Article ID: iaor20119066
Volume: 68
Issue: 3
Start Page Number: 375
End Page Number: 384
Publication Date: Aug 2011
Journal: Queueing Systems
Authors: , ,
Keywords: packet switching networks
Abstract:

We review some known results and state a few versions of an open problem related to the scaling of the total queue size (in steady state) in an n×n input‐queued switch, as a function of the port number n and the load factor ρ. Loosely speaking, the question is whether the total number of packets in queue, under either the maximum weight policy or under an optimal policy, scales (ignoring any logarithmic factors) as O(n/(1-ρ)).

Reviews

Required fields are marked *. Your email address will not be published.