Measuring packet reordering

Bellardo, John; Savage, Stefan

doi:10.1145/637215.637216

Cited by 16 publications

(21 citation statements)

References 10 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Reordering is detected whenever the segment is being observed for the first time and the IP ID is below the value of the highest IP ID seen thus far. This assumes IP IDs are assigned sequentially, which is true for all prominent operating systems except for OpenBSD [17]. Our experiences from developing and testing tcpcsm suggest that this is still correct.…”

Section: Location Of the Monitor Pointmentioning

confidence: 96%

Passive detection of TCP congestion events

Alcock

Nelson

2011

2011 18th International Conference on Telecommunications

View full text Add to dashboard Cite

Detailed passive analysis of TCP sender behaviour requires accurate identification of congestion events. Previous tools that attempt to provide such information do not incorporate the behaviour of recent operating systems and TCP features and are therefore of little use to researchers analysing contemporary TCP traffic. In this paper, we present a new tool for identifying and classifying TCP congestion events from a passive packet trace, called tcpcsm, which understands modern operating system TCP behaviour. We discuss the major problems that occur when passively identifying TCP congestion events and describe how tcpcsm solves them. We also show that tcpcsm is more accurate than previous tools using a series of controlled experiments involving a variety of operating systems.

show abstract

Section: Location Of the Monitor Pointmentioning

confidence: 96%

Passive detection of TCP congestion events

Alcock

Nelson

2011

2011 18th International Conference on Telecommunications

View full text Add to dashboard Cite

show abstract

“…For example, Internet measurements (e.g., [9]) have established the occurrence of corruption, packet loss and reordering in the Internet routing system. Also, packet losses and corruptions are frequent events in wireless networks.…”

Section: Introductionmentioning

confidence: 99%

Byte Caching in Wireless Networks

Le¹,

Srivatsa²,

Iyengar³

2012

2012 IEEE 32nd International Conference on Distributed Computing Systems

View full text Add to dashboard Cite

The explosion of data consumption has led to a renewed interest in byte caching. With studies showing potential reductions in network traffic of 50%, this fine grained caching technique looks like a very good and attractive solution for mobile wireless operators. However, properties of wireless networks actually present new challenges. We first show that a single packet loss, re-ordering or corruption -all common conditions over the air interface -can result in circular dependencies and cause existing byte caching algorithms to loop endlessly. To remedy the problem, we then explore a new set of encoding algorithms. Third, we assess the impact of packet losses on byte caching performances, both in terms of byte savings and delay reduction. We found that a mere 1% packet loss can already nullify any delay reduction and instead cause significant increases that users may not be willing to tolerate. Finally, we shared several insights, including interactions between transport layer protocol's mechanisms (e.g., TCP window congestion) and byte caching operations that can cause sophisticated encoding algorithms to perform poorly. We believe that these insights are important for designing more efficient and robust byte caching encoding algorithms.

show abstract

“…Research on network traffic modeling has recently highlighted the central role packet reordering plays in the overall dynamics of TCP traffic [2,3,13]. New measures of reordering have been introduced [17], and a variety of measures have been reviewed [14,18].…”

Section: Introductionmentioning

confidence: 99%

“…In our example, packets 1, 2, 3, 4, 8, 9, 10 and 11 are thus all pivots. 2 We omit the slow start phase from our discussions. This definition suggests a coarsened view of TCP with two states: An ordered state O , in which packets arrive in order, and an unordered state U in which there is reordering and buffering.…”

Section: An Introduction To Restoredmentioning

confidence: 99%

Packet Reordering Metrics: Some Methodological Considerations

Istrate

Hansson

Yan

2006

International Conference on Networking and Services (ICNS'06)

View full text Add to dashboard Cite

Characterizing what makes a packet reordering metric meaningful is a problem that has attracted significant interest, but it still lacks a universally accepted solution. We contribute to this discussion by investigating some theoretical concepts that make the following simple intuitions precise:-A metric that is inconsistent, i.e., gives different values on two similar TCP traces, should not be regarded as useful.-We formalize the notion of two traces being "identical modulo unimportant details" using similarity relations.-If "real-life" traces differ from random sequences by always satisfying certain reorder invariants, then we should only use traces satisfying these invariants when investigating the consistency of a reordering metric.We illustrate these concepts in the context of Restored, an approach to semantic compression of TCP traces [10]. In particular, we discuss the consistency of two metrics defined by Jayasumana et al. [1,12] with respect to the similarity notions defined in [8,9,10].

show abstract

Measuring packet reordering

Cited by 16 publications

References 10 publications

Passive detection of TCP congestion events

Passive detection of TCP congestion events

Byte Caching in Wireless Networks

Packet Reordering Metrics: Some Methodological Considerations

Contact Info

Product

Resources

About