This paper investigates the performance of an integrated voice/data wireless mobile network where a finite buffer is provided for voice calls since they can endure a tolerable time, or the reneging time, for service. Based on a given humanistic reneging time, we analyze the voice traffic blocking probability. The probability distribution of receiving service within the reneging time is obtained...

In this paper, we propose the phantom cell analysis for dynamic channel assignment. This is an approximate analysis that can handle realistic planar systems with the threecell channel-reuse pattern. To find the blocking probability of a particular cell, two phantom cells are used to represent its six neighboring cells. Then, by conditioning on the relative positions of the two phantom cells, th...

We compare the performance of a variant of the standard Dynamic Alternative Routing (DAR) technique commonly used in telephone and ATM networks to a path selection algorithm that is based on the balanced allocations principle [4, 18] the Balanced Dynamic Alternative Routing (BDAR) algorithm. While the standard technique checks alternative routes sequentially until available bandwidth is found, ...

あらまし 次世代移動通信システムの実現に向けてバーチャルセルラネットワーク(VCN)が提案されている.送信電力の制 限された環境下において伝送速度が高速化した場合,従来のセルラネットワーク(CN)では通信可能なエリアが狭まり,セル端付 近の移動局は通信できず,呼損となってしまう.VCN ではマルチホップ通信の適用により送信電力を増大させることなく,通 信エリアを拡大できる.そのため,送信電力が制限された環境下において従来のシングルホップ CN に比べ,呼損率を改善する ことが可能である.本論文では,2ホップ VCN について計算機シミュレーションにより呼損率を求め,その導入効果を明らか にしている.また,VCN に maxSINR チャネル割当て法を適用したときの呼損率を求め,チャネル棲み分け法と比較している. キーワード バーチャルセルラネットワーク,2ホップ,チャネル棲み分け,m...

AbstructDynamic Channel allocation in Cellular Networks have become very popular off late due to the flexibility obtained by using any of the available channels in any cell as long as the Interference level is below a given threshold. In our problem we study Cellular networks under Dynamic Channel Allocation and propose a Two Dimensional Markov Chain model to analyze the performance of the syst...

Survivability in the dynamic IP over WDM network may be guaranteed by the Shared Path Protection (SPP) scheme implemented at the optical layer. The advantages of this scheme are fast recovery obtained at the lowest possible layer and efficient bandwidth utilization obtained by sharing spare resources. The paper investigates the performance of a dynamic distributed bucket-based SPP scheme in con...

This paper considers a decentralized process in many-to-many matching problems. We show that if agents on one side of the market have substitutable preferences and those on the other side have responsive preferences, then, from an arbitrary matching, there exists a finite path of matchings such that each matching on the path is formed by satisfying a blocking individual or a blocking pair for t...

Acknowledgments The authors wish to thank Steve Madden from Tel-stra Research Laboratories and Rod Tucker from The University of Melbourne for helpful discussions. Jen-nifer Yates also thanks Telstra Research Laboratories for nancial support.sensitive Wavelength Conversion of 10Gbit/s Signals with SOAs in a Michelson interferometer," Electron. Figure 7: Blocking probability versus ooered traac ...

The Erlang B formula represents the steady-state blocking probability in the Erlang loss model or M/M/s/s queue. We derive asymptotic expansions for the offered load that matches, for a given number of servers, a certain blocking probability. In addressing this inversion problem we make use of various asymptotic expansions for the incomplete gamma function. A similar inversion problem is invest...

In this paper we propose a new approximate method for calculating the probability of point-to-group blocking in multi-stage switching networks with unicast and multicast connections. The results of analytical calculations of the probability of blocking are compared with the results of discrete events simulations of the switching network with multicast and unicast connections. The present analyt...