SZodixStudyAcademic Library
ShelvesOpen access
Study · an open academic library·Metadata from OpenAlex (CC0)·Shelves·OpenAlex metadata, de-duplicated
Delay models for contention trees in closed populations
7 references·1 citing·33 second hop
Delay models for contention trees in closed populations (2003)Delay models for contention trees in clos…The equivalence between processor sharing and service in random order (2003)The equivalence between proce…Response times in gated M/G/1 queues: The processor-sharing case (1989)Response times in gated M/G/1…On processor sharing and random service (1984)On processor sharing and rand…Heavy-Traffic Approximations for Service Systems With Blocking (1984)Heavy-Traffic Approximations …The Distribution of Queuing Network States at Input and Output Instants (1981)The Distribution of Queuing N…The Distribution of Queueing Network States at Input and Output Instants (1979)The Distribution of Queueing …Introduction to the Theory of Queues. (1963)Introduction to the Theory of…A discrete-time queueing model with periodically scheduled arrival and departure slots (2005)A discrete-time queueing mode…Some Queuing Problems with the Service Station Subject to Breakdown (1963)Queuing with Alternating Priorities (1965)Queueing Systems. Volume 1: Theory (1975)The Gated Infinite-Server Queue: Uniform Service Times (1992)The M/G/1 processor-sharing queue with disasters (2006)On Queueing Processes with Bulk Service (1954)Discrete-Time Models for Communication Systems Including ATM (1993)A tandem queueing model with coupled processors (2003)Heavy-Traffic Limits for Queues with Many Exponential Servers (1981)Poisson Arrivals See Time Averages (1982)The Queueing Network Analyzer (1983)Sensitivity to the Service-Time Distribution in the Nonstationary Erlang Loss Model (1995)A Transform-Free Approximation for the Finite Capacity M/G/s Queue (1996)Heavy Traffic Limits for Queues with Many Deterministic Servers (2004)Stochastic Processes Occurring in the Theory of Queues and their Analysis by the Method of the Imbedded Markov Chain (1953)Open, Closed, and Mixed Networks of Queues with Different Classes of Customers (1975)The Single Server Queue (1983)Large deviations of sojourn times in processor sharing queues (2006)Sojourn time asymptotics in processor-sharing queues (2006)Scheduling for today's computer systems: bridging theory and practice (2007)Networks of Waiting Lines (1957)Mean-Value Analysis of Closed Multichain Queuing Networks (1980)Stationary state probabilities at arrival instants for closed queueing networks with multiple types of customers (1980)Linearizer (1982)M/M/1 Queueing systems with inventory (2006)The sojourn time in the GI/M/1 queue by processor sharing (1984)The gi/m/1 processor-sharing queue and its heavy traffic analysis (1991)Measuring and Calculating Queue Length Distributions (1980)Mean value analysis of mixed, multiple class BCMP networks with load dependent service stations (1984)The influence of service-time variability in a closed network of queues (1986)A General Class of Bulk Queues with Poisson Input (1967)Stochastic Processes for Insurance and Finance (1999)Coping with Time‐Varying Demand When Setting Staffing Requirements for a Service System (2007)
this work references cited by second hop

References

  • 1963Introduction to the Theory of Queues.961 cited
  • 1981The Distribution of Queuing Network States at Input and Output Instants262 cited
  • 1984Heavy-Traffic Approximations for Service Systems With Blocking99 cited
  • 2003The equivalence between processor sharing and service in random order54 cited
  • 1979The Distribution of Queueing Network States at Input and Output Instants50 cited
  • 1984On processor sharing and random service21 cited
  • 1989Response times in gated M/G/1 queues: The processor-sharing case19 cited

Cited by

  • 2005A discrete-time queueing model with periodically scheduled arrival and departure slots14 cited

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