• Proceedings of the Korean Society of Computer Information Conference
• /
• 2009.01a
• /
• pp.293-296
• /
• 2009

최근에 다양한 네트워크의 기술들이 존재하고 개발되어지고 있다. 이러한 네트워크 기술들을 효과적으로 사용하기위해서 버티컬 핸드오버가 다양한 측면에서 연구되어지고 있다. 버티컬 핸드오버는 단말기가 이종망에서 더 나은 성능을 가진 네트워크로 끊김없는 서비스를 제공하는 핸드오버 기술이다. 버티컬 핸드오버를 수행하는 동안에 라우터간 시그널링의 지연과 더불어 인증과 등록절차에 대한 시간지연으로 인하여 혼잡한 상황이 아님에도 불구하고 TCP에서는 혼잡한 상황으로 인식하여 성능이 낮아지는 문제가 발생한다. 또한, 버티컬 핸드오버를 수행하는 중에 링크의 특성이 다르고 대역폭이 달라서 패킷의 순서번호가 일치하지 않아서 잘못된 빠른 재전송(false fast retransmission:FFR) 발생하고 이러한 현상들은 TCP 처리량의 저하를 가져온다. 논문에서는 이러한 문제를 해결하기 위한 방법들에 대한 동향을 조사 해보았다.

• Journal of Communications and Networks
• /
• v.7 no.3
• /
• pp.385-393
• /
• 2005

In this paper, we propose a simple algorithm to adaptively adjust the value of dupthresh, the duplicate acknowledgement threshold that triggers the transmission control protocol (TCP) fast retransmission algorithm, to improve the TCP performance in a network environment with persistent packet reordering. Our algorithm uses an exponentially weighted moving average (EWMA) and the mean deviation of the lengths of the reordering events reported by a TCP receiver with the duplicate selective acknowledgement (DSACK) extension to estimate the value of dupthresh. We also apply an adaptive upper bound on dupthresh to avoid the retransmission timeout events. In addition, our algorithm includes a mechanism to exponentially reduce dupthresh when the retransmission timer expires. With these mechanisms, our algorithm is capable of converging to and staying at a near-optimal interval of dupthresh. The simulation results show that our algorithm improves the protocol performance significantly with minimal overheads, achieving a greater throughput and fewer false fast retransmissions.

• The KIPS Transactions:PartC
• /
• v.12C no.4 s.100
• /
• pp.571-580
• /
• 2005

In fast long-distance networks, TCP's congestion control algorithm has the problem of utilizing bandwidth effectively. Several window-based congestion control protocols for high-speed and large delay networks have been proposed to solve this problem. These protocols deliberate mainly three properties : scalability, TCP-friendliness, and RTT-fairness. These protocols, however, cannot satisfy above three properties at the same time because of the trade-off among them This paper presents a new window-based congestion control algorithm, called EM (Exponential Increase/ Multiplicative Decrease), that simultaneously supports all four properties including fast convergence, which is another important constraint for fast long-distance networks; it can support scalability by increasing congestion window exponentially proportional to the time elapsed since a packet loss; it can support RTT-fairness and TCP-friendliness by considering RTT in its response function; it can support last fair-share convergence by increasing congestion window inversely proportional to the congestion window just before packet loss. We evaluate the performance of EIMD and other algorithms by extensive computer simulations.

• Journal of KIISE:Information Networking
• /
• v.32 no.3
• /
• pp.382-390
• /
• 2005

As today's networks evolve towards an If-based integrated network, the role of transmission control protocol(TCP) has been increasing as well. As a well-known issue, the performance of TCP is affected by its loss recovery mechanism that is comprised of two algorithms; fast retransmit and fast recovery. Although retransmission timeout(RTO) caused by multiple packet losses can be avoided by using selective acknowledgement(SACK) option, RTO cannot be avoided if a retransmitted packet is lost. Therefore, we propose a simple modification to make it possible for a TCP sender using SACK option to detect a lost retransmission. In order to evaluate the proposed algorithm, simulations have been performed for two scenarios where packet losses are random and correlated. Simulation results show that the proposed algorithm can improve TCP performance significantly.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.30 no.6B
• /
• pp.396-405
• /
• 2005

Snoop protocol is one of the efficient schemes to compensate TCP packet loss and enhance TCP throughput in wired-cum-wireless networks. However, Snoop protocol has a problem; it cannot perform local retransmission efficiently under the bursty-error prone wireless link. In this paper, we propose Enhanced Snoop(E-Snoop) protocol to solve this problem of Snoop protocol. With E-Snoop protocol, packet losses can be noticed by receiving new ACK packets as well as by receiving duplicate ACK packets or local retransmission timeout. Therefore, TCP throughput can be enhanced by fast recognition of bursty packet losses and fast local retransmissions. From the simulation results, E-Snoop protocol can improve TCP throughput more efficiently than Snoop protocol and can yield more TCP improvement especially in the channel with high packet loss rates.

