• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.26 no.6A
• /
• pp.1060-1066
• /
• 2001

레이어2 스위칭과 레이어3 라우팅의 통합 모델로써 MPLS(Multi-Protocol Label Switching) 환경에서 ATM LSR(Label-Switching Routers)은 백본망에서의 고속 전송이 가능하여 현재의 라우터 구조로써 제안되어지고 있다. MPLS가 코어 라이터로써 적용이 될 경우 확장성을 위해 label merging이라는 기술이 필요하다. VC(Virtual Circuit) merging은 ATM LSR에서 많은 IP 라우터를 하나의 라벨로 매핑을 시키며 수천 개의 목적지에 전송할 수 있는 확장성 있는 매핑 기술이다. VC merging은 같은 목적지인 다른 패킷들 간의 셀들의 섞임을 방지하기 위해 재 조합 버퍼가 요구된다. 재 조합 버퍼 사용시 일시적인 체증 현상이 발생하며 Non-VC merging과 비교시 많은 셀 손실과 많은 버퍼를 요구하게 된다. 본 논문에서는 RED(Random Early Detection) 알고리즘을 적용하여 VC merging이 필요한 버퍼의 요구량과 셀 손실을 줄였다.

• Journal of Communications and Networks
• /
• v.6 no.2
• /
• pp.133-146
• /
• 2004

Recently, many active queue management (AQM) algorithms have been proposed to address the performance degradation. of end-to-end congestion control under tail-drop (TD) queue management at Internet routers. However, these AQM algorithms show performance improvement only for limited network environments, and are insensitive to dynamically changing network situations. In this paper, we propose an adaptive queue management algorithm, called PID-controller, that uses proportional-integral-derivative (PID) feedback control to remedy these weak-Dalles of existing AQM proposals. The PID-controller is able to detect and control congestion adaptively and proactively to dynamically changing network environments using incipient as well as current congestion indications. A simulation study over a wide range of IP traffic conditions shows that PID-controller outperforms other AQM algorithms such as Random Early Detection (RED) [3] and Proportional-Integral (PI) controller [9] in terms of queue length dynamics, packet loss rates, and link utilization.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.25 no.6A
• /
• pp.910-917
• /
• 2000

Because the random early detection(RED) algorithm deals all flows with the same best-effort traffic characteristic, it can not correctly control the output link bandwidth for the flows with different traffic characteristics. To remedy this problem, several per-flow algorithms have been proposed. In this paper, we propose a new per-flow type Fair Droptail algorithm which can fairly allocate bandwidth among flows over a shared output link. By evenly allocating buffers per flow, the Fair Droptail can restrict a flow not to use more bandwidth than others. In addition, it can be simply implemented even if it employs the per-flow state mechanism, because the Fair Droptail only keeps each information of flow in active state.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2020.11a
• /
• pp.354-357
• /
• 2020

DDoS(Distributed Denial of Service) 공격은 현재의 인터넷 환경뿐만 아니라 NDN에서도 정상적인 서비스를 저해시키는 주요 문제이며 이에 관련된 다양한 연구들이 진행되고 있다. 본 논문에서는 DDoS 공격이 가해질 때 NDN 라우터의 PIT(Pending Interest Table) 가용성 저해로 인해 발생하는 문제 해결에 중점을 둔다. 이를 위한 방안으로 RED(Random Early Detection) 알고리즘을 기반으로 하는 기법을 적용하고, 시뮬레이션을 통한 측정 결과를 보여준다.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.29 no.6A
• /
• pp.667-667
• /
• 2004

We must design the buffer algorithm that protects traffic congestion and decreasing throughput at satellite communication network. It is important that buffer algorithm is satisfied with the good performance of transmission packet, responsibility of many connecting traffic and the QOS for connecting character. Old buffer algorithms are not the suitable algorithms when we have the satellite communication network environment. RED buffer algorithm is proposed by Floyd. It has a better performance than old buffer algorithm. But this algorithm is not well adapted a number of connecting TCP packet and changing network, so this algorithm has a bad performance on satellite communication network that is many of connecting user at same time. This paper propose the TARED(Target Adaptive RED). It has a good performance, adaptation and stability on satellite communication network and has not overflow and underflow of the buffer level.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.29 no.6A
• /
• pp.666-676
• /
• 2004

