Résumé
Congestion avoidance algorithms considering the network as a black-box model detect congestion through packet loss and variation in the throughput or in the Round Trip Delay. In this paper we show, by means of analysis and simulation, an undesirable effect acting on delay and throughput based congestion avoidance algorithms. This effect is caused by congestion experienced by acknowledgments. We propose to change these algorithms by dividing the round trip time into a Forward Trip Time and a Backward Trip Time. We show the performance improvement using this distinction. Finally, we describe a possible implementation in the TCP protocol.
| langue originale | Anglais |
|---|---|
| Pages | 1417-1421 |
| Nombre de pages | 5 |
| état | Publié - 1 janv. 1997 |
| Modification externe | Oui |
| Evénement | Proceedings of the 1997 IEEE International Conference on Communications, ICC. Part 3 (of 3) - Montreal, Can Durée: 8 juin 1997 → 12 juin 1997 |
Une conférence
| Une conférence | Proceedings of the 1997 IEEE International Conference on Communications, ICC. Part 3 (of 3) |
|---|---|
| La ville | Montreal, Can |
| période | 8/06/97 → 12/06/97 |
Empreinte digitale
Examiner les sujets de recherche de « Improving congestion avoidance algorithms for asymmetric networks ». Ensemble, ils forment une empreinte digitale unique.Contient cette citation
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver