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

スポンサーリンク

概要

• 論文の詳細を見る

• In this paper, we propose a method to obtain upper and lower bounds of call completion probabilities in a mobile communication network having a large number of base stations. Each base station has its own zone where its radio wave reaches. These zones are overlapping with neighboring zones, and handovers become possible. However, the existence of overlapping zones makes the analysis of a network difficult. To overcome this difficulty, we introduce two smaller size models and show that the upper and lower bounds can be represented in terms of certain performance measures obtained from the smaller size models. Using our method, we can get the values of the bounds by standard methods such as simulation with less computational burden, where the tightness of the bounds can be controlled by choosing a set of focused base stations with appropriate size.

• 社団法人日本オペレーションズ・リサーチ学会の論文

著者

• Takahashi Yukio

  Tokyo Institute of Technology

• Ozawa Toshihisa

  Komazawa University

• Takahashi Nariaki

  ITOCHU TECHNO-SCIENCE Corporation

関連論文

• ASYMPTOTIC PROPERTIES OF STATIONARY DISTRIBUTIONS IN TWO-STAGE TANDEM QUEUEING SYSTEMS
• UPPER BOUND FOR THE DECAY RATE OF THE MARGINAL QUEUE-LENGTH DISTRIBUTION IN A TWO-NODE MARKOVIAN QUEUEING SYSTEM(Network Design, Control and Optimization)
• BOUNDS FOR CALL COMPLETION PROBABILITIES IN LARGE-SCALE MOBILE COMMUNICATION NETWORKS(Network Design, Control and Optimization)
• A Backlog Evaluation Formula for Admission Control Based on the Stochastic Network Calculus with Many Flows
• A MARKOVIAN MODEL OF CODED VIDEO TRAFFIC WHICH EXHIBITS LONG-RANGE DEPENDENCE IN STATISTICA LANALYSIS

スポンサーリンク