In computer networking, a '''mouse flow''' is a short (in total bytes) flow set up by a TCP (or other protocol) flow measured over a network link.
A mouse is a flow with fewer than C packets. An elephant flow is a flow with at least C packets. The constant C is left as a degree of freedom in the analysis. C is chosen depending on the target application.<ref>{{cite journal |url=http://hal.inria.fr/docs/00/39/73/14/PDF/Hal.pdf |title=Adaptive Algorithms for the Identification of Large Flows in IP Traffic |author1=Azzana, Y |author2=Chabchoub, Y |author3=Fricker, C |author4=Guillemin, F. |author5=Robert, P. |name-list-style=amp }}</ref>
== See also == *Pareto principle *Elephant flow
== References == {{reflist}}
{{DEFAULTSORT:Mouse Flow}} Category:Network performance