Congestion control in computer networks
Congestion control in computer networks
Active probing using packet quartets
Proceedings of the 2nd ACM SIGCOMM Workshop on Internet measurment
An extended combinatorial analysis framework for discrete-time queueing systems with general sources
IEEE/ACM Transactions on Networking (TON)
Packet-dispersion techniques and a capacity-estimation methodology
IEEE/ACM Transactions on Networking (TON)
Theory, Volume 1, Queueing Systems
Theory, Volume 1, Queueing Systems
Handbook of Mathematical Functions, With Formulas, Graphs, and Mathematical Tables,
Handbook of Mathematical Functions, With Formulas, Graphs, and Mathematical Tables,
The ballot theorem strikes again: packet loss process distribution
IEEE Transactions on Information Theory
Inverse problems in queueing theory and Internet probing
Queueing Systems: Theory and Applications
Probing a M/G/1 queue with general input and service times
ACM SIGMETRICS Performance Evaluation Review
Hi-index | 0.00 |
In the course of attempting to estimate the arrival rate of a single server queue using an active probing experiment, the authors found it necessary to derive the distribution of the number of arrivals between two probes under the conditions that the busy period of the queue lasts this long. In this paper we derive this distribution. The key building blocks in the derivation of the distribution are the classical ballot theorem and its generalized forms.