• Journal of the Institute of Electronics Engineers of Korea CI
• /
• v.47 no.6
• /
• pp.28-39
• /
• 2010

The study aims at offering a solution to the problems of transmission delay and data throughput decrease as the number of contending On-Board Units (OBU) increases by applying CSMA medium access control protocol based upon IEEE 802.11p. In a competition-based medium, contention probability becomes high as OBU increases. In order to improve the performance of this medium access layer, the author proposes EDCA which a adaptive adjustment of the Contention Windows (CW) considering traffic density and data type. EDCA applies fixed values of Minimum Contention Window (CWmin) and Maximum Contention Window (CWmax) for each of four kinds of Access Categories (AC) for channel-specific service differentiation. EDCA does not guarantee the channel-specific features and network state whereas it guarantees inter-AC differentiation by classifying into traffic features. Thus it is not possible to actively respond to a contention caused by network congestion occurring in a short moment in channel. As a solution, CWminAS(CWmin Adaptation Scheme) and ACATICT(Adaptive Contention window Adjustment Technique based on Individual Class Traffic) are proposed as active CW control techniques. In previous researches, the contention probabilities for each value of AC were not examined or a single channel based AC value was considered. And the channel-specific demands of IEEE 802.11p and the corresponding contention probabilities were not reflected in the studies. The study considers the collision number of a previous service section and the current network congestion proposes a dynamic control technique ACCW(Adaptive Control of Contention windows in considering the WAVE situation) for CW of the next channel.

• 전자공학회논문지 IE
• /
• v.48 no.3
• /
• pp.16-19
• /
• 2011

Differentiated Service is an IP QoS ensuring method based on packet marking that allows packets to be prioritized according to user requirements. During the time of congestion, more low priority packets are dropped than high priority packets. Different policy models are used to determine how to mark the packet. This paper investigated the performance of Differentiated Service using time sliding window with 3 color marking (TSW3CM). Simulation results using NS-2 showed that Differentiated Service can provide the quality of service requirements.

• Journal of KIISE
• /
• v.42 no.9
• /
• pp.1162-1174
• /
• 2015

These days, the networks have exhibited HBDP (High Bandwidth Delay Product) characteristics. The legacy TCP slowly increases the size of the congestion window and drastically decreases the size of a congestion window. The legacy TCP has been found to be unsuitable for HBDP networks. TCP mechanisms for solving the problems of the legacy TCP can be categorized into the loss-based TCP and the delay-based TCP. Most of the TCP mechanisms use the standard slow start phase, which leads to a heavy packet loss event caused by the overshoot. Also, in the case of congestion avoidance, the loss-based TCP has shown problems of wastage in terms of the bandwidth and RTT (Round Trip Time) fairness. The delay-based TCP has shown a slow increase in speed and low occupancy of the bandwidth. In this paper, we propose a new scheme for improving the over shoot, increasing the speed of the bandwidth and overcoming the bandwidth occupancy and RTT fairness issues. By monitoring the buffer condition in the bottleneck link, the proposed scheme does congestion control and solves problems of slow start and congestion avoidance. By evaluating performance, we prove that our proposed scheme offers better performance in HBDP networks compared to the previous TCP mechanisms.

• Proceedings of the Korean Information Science Society Conference
• /
• 2001.10c
• /
• pp.541-543
• /
• 2001

비대칭 링크 상에서 TCP 전송율 향상을 위한 새로운 기법을 제시하였다. 기존 TCP는 비대칭 링크에서 수신단의 전송버퍼의 오버프로우에 인하여 패킷의 재전송, 타임아웃 등으로 인하여 전송율이 상당히 낮아지는 문제점을 가진다. 본 논문에서는 이러한 단점을 극복하기 위해 수신단의 전송 버퍼가 가득 찰 경우. 이를 송신 단에게 통보하여 송신단은 전송을 중단하고, 혼잡 윈도우를 유지함으로써. 전송 버퍼의 여유가 생겨서 수신단이 송신단에 이를 통보하여 다시 전송이 가능해졌을 경우 송신단이 즉시 전송을 재개할 수 있도록 하였다 제안된 기법의 성능 향상을 시뮬레이션을 통해 확인하였다 .

• Proceedings of the Korean Information Science Society Conference
• /
• 2004.10c
• /
• pp.313-315
• /
• 2004

본 논문은 IEEE 802.l1b 유무선 환경 에 서 TCP를 이용한 데이터 전송 시 에이젼트를 이용하여 패킷 손실의 원인을 분석, 무선 링크에서 발생한 패킷 손실에 대해서는 혼잡 윈도우 크기를 유지하고, 유선 링크에서 발생한 패킷 손실에 대해서는 지역 재전송을 수행하는 저전력 전송 기법을 제안하고 실제 구현한다. 제안하는 저전력 전송기법 은 전송 후 WNIC를 저 전력 모드로 전환 시킴으로써 WNIC 전력 소비를 최소화 한다. 실험 결과 높은 무선 링크 에러율(1~2%)에서 기존 TCP-Reno 보다 약 18% 에너지 감소 효과를 나타냈다.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2013.11a
• /
• pp.211-213
• /
• 2013

