• Proceedings of the Korean Information Science Society Conference
• /
• 2004.04a
• /
• pp.481-483
• /
• 2004

본 논문에서는 차등 서비스 네트워크(Diffserv network)의 확신 서비스(assured service)에서 발생할 수 있는 TCP와 UDP 플로우 사이의 공명성 문제를 해결하기 위한 TRBD(Target Rate-based Dropping) 기법을 제안한다. 차등 서비스 네트워크의 확신 서비스에서의 공평성 향상에 대한 기존 연구는 마킹 확률을 변경하여 공평성을 향상시키는 연구가 중심이 되어 왔다. 이러한 연구들은 코어노드에서의 큐 관리를 위하여 주로 MRED(Multiple RED)골 이용하기 때문에 TCP 및 UDP, 목표 전송률 등에 대한 고려가 부족하다. 본 논문에서 제안하는 TRBD 기법은 코어노드에서 목표 전송률에 따라 UDP의 폐기 확률을 조정하여 TCP-UDP 공평성 및 목표 전송률을 고려한 공평성을 향상시킬 수 있다. ns 시뮬레이터를 이용한 실험을 통하여 TRBD 기법의 TCP-UDP 공평성 향상을 확인하였다.

• Journal of KIISE:Information Networking
• /
• v.30 no.6
• /
• pp.764-775
• /
• 2003

Previous works for the assured service in the Diffserv network have no sufficient consideration on the fairness of bandwidth share based on RTTs and the target rates of TCP flows. In this paper, in order to solve these problems, we propose a TRA3CM(Target rate and RTT Aware 3 Color Marking) mechanism. The TRA3CM mechanism provides three color marking and fair transmission rates among aggregate flows by considering RTT and target rate simultaneously. In case of higher target rate than bottleneck bandwidth, the TRA3CM mechanism is able to mitigate the RTT effect and provides fair transmission rates. In the results of comparing the performance among existing mechanisms and the TRA3CM, the TRA3CM mechanism was able to mitigate the RTT effect better than the former. The TRA3CM is shown to provide good performance for transmission rates proportional to various target rates.

• Journal of KIISE:Information Networking
• /
• v.31 no.5
• /
• pp.469-481
• /
• 2004

Previous works for the AF(Assured Forwarding) service in the Diffserv network have no sufficient consideration on the fairness of bandwidth share based on RTTs, the target rates, and the impact of UDP against TCP. In this paper, in order to solve these problems, we propose a FDSA(Fair Differentiated Service Architecture) composed of TRA3CM(Target rate and RTT Aware 3 Color Marking) and TRBD(Target Rate Based Dropping) mechanisms. The TRA3CM and TRBD mechanisms provide three color marking and fair transmission rates among aggregate flows by considering RTT, target rate, and UDP flows simultaneously. In the results of comparing the performance among existing mechanisms and the TRA3CM-TRBD, the TRA3CM-TRBD mechanism was able to mitigate the RTT and UDP effect better than the former. The TRA3CM-TRBD is shown to provide good performance for transmission rates proportional to various target rates.

• Proceedings of the Korean Information Science Society Conference
• /
• 2005.07a
• /
• pp.334-336
• /
• 2005

최근 오디오나 비디오 스트리밍과 같은 멀티미디어 트래픽이 증가하고 있다. 이러한 트래픽들은 패킷을 전달하는데 대부분 UDP(User Datagram Protocol)기반의 RTP(Realtime Transport Protocol)를 사용한다. 하지만 UDP기반의 RTP는 기본적으로 혼잡제어 메커니즘이 없으며 현재 인터넷의 주요 트래픽인 TCP(Transmission Control Protocol)와의 형평성을 보장하지 않는다는 문제점을 갖는다. 본 논문에서는 스트리밍 트래픽의 TCP 친화적인 전송률 조절 기법으로 TF-RTP(TCP-Friendly RTP)를 제안하였다. TF-RTP는 네트워크 상태가 혼잡하여 패킷 손실이 발생할 경우, 개선된 파라미터들을 사용하여 경쟁하는 TCP의 전송률을 보다 정확하게 계산하여 스트리밍 트래픽의 전송률을 조절함으로써 경쟁하는 TCP 트래픽과 친화적으로 동작하며 네트워크 대역폭을 보다 공평하게 사용하게 된다. 실험을 통해 제안한 TF-RTP가 TCP의 전송률을 보다 정확하게 계산하며 TCP 친화성, 공평성 측면에서도 성능 개선을 보임을 확인할 수 있었다.

• The Journal of the Korea Contents Association
• /
• v.5 no.5
• /
• pp.248-254
• /
• 2005

