activity
19982011
most citedAsymptotic Behavior of the Moments of the Maximum Queue Length During a Busy Period

2 citations · 9 across the 13 of their papers we have counts for

collaborators
Showing 2011Show all

5 papers · 1 filter

math.PR20111 cited

Stochastic Service Systems, Random Interval Graphs and Search Algorithms

Patrick Eschenfeldt, Ben Gross, Nicholas Pippenger

We consider several stochastic service systems, and study the asymptotic behavior of the moments of various quantities that have application to models for random interval graphs an…

math.PR20111 cited

The M/M/Infinity Service System with Ranked Servers in Heavy Traffic

Patrick Eschenfeldt, Ben Gross, Nicholas Pippenger

We consider an M/M/Infinity service system in which an arriving customer is served by the first idle server in an infinite sequence S_1, S_2, ... of servers. We determine the first…

math.PR20111 cited

Martingale Couplings and Bounds on the Tails of Probability Distributions

Kyle J. Luh, Nicholas Pippenger

Hoeffding has shown that tail bounds on the distribution for sampling from a finite population with replacement also apply to the corresponding cases of sampling without replacemen…

math.PR20112 cited

Asymptotic Behavior of the Moments of the Maximum Queue Length During a Busy Period

Patrick Eschenfeldt, Ben Gross, Nicholas Pippenger

We give a simple derivation of the distribution of the maximum L of the length of the queue during a busy period for the M/M/1 queue with lambda<1 the ratio between arrival rate an…

math.PR20111 cited

A Bound on the Variance of the Waiting Time in a Queueing System

Patrick Eschenfeldt, Ben Gross, Nicholas Pippenger

Kingman has shown, under very weak conditions on the interarrival- and sevice-time distributions, that First-Come-First-Served minimizes the variance of the waiting time among poss…