We must design the buffer algorithm that protects traffic congestion and decreasing throughput at satellite communication network. It is important that buffer algorithm is satisfied with the good performance of transmission packet, responsibility of many connecting traffic and the 005 for connecting character. Old buffer algorithms are not the suitable algorithms when we have the satellite communication network environment. RED buffer algorithm is proposed by Floyd. It has a better performance than old buffer algorithm. But this algorithm is not well adapted a number of connecting TCP packet and changing network, so this algorithm has a bad Performance on satellite communication network that is many of connecting user at same time. This paper Propose the TARED(Target Adaptive RED). It has a good performance, adaptation and stability on satellite communication network and has not overflow and underflow of the buffer level.

• Journal of Communications and Networks
• /
• v.7 no.3
• /
• pp.367-376
• /
• 2005

The smooth handoff supported by the route optimization extension to the mobile IP standard protocol should support a packet buffering mechanism at the base station (BS), in order to reduce the degradation in TCP performance caused by packet losses within mobile network environments. The purpose of packet buffering at the BS is to recover the packets dropped during intersubnetwork handoff by forwarding the packets buffered at the previous BS to the new BS. However, when the mobile host moves to a congested BS within a new foreign subnetwork, the buffered packets forwarded by the previous BS are likely to be dropped. This subsequently causes global synchronization to occur, resulting in the degradation of the wireless link in the congested BS, due to the increased congestion caused by the forwarded burst packets. Thus, in this paper, we propose an implicit priority forwarding (IPF) packet buffering scheme as a solution to this problem within mobile IP based networks. In the proposed IPF method, the previous BS implicitly marks the priority packets being used for inter-subnetwork handoff. Moreover, the proposed modified random early detection (M-RED) buffer at the new congested BS guarantees some degree of reliability to the priority packets. The simulation results show that the proposed IPF packet buffering scheme increases the wireless link utilization and, thus, it enhances the TCP throughput performance in the context of various intersubnetwork handoff cases.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.27 no.4C
• /
• pp.353-364
• /
• 2002

To prevent the performance degradation of TCP due to packet loss in the smooth handoff by the route optimization extension of Mobile If protocol, a buffering of packets at a base station is needed. A buffering of packets at a base station recovers the packets dropped during the handoff by forwarding the buffered packets at the old base station to the mobile user. But, when the mobile user moves to a new foreign network which is connected to a congested router, the buffered packets forwarded by the old base station are dropped and the link utilization performance degraded due to increased congestion by the forwarded packets. In this paper, when the mobile user moves to a new foreign network which is connected to a congested router, Ive propose a packet forwarding control scheme required far the old base station to improve TCP performance in mobile networks. The old base station forwards or discards the buffered packets during handoff by proposed packet forwarding control scheme based on congestion states of RED(Random Early Detection) at the congested router. Simulation results slow that link utilization performance can be improved by applying proposed packet forwarding control scheme.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.28 no.5B
• /
• pp.475-488
• /
• 2003

To prevent performance degradation of TCP due to packet losses in the smooth handoff by the route optimization extension of Mobile IP protocol, a buffering of packets at a base station is needed. A buffering of packets at a base station recovers those packets dropped during handoff by forwarding buffered packets at the old base station to the mobile user. But, when the mobile user moves to a congested base station in a new foreign subnetwork, those buffered packets forwarded by the old base station are dropped and TCP transmission performance of a mobile user in the congested base station degrades due to increased congestion by those forwarded burst packets. In this paper, considering the general case that a mobile user moves to a congested base station, we analyze the influence of packet buffering on TCP performance according to handoff arrival distribution for Drop-tail and RED (Random Early Detection) buffer management schemes. Simulation results show that RED scheme can reduce the congestion increased by those forwarded burst packets comparing Drop-Tail, but RED scheme cannot avoid Global Synchronization due to forwarded burst packets by the old base station and new buffer management scheme to avoid it is needed in Mobile IP based networks.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.28 no.8B
• /
• pp.661-673
• /
• 2003

To prevent performance degradation of TCP due to packet losses in the smooth handoff by the route optimization extension of Mobile IP protocol, a buffering of packets at a base station is needed. A buffering of packets at a base station recovers those packets dropped during handoff by forwarding buffered packets at the old base station to the mobile user. But, when the mobile user moves to a congested base station in a new foreign subnetwork, those buffered packets forwarded by the old base station are dropped and TCP transmission performance of a mobile user in the congested base station degrades due to increased congestion by those forwarded burst packets. In this paper, considering the general case that a mobile user moves to a congested base station, we propose a Priority Packet Forwarding to improve TCP performance in mobile networks. In the proposed scheme, without modification to Mobile IP protocol, the old base station marks a buffered packet as a priority packet during handoff. And priority queue at the new congested base station schedules the priority packet firstly. Simulation results show that proposed Priority Packet Forwarding can improve TCP transmission performance more than Implicit Priority Packet Forwarding and RED (Random Early Detection) schemes.