A New Degree of Freedom in ATM Network Dimensioning: Optimizing the Logical Configuration
暂无分享,去创建一个
[1] Jean-François P. Labourdette,et al. Blocking probabilities in multitraffic loss systems: insensitivity, asymptotic behavior, and approximations , 1992, IEEE Trans. Commun..
[2] F. Kelly. Fixed point models of loss networks , 1989, The Journal of the Australian Mathematical Society. Series B. Applied Mathematics.
[3] Debasis Mitra,et al. Erlang capacity of a shared resource , 1994 .
[4] Debasis Mitra,et al. Erlang capacity and uniform approximations for shared unbuffered resources , 1994, TNET.
[5] A. Jagers,et al. On the continued Erlang loss function , 1986 .
[6] F. P. Kelly,et al. Routing and Capacity Allocation in Networks with Trunk Reservation , 1990, Math. Oper. Res..
[7] Keith W. Ross,et al. Reduced load approximations for multirate loss networks , 1993, IEEE Trans. Commun..
[8] W. Whitt,et al. Blocking when service is required from several facilities simultaneously , 1985, AT&T Technical Journal.
[9] F. Kelly. Blocking probabilities in large circuit-switched networks , 1986, Advances in Applied Probability.
[10] F. Kelly. Routing in circuit-switched networks: optimization, shadow prices and decentralization , 1988, Advances in Applied Probability.
[11] Debasis Mitra,et al. Probabilistic Models of Database Locking: Solutions, Computational Algorithms, and Asymptotics , 1984, JACM.