Flow-level stability of data networks with non-convex and time-varying rate regions
Proceedings of the 2007 ACM SIGMETRICS international conference on Measurement and modeling of computer systems
Rate-optimal schemes for Peer-to-Peer live streaming
Performance Evaluation
Stability, fairness, and performance: a flow-level study on nonconvex and time-varying rate regions
IEEE Transactions on Information Theory
A precomputation-based scheme for qos routing and fair bandwidth allocation
HiPC'06 Proceedings of the 13th international conference on High Performance Computing
| Hi-index | 0.06 |
This paper studies stability of network models that capture macroscopic features of data communication networks, including the Internet. The network model consists of a set of links and a set of possible routes that are fixed subsets of links. A connection is dynamically established along one of the routes to transmit data as requested and is terminated after the transmission is over. The transmission bandwidth of a link is dynamically allocated, according to specific bandwidth allocation policy, to ongoing connections that traverse the link. A network model is said to be stable under a given bandwidth allocation policy if, roughly, the number of ongoing connections in the network will not blow up over time. We consider a stationary and a bursty network model; the former assumes stochastically stationary arrival processes of connections as did many theoretical studies, while the latter allows more realistic bursty and correlated arrival processes. For both models under a necessary stability condition (i.e., the average offered transmission load on each link is within its bandwidth capacity), we show that the proportionally fair, the minimum potential delay, the max-min fair, and a class of utility-maximizing bandwidth allocation policies ensure network model stability, while some priority-oriented and maximum throughput policies do not. Interestingly, the bandwidth allocation policy that maximizes the arctan(脗·) utility ensures the stability of the stationary model butnot the bursty model. This raises a serious concern about the current practice in the Internet protocol design, since such a policy is thought of as a good approximation of one of the most widely used TCP in the Internet.