Combinatorics of TCP reordering

DOI10.1007/S10878-006-8904-0zbMATH Open1132.90365OpenAlexW2080577122MaRDI QIDQ857780FDOQ857780

N. E. Zubov

Publication date: 5 January 2007

Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10878-006-8904-0

zbMATH Keywords

trafficcombinatorial problem

Mathematics Subject Classification ID

Combinatorial optimization (90C27) Traffic problems in operations research (90B20)

Cites Work

• A polynomial-time approximation algorithm for the permanent of a matrix with nonnegative entries
• Random generation of combinatorial structures from a uniform distribution
• Graph minors. II. Algorithmic aspects of tree-width
• On the fixed parameter complexity of graph enumeration problems definable in monadic second-order logic
• Accelerating simulated annealing for the permanent and combinatorial counting problems
• Counting preimages of TCP reordering patterns

Cited In (1)

• Counting preimages of TCP reordering patterns

   Recommendations

• Counting preimages of TCP reordering patterns 👍 👎
• Packet reordering in networks with heavy-tailed delays 👍 👎
• On the Large Deviations of Resequencing Queue Size: 2-M/M/1 Case 👍 👎
• Title not available (Why is that?) 👍 👎
• Title not available (Why is that?) 👍 👎

This page was built for publication: Combinatorics of TCP reordering

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q857780)