Reorder buffer-occupancy density and its application for measurement and evaluation of packet reordering

Piratla, Nischal M.; Jayasumana, Anura P.; Bare, Abhijit A.; Banka, Tarun

doi:10.1016/j.comcom.2007.03.001

Cited by 18 publications

(19 citation statements)

References 12 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Measurements have confirmed that packet disordering is a common phenomenon on the internet [14]. To guarantee the newest signals executed by the controller, the packets that arrive at the controller late are discarded, such that the better performance are obtained by the plant.…”

Section: Problem Formulationmentioning

confidence: 99%

“…Noted that the parameter uncertainty F(k) is contained in (14), and Theorem 1 cannot be directly used to obtain the control law of the system (12). Therefore, we should design the guaranteed cost feedback gain K s , which makes system (12) stochastically stable with cost upper bound varying with the dynastic changes of the network.…”

Section: Stochastic Guaranteed Cost Controlmentioning

confidence: 99%

“…In this case, obviously, the controllers obtained hardly stabilize the systems and even may make the systems unstable in the practical application of NCSs. Packet disordering, out of order, is an increasingly common phenomenon on the Internet [14]. It is really nice that increasing research interests have recently been paid to the study of packet disordering of NCSs [15][16][17]19].…”

Section: Introductionmentioning

confidence: 99%

See 2 more Smart Citations

Real-time guaranteed cost control of MIMO networked control systems with packet disordering

Zhang

Huang

et al. 2011

Journal of Process Control

View full text Add to dashboard Cite

Section: Problem Formulationmentioning

confidence: 99%

Section: Stochastic Guaranteed Cost Controlmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

Real-time guaranteed cost control of MIMO networked control systems with packet disordering

Zhang

Huang

et al. 2011

Journal of Process Control

View full text Add to dashboard Cite

“…In an experimental paper [9] we showed that Restored is able to regenerate sequences similar to the original sequences with respect to several reordering metrics. One metric for which this result is true was reorder density (RD) from [10,15,16]. We found the experimental result for RD paradoxical for the following reason: Restored guarantees that the regenerated trace is (locally) similar to the original sequence for a precise notion called ≡ F B -equivalent (rigorously explained below).…”

Section: Introductionmentioning

confidence: 99%

Identifying Almost Sorted Permutations from TCP Buffer Dynamics

Istrate¹

2015

SACS

View full text Add to dashboard Cite

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 packets as well. Call two sequences A, B equivalent (writtenFor a sequence of integers A define SUS(A) to be the shuffled-upsequences reordering measure defined as the smallest possible number of classes in a partition of the original sequence into increasing subsequences. We prove the following result: any two permutations A, B of the same length with SUS(A), SUS(B) ≤ 3 such that A ≡ F B B are identical. The result is no longer valid if we replace the upper bound 3 by 4.We also consider a similar problem for permutations with repeats. In this case the uniqueness of the preimage is no longer true, but we obtain a characterization of all the preimages of a given sequence, which in particular allows us to count them in polynomial time.The results were motivated by explaining the behavior and engineering Restored, a receiver-oriented model of traffic we introduced and experimentally validated in earlier work.

show abstract

“…The reordering of the outgoing packets was measured using two metrics, Reorder Density (RD) and Reorder Bufferoccupancy Density (RBD) [28,29,30]. RD is the distribution of the displacements of packets from their original positions, normalized with respect to the number of packets.…”

Section: Simulation Based Predictionsmentioning

confidence: 99%

On Growth of Parallelism within Routers and Its Impact on Packet Reordering

Bare

Jayasumana

Piratla

2007

2007 15th IEEE Workshop on Local &Amp; Metropolitan Area Networks

View full text Add to dashboard Cite

Abstract-The network link speeds increase at a higher rate compared to processing speeds. This coupled with the increase in size of router tables demand higher levels of parallelism within router hardware. However, such parallelism introduces unintended consequences that potentially may negate some of the performance gains provided by the improved technology. The growth trends of computing speeds, link speeds, and routing table sizes are used to evaluate one such consequence, packet reordering within routers. Results presented show the trends related to the degree of hardware parallelism and packet reordering I. INTRODUCTIONAs the speed of physical links and networks increase beyond gigabit per second, and the end-to-end latency to packet transmission time ratio increases by orders of magnitude, certain phenomena that were insignificant and safely ignored assume substantial importance. In fact some of these second order effects, unless countered, can negate to a significant degree the gains provided by faster physical links and routing/switching hardware, and will have an adverse impact on the end-to-end performance seen by the applications. These unavoidable phenomena include, among others, delay jitter and packet reordering. Jitter has received attention only with respect to real-time applications such as VoIP, and effects of reordering were safely ignored.According to Moore's law, the CPU computing speed approximately doubles every 18 months [1, 2], while recent trends indicate that network link speed approximately doubles every nine months [3,4]. Thus, the network link speeds increase at a faster rate than the computing speed. The Internet itself is growing in size, resulting in the increase of routing tables sizes in backbone routers [5]. Consequently, the amount of processing to be performed by the routers will increase at a faster rate than the rate of increase in the computing power. Routers will rely on architectures that use an increasing number of processors working in parallel to counter the additional computation requirements. However, processing packets from the same stream in parallel processors deteriorates the problem of reordering. The two

show abstract

Reorder buffer-occupancy density and its application for measurement and evaluation of packet reordering

Cited by 18 publications

References 12 publications

Real-time guaranteed cost control of MIMO networked control systems with packet disordering

Real-time guaranteed cost control of MIMO networked control systems with packet disordering

Identifying Almost Sorted Permutations from TCP Buffer Dynamics

On Growth of Parallelism within Routers and Its Impact on Packet Reordering

Contact Info

Product

Resources

About