| T. J. Shepard. TCP Packet Trace Analysis. Technical Report MIT/LCS/TR-494, Laboratory for Computer Science, Massachusetts Institute of Technology, February 1991. (p 132) |
....to perform automated packet trace analysis. The most basic problem with TCP packet trace analysis is that traces are usually large and complex, and key information in a trace may be difficult to identify. The most simple analysis techniques are graphical, such as time line plots or sequence plots [58, 117] which enable one to understand the data and acknowledgment sequences of a transaction. In [21] Brakmo et al. developed a sophisticated graphical tool which enables multiple details of a TCP transaction to be tracked simultaneously. In [103] Paxson describes the tool tcpanaly which he used to ....
T. Shepard. TCP packet trace analysis. Master's thesis, Massachusetts Institute of Technology, 1990.
....bottleneck link. The emphasis of the discussion in this paper will be on the methods and tools used to detect ACK compression and related phenomena, rather than a broad study of the frequency of ACKcompression. 1.2. Related work Timothy Shepard s work on the problem of TCP packet trace analysis [16] extended the repertoire of graphical methods for visualizing TCP traces, and described a way to quantify the burstiness of a connection. Automated detection of ACK compression relies on a similar method (see section 2.3) Trevor Mendez [12] worked on the problem of identifying pathological TCP ....
....far too small. Plots of ACK value versus time for actual TCP connections show phases of relatively steady progress (diagonal lines) interspersed with dead periods (horizontal lines) Clearly, what we want is to ignore the dead periods when computing the true bandwidth. Previous work by Shepard [16] suggests a solution. In order to visualize the burstiness of TCP connections, he plotted the distribution of the instantaneous bandwidths for a connection. The 7 OBSERVING TCP DYNAMICS IN REAL NETWORKS x axis of these plots shows the number of bytes carried in a packet divided by the time since ....
[Article contains additional citation context not shown here]
Timothy Jay Shepard. TCP Packet Trace Analysis. MIT/LCS/TR- 494, Laboratory for Computer Science, Massachusetts Institute of Technology, February, 1991.
....set of tools available to work with packet traces. The most basic problem with packet trace analysis is that traces are usually large and complex, so it can be dicult to identify key information in a trace. The most simple analysis techniques are graphical such as time line plots or sequence plots [21, 38] which enable one to understand the data and acknowledgment sequences of a transaction. In [11] Brakmo et al. developed a sophisticated graphical tool which enables multiple details of a TCP transaction to be followed simultaneously. In [33] Paxson describes the tool tcpanaly which he used to ....
T. Shepard. TCP packet trace analysis. Master's thesis, Massachusetts Institute of Technology, 1990.
....has been explored in many contexts, beginning with static protocol graphs, and visualization of large scale tra c, more recently including simulation visualizations and editors. Graphs of packet exchanges are very useful at understanding cause and e ect in complex protocols like TCP. Work at MIT [14] and the University of Arizona [4] is typical: graphs show time against TCP sequence numbers on a 2 D graph, possibly with annotations to show special events. Similar time event graphs have proven useful in understanding reliable multicast behavior in SRM [6] Although nam graphs are not as ....
Shepard, T. J. TCP packet trace analysis. Tech. Rep. 494, Massachusetts Institute of Technology, Feb. 1991.
No context found.
T. J. Shepard. TCP Packet Trace Analysis. Technical Report MIT/LCS/TR-494, Laboratory for Computer Science, Massachusetts Institute of Technology, February 1991. (p 132)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC