A battery swapping and charging station (BSCS) is an energy refueling station, where i) electric vehicles (EVs) with depleted batteries (DBs) can swap their DBs for fully-charged ones, and ii) the swapped DBs are then charged until they are fully-charged. Successful deployment of a BSCS system necessitates a careful planning of swappingand charging-related infrastructures, and thus a comprehens...

We present an analytical model to compute the blocking probability in channelized cellular systems with dynamic channel allocation. We model the channel occupancy in a cell by a two-dimensional (2-D) Markov chain, which can be solved to obtain the blocking probability in each cell. We apply our analytical model to linear highway systems with and without lognormal shadowing and then extend it to...

We need to solve various mobility/traffic problems in one-dimensional (1-D), two-dimensional (2-D), and threedimensional (3-D) micro or picocell environments to efficiently plan future personal communications services (PCS’s). However, mobility/traffic problems have thus far primarily been studied in 1-D and 2-D cell structures. In this paper, we extend the previous mobility modeling from 1-D o...

To make comprehensive and objective analysis of the performance of the cloud computing system center, a cloud computing center system analysis model based on queuing theory is proposed. First, to describe the characteristics of user’s service changes request arrived at center by using Poisson distribution, the batch arrival system model was established based on queuing theory, then solve the st...

In optical WDM networks, since each lightpath can carry a huge mount of traffic, failures may seriously damage the end-user applications. Hence fault-tolerance becomes an important issue on these networks. The light path which carries traffic during normal operation is called as primary path. The traffic is rerouted on a backup path in case of a failure. In this paper we propose to design a rel...

The scalability of routing protocol has been considered as a key issue in large–scaled wavelength routed networks. Hierarchical routing scales well by yielding enormous reductions in routing table length, but it also increases path length. This increased path length in wavelength–routed networks leads to increased blocking probability because longer paths tend to have less free wavelength chann...

In this paper, we present a new approximation for estimating blocking probability in overflow loss networks and systems. Given a system for which an estimate of blocking probability is sought, we first construct a second system to act as a surrogate for the original system. Estimating blocking probability in the second system with Erlang’s fixed point approximation (EFPA) provides a better esti...

AbsnaciIn this paper, we analyzed the performance of dynamic resource allocation with channel de-allocation and buffering in cellular networks. Buffers are applied for data traffic to reduce the packet loss probability while channel de-allocation is exploited to reduce the voice blocking probability. The results show that while buffering data traffic can reduce the packet loss probability, it h...

In this paper we develop an analytical threshold-based bandwidth allocation policy for 3G multi-class cellular networks. We consider the effects of user mobility when the cellular network supports multiple classes of connections having different QoS bandwidth requirements. The policy gives priority to handoff connections over new calls and prioritizes between different classes of handoff connec...