Weina Wang
Abstract
Motivated by the stringent requirements on delay performance in data center networks, we study a connection-level model for bandwidth sharing among data transfer flows, where file sizes have phase-type distributions and proportionally fair bandwidth allocation is used. We analyze the expected number of files in steady-state by setting the steady-state drift of an appropriately chosen Lyapunov function equal to zero. We consider the heavy-traffic regime and obtain asymptotically tight bounds on the expected number of files in the system. Our results show that the expected number of files under proportionally fair bandwidth allocation is insensitive in heavy traffic to file size distributions, thus complementing the diffusion approximation result of Vlasiou et al. [20].
- S. Asmussen. Applied Probability and Queues. Springer- Verlag New York, 2003.Google Scholar
- D. Bertsimas, D. Gamarnik, and J. N. Tsitsiklis. Performance of multiclass markovian queueing networks via piecewise linear lyapunov functions. Ann. Appl. Probab., 11(4):1384-1428, 11 2001.Google ScholarCross Ref
- T. Bonald and L. Massoulié. Impact of fairness on internet performance. In Proc. ACM SIGMETRICS Int. Conf. Measurement and Modeling of Computer Systems, pages 82-91, Cambridge, MA, 2001. Google ScholarDigital Library
- T. Bonald and A. Prouti`ere. Insensitive bandwidth sharing in data networks. Queueing Syst., 44(1):69- 100, 2003. Google ScholarDigital Library
- M. Bramson. State space collapse with application to heavy traffic limits for multiclass queueing networks. Queueing Syst., 30(1/2):89-148, June 1998. Google ScholarDigital Library
- G. de Veciana, T.-J. Lee, and T. Konstantopoulos. Stability and performance analysis of networks supporting elastic services. IEEE/ACM Trans. Netw., 9(1):2-14, Feb. 2001. Google ScholarDigital Library
- A. Eryilmaz and R. Srikant. Asymptotically tight steady-state queue length bounds implied by drift conditions. Queueing Syst., 72(3-4):311-359, Dec. 2012. Google ScholarDigital Library
- B. Hajek. Hitting-time and occupation-time bounds implied by drift analysis with applications. Adv. Appl. Probab., 14(3):502-525, 1982.Google ScholarCross Ref
- W. N. Kang, F. P. Kelly, N. H. Lee, and R. J. Williams. State space collapse and diffusion approximation for a network operating under a fair bandwidth sharing policy. Ann. Appl. Probab., 19(5):1719-1780, Oct. 2009.Google ScholarCross Ref
- F. Kelly. Charging and rate control for elastic traffic. Eur. T. Telecommun., 8(1):33-37, 1997.Google ScholarCross Ref
- Y. Lu, S. T. Maguluri, M. S. Squillante, and T. Suk. On optimal weighted-delay scheduling in input-queued switches. arXiv:1704.02302 {math.OC}, Apr. 2017.Google Scholar
- D. G. Luenberger. Optimization by Vector Space Methods. JohnWiley & Sons, 1969.Google Scholar
- S. T. Maguluri and R. Srikant. Heavy traffic queue length behavior in a switch under the maxweight algorithm. Stoch. Syst., 6(1):211-250, 2016.Google ScholarCross Ref
- S. T. Maguluri, R. Srikant, and L. Ying. Heavy traffic optimal resource allocation algorithms for cloud computing clusters. Perform. Eval., 81:20-39, 2014. Google ScholarDigital Library
- S. T. Maguluri, S. K. Burle, and R. Srikant. Optimal heavy-traffic queue length scaling in an incompletely saturated switch. In Proc. ACM SIGMETRICS Int. Conf. Measurement and Modeling of Computer Systems, pages 13-24, Antibes Juan-les-Pins, France, 2016. Google ScholarDigital Library
- L. Massoulié and J. W. Roberts. Bandwidth sharing and admission control for elastic traffic. Telecommun. Syst., 15(1):185-201, 2000. Google ScholarDigital Library
- F. Paganini, A. Tang, A. Ferragut, and L. L. H. Andrew. Network stability under alpha fair bandwidth allocation with general file size distribution. IEEE Trans. Autom. Control, 57(3):579-591, Mar. 2012.Google ScholarCross Ref
- D. Shah, J. N. Tsitsiklis, and Y. Zhong. Qualitative properties of α-fair policies in bandwidth-sharing networks. Ann. Appl. Probab., 24(1):76-113, 2014.Google ScholarCross Ref
- E. D. Sontag. Mathematical Control Theory: Deterministic Finite Dimensional Systems. Springer-Verlag, 1990. Google ScholarDigital Library
- M. Vlasiou, J. Zhang, and B. Zwart. Insensitivity of proportional fairness in critically loaded bandwidth sharing networks. arXiv:1411.4841v2 {math.PR}, 2014.Google Scholar
- C.-H. Wang, S. T. Maguluri, and T. Javidi. Heavy traffic queue length behavior in switches with reconfiguration delay. In Proc. IEEE Int. Conf. Computer Communications (INFOCOM), Atlanta, GA, May 2017.Google ScholarCross Ref
- W. Wang, K. Zhu, L. Ying, J. Tan, and L. Zhang. MapTask scheduling in MapReduce with data locality: Throughput and heavy-traffic optimality. IEEE/ACM Trans. Netw., 24:190-203, Feb. 2016. Google ScholarDigital Library
- W. Wang, S. T. Maguluri, R. Srikant, and L. Ying. Heavy-traffic delay insensitivity in connection-level models of data transfer with proportionally fair bandwidth sharing. Technical report, 2017.Google Scholar
- R. Williams. Diffusion approximations for open multiclass queueing networks: sufficient conditions involving state space collapse. Queueing Syst., 30(1):27-88, 1998. Google ScholarDigital Library
- Q. Xie and Y. Lu. Priority algorithm for near-data scheduling: Throughput and heavy-traffic optimality. In Proc. IEEE Int. Conf. Computer Communications (INFOCOM), pages 963-972, Hong Kong, China, Apr. 2015.Google ScholarCross Ref
- H.-Q. Ye and D. D. Yao. A stochastic network under proportional fair resource control-diffusion limit with multiple bottlenecks. Oper. Res., 60(3):716-738, 2012. Google ScholarDigital Library
- H.-Q. Ye and D. D. Yao. Diffusion limit of fair resource control-stationarity and interchange of limits. Math. Oper. Res., 41(4):1161-1207, 2016.Google ScholarDigital Library
Index Terms
- Heavy-Traffic Delay Insensitivity in Connection-Level Models of Data Transfer with Proportionally Fair Bandwidth Sharing
Recommendations
Heavy-traffic approximations for linear networks operating under α-fair bandwidth-sharing policies
valuetools '06: Proceedings of the 1st international conference on Performance evaluation methodolgies and toolsWe consider the flow-level performance of a linear network supporting elastic traffic, where the service capacity is shared among the various classes of users according to a weighted alpha-fair policy. Assuming Poisson arrivals and exponentially ...
Heavy-Traffic Analysis of a Multiple-Phase Network with Discriminatory Processor Sharing
We analyze a generalization of the discriminatory processor-sharing (DPS) queue in a heavy-traffic setting. Customers present in the system are served simultaneously at rates controlled by a vector of weights. We assume that customers have phase-type ...
Heavy-Traffic Insensitive Bounds for Weighted Proportionally Fair Bandwidth Sharing Policies
We consider a connection-level model proposed by Massoulié and Roberts for bandwidth sharing among file transfer flows in a communication network. We study weighted proportionally fair sharing policies and establish explicit-form bounds on the weighted ...
Comments