2002
DOI: 10.1016/s0305-0548(01)00042-9
|View full text |Cite
|
Sign up to set email alerts
|

Real-time system with homogeneous servers and nonidentical channels in steady-state

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
5

Citation Types

0
5
0

Year Published

2003
2003
2021
2021

Publication Types

Select...
7
1

Relationship

4
4

Authors

Journals

citations
Cited by 8 publications
(5 citation statements)
references
References 21 publications
0
5
0
Order By: Relevance
“…In this work we generalize the model developed in Kreimer (2002b) and extend the results of Ianovsky and Kreimer (2001) as follows. We compute analytically steady-state probabilities and availability of such a system with exponentially distributed service and maintenance times, and provide limiting value of availability for RTS with large number of servers and ample maintenance facilities.…”
Section: Introductionmentioning
confidence: 92%
See 1 more Smart Citation
“…In this work we generalize the model developed in Kreimer (2002b) and extend the results of Ianovsky and Kreimer (2001) as follows. We compute analytically steady-state probabilities and availability of such a system with exponentially distributed service and maintenance times, and provide limiting value of availability for RTS with large number of servers and ample maintenance facilities.…”
Section: Introductionmentioning
confidence: 92%
“…That part of the job which is not processed immediately is lost forever and cannot be served later. Further, in Kreimer and Mehrez (1998), Kreimer (2002aKreimer ( , 2002b these models under certain assumptions have been treated as queueing networks (Gross and Harris 1998). Ianovsky andKreimer (2001, 2003) obtained optimal assignment/routing probabilities to maximize availability of RTS (with ample and restricted number of maintenance teams respectively) with two channels and large number of servers.…”
Section: Introductionmentioning
confidence: 99%
“…In [16] and [17], several UAV models have been first described and treated as Real-Time Systems (RTS) with a zero dead line for the beginning of job processing. Further, in [12] [18] [19] and [20], these models working under a maximum load (worst case) of nonstop data arrival have been treated as queuing networks [21]. RTS with priorities were studied in [22] [23] (preemptive) and [24] (nonpreemptive) respectively.…”
Section: Introductionmentioning
confidence: 99%
“…Two-dimensional birth-and-death processes [18] [19] were applied in analysis of a multiserver RTS (with ample and limited number of maintenance teams respectively) with two different channels operating under a maximum load regime, when both service and maintenance times are exponentially distributed. In [20] the results of [18] for 2 r ≥ different channels operating under a maximum load regime were extended. Optimal assignment probabilities maximizing availability of RTS (with ample and limited number of maintenance teams respectively) with large number of servers and two channels were obtained [21] [22].…”
Section: Introductionmentioning
confidence: 99%