Kelly’s Bound, RUAA and the Pricing of Multi-class Traffic in Loss Networks
暂无分享,去创建一个
[1] F. P. Kelly. Bounds on the Performance of Dynamic Routing Schemes for Highly Connected Networks , 1994, Math. Oper. Res..
[2] Richard J. Gibbens,et al. Network Programming Methods for Loss Networks (Invited Paper) , 1995, IEEE J. Sel. Areas Commun..
[3] B. Stiller,et al. A Practical Review of Pricing and Cost Recovery for Internet Services , 1999 .
[4] Norman Bleistein,et al. Uniform asymptotic expansions of integrals with stationary point near algebraic singularity , 1966 .
[5] K. G. Ramakrishnan,et al. Refined Asymptotic Approximations to Loss Probabilities and Their Sensitivities in Shared Unbuffered Resources , 1998, SIAM J. Appl. Math..
[6] Debasis Mitra,et al. Erlang capacity and uniform approximations for shared unbuffered resources , 1994, TNET.
[7] J. Kaufman,et al. Blocking in a Shared Resource Environment , 1981, IEEE Trans. Commun..
[8] Peter Key,et al. Optimal Control and Trunk Reservation in Loss Networks , 1990 .
[9] B. Stiller,et al. Reservation-based Charging in an Integrated Services Network , 1998 .