年糕
材料：
[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]
Mori, Uchida, Goto (2005) Flow Analysis of Internet Traffic: World Wide Web versus Peer-to-Peer
The paper quoted that, in mid-1990s to early-2000s, most traffic is web while the amount of P2P traffic became comparable to web since then. This paper is to measure the P2P traffic, as well as web traffic for the knowledge of traffic models. The measurement is made on an Internet...
[more]
Sarolahti, Allman and Floyd (2007) Determining an appropriate sending rate over an underutilized network path (ComNet 51(7))
Propose to use a SYN packet in TCP (or alike) to advertise a desired sending rate of \(X\), and let the routers respond for or against this rate, or counter-propose another rate \(X'\). The whole idea (a.k.a. QuickStart) is to allow a faster slow-start to catch-up the available network throughput....
[more]