ETRI-Knowledge Sharing Plaform

ENGLISH

성과물

논문 검색
구분 SCI
연도 ~ 키워드

상세정보

학술대회 A Call Admission Control Scheme for Heterogeneous Service Considering Fairness in Wireless Networks
Cited 13 time in scopus Download 0 time Share share facebook twitter linkedin kakaostory
저자
황영하, 노성기, 김상하
발행일
200507
출처
International Conference on Computer and Information Science (ICIS) 2005, pp.688-692
DOI
https://dx.doi.org/10.1109/ICIS.2005.1
초록
Guaranteeing a handoff dropping probability below a predetermined threshold is essential for wireless mobile networks. Previous researches [1-8] have proposed admission control policies for integrated voice/data traffic in wireless mobile networks. However, since QoS has been considered only in terms of CDP (Call Dropping Probability), the result has been a serious CBP (Call Blocking Probability) unfairness problem between voice and data traffic. In this paper, we suggest a new admission control policy that treats integrated voice and data traffic fairly while maintaining the CDP constraint. For underprivileged data traffic, which requires more bandwidth units than voice traffic, the packet is placed in a queue when there are no available resources in the base station, instead of being immediately rejected. Furthermore, we have adapted the biased coin method concept [9-12] to adjust unfairness in terms of CBP. We analyzed the system model of a cell using both a two-dimensional continuous-time Markov chain and the Gauss-Seidel method [13]. Numerical results demonstrate that our CAC (Call Admission Control) scheme successfully achieves CBP fairness for voice and data traffic. © 2005 IEEE.
KSP 제안 키워드
Admission control(AC), Admission control policy, Blocking probability(BP), Call Admission Control, Call dropping probability, Continuous-time Markov chain, Control scheme, Gauss-Seidel method, Handoff dropping probability, Heterogeneous service, Numerical results