AN EFFECTIVE MODEL TO EVALUATE BLOCKING PROBABILITY OF TIME-SLOTTED OPTICAL BURST SWITCHED NETWORKS

Time-slotted optical burst switched network is a potential technique to support IP over Wavelength Division Multiplexing (WDM) by introduce Time Division Multiplexing (TDM) channel to Optical Burst Switching (OBS) technology. This paper presents a framework to evaluate blocking performance of time-slot-ted OBS networks with multi-fiber wavelength channels. The proposed model is efficient for not only single class traffic such as individual circuit switch traffics or best-effort traffics but also mixed multi-class traffics. The effectiveness of the proposed model is validated by simulation results. The study shows that blocking per-formance of multi-fiber TS-OBS network is acceptable for future Internet services.

Blocking Probability in All-Optical WDM Network Using IMCA

The analysis of WDM (Wavelength-Division Multiplexing) optical network is essential to have the routed wavelength blocking probability with the conversion of wavelength using techniques. In this paper, an enhanced analytical model is proposed to evaluate the blocking performances in topology network and to improve the performances of reduction of blocking probability. The variation of probability is based on the wavelength and load used in the network. The conversion is carried out with the support of optical backbone of the inherent flexibility of the network using the proposed IMCA in Sparse-Partial Wavelength Conversion (SPWC) architecture. It reduces the number of converters significantly with efficient process and provides placement scheme of wavelength converters in the network. The proposed model utilizes the network with the assignment and routing of wavelength using dynamic process of assignment algorithm. The proposed model provides dynamic and static routing process with the range limit to have a minimum conversion for the same probabilities of blocking. The proposed system analysis and the simulation results show the better performances in faster coverage, minimum number of conversions, blocking probability improvement for high load.

Blocking Probability Based Hierarchical Storage Design in VoD Systems

In this paper, we discuss the relationship between the blocking probabilityand the configuration of storage hierarchy in a Video on Demand ( VoD) server using the queueingmodel we propose. With this model, the optimal configuration of the storage system can be obtained .

Impact of Wavelength-Routed Network Physical Topology on Blocking Probability Using a Dynamic Traffic Growth Model

We investigate the impact of network topology on blocking probability in wavelength-routed networks using a dynamic traffic growth model. The dependence of blocking on different physical parameters is assessed.

Blocking probability analysis model for flexible spectrum optical networks

Compared to the traditional wavelength division multiplexing （WDM） optical networks with rigid and coarse granularities, flexible spectrum optical networks have high spectrum efficiency, which can support the service with various bandwidth requirements, such as sub and super channel. Among all network performance parameters, blocking probability is an important parameter for the performance evaluation and network planning in circuit^based optical networks including flexible spectrum optical networks. We propose an analytical method of blocking probability computation for flexible spectrum optical networks in this letter through mathematical analysis and theoretical derivation. Two blocking probability models are built respectively based on whether considering spectrum consecutiveness or not. Numerical results validate our proposed blocking probability models under different link capacity and traffic loads.

MULTI-DIMENSIONAL MARKOV CHAIN–BASED ANALYSIS OF CONFLICT PROBABILITY FOR SPECTRUM RESOURCE SHARING

In this paper, we consider the optimal problem of channels sharing with het-erogeneous traffic （real-time service and non-real-time service） to reduce the data conflict probability of users. Moreover, a multi-dimensional Markov chain model is developed to analyze the performance of the proposed scheme. Meanwhile, performance metrics are derived. Numerical results show that the proposed scheme can effectively reduce the forced termination probability, blocking probability and spectrum utilization.

Survivability evaluation for networks carrying complex traffic flows

The capability of a system to fulfill its mission promptly in the presence of attacks,failures,or accidents is one of the qualitative definitions of survivability.In this paper,we propose a model for survivability quantification,which is acceptable for networks carrying complex traffic flows.Complex network traffic is considered as general multi-rate,heterogeneous traffic,where the individual bandwidth demands may aggregate in complex,nonlinear ways.Blocking probability is the chosen measure for survivability analysis.We study an arbitrary topology and some other known topologies for the network.Independent and dependent failure scenarios as well as deterministic and random traffic models are investigated.Finally,we provide survivability evaluation results for different network configurations.The results show that by using about 50%of the link capacity in networks with a relatively high number of links,the blocking probability remains near zero in the case of a limited number of failures.

A priority-based dynamic load transfer algorithm for cellular/WLAN integrated networks

For the integration network of a cellular network and a wireless local area network （WLAN）, a priority-based dynamic load transfer （PDLT） algorithm is proposed. The dynamic vertical handoffs by call admission control are jointly determined by the network conditions and the traffic characteristics in combination with the location-condition of mobile terminals. When there is no bandwidth resource available in the cellular network or WLAN, the proposed PDLT algorithm allows an incoming voice call or data call within the overlapping area of the cellular network and the WLAN to be directed to the spare network; meanwhile, by dynamically computing the occupancy of the bandwidth resource, the proposed PDLT algorithm also allows an ongoing voice call or data communication to be transferred to the network with a sufficient bandwidth resource according to the given threshold to balance the number of voice/data calls in the two networks. The analysis results of a two-dimensional Markov model and the simulation results show that the PDLT algorithm can effectively enhance the whole integrated network＇ s traffic, reduce the blocking probability of new calls and increase the data throughput, and thus decrease the response time for various services.

Handover algorithm for multiple networks based on Bayesian decision

An improved vertical handover algorithm for multiple networks based on Bayesian decision is proposed. Firstly, the handover probability distribution is established considering multiple conditions including signal strength, bit error rate, blocking probability and user demands, and accordingly the prior handover probability is calculated. Secondly, the posterior probability based on Bayesian decision algorithm is got. Finally, the optimal access network is selected according to the decision strategy based on posterior probability. Simulation results indicate that the proposed algorithm not only effectively achieves vertical handover among WLAN, WiMAX and LTE with the least number of handovers, but also keeps high average network load, which can provide the users with good service quality.

COOPERATIVE DIRECTIONAL INTER-CELL HANDOVER SCHEME IN HIGH ALTITUDE PLATFORM COMMUNICATIONS SYSTEMS

A novel Cooperative Directional inter-cell Handover Scheme(CDHS) for High Altitude Platform(HAP) communications systems is proposed,in which the handover target cell and the two cells adjacent to this handover target cell work cooperatively to exploit the traffic fluctuation to improve handover performance.Users in the overlap area of the overloaded handover target cell will be forced to handover directionally before their optimal handover boundary in order to free up resources for the handover calls which would otherwise be dropped due to the shortage of resources and queue time out.Simulation results show that the handover call dropping probability is greatly reduced(at least 60%) compared with the general queue handover scheme,with little performance reduction to the call blocking probability,and the Not in the Best Cell(NBC) average time is only increased moderately.Moreover,an optimal cell radius can be achieved for a specific platform speed by minimizing the unified system performance,which is the linear combination of the handover call dropping probability and the NBC average time.

Proactive Connection Recovery Strategy with Recovery Time Constraint for Survivable Elastic Optical Networks

This paper presents a halfway signaling exchange shared path protection(HSE-SPP)on the backup route for a fast connection recovery strategy.In the proposed HSE-SPP,a pre-assigned intermediate node on the backup route is chosen for signaling exchange.When connection fails,source and destination nodes simultaneously generate backup connection setup messages to the pre-assigned intermediate node on the reserved backup route.At the intermediate node,signaling process occurs,and acknowledgment is generated for data transmission to the respective end nodes.Consequently,connection recovery time by applying HSE-SPP becomes very low.Simulations are performed for network parameters and results are verified with existing strategies.The average recovery time(RT),bandwidth blocking probability(BBP),bandwidth provisioning ratio(BPR),and resource overbuild(RO)ratio of HSE-SPP for ARPANET is 13.54 ms,0.18,3.02,0.55,and for dedicated path protection(DPP)are 13.20 ms,0.56,6.30,3.75 and for shared path protection(SPP)22.19 ms,0.22,3.23,0.70 respectively.Similarly,average RT,BBP,BPR and RO of HSE-SPP for COST239 are8.33 ms,0.04,1.64,0.26,and for DPP 4.23,0.47,3.50,2.04,and for SPP 11.81,0.08,1.66,0.27 respectively.Hence,results of the proposed strategy are better in terms of RT,BBP,BPR,and RO ratio.

A new channel allocation scheme and performance optimizing for mobile multimedia wireless networks

A multimedia channel allocation scheme is proposed and studied in terms of the connection-level QoS.A new traffic model based on multidimensional Markov chain is developed considering the traffic characteristic of two special periods of time.And the pre-emptive priority strategies are used to classify real-time services and non-real-time services.Real-time service is given higher priority for its allowance to pre-empt channels used by non-real-time service.Considering the mobility of persons in a day,which affects the mobile user's density,the simulation was conducted involving the two pre-emptive priority strategies.The result of some comparisons shows the feasibility of the proposed scheme.

New code match strategy for wideband code division multiple access code tree management

Orthogonal variable spreading factor channelization codes are widely used to provide variable data rates for supporting different bandwidth requirements in wideband code division multiple access (WCDMA) systems. A new code match scheme for WCDMA code tree management was proposed. The code match scheme is similar to the existing crowed-first scheme. When choosing a code for a user, the code match scheme only compares the one up layer of the allocated codes, unlike the crowed-first scheme which perhaps compares all up layers. So the operation of code match scheme is simple, and the average time delay is decreased by 5.1%. The simulation results also show that the code match strategy can decrease the average code blocking probability by 8.4%.

