∫ntegrabℓε ∂iﬀerentiαℓs · unorganised notes, code, and writings of random topics

Tang, Huang, Chen (2000) Internet Flow Blocking Probability Calculation (Canadian Conf on ECE)

January 14, 2009 paper

This paper derives equations. Assume the Internet operates as /Pareto// queues, the flow blocking probability is , where is the arrival rate, is the first busy period (i.e. mean of Pareto), is the -th busy period, and denotes the probability of having customers in the /Pareto// queue. [more]

Hua et al (2008) Rank-indexed Hashing: A Compact Construction of Bloom Filters and Variants (ICNP)

January 13, 2009 paper

PDF [more]

Mori, Uchida, Goto (2005) Flow Analysis of Internet Traffic: World Wide Web versus Peer-to-Peer

January 11, 2009 paper

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))

January 10, 2009 paper

Propose to use a SYN packet in TCP (or alike) to advertise a desired sending rate of , and let the routers respond for or against this rate, or counter-propose another rate . The whole idea (a.k.a. QuickStart) is to allow a faster slow-start to catch-up the available network throughput.... [more]

Nadarajah and Kotz (2007) On the convolution of Pareto and gamma distributions (ComNet(51))

January 10, 2009 paper

It is well-accepted that Pareto (heavy-tailed) and Gamma (short-tailed) distributions can be used to model the on-off time of a bursty traffic. If is Pareto, i.e. , and is Gamma, i.e. , then models the time between successive on-off cycles. [more]