TCP는 네트워크에서 손실 없이 데이터를 전송하는 전송 프로토콜이다. TCP는 전송 초기에 대역폭을 알지 못하는 상황에서 혼잡 윈도우의 지수적 증가를 통하여 전송하는 슬로우 스타트 단계를 수행한다. 지수적 증가의 특성으로 말미암아 폭주 가능성이 발생하고, 이는 네트워크의 변동성이 심할수록 가중된다. 본 논문에서는 이러한 문제점을 해결하기 위해 기존의 Hybrid Start 방법을 개선한 통계적 슬로우 스타트 방법을 제안하며 이를 통하여 TCP 성능을 개선한다.

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

The standards which use shared medium like IEEE 802.11 wireless LAN have transmission opportunity by contention in contention period. If there are collisions in contention period, medium access control protocol may solve problem by using backoff algorithm. Backoff algorithm is important part in medium access control, but legacy backoff method which is used under IEEE 802.11 standards is not adjusted when load is heavy because of increasing collisions. In this paper, we propose a new load-based dynamic backoff algorithm in contention-based wireless shared medium to improve throughput of medium and to reduce the number of collisions. Proposed backoff algorithm can increase the network utilization about $20\%$ higher than that of binary exponential backoff algorithm.

• The Journal of the Korea institute of electronic communication sciences
• /
• v.2 no.1
• /
• pp.10-18
• /
• 2007

In this paper, we extend the multiple time scale control framework to window-based congestion control, in particular, TCP. This is performed by interfacing TCP with a large time scale control module which adjusts the aggressiveness of bandwidth consumption behavior exhibited by TCP as a function of "large time scale" network state. i.e., conformation that exceeds the horizon of the feedback loop as determined by RTT. Performance evaluation of multiple time scale TCP is facilitated by a simulation bench-mark environment which is based on physical modeling of self-similar traffic. If source traffic is not extended exceeding, when RTT is 450ms, in self similar burst environment, performance gain of TCP-SSC is up to 45% for ${\alpha}$=1.05. However, its is acquired only 20% performance gain for ${\alpha}$=1.95 relatively. Therefore we showed that by TCP-MTS at large time scale into a rate-based feedback congestion control, we are able to improve two times performance significantly.

• The Journal of the Korea Contents Association
• /
• v.7 no.1
• /
• pp.131-138
• /
• 2007

In wired networks, packet losses mostly occur due to congestion. TCP reacts to the congestion by decreasing its congestion window, thus to reduce network utilization. In wireless networks, however, losses may occur due to the high bit-error rate of the transmission medium or due to fading and mobility. Nevertheless, TCP still reacts to packet losses according to its congestion control scheme, thus to reduce the network utilization unnecessarily. This reduction of network utilization causes the performance of TCP to decrease. In this paper, we predict packet loss by using RSS(Received Signal Strengths) on the wireless and suggest adding RSS flag bit in ACK packet of MH. By using RSS flag bit in ACK, the FH(Fixed Host) decides whether it adopt congestion control scheme or not for the maximum throughput. The result of the simulation by NS-2 shows that the proposed mechanism significantly increases sending amount and receiving amount by 40% at maximum.

• Journal of KIISE:Information Networking
• /
• v.30 no.5
• /
• pp.656-667
• /
• 2003

Congestion control is a key task in reliable multicast along with error control. However, existing tree-based congestion control schemes such as MTCP and TRAMCC are designed for one-to-many reliable multicast and have some drawbacks when they are used for many-to-many reliable multicast. We propose an efficient congestion control mechanism, TMRCC, for tree-based many-to-many reliable multicast protocols. The proposed scheme is based on the congestion windowing mechanism and a rate controller is used in addition. The feedback for error recovery is exploited for congestion control as well to minimize the overhead at the receivers. The ACK timer and the NACK timers are set dynamically reflecting the network condition changes. The rate regulation algorithm in the proposed scheme is designed to help the flows sharing the same link to achieve the fair share quickly The performance of the proposed scheme is evaluated using ns-2. The simulation results show that the proposed scheme outperforms TRAMCC in terms of intra- session fairness and shows good level of responsiveness, TCP-friendliness, and scalability. In addition, we implemented the proposed scheme by integrating with GAM that is one of many-to-many reliable multicast protocols and evaluated the performance in a laboratory-wide testbed.