Premiile Ad Astra
Revista Ad Astra
Biblioteca de știință
Cartea albă
Topul universităților
Who's who
Publicații
Teze și dizertații
Asociația Ad Astra
 
Comunicate
Știri
Evenimente
Oportunități de finanțare
 
Login
Înregistrare
 
>> English
 
   
 

Anders Hansson, Gabriel Istrate and Shiva Prasad Kasiviswanathan. Combinatorics of TCP Reordering. Journal of Combinatorial Optimization, 12 (1-2), pp. 57-70, 2006.

Rezumat: We study a combinatorial problem motivated by a receiver-oriented model of TCP traffic, that incorporates information on both arrival times and the dynamics of packet IDs. An important component of this model is a many-to-one mapping FB from sequences of IDs into a sequence of buffer sizes. We show that:

i) Given a buffer sequence B, constructing a sequence A of IDs that belongs to the preimage of B can be accomplished by a cubic time algorithm.


ii) Counting the number of sequences A of packet IDs that belong to the preimage of B can be done in linear time in the special case when there exists a constant upper bound on the maximum entry in B.


iii) This problem also has a fully polynomial randomized approximation scheme when we have a constant upper bound on the number of repeats in the packet sequences in the preimage. We also provide experimental evidence that the two previous results suffice to efficiently count the number of preimages for buffer sequences observed in real TCP data.

A preliminary version of this paper can be freely downloaded from

http://www.cse.psu.edu/~kasivisw/pap.pdf

Cuvinte cheie: packet reordering, TCP, generalized matchings

URL: http://www.springerlink.com/link.asp?id=q653jp157626x722

Adăugată pe site de Gabriel Istrate

Înapoi

   
© Ad Astra 2001-2013