2002
DOI: 10.1016/s0166-5316(02)00121-9
|View full text |Cite
|
Sign up to set email alerts
|

Response times in a two-node queueing network with feedback

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
2
1

Citation Types

0
8
0

Year Published

2005
2005
2014
2014

Publication Types

Select...
6
1

Relationship

0
7

Authors

Journals

citations
Cited by 12 publications
(8 citation statements)
references
References 6 publications
0
8
0
Order By: Relevance
“…In [11], a single PS node is studied with several multi-server FCFS nodes. The authors derive exact results for the mean response time but do not allow for synchronization.…”
Section: Performance Analysismentioning
confidence: 99%
“…In [11], a single PS node is studied with several multi-server FCFS nodes. The authors derive exact results for the mean response time but do not allow for synchronization.…”
Section: Performance Analysismentioning
confidence: 99%
“…In view of the overtaking problem, we are looking for approximation methods for the sojourn time distribution in the network. Our study is related to [3,5,10]. We consider the same model, except that (i) we allow general service time distributions in both nodes, (ii) we consider a delay node instead of a FCFS node, and (iii) the feedback probabilities may change in each loop.…”
Section: Model Descriptionmentioning
confidence: 99%
“…We consider the same model, except that (i) we allow general service time distributions in both nodes, (ii) we consider a delay node instead of a FCFS node, and (iii) the feedback probabilities may change in each loop. In the model of [5,10] there is no product form solution, and even mean sojourn times are not known; those papers concentrate on approximating mean sojourn times.…”
Section: Model Descriptionmentioning
confidence: 99%
See 1 more Smart Citation
“…Tang and Zhao, assumed Markovian arrival and service times for feedback queues [4]. On completion of a service at the station, the task either leaves the system with probability p, or goes back, along with all tasks currently waiting in the queue, to the station with probability 1 -p. Tandem queues with feedback have comprehensively studied in the literature [5]. Tandem queues with feedback are more complex objects for research than tandem queues without feedback.…”
Section: Introductionmentioning
confidence: 99%