The existing buffer management scheme is caused by with burstness characteristic of the TCP traffic and with only the transmission which is not loss it provides the smallest transmission rate guarantee where the GFR demands and a fair characteristic. In order to provide a high fair characteristic from the dissertation which it sees with the smallest transmission rate guarantee where the GFR demands it proposed the existing buffer algorithm which applies a Fuzzy mechanism in the existing buffer management technique. The proposed algorithm decides a packet disuse used by three parameters which are composed of tagging information, the buffer usage, and the load of VC. Simulation results shows that the fairness and goodput of the proposed algorithm were excellent where the size of MCR will become larger, from the switch the Double-EPD or the DFBA was visible a similar efficiency even from size change of the buffer. The algorithm which is proposed provides a good throughput and a fair characteristic.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.22 no.5
• /
• pp.939-948
• /
• 1997

In this paper, we propose the new rate-based transmission rates control algorithm that allocates the fair band-width for ABR service in ATM network. In the traditional ABR service, bandwidth is allocated with constant rate increment or decrement, but in the proposed algorithm, it is allocated fairly to the connected calls by the fuzzy inference of the available bandwidth. The fuzzy inference uses buffer state and the buffer variant rate as the input variables, and uses the total transmission rate as a output variable. This inference a bandwidth is fairly distributed over all ABR calls in service. By simmulation, we showed that the proposed method improved 0.17% in link effectiveness when RIF, RDF is 1/4, 38.6% when RIF, RDF 1/16, and 82.4% when RIF, RDF 1/32 than that of the traditional EFPCA.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2015.05a
• /
• pp.649-652
• /
• 2015

Previous marking policy for the AF service of TCP traffic in the Diffserv network have no sufficient consideration on the effect of RTT and target rate. In this paper, in order to improve fairness Index by the effect RTT difference of TCP traffic, we propose the modified TSW3CDM(Time Sliding Window Three Color Dynamic Marker) based on average transfer rate estimation and the flow state. The proposed algorithm is dynamic marking policy that do allocate band width in proportion to transmission rate. To evaluate the performance of the proposed algorithm, We accomplished a computer simulation using NS-2. From simulation results, the proposed TSW3CDM algorithm improves fairness index by comparison with TSW3CM.

• Journal of KIISE:Information Networking
• /
• v.32 no.5
• /
• pp.641-649
• /
• 2005

Metro networks use the existing circuit-switching technology like SONET/SDH. Such circuit-switching based networks are inefficient in tarrying Internet traffic with bursty nature. Therefore, metro networks can become a bottleneck In order to resolve this problem, the IEEE 802.17 working group has proposed the RPR (Resilient Packet Ring) technology. In addition to this, the RPR fairness mechanism has been defined to provide fairness among the stations in the RPR network. However, the current RPR fairness mechanism has the problem of inefficient use of the available bandwidth after when the congestion at a node is resolved. In this paper, we propose an improved bandwidth allocation mechanism in which, after the congestion resolution at a node, the node estimates the number of nodes transmitting data and measures the remaining bandwidth and fairly allocates the available bandwidth to active nodes. To show the performance of our proposed mechanism, we have performed simulation and showed that the proposed mechanism offers higher bandwidth utilization.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.47 no.7
• /
• pp.36-44
• /
• 2010

When multi-user MIMO (Multiple-Input Multiple-Output) systems utilize a sum-rate maximization (SRM) scheduler, the throughput of the systems can be enhanced. However, fairness problems may arise because users located near cell edge or experiencing poor channel conditions are less likely to be selected by the SRM scheduler. In this paper, a weighted sum-rate maximization (WSRM) scheduler is used to enhance the fairness performance of the MIMO systems. Closed-form expressions for the optimal transmit power allocation of WSRM and corresponding weighted sum-rate (WSR) are derived in the 6-sector collaborative transmission system. Using the derived results, we propose an algorithm which searches the optimal power allocation for WSRM in the 3-sector collaborative transmission system. Based on the derived closed-form expressions and the proposed algorithm, we perform computer simulations to compare performance of the WSRM scheduler and the SRM scheduler with respect to the sum-rate and the log-sum-of-average rates. We further verify that the WSRM scheduler efficiently improves fairness performance by showing the enhanced performance of average transmission rates in low percentile region.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2002.11b
• /
• pp.1197-1200
• /
• 2002

본 논문에서는 GFR이 요구하는 최소 전송률 보장과 높은 공평성을 제공하기 위하여 퍼지 이론을 이용한 버퍼관리 알고리즘을 제안하였다. 제안된 알고리즘은 태깅정보, 전체 버퍼의 점유량, VC의 부하 정도로 구성된 세 개의 파라미터를 이용하여 패킷 폐기를 결정한다. 시뮬레이션 결과 MCR의 크기가 커질수록 제안된 알고리즘의 수율과 공평성이 우수하였으며. 스위치에서 버퍼의 크기 변화에서도 Double-EPD나 DFRA는 비슷한 성능을 보였고, 제안된 알고리즘은 좋은 수율과 공평성을 제공한다.