• Proceedings of the IEEK Conference
• /
• 2003.07b
• /
• pp.855-858
• /
• 2003

TCP/IP 를 포함하는 데이터 네트워킹 프로토콜을 구현함에 있어, 기존에는 소프트웨어 방식으로 구현되었던 모듈들을 하드웨어로 구현하는 프로젝트를 수행하면서, CPU 와 하드웨어 모듈과의 통신을 중계하는 모듈을 구현하였다. 본 논문에서는 TCP/IP 하드웨어와 CPU 와의 통신을 위한 Host Interface 의 기능에 대해 다루고 구현 방식을 Control flow와 Data flow의 입장에서 설명하였다. 우선, Host Interface 의 기능을 설명하고 Host Interface 의 입출력 신호를 정의하였다. Host Interface에서 이루어지는 CPU와 하드웨어 모듈간의 통신을 제어정보 흐름과 데이터정보 흐름으로 나누고 제어흐름을 위해서는 Command/Status Register 를 두었고, 데이터 흐름을 위해서는 CPU와 데이터 RAM 사이에 FIFO 를 두어 데이터의 흐름이 신속히 이루어지도록 하였다. 끝으로 Host Interface 와 주변 모듈들간의 통신에 대한 Testcases에 대해서도 다루었다.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.32 no.10A
• /
• pp.965-973
• /
• 2007

We analyzed that the loss of data in TCP protocol based wireless networks caused by overlapped responses in bi-directional nodes that were resulted in out of the data sequence. This loss can be prevented by using revised TCP rate control algorithm and the performance of throughput can also be improved. The rate control algorithm is applied when the congestion happens between nodes while traffic packets are retransmitting in TCP bandwidth. In addition to applying the rate control algorithm, we determine the number of system clients in bandwidth and the average of pausing time between transmitting serial files to produce a competitive level so that an efficient performance of rapid retransmitting for the loss of multi-packets. This paper discusses the improvement of congestion control in that the decrease of the loss, firstly, as ensuring an efficient connection rate and, secondly, as using sliding window flow control.

• The Transactions of the Korea Information Processing Society
• /
• v.7 no.11S
• /
• pp.3723-3731
• /
• 2000

Recently, the growth of applications and services over high-speed Internet increase, ATM networks as wide area back-bone has been a major solution. The conventional TCP suite is still the standard protocol used to support upper application on current Internet and uses a window based protocol for flow control in the transport layer. When TCP data uses the UBR service in ATM layer, the control method is also buffer management. If a cell is discarded in ATM layer. one whole packet of TCP will be lost. Which is responsible for most TCP performance degradation and do not offer sufficiently QoS. To solve this problem, Several dropping strategies, such as Tail Drop, EPD, PPO, SPD, FBA, have been proposed to improve the TCP performance over ATM. In this paper, to improve the TCP fairness of end to end, we propose a packet dropping scheme algorithm using two fixed threshold. Under similar condition, we compared our proposed scheme with other dropping strategies. Although the number of VC is increased, simulation results showed that the proposed scheme can allocate more fairly each VC than other schemes.

• Annual Conference of KIPS
• /
• 2002.11b
• /
• pp.1249-1252
• /
• 2002

클러스터와 같은 네트워크 컴퓨팅 환경에서는 신속하고 신뢰성이 보장되는 데이터 전송이 요구된다. 신뢰성 보장을 위해서 일반적으로 사용되는 전송 프로토콜은 TCP 이다. 그러나 클러스터의 하부 네트워크로서 많이 사용되는 Myrinet 은 cut-through 스위칭 방식을 기반으로 하기 때문에 네트워크 혼잡(congestion)이 발생하지 않는다. 따라서 TCP 의 혼잡 제어(congestion control) 등과 같은 루틴들은 Myrinet 상에서 불필요한 오버헤드를 발생시킨다. 본 논문은 Myrinet 네트워크에서 흐름 제어(flow control)만으로도 신뢰성을 보장할 수 있음을 보이고 TCP 보다 오버헤드가 적은 UDP에 흐름 제어를 구현한 RUM(Reliable UDP on Myrinet)을 제안한다. 성능 측정 결과, RUM 은 신뢰성을 보장함과 동시에 TCP 보다 최대 34% 더 높은 처리량(throughput)을 보이며, UDP 와 비슷한 낮은 단방향 지연시간(one-way latency)을 보장함을 알 수 있다.

• Proceedings of the Korean Information Science Society Conference
• /
• 2003.04d
• /
• pp.512-514
• /
• 2003

본 논문은 모바일 환경에서 제한된 메모리를 가지고 있는 수신자에 의 한 TCP흐름 제어 방법을 제안한다. TCP 흐름 제어는 송신자에서 수신자에게 전달되는 Advertised 윈도우 크기를 조정하여 수행된다. 수신자는 무선 대역폭과 종단간 패킷 왕복 시간을 동적으로 측정하며 최적의 Advertised 윈도우 크기를 계산하고 송신자의 전송률을 무선 대역폭으로 제한한다. 제안된 흐름 제어 기법은 제한된 메모리를 가진 수신자를 고려하였으며 무선 네트웍의 특성을 고려 한 효율적 인 TCP 흐름 제어로 TCP의 전송 성능 향상과 종단간 패킷 왕복 시간의 지연을 줄일 수 있도록 하였다. 제안된 흐름 제어 기 법의 효율성과 성능을 구현과 실험을 통해 검증한다.

• Journal of Navigation and Port Research
• /
• v.27 no.3
• /
• pp.283-288
• /
• 2003

