LOGLOG counting for the estimation of IP traffic

In this paper, we discuss the problem of estimating the number of "elephants'' in a stream of IP packets. First, the problem is formulated in the context of multisets. Next, we explore some of the theoretical space complexity of this problem, and it is shown that it cannot be solved with less than $...

Fuld beskrivelse

Bibliografiske detaljer

Principais autores:	Olivier Gandouet, Alain Jean-Marie
Format:	Artigo
Sprog:	Inglês
Udgivet:	Discrete Mathematics & Theoretical Computer Science 2006-01-01
Serier:	Discrete Mathematics & Theoretical Computer Science
Fag:	probabilistic counting communication complexity ip traffic [info.info-ds] computer science [cs]/data structures and algorithms [cs.ds] [info.info-dm] computer science [cs]/discrete mathematics [cs.dm] [math.math-co] mathematics [math]/combinatorics [math.co] [info.info-hc] computer science [cs]/human-computer interaction [cs.hc] [info.info-ir] computer science [cs]/information retrieval [cs.ir]
Online adgang:	https://dmtcs.episciences.org/3503/pdf
Tags:	Tilføj Tag Ingen Tags, Vær først til at tagge denne postø!