Randolph Nelson, Don Towsley, et al.
IEEE Transactions on Software Engineering
Chemoff’s bound on P[X ≥ t] is used almost universally when a tight bound on tail probabilities is required. In this article we show that for all positive t and for all distributions, the moment bound is tighter than Chemoff’s bound. By way of example, we demonstrate that the improvement is often substantial. © Taylor & Francis Group, LLC.
Randolph Nelson, Don Towsley, et al.
IEEE Transactions on Software Engineering
Cheng-Shang Chang, Randolph Nelson
Communications in Statistics. Stochastic Models
Thomas K. Philips, Donald F. Towsley, et al.
IEEE Trans. Inf. Theory
Randolph D. Nelson, Thomas K. Philips
Performance Evaluation