Advertisement

Journal of Combinatorial Optimization

, Volume 12, Issue 1–2, pp 57–70 | Cite as

Combinatorics of TCP reordering

  • Anders Hansson
  • Gabriel IstrateEmail author
  • Shiva Prasad Kasiviswanathan
Article

Abstract

We study a combinatorial problem motivated by a receiver-oriented model of TCP traffic from Istrate et al. (2006), 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 is no harder than finding matchings in bipartite graph. 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.

Keywords

Bipartite Graph Buffer Size Application Layer Tree Decomposition Counting Problem 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Bellardo J, Savage S (2002) Measuring packet reordering. In Proc. ACM SIGCOMM Internet Measurement Workshop, Marseille, France 97–105Google Scholar
  2. Bennett JCR, Partridge C, Shectman N (1999) Packet reordering is not pathological network behavior. IEEE/ACM Transactions on Networking, 7(6):789–798CrossRefGoogle Scholar
  3. Bezákova I, Štefankovič D, Vigoda E, Vazirani VV (2006) Accelerating simulated annealing algorithm for the permanent and combinatorial counting problems. In Proceedings of the 17th ACM-SIAM Symposium on Discrete Algorithms (SODA’06), 900–907Google Scholar
  4. Courcelle B, Makowsky JA, Rotics U (2001) On the fixed parameter complexity of graph enumeration problems definable in monadic second-order logic. Discrete Appl. Math., 108(1-2):23–52zbMATHMathSciNetCrossRefGoogle Scholar
  5. Downey RG, Fellows MR (1999) Parameterized Complexity. Springer Verlag.Google Scholar
  6. Istrate G, Hansson A (2005) Counting preimages of TCP reordering patterns. Submitted to Discrete Applied MathematicsGoogle Scholar
  7. Istrate G, Hansson A, Thulasidasan S, Marathe M, Barrett C (2006) Semantic compression of TCP traces. In Proceedings of the IFIP NETWORKING Conference, F. Boavida (editor), volume 3976 of Lecture Notes in Computer Science, Springer Verlag, 123–135Google Scholar
  8. Jaiswal S, Iannacone G, Diot C, Kurose J, Towsley D (2004) Inferring TCP connection characteristics through passive measurements. In Proceedings of INFOCOM’;04, volume 3, Hong Kong, China, 1582–1592Google Scholar
  9. Jerrum M, Sinclair A, Vigoda E (2004) A polynomial-time approximation algorithm for the permanent of a matrix with nonnegative entries. Journal of the ACM, 51(4):671–697MathSciNetCrossRefGoogle Scholar
  10. Jerrum M, Valiant LG, Vazirani VV (1986) Random generation of combinatorial structures from a uniform distribution. Theor. Comput. Sci., 43:169–188zbMATHMathSciNetCrossRefGoogle Scholar
  11. Laor M, Gendel L (2002) The effect of packet reordering in a backbone link on application throughput. IEEE Network, 16(5):28–36CrossRefGoogle Scholar
  12. Lovász L, Plummer M (1986) Matching Theory. Number 29 in Annals of Discrete Mathematics. North HollandGoogle Scholar
  13. Peterson L, Davie BS (2000) Computer Networks. A Systems Approach. Morgan Kauffman, San Francisco, CA, 2nd editionGoogle Scholar
  14. Piratla NM, Jayasumana AP, Bare AA (2005) RD: A formal, comprehensive metric for packet reordering. In Proc. IFIP Networking Conference 2005, volume 3462 of Lecture Notes in Computer Science, Springer Verlag, 78–89Google Scholar
  15. Robertson N, Seymour PD (1986) Graph minors II, algorithmic aspects of tree-width. Journal of Algorithms, 7:309–322zbMATHMathSciNetCrossRefGoogle Scholar

Copyright information

© Springer Science + Business Media, LLC 2006

Authors and Affiliations

  • Anders Hansson
    • 1
  • Gabriel Istrate
    • 1
    Email author
  • Shiva Prasad Kasiviswanathan
    • 2
  1. 1.CCS-5, Discrete Simulation ScienceLos Alamos National LaboratoryLos Alamos
  2. 2.Department of Computer Science and EngineeringPennsylvania State UniversityUniversity Park

Personalised recommendations