Resource allocation problems: algorithmic approaches
Resource allocation problems: algorithmic approaches
Congestion avoidance and control
SIGCOMM '88 Symposium proceedings on Communications architectures and protocols
Random early detection gateways for congestion avoidance
IEEE/ACM Transactions on Networking (TON)
Probability, stochastic processes, and queueing theory: the mathematics of computer performance modeling
SIGMETRICS '97 Proceedings of the 1997 ACM SIGMETRICS international conference on Measurement and modeling of computer systems
Generating representative Web workloads for network and server performance evaluation
SIGMETRICS '98/PERFORMANCE '98 Proceedings of the 1998 ACM SIGMETRICS joint international conference on Measurement and modeling of computer systems
Summary of WWW characterizations
WWW7 Proceedings of the seventh international conference on World Wide Web 7
A performance evaluation of hyper text transfer protocols
SIGMETRICS '99 Proceedings of the 1999 ACM SIGMETRICS international conference on Measurement and modeling of computer systems
Fair end-to-end window-based congestion control
IEEE/ACM Transactions on Networking (TON)
Dimensioning bandwidth for elastic traffic in high-speed data networks
IEEE/ACM Transactions on Networking (TON)
Impact of fairness on Internet performance
Proceedings of the 2001 ACM SIGMETRICS international conference on Measurement and modeling of computer systems
Statistical bandwidth sharing: a study of congestion at flow level
Proceedings of the 2001 conference on Applications, technologies, architectures, and protocols for computer communications
Traffic model and performance evaluation of Web servers
Performance Evaluation
Large Deviations for Large Capacity Loss Networks withFixed Routing and Polyhedral Admission Sets
Discrete Event Dynamic Systems
TCP Vegas: end to end congestion avoidance on a global Internet
IEEE Journal on Selected Areas in Communications
FAST TCP: motivation, architecture, algorithms, performance
IEEE/ACM Transactions on Networking (TON)
Network utility maximization for triple-play services
Computer Communications
Equilibrium analysis through separation of user and network behavior
Computer Networks: The International Journal of Computer and Telecommunications Networking
Utility-based end-to-end flow control for services with time-varying rate requirements
CCNC'09 Proceedings of the 6th IEEE Conference on Consumer Communications and Networking Conference
Layering as optimization decomposition: questions and answers
MILCOM'06 Proceedings of the 2006 IEEE conference on Military communications
User-level satisfaction aware end-to-end rate control in communication networks
Computer Networks: The International Journal of Computer and Telecommunications Networking
Stochastic utility-based flow control algorithm for services with time-varying rate requirements
Computer Networks: The International Journal of Computer and Telecommunications Networking
| Hi-index | 0.00 |
There has been tremendous progress in understanding how bandwidth is shared by TCP-like connections. By associating each TCP-like connection with a utility function, the bandwidth sharing problem of TCP-like connections can be modeled as a distributed optimization problem for utility functions. However, little is known on how bandwidth is shared by HTTP-like connections through their utility functions at the TCP level. One of the main objectives of this paper is to provide a theory for bandwidth sharing of a large number of HTTP-like connections. Based on certain technical assumptions, we show that there is a utility function at the HTTP level for an HTTP-like connection and such a utility function can be derived from the utility function at the TCP level. The bandwidth is then shared by HTTP-like connections through utility functions at the HTTP level. We also address two possible extensions of the theory: the case with impatient TCP connections and the case with multiple types of requests. With appropriate modification of the utility functions at the HTTP level, we show that the bandwidth is still shared by optimizing their utility functions at the HTTP level for the case with impatient TCP connections. For the case with multiple types of requests, the bandwidth shared at the HTTP level can still be found by solving a unique fixed point limit.