We prove the correctness of a sliding window protocol with an arbitrary finite window size n and sequence numbers modulo 2n. We show that the sliding window protocol is branching bisimilar to a queue of capacity 2n. The proof is given entirely on the basis of an axiomatic theory, and was checked with the help of PVS.

TCP is known to have bandwidth fairness problems for flows of different RTT. HighSpeed TCP, which adapts TCP’s congestion avoidance to grow faster, and thus be able to scale to high bandwidth environments, aggravates the RTT fairness problem since the congestion window increases at a rate proportional to the RTT and the current window size. We propose a method to eliminate the RTT fairness prob...

We assessed the agreement between sampling windows of different size and orientation on packing density estimates in images of the parafoveal cone mosaic acquired using a flood-illumination adaptive optics retinal camera. Horizontal and vertical oriented sampling windows of different size (320x160 µm, 160x80 µm and 80x40 µm) were selected in two retinal locations along the horizontal meridian i...

We consider a sliding window W over a stream of characters from some alphabet of constant size. The user wants to perform deterministic substring matching on the current sliding window content and obtain positions of the matches. We present an indexed version of the sliding window based on a suffix tree. The data structure of size Θ(|W |) has optimal time queries Θ(m + occ) and amortized consta...