Heuristic Approaches to Service Level Agreements in Packet Networks
暂无分享,去创建一个
Kin F. Li | Eric G. Manning | K. F. Li | Louis L. Yu | E. Manning | L. Yu
[1] Fillia Makedon,et al. Fast approximation algorithms for multicommodity flow problems , 1991, STOC '91.
[2] Kin F. Li,et al. Optimal Quality of Service routing and admission control using the Utility Model , 2003, Future Gener. Comput. Syst..
[3] Jos J. M. Trienekens,et al. Specification of Service Level Agreements: Problems, Principles and Practices , 2004, Software Quality Journal.
[4] Donald B. Johnson,et al. A Note on Dijkstra's Shortest Path Algorithm , 1973, JACM.
[5] Allan Borodin,et al. Online computation and competitive analysis , 1998 .
[6] Prabhakar Raghavan,et al. Randomized rounding: A technique for provably good algorithms and algorithmic proofs , 1985, Comb..
[7] Edward Y. Chang,et al. Cost Analyses for VBR Video Servers , 1996, IEEE Multim..
[8] Arjang A. Assad,et al. Multicommodity network flows - A survey , 1978, Networks.
[9] Edward Y. Chang,et al. Cost analysis for VBR video servers , 1996, Electronic Imaging.
[10] Sartaj Sahni,et al. Approximate Algorithms for the 0/1 Knapsack Problem , 1975, JACM.
[11] Md. Mostofa Akbar,et al. The distributed utility model applied to optimal admission control and qos adaptation in multimedia systems and enterprise networks , 2002 .
[12] Philip N. Klein,et al. Leighton-Rao might be practical: faster approximation algorithms for concurrent flow with uniform capacities , 1990, STOC '90.
[13] Clifford Stein,et al. Improved approximation algorithms for unsplittable flow problems , 1997, Proceedings 38th Annual Symposium on Foundations of Computer Science.