Self-similarity in World Wide Web traffic: evidence and possible causes
Proceedings of the 1996 ACM SIGMETRICS international conference on Measurement and modeling of computer systems
The macroscopic behavior of the TCP congestion avoidance algorithm
ACM SIGCOMM Computer Communication Review
Modeling TCP Reno performance: a simple model and its empirical validation
IEEE/ACM Transactions on Networking (TON)
Equation-based congestion control for unicast applications
Proceedings of the conference on Applications, Technologies, Architectures, and Protocols for Computer Communication
Statistical bandwidth sharing: a study of congestion at flow level
Proceedings of the 2001 conference on Applications, technologies, architectures, and protocols for computer communications
On a reduced load equivalence for fluid queues under subexponentiality
Queueing Systems: Theory and Applications
User-level performance of elastic traffic in a differentiated-services environment
Performance Evaluation
Reduced Load Equivalence under Subexponentiality
Queueing Systems: Theory and Applications
On performance bounds for the integration of elastic and adaptive streaming flows
Proceedings of the joint international conference on Measurement and modeling of computer systems
Fluid Queues with Heavy-Tailed M/G/∞ Input
Mathematics of Operations Research
Integration of TCP-friendly streaming sessions and heavy-tailed elastic flows
ACM SIGMETRICS Performance Evaluation Review
Sojourn time asymptotics in processor-sharing queues
Queueing Systems: Theory and Applications
Flow vs. time sampling for throughput performance evaluation
Performance Evaluation
Sojourn time asymptotics in Processor Sharing queues with varying service rate
Queueing Systems: Theory and Applications
Hi-index | 0.00 |
We consider a fixed number of streaming sessions which share a bottleneck link with a dynamic population of elastic flows. Motivated by extensive measurement studies, we assume that the sizes of the elastic flows exhibit heavy-tailed characteristics. The elastic flows are TCP-controlled, while the transmission rates of the streaming applications are governed by a so-called TCP-friendly rate control protocol. TCP-friendly rate control protocols provide a promising mechanism for avoiding severe fluctuations in the transmission rate, while ensuring fairness with competing TCP-controlled flows. Adopting the processor-sharing (PS) discipline to model the bandwidth sharing, we investigate the tail distribution of the deficit in service received by the streaming sessions compared to a nominal service target. The latter metric provides an indication for the quality experienced by the streaming applications. The results yield valuable qualitative insight into the occurrence of persistent quality disruption for the streaming users. We also examine the delay performance of the elastic flows by exploiting a useful relationship with a processor-sharing queue with permanent customers.