Conditions for a product-form stationary distribution of one queueing system with batch transfers and a disaster flow

Conditions for a product-form stationary distribution of one queueing system with batch transfers... We consider an open exponential network with two types of arrival flows at the network nodes: a message flow and a disaster flow. Messages arriving at the nodes form batches of customers of a random size. A disaster arrival at a node completely empties the queue at the node if it is nonempty and has no effect otherwise. Customers are served in batches of a random size. After a batch is served at a node, the batch quits the network and, according to a routing matrix, either sends a message or a disaster to another node or does not send anything. We find conditions for the stationary distribution of the network state probabilities to be represented as a product of shifted geometric distributions. http://www.deepdyve.com/assets/images/DeepDyve-Logo-lg.png Problems of Information Transmission Springer Journals

Conditions for a product-form stationary distribution of one queueing system with batch transfers and a disaster flow

Loading next page...
 
/lp/springer_journal/conditions-for-a-product-form-stationary-distribution-of-one-queueing-OYSpQY0WQr
Publisher
Pleiades Publishing
Copyright
Copyright © 2014 by Pleiades Publishing, Inc.
Subject
Engineering; Communications Engineering, Networks; Electrical Engineering; Information Storage and Retrieval; Systems Theory, Control
ISSN
0032-9460
eISSN
1608-3253
D.O.I.
10.1134/S0032946014010074
Publisher site
See Article on Publisher Site

Abstract

We consider an open exponential network with two types of arrival flows at the network nodes: a message flow and a disaster flow. Messages arriving at the nodes form batches of customers of a random size. A disaster arrival at a node completely empties the queue at the node if it is nonempty and has no effect otherwise. Customers are served in batches of a random size. After a batch is served at a node, the batch quits the network and, according to a routing matrix, either sends a message or a disaster to another node or does not send anything. We find conditions for the stationary distribution of the network state probabilities to be represented as a product of shifted geometric distributions.

Journal

Problems of Information TransmissionSpringer Journals

Published: Apr 15, 2014

References

You’re reading a free preview. Subscribe to read the entire article.


DeepDyve is your
personal research library

It’s your single place to instantly
discover and read the research
that matters to you.

Enjoy affordable access to
over 12 million articles from more than
10,000 peer-reviewed journals.

All for just $49/month

Explore the DeepDyve Library

Unlimited reading

Read as many articles as you need. Full articles with original layout, charts and figures. Read online, from anywhere.

Stay up to date

Keep up with your field with Personalized Recommendations and Follow Journals to get automatic updates.

Organize your research

It’s easy to organize your research with our built-in tools.

Your journals are on DeepDyve

Read from thousands of the leading scholarly journals from SpringerNature, Elsevier, Wiley-Blackwell, Oxford University Press and more.

All the latest content is available, no embargo periods.

See the journals in your area

DeepDyve Freelancer

DeepDyve Pro

Price
FREE
$49/month

$360/year
Save searches from
Google Scholar,
PubMed
Create lists to
organize your research
Export lists, citations
Read DeepDyve articles
Abstract access only
Unlimited access to over
18 million full-text articles
Print
20 pages/month
PDF Discount
20% off