Recently, the growth of applications and services over high-speed Internet increases, ATM networks as wide area back-bone has been a major solution. As the conventional TCP/IP suite is still the standard protocol used to support upper application on current. Internet, the issues regarding whether TCP/IP will operate efficiently on top of an ATM infrastructure and how to control its QoS still remain for studies. TCP uses a window-based protocol for flow control in the transport layer. When TCP uses the UBR service in ATM layer, the control method is only buffer management. If a cell is discarded in ATM layer, one whole packet of TCP will be lost; this fact occur the most TCP performance degradation. Several dropping strategies, such as Tail Drop, EPD, PPD, SPD, FBA, have been proposed to improve the TCP performance over ATM. In this paper, to improve the TCP performance, we propose a packet dropping scheme that is based on comparison with EPD, SPD and FBA. Our proposed scheme is applied to schemes discussed in the previous technology. Our proposed scheme does not need to know each connection's mean packet size. When the buffer exceeds the given threshold, it is based on comparison between the number of dropped packet and the approved packet. Our results are reported and discussed for comparing these discarding schemes under similar conditions. Although the number of virtual channel (VC) is increased, the simulation results showed that the proposed scheme can allocate more fairly each VC than other scheme.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.12 no.11
• /
• pp.5179-5202
• /
• 2018

Transmission Control Protocol (TCP) is the most widely used protocol in the cloud data centers today. However, cloud data centers using TCP experience many issues as TCP was designed based on the assumption that it would primarily be used in Wide Area Networks (WANs). One of the major issues with TCP in the cloud data centers is the Incast issue. This issue arises because of the many-to-one communication pattern that commonly exists in the modern cloud data centers. In many-to-one communication pattern, multiple senders simultaneously send data to a single receiver. This causes packet loss at the switch buffer which results in TCP throughput collapse that leads to high Flow Completion Time (FCT). Recently, Software-Defined Networking (SDN) has been used by many researchers to mitigate the Incast issue. In this paper, a detailed survey of various SDN based solutions to the Incast issue is carried out. In this survey, various SDN based solutions are classified into four categories i.e. TCP Receive Window based solutions, Tuning TCP Parameters based solutions, Quick Recovery based solutions and Application Layer based solutions. All the solutions are critically evaluated in terms of their principles, advantages, and shortcomings. Another important feature of this survey is to compare various SDN based solutions with respect to different performance metrics e.g. maximum number of concurrent senders supported, calculation of delay at the controller etc. These performance metrics are important for deployment of any SDN based solution in modern cloud data centers. In addition, future research directions are also discussed in this survey that can be explored to design and develop better SDN based solutions to the Incast issue.

• The KIPS Transactions:PartC
• /
• v.11C no.1
• /
• pp.89-98
• /
• 2004

AQM (Active Queue Management) techniques such as RED (Random Early Detection) which be proposed to solve the congestion of internet perform congestion control effectively for TCP data. However, in the situation where TCP and UDP share the bottleneck link, they can not solve the problems of the unfairness and long queueing delay. In this paper, we proposed an simple queue management algorithm, called PSRED (Protocol Sensitive RED), that improves fairness and decreases queueing delay. PSRED algorithm improves fairness and decreases average queue length by distinguishes each type of flow in using protocol field of packets and applies different drop functions to them respectively.

• Journal of KIISE:Computing Practices and Letters
• /
• v.14 no.4
• /
• pp.369-377
• /
• 2008

Today, Ethernet technology is rapidly developing to have a bandwidth of 10Gbps beyond 1Gbps. In such high-speed networks, the existing method that host CPU processes TCP/IP in the operating system causes numerous overheads. As a result of the overheads, user applications cannot get the enough computing power from the host CPU. To solve this problem, the TCP/IP Offload Engine(TOE) technology was emerged. TOE is a specialized NIC which processes the TCP/IP instead of the host CPU. In this paper, we implemented a high-performance, lightweight TCP/IP(HL-TCP) for the TOE and applied it to an embedded system. The HL-TCP supports existing fundamental TCP/IP functions; flow control, congestion control, retransmission, delayed ACK, processing out-of-order packets. And it was implemented to utilize Ethernet MAC's hardware features such as TCP segmentation offload(TSO), checksum offload(CSO) and interrupt coalescing. Also we eliminated the copy overhead from the host memory to the NIC memory when sending data and we implemented an efficient DMA mechanism for the TCP retransmission. The TOE using the HL-TCP has the CPU utilization of less than 6% and the bandwidth of 453Mbps.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.9 no.1
• /
• pp.45-57
• /
• 2005

In this paper, we extend the performance of bidirectional TCP connection over end-to-end network that uses transfer rate-based flow and congestion control. The sharing of a common buffer by TCP packets and acknowledgement has been known to result in an effect called ack compression, where acks of a connection arrive at the source bunched together, resulting in unfairness and degraded throughput. The degradation in throughput due to bidirectional traffic can be significant. Even in the simple case of symmetrical connections with adequate window size, the connection efficiency is improved about 20% for three levels of background traffic 2.5Mbps, 5.0Mbps and 7.5Mbps. Otherwise, the throughput of jitter is reduced about 50% because round trip delay time is smaller between source node and destination node. Also, we show that throughput curve is improved with connection rate algorithm which is proposed for TCP congetion avoidance as a function of aggressiveness threshold for three levels of background traffic 2.5Mbps, 5Mbps and 7.5Mbps. By analyzing the periodic bursty behavior of the source IP queue, we derive estimated for the maximum queue size and arrive at a simple predictor for the degraded throughput, applicable for relatively general situations.