计算机技术与发展
計算機技術與髮展
계산궤기술여발전
COMPUTER TECHNOLOGY AND DEVELOPMENT
2015年
8期
48-52
,共5页
异构无线网络%联合呼叫接纳控制%会话分流%马尔可夫链模型%新呼叫阻塞率%切换呼叫中断率
異構無線網絡%聯閤呼叫接納控製%會話分流%馬爾可伕鏈模型%新呼叫阻塞率%切換呼叫中斷率
이구무선망락%연합호규접납공제%회화분류%마이가부련모형%신호규조새솔%절환호규중단솔
heterogeneous wireless networks%joint call admission control%packet stream splitting%Markov chain model%new call blocking probability%handoff call dropping probability
文中在WLAN和3G互连的异构网络中提出一种基于会话分流的呼叫接纳控制算法。当网络中任意一个无线接入技术( Radio Access Technology,RAT)都不能为呼叫提供接入时,通过会话分流技术将呼叫在多个无线接入网中传输,接纳这个新的呼叫,并在接收端组合这些分流还原会话。首先构建3G和WLAN相互融合的网络拓扑结构,然后根据多维马尔可夫链模型模拟联合呼叫接纳控制过程,分析异构网络中呼叫接纳控制算法性能的两个重要指标：新呼叫阻塞率和切换呼叫中断率。仿真结果表明,所提算法能够在网络接近满载时有效降低网络中的新呼叫阻塞率和切换呼叫中断率,提高网络的整体利用率。
文中在WLAN和3G互連的異構網絡中提齣一種基于會話分流的呼叫接納控製算法。噹網絡中任意一箇無線接入技術( Radio Access Technology,RAT)都不能為呼叫提供接入時,通過會話分流技術將呼叫在多箇無線接入網中傳輸,接納這箇新的呼叫,併在接收耑組閤這些分流還原會話。首先構建3G和WLAN相互融閤的網絡拓撲結構,然後根據多維馬爾可伕鏈模型模擬聯閤呼叫接納控製過程,分析異構網絡中呼叫接納控製算法性能的兩箇重要指標：新呼叫阻塞率和切換呼叫中斷率。倣真結果錶明,所提算法能夠在網絡接近滿載時有效降低網絡中的新呼叫阻塞率和切換呼叫中斷率,提高網絡的整體利用率。
문중재WLAN화3G호련적이구망락중제출일충기우회화분류적호규접납공제산법。당망락중임의일개무선접입기술( Radio Access Technology,RAT)도불능위호규제공접입시,통과회화분류기술장호규재다개무선접입망중전수,접납저개신적호규,병재접수단조합저사분류환원회화。수선구건3G화WLAN상호융합적망락탁복결구,연후근거다유마이가부련모형모의연합호규접납공제과정,분석이구망락중호규접납공제산법성능적량개중요지표：신호규조새솔화절환호규중단솔。방진결과표명,소제산법능구재망락접근만재시유효강저망락중적신호규조새솔화절환호규중단솔,제고망락적정체이용솔。
A novel session splitting-based joint call admission control algorithm in a heterogeneous wireless network combined WLAN and 3G is proposed. The packet stream is split and admitted into multiple radio access networks when none of the available individual ra-dio access technologies have enough bandwidth to support the incoming call,at the receiver,the split packet stream are combined. A heter-ogeneous wireless network combined 3G and WLAN is built firstly,then multidimensional Markov chain model is used to simulate the process of joint call admission control and analyze the new call blocking probability and handoff call dropping probability of the proposed algorithm. Simulation result shows that the proposed algorithm can reduce call blocking/dropping probability and improve the utility of networks when networks are almost at full capacity.
