Sojourn times in vacation and polling systems with Bernoulli feedback
From MaRDI portal
(Redirected from Publication:3359541)
Recommendations
- Sojourn times in a processor sharing queue with multiple vacations
- Some results for vacation systems with sojourn time limits
- A Note on M/G/1 Vacation Systems with Sojourn Time Limits
- A note on sojourn times in M/G/1 queues with instantaneous, bernoulli feedback
- Sojourn times in the m/g/1 queue with deterministic feedback
Cited in
(13)- A simple approach for analyzing feedback vacation queues with levy input process
- Analysis of multiclass Markovian polling systems with feedback and composite scheduling algorithms
- Gated polling with stationary ergodic walking times, Markovian routing and random feedback
- The effect of workers with different capabilities on customer delay
- An \(M\)/\(G\)/1 queue with multiple types of feedback, gated vacations and FCFS policy
- Analysis of a Markovian feedback queue with multi-class customers and its application to the weighted round-robin queue
- The analysis of batch sojourn-times in polling systems
- Mathematical methods to study the polling systems
- Some results for vacation systems with sojourn time limits
- Waiting times in queueing networks with a single shared server
- Mean sojourn times in multiclass feedback queues with gated disciplines
- Optimal routeing in two-queue polling systems
- The M/GI/1 Bernoulli feedback queue with vacations
This page was built for publication: Sojourn times in vacation and polling systems with Bernoulli feedback
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3359541)
