Wireshark: Analyzing Load Distribution, Throughput, Time Sequence and Flow Graphs

This article explains how to analyze load distribution, throughput, time sequence and flow graphs using Wireshark. It also covers the protocols captured and their processing time. The article then analyzes data for websites like sbs.com.au, amazon.com.au and howeverythingworks.org.

Wireshark
1
Wireshark

2
Wireshark
Task 1 a
a) The protocols that appear in the captures packets include the following.
The following protocols are captured during the processing of capturing the packets.
 TCP
 HTTP
 ARP
b)

3
Wireshark
The time take was 75 ms.
c) The address of gaia.cs.umass.edu is 128.119.245.12
Task 1 b ; Analyzation of data

4
Wireshark
Analyzation of https://www.sbs.com.au/news/
Load distribution
It uses time period that loads every data of the requested website by the client as the focal point of
studying [1]. This depends on the network and internet performance duration that the content takes to
load. The diagram of load distribution is as shown below
The load distribution diagram here demonstrates the ideal execution of investigation with hundred
percent score card. From the above take a table at the heap circulation table the parcels sent are at a
rate of 40 counts for every a time of 0.000253 milliseconds which is very quick subsequently toll enough
for a generally decent site execution [2].

5
Wireshark
Throughput graph
Time succession chart of this site indicates precariousness conduct of bytes concerning time change. The
change anyway is customary shaping even interims in change of one and half units of bytes.

6
Wireshark
Time sequence graph
This is graph the shows data sequence over or against time of any given website. The sequence numbers
in the graph can represent the bytes that are sent in the website. In the graph above the sequence
increases by one to any TCP data that is sent [3] .if graph could be drawn in the network then the slope
of the line could be theoretical bandwidth of the pipe. This graph shows that the steeper the line is then
the higher the throughput.

7
Wireshark
Flow graph
Not at all like other stream charts as you will see beneath, the length is exceptionally insignificant simply
indicating normal execution or rather most elevated execution in the entire examination. The graph
shows initiation of connection between the users and the serve [4 ]r. The time of transmission, frame
size and number of frames TCP ports that are used in the connection are all shown in the above
diagram. The packets that are also lost in the process of transmission can also be located using the flow
graph as shown above. The flow graph can also be saved as a text file.

8
Wireshark
Window scaling
Window scaling manages TCP window, which utilizes memory cushions. With information stacked in the
cradles the execution of the destinations has a tendency to back off subsequently the extent of the
recipient window and the speed are straightforwardly corresponding.

9
Wireshark
Analyzation of https://www.amazon.com.au
Load distribution
Load distribution appropriation centers around day and age of the stacking of each web asked for
content by the customer. Contingent upon the system and web execution the term which diverse
substance take to stack fluctuates. From the above take a gander at the heap circulation table the
parcels sent are at a rate of 0 for every a time of 0.000253 milliseconds which is very quick subsequently
toll enough for a generally decent site execution [4].

10
Wireshark
Throughput graph
This chart demonstrates the measure of throughput on the server amid each second of the heap test
situation run. Throughput is estimated in bytes or megabytes and speaks to the measure of information
that the users got from the server at some random second. To see throughput in megabytes, utilize.

11
Wireshark
Time sequence graph
This is diagram the shows information arrangement over or against time of some random site. The
succession numbers in the chart can speak to the bytes that are sent in the site. In the diagram over the
arrangement increments by one to any TCP information that is sent .if chart could be attracted the
system then the incline of the line could be hypothetical data transfer capacity of the pipe [5]. This
diagram demonstrates that the more extreme the line is then the higher the throughput. The graphs
shows that one factor increases and the other one remains constant. If then time increases then time
sequence remains constant as shown in the diagram above.

12
Wireshark
Flow graph
General
Demonstrates the association inception process between the server and the customer. Once the
association is set up, the information outlines begin to stream. The basic points of interest of a casing
are appeared in the stream chart. We can see, for example, the season of transmission, the extent of the
casing, the arrangement number of the casing and the TCP ports utilized for the association. You can
likewise advance through the diagram to the end and check whether there are any re-transmits because
of bundle misfortune or timeouts.

13
Wireshark
Tcp flow
The diagram indicates commencement of association between the clients and the server. The season of
transmission, outline size and number of casings TCP ports that are utilized in the association are
altogether appeared in the above chart. The parcels that are additionally lost during the time spent
transmission can likewise be found utilizing the stream chart as appeared previously. The ACK values are
used to determine this [5].
Windows scaling
Discussing window scaling we are essentially discussing TCP window get window which is basically a
cushion on the two sides of TCP association holding the approaching information just incidentally. At the
point when the information in this store isn't cleaned it subsequently causes moderate web execution
and the inverse is valid.

14
Wireshark
Analyzation of http://howeverythingworks.org
Load distribution
Load distribution appropriation centers around day and age of the stacking of each web asked for
content by the customer. Contingent upon the system and web execution the term which diverse
substance take to stack fluctuates. From the above take a gander at the heap circulation table the
parcels sent are at a rate of 1 for every a time of milliseconds which is very quick subsequently toll
enough for a generally decent site execution.

15
Wireshark
Throughput
This is outline the shows data course of action over or against time of some arbitrary site. The
progression numbers in the diagram can address the bytes that are sent in the site. In the outline over
the course of action augments by one to any TCP data that is sent. The graph shows that data time
sequence varies with time as the data flow in the system.

16
Wireshark
Time sequence
This is diagram the shows information arrangement over or against time of some random site. The
succession numbers in the chart can speak to the bytes that are sent in the .The graph is a comparison
between sequences and time. The graph shows that the sequence number of the website increases
with increase in time

17
Wireshark
Flow graph
General flow
Demonstrates the association inception process between the server and the customer. Once the
association is set up, the information outlines begin to stream. The basic points of interest of a casing
are appeared in the stream chart

18
Wireshark
Tcp flow
Window scaling

19
Wireshark
Window scaling oversees TCP window, which uses memory pads. With data stacked in the supports the
execution of the goals tends to back off consequently the degree of the beneficiary window and the
speed are direct comparing.

20
Wireshark
Task 2
Analyzation of http://www.radioau.net/
Time sequence
The graph is empty showing that no data packets are being captured.

21
Wireshark
References
[1] Padhye, J., Firoiu, V., Towsley, D. and Kurose, J.. Modeling TCP throughput: A simple
model and its empirical validation. ACM SIGCOMM Computer Communication Review, 28(4),
pp.303-314, 2010.
[2] McGregor, A., Hall, M., Lorier, P. and Brunskill, JFlow clustering using machine learning
techniques. In International Workshop on Passive and Active Network Measurement (pp. 205-
214). Springer, Berlin, Heidelberg ., 2009.
[3] Mahajan, R., Rodrig, M., Wetherall, D. and Zahorjan, J.. Analyzihe MAC-level behavior of
wireless networks in the wild. In ACM SIGCOMM Computer Communication Review (Vol. 36,
No. 4, pp. 75-86). ACM,2010
[4]Yajnik, M., Moon, S., Kurose, J. and Towsley, D., Measurement and modelling of the
temporal dependence in packet loss. In INFOCOM'99. Eighteenth Annual Joint Conference of
the IEEE Computer and Communications Societies. Proceedings. IEEE (Vol. 1, pp. 345-352).
IEEE,2010
[5] Pang, R., Allman, M., Paxson, V. and Lee, J.. The devil and packet trace anonymization.
ACM SIGCOMM Computer Communication Review, 36(1), pp.29-38,2012