Price-based call admission control in a single DiffServ domain
暂无分享,去创建一个
Thomas Erlebach | Burkhard Stiller | C. Chhabra | Danica Vukadinović | B. Stiller | T. Erlebach | Danica Vukadinovic | C. Chhabra
[1] Zhi-Li Zhang,et al. Decoupling QoS control from core routers: a novel bandwidth broker architecture for scalable support of guaranteed services , 2000, SIGCOMM.
[2] Amit Kumar,et al. Provisioning a virtual private network: a network design problem for multicommodity flow , 2001, STOC '01.
[3] Yossi Azar,et al. Beating the Logarithmic Lower Bound: Randomized Preemptive Disjoint Paths and Call Control Algorithms , 1999, SODA '99.
[4] Yossi Azar,et al. Throughput-competitive on-line routing , 1993, Proceedings of 1993 IEEE 34th Annual Foundations of Computer Science.
[5] Peter Reichl,et al. A Generic and Modular Internet Charging System for the Cumulus Pricing Scheme , 2001, Journal of Network and Systems Management.
[6] E. Scheinerman,et al. Fractional Graph Theory: A Rational Approach to the Theory of Graphs , 1997 .
[7] Cynthia A. Phillips,et al. Off-line admission control for general scheduling problems , 2000, SODA '00.
[8] Susana Sargento,et al. Resource Stealing in Endpoint Controlled Multi-class Networks , 2001, IWDC.
[9] Yuval Rabani,et al. On-line admission control and circuit routing for high performance computing and communication , 1994, Proceedings 35th Annual Symposium on Foundations of Computer Science.
[10] Amit Kumar,et al. Algorithms for provisioning virtual private networks in the hose model , 2001, SIGCOMM.
[11] Éva Tardos,et al. Disjoint paths in densely embedded graphs , 1995, Proceedings of IEEE 36th Annual Foundations of Computer Science.
[12] Alexander Schrijver,et al. Theory of linear and integer programming , 1986, Wiley-Interscience series in discrete mathematics and optimization.
[13] Albert G. Greenberg,et al. A flexible model for resource management in virtual private networks , 1999, SIGCOMM '99.
[14] Reuven Bar-Yehuda,et al. A unified approach to approximating resource allocation and scheduling , 2001, JACM.
[15] David S. Johnson,et al. Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .
[16] Scott Shenker,et al. Integrated Services in the Internet Architecture : an Overview Status of this Memo , 1994 .
[17] Amos Fiat,et al. Competitive non-preemptive call control , 1994, SODA '94.
[18] Stefano Leonardi,et al. On-line Network Routing , 1996, Online Algorithms.
[19] Allan Borodin,et al. Online computation and competitive analysis , 1998 .
[20] Jon M. Kleinberg,et al. Approximation algorithms for disjoint paths problems , 1996 .
[21] Ion Stoica,et al. Providing guaranteed services without per flow management , 1999, SIGCOMM '99.
[22] Moti Yung,et al. Efficient On-Line Call Control Algorithms , 1997, J. Algorithms.
[23] Scott Shenker,et al. Endpoint admission control: architectural issues and performance , 2000, SIGCOMM.
[24] Rajeev Rastogi,et al. Restoration algorithms for virtual private networks in the hose model , 2002, Proceedings.Twenty-First Annual Joint Conference of the IEEE Computer and Communications Societies.
[25] Zheng Wang,et al. An Architecture for Differentiated Services , 1998, RFC.
[26] Michael Devetsikiotis,et al. An overview of pricing concepts for broadband IP networks , 2000, IEEE Communications Surveys & Tutorials.
[27] Fred Baker,et al. Network Working Group Aggregation of Rsvp for Ipv4 and Ipv6 Reservations , 2002 .
[28] B. Stiller,et al. Pricing and Cost Recovery for Internet Services: Practical Review, Classification, and Application of Relevant Models , 2001 .
[29] Sudipto Guha,et al. Approximating the throughput of multiple machines under real-time scheduling , 1999, STOC '99.