• 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% 에너지 감소 효과를 나타냈다.

• Journal of Internet Computing and Services
• /
• v.8 no.5
• /
• pp.125-132
• /
• 2007

Transmission mechanisms that include an available bandwidth estimation algorithm and a packet loss differentiation scheme, in general, exhibit higher TCP performance in wireless networks. TCP New Jersey, known as the best existing scheme in terms of goodput, improves wireless TCP performance using the available bandwidth estimation at the sender and the congestion warning at intermediate routers. Although TCP New Jersey achieves 17% and 85% improvements in goodput over TCP Westwood and TCP Reno, respectively, we further improve TCP New Jersey by exploring improved available bandwidth estimation, retransmission timeout, and recovery mechanisms. Hence, we propose TCP New Jersey PLUS (shortly TCP NJ+), showing that under 1% packet loss rate, it outperforms 3% by TCP New Jersey and 5% by TCP Wes1wood. In 5% packet loss rate, a characteristic of high bit-error-rate wireless network, it outperforms other TCP variants by 19% to 104% in terms of goodput even when the network is in bi-directional congestion.

• Journal of Korean Society of Transportation
• /
• v.28 no.4
• /
• pp.167-175
• /
• 2010

The ubiquitous transportation system environments make it possible to collect each vehicle's position and velocity data and to perform more sophisticated traffic flow management at the individual vehicle or platoon level through vehicle to vehicle (V2V) and vehicle to infrastructure (V2I) communication. It is necessary to develop a traffic flow management scheme to take advantage of the ubiquitous transportation system environments. This paper proposes an algorithm to advise the optimal speed for each vehicle according to the traffic flow condition. The algorithm aims to stabilize the traffic flow by advising the equilibrium speed to the vehicles speeding or crawling under freely flowing condition. And it aims to prevent or at least alleviate the shockwave propagation by advising the optimal speed that should dampen the speed drop under critical flow conditions. This paper builds a simulation testbed and performs some simulation experiments for the proposed algorithm. The proposed algorithm shows the expected results in terms of travel time reduction and congestion alleviation.

• Journal of Internet Computing and Services
• /
• v.8 no.1
• /
• pp.15-23
• /
• 2007

Wireless LAN (IEEE 802.11) uses traditional TCP for reliable data transmission, But it brings the unintentional packet loss which is not congestion loss caused by handoff, interference, and fading in wireless LAN. In wireless LAN, TCP experiences performance degradation because it consumes that the cause of packet loss is congestion, and it decrease the sending rate by activating congestion control algorithm. This paper analyzes that correlation of throughput and buffer size for wireless buffer tuning. We find MBT (Maximum Buffer Threshold) which does not increase the throughput through the analysis, For calculation of MBT, we experiment the throughput by using high volume music data which is creased by real-time performance of piano. The experiment results is shown that buffer tuing based on MBT shows 20.3%, 21.4%, and 45.4% throughput improvement under 5ms RTT, 10ms RTT, and 20ms RTT, respectively, comparing with the throughput of operation system default buffer size, In addition, we describe that The setting of TCP buffer size by exceeding MBT does not have an effect on the performance of TCP.

• Journal of KIISE
• /
• v.43 no.8
• /
• pp.919-926
• /
• 2016

In a wireless network, TCP causes the performance degradation because of mistaking packet loss, which is caused by characteristics of wireless link and throughput oscillation due to change of devices connected on a limited bandwidth. Delay based TCP is not affected by packet loss because it controls window size by using the RTT. Therefore, it can solve the problem of unnecessary degradation of the rate caused by misunderstanding reason of packet loss. In this paper, we propose an algorithm for improving the remaining problems by using delay based TCP. The proposed scheme can change throughput adaptively by adding the RTT, which rapidly reflects the network conditions to BaseRTT. It changes the weight of RTT and the increases and decreases window size based on the remaining amount of the buffer. The simulation indicated that proposed scheme can alleviate the throughput oscillation problem, as compared to the legacy TCP Vegas.

• Journal of Korean Society of Forest Science
• /
• v.79 no.3
• /
• pp.231-244
• /
• 1990

As the complexity of society increases, the demand for the forest-based recreational site is also increased. This, in turn. makes congestion an ubiquitous type of externality in forest-based recreational site. Efficient resource allocation requires this congestion effect to be accounted and considered in the decision making process. In this content, this study was conducted to suggest a process which can be used to measure the congestion and determine the optimal number of users. Willigness to pay(WTP) function obtained from Book Han San National Park users suggested that every 20.000 users increased decrease the satisfaction of users obtained from the site visit be 27.3%. For the purpose of demonstration this WTP function is applied tit determine the optimal number of users which is estimated as about 73,000 persons per day.