• Journal of Communications and Networks
• /
• v.4 no.2
• /
• pp.148-157
• /
• 2002

This paper investigates schemes to improve TCP performance in multipath forwarding networks. In multipath routing, packets to the same destination are sent to multiple next-hops in either packet-level or flow-level forwarding mode. Effective bandwidth is increased since we can utilize unused capacity of multiple paths to the destination. In packet-level multipath forwarding networks, TCP performance may not be enhanced due to frequent out-of-order segment arrivals at the receiver because of different delays among paths. To overcome this problem, we propose simple TCP modifications. At the sender, the fast retransmission threshold is adjusted taking the number of paths into consideration. At the receiver, the delayed acknowledgment scheme is modified such that an acknowledgment for an out-of-order segment arrival is delayed in the same way for the in-order one. The number of unnecessary retransmissions and congestion window reductions is diminished, which is verified by extensive simulations. In flow-level multipath forwarding networks, hashing is used at routers to select outgoing link of a packet. Here, we show by simulations that TCP performance is increased in proportion to the number of paths regardless of delay differences.

• Proceedings of the IEEK Conference
• /
• 2000.07a
• /
• pp.88-91
• /
• 2000

In this paper we approach the problem of congestion control for TCP traffic over ATM-UBR networks by focusing on the fact that to get best performance. We study how to efficiently support TCP traffic in the subnet ATM model, when ATM is only a single link in the whole path. We show that when UBR connection. We analyze the ATM-UBR network service using the BSD 4.3 Reno, Tahoe TCP. However we found the fact that the characteristic of fast recovery algorithm makes a serious degradation of performance in multiple cell loss drop situation. We propose new fast recovery algorithm to solve the problem.

• Journal of KIISE:Computing Practices and Letters
• /
• v.8 no.3
• /
• pp.336-343
• /
• 2002

Nowadays, after appearance of wireless network the existent internet environment is changing into the united wire/wireless network. But the present TCP regards all of the packet losses on transmission as the packet tosses due to the congestion. When it is applied on the wireless path, it deteriorates the end-to-end TCP throughput because it regards the packet loss by handoff or bit error as the packet loss by the congestion and it reduces the congestion window. In this paper, for solving these problems we propose the method that controls the performance of TCP on the wireless link by extending ECN which is used as a congestion control mechanism on the existent wire link. This is the method that distinguished the packet loss due to the congestion from due to bit error or handoff on the wireless network, so it calls the congestion control mechanism only when there occurs the congestion in the united wire/wireless network.

• Journal of Broadcast Engineering
• /
• v.9 no.2
• /
• pp.119-130
• /
• 2004

We have developed a prototype super-high-definition (SHD) digital cinema distribution system that can store, transmit, and display eight-million-pixel motion pictures that have the image quality of a 35-mm film movie. The system contains a movie server, a real-time decoder, and an SHB projector. Using a Gigabit Ethernet link and TCP/IP, the server transmits JPEG2000 compressed motion picture data streams to the decoder at transmission speeds as high as 300 Mbps. The received data streams are decompressed by the decoder, and then projected onto a screen via the projector. By using an enlarged TCP window, multiple TCP streams, and a shaping function to control the data transmission quantity, we achieved real-time streaming of SHD movie data at about 300 Mbps between Chicago and Los Angeles, a distance of more than 3000 km. We also improved the decoder performance to show movies with Image qualities of 450 Mbps or higher. Since UDP is more suitable than TCP for fast long-distance streaming, we have developed an SHD digital cinema UDP relay system, in which UDP is used for transmission over a fast long-distance network. By using four pairs of server-side-proxy and decoder-side-proxy, 450-Mbps movie data streams could be transmitted.

• Journal of Korea Multimedia Society
• /
• v.3 no.6
• /
• pp.643-651
• /
• 2000

ATM network technology is generally used for the integration of multimedia services in high-speed Internet. ABR (Available Bit Rate) and UBR (Unspecified Bit Rate) service classes have been developed specifically to support data application. In this paper, through the result of simulation, we analyzed the effect of TCP data transmission performance by using FRR (Fast Retransmission and Recovery) and Nagle's Algorithm on the UBR service, and by adjusting EFCI switch parameter on the ABR service. As a result of our study, performance improvement of TCP over ATM network is observed by adjusting TCP parameters and setting of effective switch parameter.