Counterexample to a conjecture of Harrison and Wein

James R. Morrison, P. R. Kumar

Research output: Contribution to journalConference articlepeer-review

2 Scopus citations


For two station closed queueing networks, Harrison and Wein studied a Reflected Brownian Motion approximation of the network and arrived at a conjecture for an explicit formula for the asymptotic loss of any buffer priority policy. Here we show by explicit solution of two examples that this formula is not correct if the network is unbalanced, even though the networks are efficient. However, if the example networks are balanced, the true asymptotic loss agrees exactly with the conjecture. Thus, while dispelling the conjecture for the general unbalanced case, the examples bolster the evidence for the conjectured form in the balanced case.

Original languageEnglish
Pages (from-to)3457-3461
Number of pages5
JournalProceedings of the IEEE Conference on Decision and Control
StatePublished - 1998
EventProceedings of the 1998 37th IEEE Conference on Decision and Control (CDC) - Tampa, FL, USA
Duration: Dec 16 1998Dec 18 1998


Dive into the research topics of 'Counterexample to a conjecture of Harrison and Wein'. Together they form a unique fingerprint.

Cite this