∫ntegrabℓε ∂ifferentiαℓs
  • Collections
    Papers Books Tagged posts
  • About

∫ntegrabℓε ∂ifferentiαℓs


unorganised notes, code, and writings of random topics

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 \(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]

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 \(X\) is Pareto, i.e. \(X\sim\dfrac{ac^a}{(x+c)^{a+1}}\), and \(Y\) is Gamma, i.e. \(Y\sim\dfrac{y^{\alpha-1}e^{-y/\lambda}}{\lambda^\alpha\Gamma(\alpha)}\), then \(R=X+Y\) models the time between successive on-off cycles. [more]

Phit and Abe (2006) Packet Inter-arrival Time Estimation Using Neural Network Models (IC'06)

January 10, 2009 paper

This paper proposed a neural network model to estimate packet inter-arrival time. The neural network model is to take past \(n\) inter-arrival time into account to estimate the next arrival. Different model is proposed (such as linear or sigmod functions) and the parameters of the function is determined by machine... [more]

Durand and Flajolet (2003) Loglog Counting of Large Cardinalities (ESA'03)

January 10, 2009 paper

Assume we have a multiset (a set which each item can have multiplicity \(> 1\)) of elements from a universe of infinite size. The number of elements in the multiset is finite and we define the cardinality of the multiset to be the number of distinct elements in it. [more]
‹
›

Adrian S. Tam  •  © 2025  •  CC-BY-SA 4.0 •  http://www.adrian.idv.hk

On a heavily modified beautiful-jekyll theme.