This paper addresses the problem of survivable traffic assignment with failure probability requirement in flexible bandwidth optical networks. We describe a Survivable Traffic Cognition (STC) algorithm with joint fail...This paper addresses the problem of survivable traffic assignment with failure probability requirement in flexible bandwidth optical networks. We describe a Survivable Traffic Cognition (STC) algorithm with joint failure probability. Survivable Traffic Assignment (STA) algorithm and Conventional Traffic Assignment (CTA) algorithm are added to illustrate the effectiveness of our proposed STC. We investigate the effect of joint failure probability on blocking probability, spectral utilization ratio, average joint failure probability, and the average hops. Simulation results show that our proposed STC not only achieves better performance in terms of blocking probability and spectral utilization ratio than CTA and STA, but also does not cause higher average joint failure probability or larger average hops compared with STA. As a result, STC makes the best use of spectral resources and does not cause large average joint failure probability.展开更多
Dynamic spectrum access policy is crucial in improving the performance of over- lay cognitive radio networks. Most of the previ- ous works on spectrum sensing and dynamic spe- ctrum access consider the sensing effecti...Dynamic spectrum access policy is crucial in improving the performance of over- lay cognitive radio networks. Most of the previ- ous works on spectrum sensing and dynamic spe- ctrum access consider the sensing effective- ness and spectrum utilization as the design cri- teria, while ignoring the energy related issues and QoS constraints. In this article, we propose a QoS provisioning energy saving dynamic acc- ess policy using stochastic control theory con- sidering the time-varying characteristics of wir- eless channels because of fading and mobility. The proposed scheme determines the sensing action and selects the optimal spectrum using the corresponding power setting in each decis- ion epoch according to the channel state with the objective being to minimise both the flame error rate and energy consumption. We use the Hidden Markov Model （HMM） to model a wir- eless channel, since the channel state is not dir- ectly observable at the receiver, but is instead embedded in the received signal. The proced- ure of dynamic spectrum access is formulated as a Markov decision process which can be sol- ved using linear programming and the primal- dual index heuristic algorithm, and the obta- ined policy has an index-ability property that can be easily implemented in real systems. Sim- ulation results are presented to show the per- formance improvement caused by the propo- sed approach.展开更多
基金supported in part by 973 Program under Grants No. 2010CB328204,No. 2012CB315604863 Program under Grant No. 2012AA011301+3 种基金National Natural Science Foundation of China under Grants No. 61271189,No. 61201154, No. 60932004RFDP Project under Grants No. 20090005110013,No. 20120005120019the Fundamental Research Funds for the Central Universitiesthe State Scholarship Fund
文摘This paper addresses the problem of survivable traffic assignment with failure probability requirement in flexible bandwidth optical networks. We describe a Survivable Traffic Cognition (STC) algorithm with joint failure probability. Survivable Traffic Assignment (STA) algorithm and Conventional Traffic Assignment (CTA) algorithm are added to illustrate the effectiveness of our proposed STC. We investigate the effect of joint failure probability on blocking probability, spectral utilization ratio, average joint failure probability, and the average hops. Simulation results show that our proposed STC not only achieves better performance in terms of blocking probability and spectral utilization ratio than CTA and STA, but also does not cause higher average joint failure probability or larger average hops compared with STA. As a result, STC makes the best use of spectral resources and does not cause large average joint failure probability.
基金supported by the National Natural Science Foundation of China under Grant No.61101107the Beijing Higher Education Young Elite Teacher Project under Grant No.YETP0439
文摘Dynamic spectrum access policy is crucial in improving the performance of over- lay cognitive radio networks. Most of the previ- ous works on spectrum sensing and dynamic spe- ctrum access consider the sensing effective- ness and spectrum utilization as the design cri- teria, while ignoring the energy related issues and QoS constraints. In this article, we propose a QoS provisioning energy saving dynamic acc- ess policy using stochastic control theory con- sidering the time-varying characteristics of wir- eless channels because of fading and mobility. The proposed scheme determines the sensing action and selects the optimal spectrum using the corresponding power setting in each decis- ion epoch according to the channel state with the objective being to minimise both the flame error rate and energy consumption. We use the Hidden Markov Model （HMM） to model a wir- eless channel, since the channel state is not dir- ectly observable at the receiver, but is instead embedded in the received signal. The proced- ure of dynamic spectrum access is formulated as a Markov decision process which can be sol- ved using linear programming and the primal- dual index heuristic algorithm, and the obta- ined policy has an index-ability property that can be easily implemented in real systems. Sim- ulation results are presented to show the per- formance improvement caused by the propo- sed approach.
