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: | , , |
---|---|
格式: | text |
語言: | English |
出版: |
Institutional Knowledge at Singapore Management University
1999
|
主題: | |
在線閱讀: | https://ink.library.smu.edu.sg/sis_research/721 https://ink.library.smu.edu.sg/context/sis_research/article/1720/viewcontent/WindowDistnMultipleTCP_Globecom99.pdf |
標簽: |
添加標簽
沒有標簽, 成為第一個標記此記錄!
|
成為第一個發表評論!