Oh and Ahn (1999) Dynamic Calendar Queue (Sim Symp)
PDF
[more]
Brown (1988) Calendar Queues: A Fast O(1) Priority Queue Implementation for the Simulation Event Set Problem
This is the seminal paper that proposes the calendar queues which can be used for DES. Events are classified into “days” and different “days” are put into an array as a “year”. When we insert, put the event into an appropriate day according to the event’s deadline. When we dequeue...
[more]
年糕
材料：
[more]
Tang, Huang, Chen (2000) Internet Flow Blocking Probability Calculation (Canadian Conf on ECE)
This paper derives equations. Assume the Internet operates as \(M\)/Pareto/\(1\)/\(K\) queues, the flow blocking probability is \(P_B = 1-\dfrac{\Gamma(K)}{m+\lambda\Gamma(K)}\), where \(\lambda\) is the arrival rate, \(m\) is the first busy period (i.e. mean of Pareto), \(\Gamma(K)=\dfrac{m}{1-\rho}(P_0+P_1+...+P_{K-1})\) is the \(k\)-th busy period, and \(P_j\) denotes the probability of having \(j\) customers...
[more]
Hua et al (2008) Rank-indexed Hashing: A Compact Construction of Bloom Filters and Variants (ICNP)
PDF
[more]