상세정보
학술지
Adaptive Logarithmic Increase Congestion Control Algorithm for Satellite Networks
- 발행일
- 201408
- 출처
- KSII Transactions on Internet and Information Systems, v.8 no.8, pp.2796-2813
- ISSN
- 1976-7277
- 출판사
- 한국인터넷정보학회
- 협약과제
- 14MR9200, (통합)적응형 위성방송통신 전송 기술 개발, 오덕길
- 초록
- This paper presents a new algorithm called the adaptive logarithmic increase and adaptive decrease algorithm (A-LIAD), which mainly addresses the Round-Trip Time (RTT) fairness problem in satellite networks with a very high propagation delay as an alternative to the current TCP congestion control algorithm. We defined a new increasing function in the fashion of a logarithm depending on the increasing factor, which is different from the other logarithmic increase algorithm adopting a fixed value of 慣 = 2 leading to a binary increase. In A-LIAD, the 慣 value is derived in the RTT function through the analysis. With the modification of the increasing function applied for the congestion avoidance phase, a hybrid scheme is also presented for the slow start phase. From this hybrid scheme, we can avoid an overshooting problem during a slow start phase even without a SACK option. To verify the feasibility of the algorithm for deployment in a high-speed and long-distance network, several aspects are evaluated through an NS-2 simulation. We performed simulations for intra- and inter-fairness as well as utilization in different conditions of varying RTT, bandwidth, and PER. From these simulations, we showed that although A-LIAD is not the best in all aspects, it provides a competitive performance in almost all aspects, especially in the start-up and packet loss impact, and thus can be an alternative TCP congestion control algorithm for high BDP networks including a satellite network. © 2014 KSII.
- KSP 제안 키워드
- Competitive performance, Congestion Avoidance, Congestion control algorithm, Different conditions, High Speed, Hybrid Scheme, Long-distance, Network simulator-2(NS2), Ns-2 Simulation, Propagation delay, Round trip time