Calculating the throughput of a given TCP connection
Given a TCP session, is there a way to determine the throughput of the sender?
I have a wireshark sniff, and I see that to calculate the throughput of the sender I can use theTCP-Window-Size-in-bits / Latency-in-seconds = Bits-per-second-throughput formula,
But the window is constantly changing (due to the tcp protocol).
Furthermore, why does the tcp window size is taken into account? isn't that true that sometimes the sender sends more than one segment before receiving the ack?
tcp wireshark
asked Nov 21 '18 at 11:13
DsCppDsCpp
1443
add a comment |
Given a TCP session, is there a way to determine the throughput of the sender?
I have a wireshark sniff, and I see that to calculate the throughput of the sender I can use theTCP-Window-Size-in-bits / Latency-in-seconds = Bits-per-second-throughput formula,
But the window is constantly changing (due to the tcp protocol).
Furthermore, why does the tcp window size is taken into account? isn't that true that sometimes the sender sends more than one segment before receiving the ack?
tcp wireshark
asked Nov 21 '18 at 11:13
DsCppDsCpp
1443
add a comment |
Given a TCP session, is there a way to determine the throughput of the sender?
I have a wireshark sniff, and I see that to calculate the throughput of the sender I can use theTCP-Window-Size-in-bits / Latency-in-seconds = Bits-per-second-throughput formula,
But the window is constantly changing (due to the tcp protocol).
Furthermore, why does the tcp window size is taken into account? isn't that true that sometimes the sender sends more than one segment before receiving the ack?
tcp wireshark
asked Nov 21 '18 at 11:13
DsCppDsCpp
1443
Given a TCP session, is there a way to determine the throughput of the sender?
I have a wireshark sniff, and I see that to calculate the throughput of the sender I can use theTCP-Window-Size-in-bits / Latency-in-seconds = Bits-per-second-throughput formula,
But the window is constantly changing (due to the tcp protocol).
Furthermore, why does the tcp window size is taken into account? isn't that true that sometimes the sender sends more than one segment before receiving the ack?
tcp wireshark
tcp wireshark
asked Nov 21 '18 at 11:13
DsCppDsCpp
1443
asked Nov 21 '18 at 11:13
DsCppDsCpp
1443
asked Nov 21 '18 at 11:13
DsCppDsCpp
1443
asked Nov 21 '18 at 11:13
DsCppDsCpp
1443
asked Nov 21 '18 at 11:13
DsCppDsCpp
1443
1443
add a comment |
add a comment |
2 Answers
2
active
oldest
votes
isn't that true that sometimes the sender sends more than one segment before receiving the ack?
This is exactly what "window" means. Imagine a protocol requiring acknowledgment but only sending a single data packet/segment each time (window = 1 segment) - there can only be a single segment/ACK pair in each round-trip period, regardless of the actual bandwidth.
The send window provides a method to send multiple segments consecutively before expecting ACKs. Each segment that's ACKed is removed from the send window and the window advanced to a new segment - hence "sliding window".
Sending multiple segments "in parallel" with an adaptive, sliding window, you can make use of the total bandwidth. Generally, you cannot transport more data than one full window within each RTT period.
TCP uses a sliding window that is controlled by the (constantly monitored) RTT value as congestion sensor - from a simplified perspective, when RTT goes up, the window size goes down and vice versa. Naturally, each value may change at any time due to the network load and other variables.
answered Nov 21 '18 at 15:10
Zac67Zac67
26.7k21352
The windows is not only sliding, but also adapting to the dynamic net, i.e. getting bigger/smaller regards the RTT and packet drop statistics, no? (congestion avoidance algorithms)? do we have a better solution to calculate the throughput than just average the window size over time?
– DsCpp
Nov 22 '18 at 8:46
The windows size adapts, see my last paragraph. "Throughput" is a instantaneous value, just like RTT and window size. If you average one, you average them all.
– Zac67
Nov 22 '18 at 18:20
add a comment |
All the measurements are changing: the throughput and the latency can be instantaneous measurements too.
- If you want an average, measure it over a long period
- Yes, the sender very often will send segments before getting the acknowledgment
answered Nov 21 '18 at 13:42
jonathanjojonathanjo
10.9k1834
add a comment |
Your Answer
StackExchange.ready(function() {
var channelOptions = {
tags: "".split(" "),
id: "496"
};
initTagRenderer("".split(" "), "".split(" "), channelOptions);
StackExchange.using("externalEditor", function() {
// Have to fire editor after snippets, if snippets enabled
if (StackExchange.settings.snippets.snippetsEnabled) {
StackExchange.using("snippets", function() {
createEditor();
});
}
else {
createEditor();
}
});
function createEditor() {
StackExchange.prepareEditor({
heartbeatType: 'answer',
autoActivateHeartbeat: false,
convertImagesToLinks: false,
noModals: true,
showLowRepImageUploadWarning: true,
reputationToPostImages: null,
bindNavPrevention: true,
postfix: "",
imageUploader: {
brandingHtml: "Powered by u003ca class="icon-imgur-white" href="https://imgur.com/"u003eu003c/au003e",
contentPolicyHtml: "User contributions licensed under u003ca href="https://creativecommons.org/licenses/by-sa/3.0/"u003ecc by-sa 3.0 with attribution requiredu003c/au003e u003ca href="https://stackoverflow.com/legal/content-policy"u003e(content policy)u003c/au003e",
allowUrls: true
},
noCode: true, onDemand: true,
discardSelector: ".discard-answer"
,immediatelyShowMarkdownHelp:true
});
}
});
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
StackExchange.ready(
function () {
StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fnetworkengineering.stackexchange.com%2fquestions%2f54889%2fcalculating-the-throughput-of-a-given-tcp-connection%23new-answer', 'question_page');
}
);
Post as a guest
Required, but never shown
2 Answers
2
active
oldest
votes
2 Answers
2
active
oldest
votes
active
oldest
votes
active
oldest
votes
isn't that true that sometimes the sender sends more than one segment before receiving the ack?
This is exactly what "window" means. Imagine a protocol requiring acknowledgment but only sending a single data packet/segment each time (window = 1 segment) - there can only be a single segment/ACK pair in each round-trip period, regardless of the actual bandwidth.
The send window provides a method to send multiple segments consecutively before expecting ACKs. Each segment that's ACKed is removed from the send window and the window advanced to a new segment - hence "sliding window".
Sending multiple segments "in parallel" with an adaptive, sliding window, you can make use of the total bandwidth. Generally, you cannot transport more data than one full window within each RTT period.
TCP uses a sliding window that is controlled by the (constantly monitored) RTT value as congestion sensor - from a simplified perspective, when RTT goes up, the window size goes down and vice versa. Naturally, each value may change at any time due to the network load and other variables.
answered Nov 21 '18 at 15:10
Zac67Zac67
26.7k21352
The windows is not only sliding, but also adapting to the dynamic net, i.e. getting bigger/smaller regards the RTT and packet drop statistics, no? (congestion avoidance algorithms)? do we have a better solution to calculate the throughput than just average the window size over time?
– DsCpp
Nov 22 '18 at 8:46
The windows size adapts, see my last paragraph. "Throughput" is a instantaneous value, just like RTT and window size. If you average one, you average them all.
– Zac67
Nov 22 '18 at 18:20
add a comment |
isn't that true that sometimes the sender sends more than one segment before receiving the ack?
This is exactly what "window" means. Imagine a protocol requiring acknowledgment but only sending a single data packet/segment each time (window = 1 segment) - there can only be a single segment/ACK pair in each round-trip period, regardless of the actual bandwidth.
The send window provides a method to send multiple segments consecutively before expecting ACKs. Each segment that's ACKed is removed from the send window and the window advanced to a new segment - hence "sliding window".
Sending multiple segments "in parallel" with an adaptive, sliding window, you can make use of the total bandwidth. Generally, you cannot transport more data than one full window within each RTT period.
TCP uses a sliding window that is controlled by the (constantly monitored) RTT value as congestion sensor - from a simplified perspective, when RTT goes up, the window size goes down and vice versa. Naturally, each value may change at any time due to the network load and other variables.
answered Nov 21 '18 at 15:10
Zac67Zac67
26.7k21352
The windows is not only sliding, but also adapting to the dynamic net, i.e. getting bigger/smaller regards the RTT and packet drop statistics, no? (congestion avoidance algorithms)? do we have a better solution to calculate the throughput than just average the window size over time?
– DsCpp
Nov 22 '18 at 8:46
The windows size adapts, see my last paragraph. "Throughput" is a instantaneous value, just like RTT and window size. If you average one, you average them all.
– Zac67
Nov 22 '18 at 18:20
add a comment |
isn't that true that sometimes the sender sends more than one segment before receiving the ack?
This is exactly what "window" means. Imagine a protocol requiring acknowledgment but only sending a single data packet/segment each time (window = 1 segment) - there can only be a single segment/ACK pair in each round-trip period, regardless of the actual bandwidth.
The send window provides a method to send multiple segments consecutively before expecting ACKs. Each segment that's ACKed is removed from the send window and the window advanced to a new segment - hence "sliding window".
Sending multiple segments "in parallel" with an adaptive, sliding window, you can make use of the total bandwidth. Generally, you cannot transport more data than one full window within each RTT period.
TCP uses a sliding window that is controlled by the (constantly monitored) RTT value as congestion sensor - from a simplified perspective, when RTT goes up, the window size goes down and vice versa. Naturally, each value may change at any time due to the network load and other variables.
answered Nov 21 '18 at 15:10
Zac67Zac67
26.7k21352
isn't that true that sometimes the sender sends more than one segment before receiving the ack?
This is exactly what "window" means. Imagine a protocol requiring acknowledgment but only sending a single data packet/segment each time (window = 1 segment) - there can only be a single segment/ACK pair in each round-trip period, regardless of the actual bandwidth.
The send window provides a method to send multiple segments consecutively before expecting ACKs. Each segment that's ACKed is removed from the send window and the window advanced to a new segment - hence "sliding window".
Sending multiple segments "in parallel" with an adaptive, sliding window, you can make use of the total bandwidth. Generally, you cannot transport more data than one full window within each RTT period.
TCP uses a sliding window that is controlled by the (constantly monitored) RTT value as congestion sensor - from a simplified perspective, when RTT goes up, the window size goes down and vice versa. Naturally, each value may change at any time due to the network load and other variables.
answered Nov 21 '18 at 15:10
Zac67Zac67
26.7k21352
edited Nov 22 '18 at 18:20
answered Nov 21 '18 at 15:10
Zac67Zac67
26.7k21352
answered Nov 21 '18 at 15:10
Zac67Zac67
26.7k21352
answered Nov 21 '18 at 15:10
Zac67Zac67
26.7k21352
26.7k21352
The windows is not only sliding, but also adapting to the dynamic net, i.e. getting bigger/smaller regards the RTT and packet drop statistics, no? (congestion avoidance algorithms)? do we have a better solution to calculate the throughput than just average the window size over time?
– DsCpp
Nov 22 '18 at 8:46
The windows size adapts, see my last paragraph. "Throughput" is a instantaneous value, just like RTT and window size. If you average one, you average them all.
– Zac67
Nov 22 '18 at 18:20
add a comment |
The windows is not only sliding, but also adapting to the dynamic net, i.e. getting bigger/smaller regards the RTT and packet drop statistics, no? (congestion avoidance algorithms)? do we have a better solution to calculate the throughput than just average the window size over time?
– DsCpp
Nov 22 '18 at 8:46
The windows size adapts, see my last paragraph. "Throughput" is a instantaneous value, just like RTT and window size. If you average one, you average them all.
– Zac67
Nov 22 '18 at 18:20
The windows is not only sliding, but also adapting to the dynamic net, i.e. getting bigger/smaller regards the RTT and packet drop statistics, no? (congestion avoidance algorithms)? do we have a better solution to calculate the throughput than just average the window size over time?
– DsCpp
Nov 22 '18 at 8:46
The windows is not only sliding, but also adapting to the dynamic net, i.e. getting bigger/smaller regards the RTT and packet drop statistics, no? (congestion avoidance algorithms)? do we have a better solution to calculate the throughput than just average the window size over time?
– DsCpp
Nov 22 '18 at 8:46
The windows size adapts, see my last paragraph. "Throughput" is a instantaneous value, just like RTT and window size. If you average one, you average them all.
– Zac67
Nov 22 '18 at 18:20
The windows size adapts, see my last paragraph. "Throughput" is a instantaneous value, just like RTT and window size. If you average one, you average them all.
– Zac67
Nov 22 '18 at 18:20
add a comment |
All the measurements are changing: the throughput and the latency can be instantaneous measurements too.
- If you want an average, measure it over a long period
- Yes, the sender very often will send segments before getting the acknowledgment
answered Nov 21 '18 at 13:42
jonathanjojonathanjo
10.9k1834
add a comment |
All the measurements are changing: the throughput and the latency can be instantaneous measurements too.
- If you want an average, measure it over a long period
- Yes, the sender very often will send segments before getting the acknowledgment
answered Nov 21 '18 at 13:42
jonathanjojonathanjo
10.9k1834
add a comment |
All the measurements are changing: the throughput and the latency can be instantaneous measurements too.
- If you want an average, measure it over a long period
- Yes, the sender very often will send segments before getting the acknowledgment
answered Nov 21 '18 at 13:42
jonathanjojonathanjo
10.9k1834
All the measurements are changing: the throughput and the latency can be instantaneous measurements too.
- If you want an average, measure it over a long period
- Yes, the sender very often will send segments before getting the acknowledgment
answered Nov 21 '18 at 13:42
jonathanjojonathanjo
10.9k1834
answered Nov 21 '18 at 13:42
jonathanjojonathanjo
10.9k1834
answered Nov 21 '18 at 13:42
jonathanjojonathanjo
10.9k1834
answered Nov 21 '18 at 13:42
jonathanjojonathanjo
10.9k1834
10.9k1834
add a comment |
add a comment |
Thanks for contributing an answer to Network Engineering Stack Exchange!
- Please be sure to answer the question. Provide details and share your research!
But avoid …
- Asking for help, clarification, or responding to other answers.
- Making statements based on opinion; back them up with references or personal experience.
To learn more, see our tips on writing great answers.
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
StackExchange.ready(
function () {
StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fnetworkengineering.stackexchange.com%2fquestions%2f54889%2fcalculating-the-throughput-of-a-given-tcp-connection%23new-answer', 'question_page');
}
);
Post as a guest
Required, but never shown
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
