We consider open and closed queueing networks with Markovian routing and symmetric service policies. Single-server nodes may operate in several modes. In each node, the amount of work required for servicing an arrival or for switching the mode is distributed arbitrarily. The performance rate for each of these operations depends on the residual amount of work. For open networks, the arrival flow is Poissonian. We establish conditions for a productform stationary distribution of states of the piecewise continuous process that describes the network behavior.
Problems of Information Transmission – Springer Journals
Published: Apr 19, 2011
It’s your single place to instantly
discover and read the research
that matters to you.
Enjoy affordable access to
over 18 million articles from more than
15,000 peer-reviewed journals.
All for just $49/month
Query the DeepDyve database, plus search all of PubMed and Google Scholar seamlessly
Save any article or search result from DeepDyve, PubMed, and Google Scholar... all in one place.
All the latest content is available, no embargo periods.
“Whoa! It’s like Spotify but for academic articles.”@Phil_Robichaud