Loss-bounded analysis for differentiated services
作者： Alexander Kesselman , Yishay Mansour
DOI: 10.1016/S0196-6774(02)00270-5
关键词:
摘要: We consider a network providing Differentiated Services (DiffServ) which allow service providers to offer different levels of Quality Service (QoS) traffic streams. focus on loss and first show that only trivial bounds could be obtained by means traditional competitive analysis. Then we introduce new approach for estimating an online policy called loss-bounded In analysis the is bounded optimal offline plus constant fraction benefit policy. relate throughput-competitive derive tight upper lower various settings DiffServ parameters using model. believe important technique can complement insight interesting results.
elsevier.com
sci-hub.se 参考文章(19)
Vaduvur Bharghavan, Narayanan Venkitaraman, Raghupathy Sivakumar, Thyagarajan Nandagopal, Relative Delay Differentiation and Delay Class Adaptation in Core-Stateless Networks. international conference on computer communications. pp. 421- 430 ,(2000)
John Wroclawski, David Clark, An Approach to Service Allocation in the Internet ,(1997)
Ran El-Yaniv, Allan Borodin, Online Computation and Competitive Analysis ,(1998)
V. Jacobson, L. Zhang, K. Nichols, A Two-bit Differentiated Services Architecture for the Internet RFC. ,vol. 2638, pp. 1- 26 ,(1999)
N. Semret, R.R.-F. Liao, A.T. Campbell, A.A. Lazar, Peering and provisioning of differentiated Internet services international conference on computer communications. ,vol. 2, pp. 414- 420 ,(2000) , 10.1109/INFCOM.2000.832214
Y. Bernet, A. Smith, D. Grossman, S. Blake, An Informal Management Model for Diffserv Routers RFC. ,vol. 3290, pp. 1- 56 ,(2002)
Alexander Kesselman, Zvi Lotker, Yishay Mansour, Boaz Patt-Shamir, Baruch Schieber, Maxim Sviridenko, Buffer overflow management in QoS switches Proceedings of the thirty-third annual ACM symposium on Theory of computing - STOC '01. pp. 520- 529 ,(2001) , 10.1145/380752.380847
Yishay Mansour, Boaz Patt-Shamir, Ofer Lapid, Optimal smoothing schedules for real-time streams Distributed Computing. ,vol. 17, pp. 77- 89 ,(2004) , 10.1007/S00446-003-0101-0
Ellen L. Hahne, Alexander Kesselman, Yishay Mansour, Competitve buffer management for shared-memory switches Proceedings of the thirteenth annual ACM symposium on Parallel algorithms and architectures - SPAA '01. pp. 53- 58 ,(2001) , 10.1145/378580.378589
Daniel D. Sleator, Robert E. Tarjan, Amortized efficiency of list update and paging rules Communications of The ACM. ,vol. 28, pp. 202- 208 ,(1985) , 10.1145/2786.2793