SZodixStudyAcademic Library
ShelvesOpen access
Study · an open academic library·Metadata from OpenAlex (CC0)·Shelves·OpenAlex metadata, de-duplicated
Analysis of a time-limited polling system
11 references·3 citing·36 second hop
Analysis of a time-limited polling system (1998)Analysis of a time-limited polling systemPolling systems with server timeouts and their application to token passing networks (1995)Polling systems with server t…A discrete MAP/PH/1 queue with vacations and exhaustive time-limited service (1995)A discrete MAP/PH/1 queue wit…Cyclic-service systems with nonpreemptive, time-limited service (1994)Cyclic-service systems with n…Stability of token passing rings (1992)Stability of token passing ri…A single-server queue with vacations and non-gated time-limited service (1991)A single-server queue with va…Stochastic analysis of computer and communication systems (1990)Stochastic analysis of comput…A single-server queue with vacations and gated time-limited service (1990)A single-server queue with va…Comparison Methods for Queues and Other Stochastic Models. (1986)Comparison Methods for Queues…Analysis of polling systems (1985)Analysis of polling systemsComparison Methods for Queues and Other Stochastic Models (1984)Comparison Methods for Queues…The single server queue in discrete time‐numerical analysis II (1973)The single server queue in di…Stability analysis of multiserver discrete-time queueing systems with renewal-type server interruptions (2011)Stability analysis of multise…The discrete-time MAP/PH/1 queue with multiple working vacations (2009)The discrete-time MAP/PH/1 qu…A polling model with an autonomous server (2009)A polling model with an auton…Poisson Arrivals See Time Averages (1982)Queueing systems with vacations ? A survey (1986)Pseudo-conservation laws in cyclic-service systems (1987)Load-dependent service queues with application to congestion control in broadband networks (2002)Analysis of cyclic service systems with limited service: Bounds and approximations (1988)New results on the single server queue with a batch markovian arrival process (1991)Using the discrete time modelling approach to evaluate the time-dependent behaviour of queueing systems (1999)On Numerical Computations of Some Discrete-Time Queues (2000)Analyzing discrete-time D-BMAP/G/1/N queue with single and multiple vacations (2006)Introduction to the Theory of Queues (1963)Introduction to the Theory of Queues. (1963)The Markov Renewal Branching Process (1974)Computational uses of the method of phases in the theory of queues (1975)Iterative Algorithms for Bulk Arrival, Bulk Service Queues with Poisson and Non-Poisson Arrivals (1986)A Proof for the Queuing Formula: L = λ W (1961)Discrete time queues and matrix-analytic methods (2002)Vacation models in discrete time (2003)Queuing analysis of polling models (1988)The use of service limits for efficient operation of multistation single-medium communication systems (1995)Ordinal Optimization of G/G/1/K Polling Systems with k-Limited Service Discipline (2008)The stability of a queue with non-independent inter-arrival and service times (1962)Applied Probability and Queues (1987)An Introduction to Queueing Networks (1990)Queueing-theoretic solution methods for models of parallel and distributed systems (1994)Computing distributions and moments in polling models by numerical transform inversion (1996)Heuristic Scheduling of Parallel Heterogeneous Queues with Set-Ups (1996)Polling systems: applications, modeling, and optimization (1990)Stability and convergence of moments for multiclass queueing networks via fluid limit models (1995)Dynamic server allocation to parallel queues with randomly varying connectivity (1993)Stability, queue length, and delay of deterministic and stochastic queueing networks (1994)Optimal Investment Policies for a Firm With a Random Risk Process: Exponential Utility and Minimizing the Probability of Ruin (1995)Blocking When Service Is Required From Several Facilities Simultaneously (1985)Marked point processes as limits of Markovian arrival streams (1993)Stability conditions for some distributed systems: buffered random access systems (1994)Analysis of a GI/M/1 queue with multiple working vacations (2004)M/G/1 queue with multiple working vacations (2005)
this work references cited by second hop

References

  • 1986Comparison Methods for Queues and Other Stochastic Models.938 cited
  • 1984Comparison Methods for Queues and Other Stochastic Models720 cited
  • 1985Analysis of polling systems661 cited
  • 1990Stochastic analysis of computer and communication systems389 cited
  • 1992Stability of token passing rings64 cited
  • 1973The single server queue in discrete time‐numerical analysis II59 cited
  • 1990A single-server queue with vacations and gated time-limited service56 cited
  • 1991A single-server queue with vacations and non-gated time-limited service44 cited
  • 1995A discrete MAP/PH/1 queue with vacations and exhaustive time-limited service42 cited
  • 1994Cyclic-service systems with nonpreemptive, time-limited service36 cited
  • 1995Polling systems with server timeouts and their application to token passing networks30 cited

Cited by

  • 2011Stability analysis of multiserver discrete-time queueing systems with renewal-type server interruptions24 cited
  • 2009A polling model with an autonomous server23 cited
  • 2009The discrete-time MAP/PH/1 queue with multiple working vacations20 cited

Only edges whose both ends are imported exist here. Widen the year window, or show the whole map. Back to the work