Random Channel Allocation Scheme for SDMA Systems

A random allocation scheme for SDMA systems is proposed with a goal of more efficient dynamic allocation. Based on theoretical analysis and derivation, the blocking probability of the proposed scheme is calculated and compared with those of the ftrst duplicate （FD） and duplicate last （DL） schemes with different state-independent probabilities （p,） of acquring a dupicate channel suecessfully and 5 resources; moreover, a more realistic performance analysis of the random scheme is made with state-dependent ps in the SDMA/CDMA environment. The results show that the random scheme has a similar allocation pefformace to the FD and DL schemes, but is simpler than them in computation and scheduling.

Comparison of Node Architectures for Elastic Optical Networks with Waveband Conversion

In Elastic Optical Networks(EONs)with flexible bandwidth allocation,the blocking probability is high because of spectral contention.Similar to the functionality of wavelength conversion in Wavelength-Division-Multiplexing(WDM)networks,waveband conversion has been proposed to solve spectral contention in EONs.In this paper,we discuss the design of node architectures for an EON with waveband conversion.Four node architectures with shared Tuneable Waveband Converters(TWBCs)are proposed,and their blocking performances are evaluated by simulation.Simulation results show that the blocking probability of a node is significantly improved by waveband conversion.The sharing efficiency of waveband converters is also investigated.Simulation results show that at the same blocking rate,the node architecture with converters shared per node can save more than 20% waveband converters compared with that of the one with converters shared per link.

A New Channel Allocation Scheme for Hierarchical Wireless Networks

A channel allocation scheme for hierarchical wireless networks was proposed in terms of the connection-level quality of service. The channel allocation scheme was analyzed using both horizontal channel borrowing and vertical traffic overflowing. Pre-emptive priority strategies are used to classify real-time services and non-real-time services, real-time service is given higher priority for it is allowed to pre-empt channels used by non-real-time service. Some channel borrowing thresholds and acceptance ratios are used to avoid channel locking or dynamic power control, which can also be dynamically adjusted according to network load. Simulation results show that the proposed schemes can improve the system performance.

An Approach to Calculate the Blocking Probability of Multistage Link System Using the Minimum Pathset

The structure of multistage link systems and the calculation of their blocking probability arediscussed in the paper. The characteristics of SPC digital switching network are specially outlined. Thenby defining the minimum pothset used in network graph, a general algorithm is developed to calculate theblocking probability of a complex network. Compared with traditioanl methods for calculating the block-ing probability, the algorithm derived in this paper is more sirnple, more effective and more easily realizedon computer, and is well worthy of being used practically.

New bandwidth algorithmand its performance analysis in integrated service network

Because of no strict expression of calculating call blocking probability （CBP） in the solution procedure of virtual-path bandwidth allocation problem, the process of calculating bandwidth through CBP and traffic load adopts the iteration algorithm in common, which is an inverse process of calculating CBP through traffic load and bandwidth. It limits computing speed by a long way because of including recursion. An approximate algorithm of bandwidth is presented. We compare the performance of this algorithm with that of another classical algorithm and conclude that the former makes a great increase in speed with little error about 2 %.

Traffic analysis on carrier accessing for WLAN indoor positioning system

Currently,the WLAN indoor positioning system attracts a lot of interests,not only because of the cheap implementation but also because of the high positioning accuracy comparing with other indoor positioning systems.The WLAN indoor positioning system contains two phases,which are offline phase and online phase.In the online phase,the WLAN equipment user(UE) has to access to the WLAN for the latest radio map and positioning software.Due to during the network allocation vector(NAV) duration,the WLAN channel is only reserved for one WLAN UE,others UEs' carrier accessing will be blocked.In addition,the blocked UE will make a retrial accessing,which will definitely introduce more traffic blocking to the WLAN.So In this paper,based on the analysis of the WLAN indoor positioning system architecture,a proper queuing model by using of the Extended Erlang B formula is proposed,which takes the retrial calling percentage into consideration in the proposed model.The simulation results show that the proposed method is more accurate and performs well to predict the blocking probability.

New degradation call admission control for increasing WCDMA system capacity

Propose a new degradation call admission control（DCAC）scheme, which can be used in wideband code division multiple access communication system. So-called degradation is that non-real time call has the characteristic of variable bit rate, so decreasing its bit rate can reduce the load of the system, consequently the system can admit new call which should be blocked when the system is close to full load, therefore new call＇s access probability increases. This paper brings forward design project and does system simulation, simulation proves that DCAC can effectively decrease calls＇ blocking probability and increase the total number of the on-line users.