2006
DOI: 10.1016/j.peva.2005.08.002
|View full text |Cite
|
Sign up to set email alerts
|

Sojourn time approximations in queueing networks with feedback

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1

Citation Types

0
2
0

Year Published

2008
2008
2018
2018

Publication Types

Select...
5
1

Relationship

0
6

Authors

Journals

citations
Cited by 6 publications
(2 citation statements)
references
References 9 publications
0
2
0
Order By: Relevance
“…The end user sends the request to the server-side script and the server sends the request to different providers to give the requested service. (Gijsen et al, 2006) Maximum and minimum of the total virtual waiting time of a customer in open queues in M/G/1 and GI/M/1 service systems can be found. The method of strong approximations for several different queuing processes can be used to find maximum and minimum parameters in queues (Minkevi£ius, 2009).…”
Section: Tandem Queuesmentioning
confidence: 96%
“…The end user sends the request to the server-side script and the server sends the request to different providers to give the requested service. (Gijsen et al, 2006) Maximum and minimum of the total virtual waiting time of a customer in open queues in M/G/1 and GI/M/1 service systems can be found. The method of strong approximations for several different queuing processes can be used to find maximum and minimum parameters in queues (Minkevi£ius, 2009).…”
Section: Tandem Queuesmentioning
confidence: 96%
“…Gijsen et al [24] study sojourn times in an open queueing network with a single processor sharing node and an arbitrary number of multi-server FCFS nodes. PS-node represents the front-end application server, while multi-server FCFS nodes stand for distributed database sites.…”
Section: Granularity Of Transaction Modelingmentioning
confidence: 99%