Pages that link to "Item:Q1413911"

The following pages link to The equivalence between processor sharing and service in random order. (Q1413911):

Displaying 27 items.

• Large deviations of the waiting time in the GI/G/1 queue with random order service (Q364612) (← links)
• Factorized time-dependent distributions for certain multiclass queueing networks and an application to enzymatic processing networks (Q415641) (← links)
• On a processor sharing queue that models balking (Q607679) (← links)
• Tail behavior of conditional sojourn times in processor-sharing queues (Q877791) (← links)
• Asymptotic expansions for the sojourn time distribution in the \(M/G/1\)-PS queue (Q966424) (← links)
• On sojourn times in the finite capacity \(M/M/1\) queue with processor sharing (Q1043259) (← links)
• Sojourn time distribution in a MAP/M/1 processor-sharing queue (Q1400353) (← links)
• Computing conditional sojourn time of a randomly chosen tagged customer in a BMAP/MSP/\(1\) queue under random order service discipline (Q1708522) (← links)
• When random-order-of-service outperforms first-come-first-served (Q1785418) (← links)
• Product forms for FCFS queueing models with arbitrary server-job compatibilities: an overview (Q2220355) (← links)
• Random-order-of-service for heterogeneous customers: waiting time analysis (Q2341233) (← links)
• Sojourn time asymptotics in processor sharing queues with varying service rate (Q2454682) (← links)
• Asymptotic expansions for the conditional sojourn time distribution in the \(M/M/1\)-PS queue (Q2479860) (← links)
• Heavy-traffic asymptotics for the single-server queue with random order of service (Q2488203) (← links)
• Large deviations of sojourn times in processor sharing queues (Q2494550) (← links)
• Sojourn time asymptotics in processor-sharing queues (Q2494559) (← links)
• Sojourn times in the \(M/ PH/1\) processor sharing queue (Q2572901) (← links)
• Analysis of a Markovian queue with customer interjections and finite buffer (Q2656498) (← links)
• Heavy-traffic limits for polling models with exhaustive service and non-FCFS service order policies (Q2786424) (← links)
• SOJOURN TIME TAILS IN THE <i>M</i>/<i>D</i>/1 PROCESSOR SHARING QUEUE (Q3591538) (← links)
• M/M/∞ Transience: Tail Asymptotics of Congestion Periods (Q3653124) (← links)
• Sojourn time in an <i><i>M</i>/<i>M</i>/1</i> processor sharing queue with permanent customers (Q4639232) (← links)
• Sojourn time in a Processor Sharing queue with batch arrivals (Q4646609) (← links)
• Stationary analysis of the “Shortest Queue First” service policy: The asymmetric case (Q4976518) (← links)
• FLUID LIMIT OF A PS-QUEUE WITH MULTISTAGE SERVICE (Q5056600) (← links)
• Batch sojourn time in the processor sharing queue with geometric batch size (Q5157349) (← links)
• HEAVY-TRAFFIC ANALYSIS OF A NON-PREEMPTIVE MULTI-CLASS QUEUE WITH RELATIVE PRIORITIES (Q5358033) (← links)