The window distribution of multiple TCPs with random loss queues
Two approximate techniques for analyzing the window size distribution of TCP flows sharing a RED-like bottleneck queue are presented. Both methods presented first use a fixed point algorithm to obtain the mean window sizes of the flows, and the mean queue length in the bottleneck buffer. The simpler...
Saved in:
| Main Authors: | , , |
|---|---|
| Format: | text |
| Language: | English |
| Published: |
Institutional Knowledge at Singapore Management University
1999
|
| Subjects: | |
| Online Access: | https://ink.library.smu.edu.sg/sis_research/721 https://ink.library.smu.edu.sg/context/sis_research/article/1720/viewcontent/WindowDistnMultipleTCP_Globecom99.pdf |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Institution: | Singapore Management University |
| Language: | English |