Admission control in queueing networks is often based on partial information on the network state. This paper studies how the lack of state information affects performance by considering a simple model for admission control. The model is analyzed by studying a related censored process that has a matrix-geometric steady-state distribution. Numerical results show how partial information may cause some performance characteristics in queueing networks to be nonmonotone with respect to service rates.
|Naam||Lecture Notes in Computer Science|
|ISSN van geprinte versie||0302-9743|
|Congres||conference; NET-COOP 2007, Avignon, France; 2007-06-05; 2007-06-07|
|Periode||5/06/07 → 7/06/07|
|Ander||NET-COOP 2007, Avignon, France|