Blocking probability analysis of circuit-switched networks with long-lived and short-lived connections
暂无分享,去创建一个
M. Zukerman | E. W. M. Wong | Meiqian Wang | Shuo Li | M. Zukerman | E. Wong | Shuo Li | Meiqian Wang
[1] Dahai Xu,et al. Network Design and Architectures for Highly Dynamic Next-Generation IP-Over-Optical Long Distance Networks , 2009, Journal of Lightwave Technology.
[2] Anthony Unwin,et al. Reversibility and Stochastic Networks , 1980 .
[3] Debasis Mitra,et al. Routing and protection in GMPLS networks: from shortest paths to optimized designs , 2003 .
[4] Zhang Xijun,et al. Polymorphic Control for Cost‐Effective Design of Optical Networks , 2000 .
[5] H. Hasegawa,et al. Optical Networking Technologies That Will Create Future Bandwidth-Abundant Networks [Invited] , 2009, IEEE/OSA Journal of Optical Communications and Networking.
[6] Feller William,et al. An Introduction To Probability Theory And Its Applications , 1950 .
[7] Moshe Zukerman,et al. On the Accuracy of the OPC Approximation for a Symmetric Overflow Loss Model , 2013 .
[8] Chunming Qiao,et al. Polymorphic Control for Cost-Effective Design of Optical Networks , 1998, Eur. Trans. Telecommun..
[9] Deep Medhi,et al. Adaptive alternate routing in WDM networks and its performance tradeoffs in the presence of wavelength converters , 2009, Opt. Switch. Netw..
[10] Jack K. Wolf,et al. Finding the best set of K paths through a trellis with application to multitarget tracking , 1989 .
[11] S. Zachary,et al. Loss networks , 2009, 0903.0640.
[12] Sudhir S. Dixit,et al. Traffic grooming in mesh WDM optical networks - performance analysis , 2003, GLOBECOM '03. IEEE Global Telecommunications Conference (IEEE Cat. No.03CH37489).
[13] Andre Girard,et al. Routing and Dimensioning in Circuit-Switched Networks , 1990 .
[14] D. Mitra. Asymptotic analysis and computational methods for a class of simple, circuit-switched networks with blocking , 1987, Advances in Applied Probability.
[15] W. Whitt,et al. Blocking when service is required from several facilities simultaneously , 1985, AT&T Technical Journal.
[16] Villy Bæk Iversen,et al. Teletraffic engineering and network planning , 2015 .
[17] F. Kelly. Blocking probabilities in large circuit-switched networks , 1986, Advances in Applied Probability.
[18] O.J. Boxma,et al. Performance analysis of admission control for integrated services with minimum rate guarantees , 2006, 2006 2nd Conference on Next Generation Internet Design and Engineering, 2006. NGI '06..
[19] R. I. Wilkinson. Theories for toll traffic engineering in the U. S. A. , 1956 .
[20] A. Barczyk. World-wide networking for LHC data processing , 2012, OFC/NFOEC.
[21] Mark S. Squillante,et al. Improved approximations for the Erlang loss model , 2009, Queueing Syst. Theory Appl..
[22] P. O'Reilly. The case for circuit switching in future wide bandwidth networks , 1988, IEEE International Conference on Communications, - Spanning the Universe..
[23] Adrian Farrel,et al. Crankback Signaling Extensions for MPLS Signaling , 2003 .
[24] Ajay Mahimkar,et al. Bandwidth on demand for inter-data center communication , 2011, HotNets-X.
[25] Atsushi Iwata,et al. Crankback Signaling Extensions for MPLS and GMPLS RSVP-TE , 2007, RFC.
[26] Alexandre Proutière,et al. Modeling integration of streaming and data traffic , 2004, Perform. Evaluation.
[27] L. Delbrouck. The Uses of Kosten's Systems in the Provisioning of Alternate Trunk Groups Carrying Heterogeneous Traffic , 1983, IEEE Trans. Commun..
[28] Alon Itai,et al. The complexity of finding maximum disjoint paths with length constraints , 1982, Networks.
[29] M. Medard,et al. Design and Analysis of Optical Flow-Switched Networks , 2009, IEEE/OSA Journal of Optical Communications and Networking.
[30] Peter G. Taylor,et al. Reduced load approximations for loss networks , 1993, Telecommun. Syst..
[31] Sammy Chan,et al. A novel method for modeling and analysis of distributed video on demand systems , 2005, IEEE International Conference on Communications, 2005. ICC 2005. 2005.
[32] Moshe Zukerman,et al. A new method for approximating blocking probability in overflow loss networks , 2007, Comput. Networks.
[33] M. Zukerman,et al. A New Method for Blocking Probability Evaluation in OBS/OPS Networks With Deflection Routing , 2009, Journal of Lightwave Technology.
[34] Yoram Ofek,et al. A scalable solution for engineering streaming traffic in the future Internet , 2007, Comput. Networks.
[35] Eric Wing Ming Wong,et al. Analysis of rerouting in circuit-switched networks , 2000, TNET.
[36] A. Leon-Garcia,et al. Performance Evaluation Methods for an Integrated Voice/Data Link , 1982, IEEE Trans. Commun..
[37] Kyomin Jung,et al. Revisiting stochastic loss networks: structures and algorithms , 2008, SIGMETRICS '08.
[38] Sanjeev Khanna,et al. Edge disjoint paths revisited , 2003, SODA '03.
[39] Maurice Gagnaire,et al. Power-Aware Multi-Rate WDM Network Design under Static/Dynamic Traffic , 2011, 2011 IEEE Global Telecommunications Conference - GLOBECOM 2011.
[40] William Feller,et al. An Introduction to Probability Theory and Its Applications , 1967 .
[41] MATTHIAS MIDDENDORF,et al. On the complexity of the disjoint paths problem , 1993, Comb..
[42] Moshe Zukerman,et al. Enhanced Blocking Probability Evaluation Method for Circuit-Switched Trunk Reservation Networks , 2007, IEEE Communications Letters.
[43] Gangxiang Shen,et al. Energy-Minimized Design for IP Over WDM Networks , 2012, IEEE/OSA Journal of Optical Communications and Networking.
[44] B. Van Houdt,et al. Markovian Approximations for a Grid Computing Network with a Ring Structure , 2010 .
[45] Wei Song,et al. QoS provisioning via admission control in cellular/wireless LAN interworking , 2005, 2nd International Conference on Broadband Networks, 2005..