혼합트래픽 네트워크에서 혼잡회피를 위한 큐 관리 알고리즘
Queue Management Algorithm for Congestion Avoidance in MixedTraffic Network
0
조회
0
다운로드
0
인용
0
참고문헌
키워드
초록
This paper suggests PARED algorithm, a modified RED algorithm, that actively reacts to dynamic changes in network to apply packet drop probability flexibly. The main idea of PARED algorithm is that it compares the target queue length to the average queue length which is the criterion of changes in packet drop probability and feeds the gap into packet drop probability. That is, when the difference between the average queue length and the target queue length is great, it reflects as much as the difference in packet drop probability, and reflects little when the difference is little. By doing so, packet drop probability could be actively controled and effectively dealt with in the network traffic situation. To evaluate the performance of the suggested algorithm, we conducted simulations by changing network traffic into a dynamic stat. At the experiments, the suggested algorithm was compared to the existing RED one and then to ARED one that provided the basic idea for this algorithm. The results proved that the suggested PARED algorithm is superior to the existing algorithms.
Abstract
This paper suggests PARED algorithm, a modified RED algorithm, that actively reacts to dynamic changes in network to apply packet drop probability flexibly. The main idea of PARED algorithm is that it compares the target queue length to the average queue length which is the criterion of changes in packet drop probability and feeds the gap into packet drop probability. That is, when the difference between the average queue length and the target queue length is great, it reflects as much as the difference in packet drop probability, and reflects little when the difference is little. By doing so, packet drop probability could be actively controled and effectively dealt with in the network traffic situation. To evaluate the performance of the suggested algorithm, we conducted simulations by changing network traffic into a dynamic stat. At the experiments, the suggested algorithm was compared to the existing RED one and then to ARED one that provided the basic idea for this algorithm. The results proved that the suggested PARED algorithm is superior to the existing algorithms.
참고문헌 (23)
- A. Feldman, "Thechanging nature of network traffic: Scaling Phenomena", Computer Communication Review, 28(2), pp.529~ (1998)
- A. C. Gilbert, "Scaling analysis of conservative cascades, with applications to network traffic", IEEE Transactions on Information Theory, 45(3), pp.971~991 (1999)
- 김창희, "유무선 혼합망에서 웹 트래픽 성능에 관한 연구", (사)디지털산업정보학회 논문지, 7(2), pp.47~58 (2011), (사)디지털산업정보학회
- S. Floyd, "Promoting the Use of EndtoEnd Congestion Control in the Internet", IEEE, 1999, pp.7(4), 458~473
- S. Floyd, "On Traffic Phase Effects in PacketSwitched Gateways", Internetworking: Research and Experience, 3(3), pp.115~156 (1992)
- S. Shenker, "Fundamental Design Issues for the Future Internet", IEEE Journal on Selected Areas in Communications, 13(7), pp.1176~1188 (1995)
- A. Giessler, "Free Buffer Allocation An Investigation by Simulation", Computer Networks, 1(3) (1978)
- "An Empirical Model of HTTP Network Traffic"[URL]
- Recommendations on Queue Management and Congestion Avoidance in the Internet, "B. Braden", IETF, ~, pp.RFC 2309 (1998)
- Recommendations on Queue Management and Congestion Avoidance in the Internet, "B. Braden", ~, pp.RFC 2309 (1998)
- "Adaptive RED: An Algorithm for Increasing the Robustness of RED's Active Queue Management" (2001)[URL]
- D. Lin, "Dynamics of Random Early Detection", ACM SIGCOMM 97, pp.127~137 (1997)
- R. Mahajan, "Controlling HighBandwidth Flows at the Congested Router" (2000), ACIRI, Berkeley
- 구자헌, "IP 네트워크에서 혼잡제어를 위한 새로운 Active RED 알고리즘", 정보과학회논문지 : 정보통신, 29(4), pp.437~446 (2002), 한국정보과학회
- Gang Feng, "Modified RED Gateways Under Bursty Traffic", IEEE Communications Letters, 8(5), pp.323~325 (2004)
- W. C. Feng, "The blue active queue management algorithms", IEEE, 2002, pp.10, 513~528
- M. Christiansen, "Tuning RED for Web Traffic", IEEE, 2001, pp.9(3), 249~264
- C. Hollot, "Analysis and design of controllers for AQM routers supporting TCP flows", IEEE Transactions on Automatic Control, 47(6), pp.945~959 (2002)
- W. Feng, "A selfconfiguring RED gateway", INFOCOM '99, 3, pp.1320~1328 (1999)
- J. H. Salim, "Performance Evaluation of Explicit Congestion Notification(ECN) in IP Networks", RFC 2884, IETF, ~ (2000)
- C. Hollot, "A control theoretic analysis of RED", In Proceedings of the IEEE INFOCOM'01 (2001)
- 김창희, "TCP", IP 네트워크에서 적응적 큐 관리 알고리즘, 2010, pp.6(2), 153~167[DOI]