• Journal of the Institute of Electronics Engineers of Korea CI
• /
• v.45 no.5
• /
• pp.125-133
• /
• 2008

In this paper, we propose active queue management mechanism (Active-WRED) to guarantee quality of the high priority service class in multi-class traffic service environment. In congestion situation, this mechanism increases drop probability of low priority traffic and reduces the drop probability of the high priority traffic, therefore it can improve the quality of the high priority service. In order to analyze the performance of our mechanism we introduce the stochastic analysis of a discrete-time queueing systems for the performance evaluation of the Active Queue Management (AQM) based congestion control mechanism called Weighted Random Early Detection (WRED) using a two-state Markov-Modulated Bernoulli arrival process (MMBP-2) as the traffic source. A two-dimensional discrete-time Harkov chain is introduced to model the Active-WRED mechanism for two traffic classes (Guaranteed Service and Best Effort Service) where each dimension corresponds to a traffic class with its own parameters.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.33 no.3A
• /
• pp.219-224
• /
• 2008

In the c-DSDV routing protocol proposed to improve the scalability of DSDV, clusterheads manage a routing table that has only clusterheads as potential destinations and flood update request message to its neighbor clusterheads periodically or at the time of topology change. Accordingly, the convergence range of topology change by a single update request message was expanded nine times as wide as that of DSDV, increasing routing correctness; however, c-DSDV suffers from the congestion of clusterheads since data packets always go through clusterheads of the clusters on the routing path. To improve this problem, we propose an adaptive routing scheme that judges if detouring clusterhead is possible on the fly while packets are forwarded. As a result, a routing path length is shortened and an end-to-end delay is improved by the reduced queue length. It shows that the end-to-end delay is reduced by almost 40% through simulation.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.31 no.9B
• /
• pp.829-837
• /
• 2006

Due to the internet network congestion, packets may be dropped or delayed at routers. This phenomenon degrades the quality of streaming applications that require high QoS requirements. The proposed algorithm in this paper, called DBRC(Delay-Based Rate Control), tries to cause router queue occupancy to reach a steady state or equilibrium by throttling the transmission rate of the multimedia traffics when network delays tend to increase and also probing for more bandwidth when network delays tend to decrease. Simulation results show that the proposed algorithm provides smooth transmission rate, nearly constant delay and low packet loss rates, compared with TFRC(TCP Friendly Rate Control) that is one of dominant multimedia congestion control algorithms.

• Journal of Korean Society of Transportation
• /
• v.22 no.2 s.73
• /
• pp.55-63
• /
• 2004

기존의 설계시간순위 결정은 "순위곡선의 기울기가 완만해지는 지점"이라는 정성적인 기준을 사용하였다. 따라서, 분석자마다 서로 다른 결과를 도출하고 도로 설계시 고려해야하는 두요소(교통혼잡, 경제성)를 전혀 고려하지 못하는 문제점이 있다. 또한 현재의 도로 설계시 대상으로 삼는 시간교통량은 국내 도로의 교통특성이 설, 추석 등의 연휴에 집중적으로 몰리는 등 외국과 그 특성이 상이함에도 불구하고 미국과 동일한 상위 30순위 교통량을 사용한다. 상위 30순위 교통량을 설계시간순위로 하는 경우, 상위 30순위교통량 중 휴일교통량의 비율이 74.1%(설, 추석 연휴 39.7%)로 휴일 집중 교통량의 영향을 크게 받으며, 연중 최대교통량이 용량의 85.2% 에 불과해 도로가 과다 설계된다. 본 연구에서는 목표년도의 연중 최대시간교통량이 용량에 도달하는 순위를 설계시간순위로 하였으며, 분석결과 상위 150순위가 교통혼잡과 도로의 경제성을 모두 고려할 수 있는 설계시간순위로 산정되었다. 설계시간순위를 150순위로 할 경우 현행 설계순위인 30순위에 비해 휴일비율 13.8% 감소, 최대시간교통량의 용량비율($V_1/C_a$) 16.0% 증가의 효과가 있을 것으로 분석되었다. - 현행 설계시간순위(30순위) : 휴일비율 74.1%(설, 추석 비율 39.7%), $V_1/C_a$ 85.2% - 제안 설계시간순위(150순위) : 휴일비율 60.3%(설, 추석비율 23.0%), $V_1/C_a$ 101.2%