BOUNDS FOR CALL COMPLETION PROBABILITIES IN LARGE-SCALE MOBILE COMMUNICATION NETWORKS(<Special Issue>Network Design, Control and Optimization)

DOI10.15807/JORSJ.47.339MaRDI QIDQ4671027zbMATH OpenOpenAlexFDO

Authors Toshihisa Ozawa, Nariaki Takahashi, Yukio Takahashi

Publication date 23 April 2005

Published in Journal of the Operations Research Society of Japan (Search for Journal in Brave)

Full work available at URL https://doi.org/10.15807/jorsj.47.339

Mathematics Subject Classification ID

Queues and service in operations research (90B22) Communication theory (94A05) Continuous-time Markov processes on discrete state spaces (60J27) Communication networks in operations research (90B18)

Recommendations

• ASYMPTOTIC EVALUATION OF BLOCKING PROBABILITIES IN A HIERARCHICAL CELLULAR MOBILE NETWORK
• Blocking probabilities in large circuit-switched networks
• An approximate model for the computation of blocking probabilities in cellular networks with repeated calls
• scientific article; zbMATH DE number 994728
• scientific article; zbMATH DE number 1724443

This page was built for publication: BOUNDS FOR CALL COMPLETION PROBABILITIES IN LARGE-SCALE MOBILE COMMUNICATION NETWORKS(<Special Issue>Network Design, Control and Optimization)

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4671027)