published in Proceedings of the 4th ROEDUNET International Conference, Education/Training and Information/Communication Technologies – ROEDUNET ’05, Romania, pp. 225-234, 2005.
Indexed in: Thomson Reuters ISI proceedings
Cite as
|
1 |
A. Campan, D. Bufnea, "Delimitation of Macroflows in Congestion Control Management Using Data Mining Techniques", in Proceedings of the 4th ROEDUNET International Conference, Education/Training and Information/Communication Technologies – ROEDUNET '05, Romania, pp. 225-234, 2005 |
Full paper
Delimitation of Macroflows in Congestion Control Management Using Data Mining Techniques
Authors
Alina Campan, Darius Bufnea
Department of Computer Science, Faculty of Mathematics and Computer Science,
Babeş-Bolyai University of Cluj-Napoca
Abstract
Some of the newest approaches in Internet congestion control management suggest collaboration between sets of streams that should share network resources and learn from each other about the state of the network. A set of such collaborating streams is called a macroflow. In classical congestion control approach, a stream learns information about the network state by itself. It makes use of the acquired knowledge to adapt its transmission rates to the current network conditions. Stream collaboration, in exchange, permits dissemination of network state knowledge: the streams in a macroflow maintain common information about the network state. Every stream in that macroflow uses this shared knowledge and contributes to its maintenance. This dissemination of network knowledge conducts to a better, faster and more flexible adaptation of flow behavior in presence of network congestion. The remaining problem is how to identify the streams forming such a logical entity (a macroflow). Currently a macroflow is organized on host pair basis. We propose in this paper a new method for grouping streams into macroflows if they behave similarly. A flow behavior is described by a set of state variables, such as the congestion window size, the round trip time or retransmission time out. This extended macroflow granularity can be used in an improved Congestion Manager.
Key words
congestion control, congestion manager, macroflow, congestion window
BibTeX bib file
|
1 2 3 4 5 6 7 8 |
@inproceedings{campan2005delimitation, title={Delimitation of Macroflows in Congestion Control Management Using Data Mining Techniques}, author={C{\^a}mpan, Alina and Bufnea, Darius}, booktitle={4th ROEDUNET International Conference, Education/Training and Information/Communication Technologies}, volume={5}, pages={225--234}, year={2005} } |
EndNote enw file
References
- Allman, M., Paxson, V., Stevens, W., TCP Congestion Control, IETF RFC 2581, April, 1999.
- Balakrishnan, H., Seshan, S., The Congestion Manager, IETF RFC 3124, June 2001.
- Bufnea, D., Sterca, A., Cobarzan, C., Boian, F., TCP State Variables Sharing, Proc. of the Symposium “Zilele Academice Clujene”, pp 129-133, Cluj-Napoca, 2004.
- Floyd, S., A reports on Some Recent Developments in TCP Congestion Control, IEEE Communication Magazine, April 2001, vol 39, no 4.
- Han, J., Kamber, M., Data Mining: Concepts and Techniques, Morgan Kaufmann Publishers, 2001.
- Jacobson, V., Congestion Avoidance and Control, Proc. of SIGCOMM ’88, ACM, 1988.
- Paxon, V., Allman, M., Computing TCP’s Retransmission Timer, IEFC RFC 2988, November 2000.
- Sarolahti, P., Kuznetzov, A., Congestion Control in Linux TCP, Proc. of the FREENIX Track, USENIX Annual Technical Conf., pp 49-62, 2002.
- Touch, J., TCP Control Block Interdependence, IETF RFC 2140, April 1997.
