Predicting Bottleneck Bandwidth Sharing by Generalized TCP Flows
The paper presents a technique for computing the individual throughputs and the average queue occupancy when multiple TCP connections share a single bottleneck buffer. The bottleneck buffer is assumed to perform congestion feedback via randomized packet marking or drops. We first present a fixed poi...
Saved in:
Main Authors: | , , |
---|---|
Format: | text |
Language: | English |
Published: |
Institutional Knowledge at Singapore Management University
2002
|
Subjects: | |
Online Access: | https://ink.library.smu.edu.sg/sis_research/663 https://ink.library.smu.edu.sg/context/sis_research/article/1662/viewcontent/PredictingBottleneck_2002.pdf |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Institution: | Singapore Management University |
Language: | English |
id |
sg-smu-ink.sis_research-1662 |
---|---|
record_format |
dspace |
spelling |
sg-smu-ink.sis_research-16622017-11-01T06:38:46Z Predicting Bottleneck Bandwidth Sharing by Generalized TCP Flows MISRA, Archan OTT, Teunis BARAS, John The paper presents a technique for computing the individual throughputs and the average queue occupancy when multiple TCP connections share a single bottleneck buffer. The bottleneck buffer is assumed to perform congestion feedback via randomized packet marking or drops. We first present a fixed point-based analytical technique to compute the mean congestion window sizes, the mean queue occupancy and the individual throughputs when the TCP flows perform idealized congestion avoidance. We subsequently extend the technique to analyze the case where TCP flows perform generalized congestion avoidance and demonstrate the use of this technique under the Assured Service model, where each flow is assured a minimum traffic rate. Simulations are used to demonstrate the accuracy of this technique for relatively low values of packet dropping probability and a much wider range of packet marking probability. 2002-11-01T08:00:00Z text application/pdf https://ink.library.smu.edu.sg/sis_research/663 info:doi/10.1016/S1389-1286(02)00296-7 https://ink.library.smu.edu.sg/context/sis_research/article/1662/viewcontent/PredictingBottleneck_2002.pdf http://creativecommons.org/licenses/by-nc-nd/4.0/ Research Collection School Of Computing and Information Systems eng Institutional Knowledge at Singapore Management University TCP Throughput RED ECN Congestion avoidance Queues Software Engineering |
institution |
Singapore Management University |
building |
SMU Libraries |
continent |
Asia |
country |
Singapore Singapore |
content_provider |
SMU Libraries |
collection |
InK@SMU |
language |
English |
topic |
TCP Throughput RED ECN Congestion avoidance Queues Software Engineering |
spellingShingle |
TCP Throughput RED ECN Congestion avoidance Queues Software Engineering MISRA, Archan OTT, Teunis BARAS, John Predicting Bottleneck Bandwidth Sharing by Generalized TCP Flows |
description |
The paper presents a technique for computing the individual throughputs and the average queue occupancy when multiple TCP connections share a single bottleneck buffer. The bottleneck buffer is assumed to perform congestion feedback via randomized packet marking or drops. We first present a fixed point-based analytical technique to compute the mean congestion window sizes, the mean queue occupancy and the individual throughputs when the TCP flows perform idealized congestion avoidance. We subsequently extend the technique to analyze the case where TCP flows perform generalized congestion avoidance and demonstrate the use of this technique under the Assured Service model, where each flow is assured a minimum traffic rate. Simulations are used to demonstrate the accuracy of this technique for relatively low values of packet dropping probability and a much wider range of packet marking probability. |
format |
text |
author |
MISRA, Archan OTT, Teunis BARAS, John |
author_facet |
MISRA, Archan OTT, Teunis BARAS, John |
author_sort |
MISRA, Archan |
title |
Predicting Bottleneck Bandwidth Sharing by Generalized TCP Flows |
title_short |
Predicting Bottleneck Bandwidth Sharing by Generalized TCP Flows |
title_full |
Predicting Bottleneck Bandwidth Sharing by Generalized TCP Flows |
title_fullStr |
Predicting Bottleneck Bandwidth Sharing by Generalized TCP Flows |
title_full_unstemmed |
Predicting Bottleneck Bandwidth Sharing by Generalized TCP Flows |
title_sort |
predicting bottleneck bandwidth sharing by generalized tcp flows |
publisher |
Institutional Knowledge at Singapore Management University |
publishDate |
2002 |
url |
https://ink.library.smu.edu.sg/sis_research/663 https://ink.library.smu.edu.sg/context/sis_research/article/1662/viewcontent/PredictingBottleneck_2002.pdf |
_version_ |
1770570655359565824 |