Sojourn time approximations in queueing networks with feedback
Abstract
References
Index Terms
- Sojourn time approximations in queueing networks with feedback
Recommendations
Response times in a two-node queueing network with feedback
The study presented in this paper is motivated by the performance analysis of response times in distributed information systems, where transactions are handled by iterative server and database actions. We model system response times as sojourn times in ...
Sojourn times in a processor sharing queue with multiple vacations
We study an M/G/1 processor sharing queue with multiple vacations. The server only takes a vacation when the system has become empty. If he finds the system still empty upon return, he takes another vacation, and so on. Successive vacations are ...
Sojourn Times in Queueing Networks
<P>We consider a queueing network with types of customers. Poisson arrivals, type dependent routing and state dependent service. A number of stochastic aspects relating to sojourn times are investigated. Included are limiting state distributions ...
Comments
Information & Contributors
Information
Published In
Publisher
Elsevier Science Publishers B. V.
Netherlands
Publication History
Author Tags
Qualifiers
- Article
Contributors
Other Metrics
Bibliometrics & Citations
Bibliometrics
Article Metrics
- 0Total Citations
- 0Total Downloads
- Downloads (Last 12 months)0
- Downloads (Last 6 weeks)0
Other Metrics
Citations
View Options
View options
Get Access
Login options
Check if you have access through your login credentials or your institution to get full access on this article.
Sign in