Due to the traditional overlay network QOS routing algorithm fails to consider the effects of the resource bottleneck on the routing selection, it results in the local congestion of the system. Therefore, this paper proposes a fair load-balancing QOS overlay routing F-LBQAR algorithm. The algorithm introduces the resource fairness index, sets up a new load-balancing utility function, and adopts the adaptive weighted method in the system’s load state to correct the weight restriction of QOS. The experimental results show that the algorithm in this paper can reduce the probability of network congestion caused by resources bottleneck and improve the QOS service success rate and the throughput of the system.
목차
Abstract 1. Introduction 2. The F-LBQAR Algorithm A.Coverage Analysis B. The Fair Load-balancing QoS Routing Algorithm (F-LBQA) 3. Experimental Simulation and Analysis A. The Experimental Environment B. The Analysis of the Experimental Results 4. Conclusion References
키워드
Cost ModelService ResourcesRouting SelectionCovering Space
저자
ZHOU Xiao-Yan [ Information Engineering Department of Karamay Vocational and Technical College, Karamay Xinjiang, China ]
Zhao Kai [ Teaching Affairs Division, Pingdingshan University, Henan Pingdingshan, China ]
보안공학연구지원센터(IJFGCN) [Science & Engineering Research Support Center, Republic of Korea(IJFGCN)]
설립연도
2006
분야
공학>컴퓨터학
소개
1. 보안공학에 대한 각종 조사 및 연구
2. 보안공학에 대한 응용기술 연구 및 발표
3. 보안공학에 관한 각종 학술 발표회 및 전시회 개최
4. 보안공학 기술의 상호 협조 및 정보교환
5. 보안공학에 관한 표준화 사업 및 규격의 제정
6. 보안공학에 관한 산학연 협동의 증진
7. 국제적 학술 교류 및 기술 협력
8. 보안공학에 관한 논문지 발간
9. 기타 본 회 목적 달성에 필요한 사업
간행물
간행물명
International Journal of Future Generation Communication and Networking
간기
격월간
pISSN
2233-7857
수록기간
2008~2016
십진분류
KDC 505DDC 605
이 권호 내 다른 논문 / International Journal of Future Generation Communication and Networking Vol.8 No.3