The macroscopic behavior of the TCP congestion avoidance algorithm
ACM SIGCOMM Computer Communication Review
Modeling TCP throughput: a simple model and its empirical validation
Proceedings of the ACM SIGCOMM '98 conference on Applications, technologies, architectures, and protocols for computer communication
Fluid-based analysis of a network of AQM routers supporting TCP flows with an application to RED
Proceedings of the conference on Applications, Technologies, Architectures, and Protocols for Computer Communication
A stochastic model of TCP/IP with stationary random losses
Proceedings of the conference on Applications, Technologies, Architectures, and Protocols for Computer Communication
A survey on statistical bandwidth sharing
Computer Networks: The International Journal of Computer and Telecommunications Networking - Special issue: In memroy of Olga Casals
Using partial differential equations to model TCP mice and elephants in large IP networks
IEEE/ACM Transactions on Networking (TON)
A stochastic model for the throughput of non-persistent TCP flows
valuetools '06 Proceedings of the 1st international conference on Performance evaluation methodolgies and tools
Hi-index | 0.00 |
We analyze the fairness of bandwidth sharing between competing flows when the flows use different packet sizes. For systems where router buffers are defined in packets, we notice that larger packets get preferential treatment. Specifically, in networks, where a higher capacity link is followed by a lower capacity link, packet loss seen by streams with bigger packet size is smaller. We verify our findings by simulating both UDP and TCP traffic in ns2.