Skip to main content Accessibility help
×
Home

On Queueing Networks with Signals and History-Dependent Routing

  • Xiuli Chao (a1) and Michael Pinedo (a2)

Abstract

This paper extends product form results for queueing networks with signals to allow history-dependent routing. The signals in these models carry information to nodes and induce multiple customers to move simultaneously within the network. Two models are studied in this paper. In the first one we assume that routing probabilities of a departing customer from a given class of nodes depend on the amount of service just received by the customer and whether its departure is the result of an actual service completion or the result of an arriving signal. In the second model we assume that the routing probabilities of a customer depend on the number of times this customer's service has been interrupted by signals in the past as well as the cause of its departure. We show that both models possess simple product form solutions. These results provide a new dimension in modeling and analyzing practical systems.

Copyright

References

Hide All
1.Buzacott, J. & Shanthikumar, J.G. (1993). Stochastic models of manufacturing systems. Englewood Cliffs, NJ: Prentice-Hall.
2.Chao, X. (1995). Networks of queues with customers, signals and arbitrary service time distributions. Operations Research 43: 537544.
3.Chao, X. & Pinedo, M. (1993). Generalized networks of queues with positive and negative arrivals. Probability in the Engineering and Informational Sciences 7: 301334.
4.Gelenbe, E. (1991). Product form queueing networks with positive and negative customers. Journal of Applied Probability 28: 656663.
5.Kelly, F. (1979). Reversibility and stochastic networks. New York: Wiley & Sons.
6.Miyazawa, M. (1993). Insensitivity and product form decomposability of reallocatable GSMP. Advances in Applied Probability 25: 415437.
7.Robertazzi, T. (1994). Computer networks and systems, 2nd ed.New York: Springer-Verlag.
8.Ross, S.M. (1993). Introduction to probability models, 5th ed.San Diego, CA: Academic Press.
9.Sauer, C.H. & Chandy, K.M. (1981). Computer systems performance modeling. NJ: Prentice-Hall.
10.Schwartz, M. (1988). Telecommunication networks, protocols, modeling, and analysis. Addison-Wesley.
11.Walrand, J. (1983). A probabilistic look at networks of quasi-reversible queues. IEEE Transactions on Information Theory IT-29(6): 825831.
12.Walrand, J. (1988). An introduction to queueing networks. Englewood Cliffs, NJ: Prentice-Hall.

Metrics

Full text views

Total number of HTML views: 0
Total number of PDF views: 0 *
Loading metrics...

Abstract views

Total abstract views: 0 *
Loading metrics...

* Views captured on Cambridge Core between <date>. This data will be updated every 24 hours.

Usage data cannot currently be displayed