Identifying Almost Sorted Permutations from TCP Buffer Dynamics
Associate to each sequence A of integers (intending to model packet IDs in a TCP/IP stream) a sequence of positive integers of the same length M(A). The i’th entry of M(A) is the size (at time i) of the smallest buffer needed to hold out-of-order packets, where space is accounted for unreceived pack...
Main Author: | G. Istrate |
---|---|
Format: | Article |
Language: | English |
Published: |
Alexandru Ioan Cuza University of Iasi
2015-06-01
|
Series: | Scientific Annals of Computer Science |
Online Access: | http://www.info.uaic.ro/bin/download/Annals/XXV1/XXV1_5.pdf |
Similar Items
-
Sorting by Bounded Permutations
by: Vergara, John Paul C.
Published: (2014) -
Sorting Permutations by λ-Operations
by: Guilherme Henrique Santos Miranda, et al.
Published: (2019-02-01) -
Highly sorted permutations and Bell numbers
by: Colin Defant
Published: (2020-12-01) -
Sorting signed permutations by transpositions and reversals
by: Zhang, Fei.
Published: (2008) -
Permutation classes, sorting algorithms, and lattice paths
by: Ferrari, Luca <1985>
Published: (2013)