• Journal of Korea Multimedia Society
• /
• v.11 no.2
• /
• pp.197-205
• /
• 2008

TCP packets occupy over 90% of current Internet traffic thus understanding of TCP throughput is crucial to understand Internet. Under the TCP congestion regime, heterogeneous flows, i.e., flows with different round-trip times (RTTs), that share the same bottleneck link will not attain equal portions of the available bandwidth. In fact, according to the TCP friendly formula, the throughput ratio of two flows is inversely proportional to the ratio of their RTTs. It has also been shown that TCP's unfairness to flows with longer RTTs is accentuated under loss synchronization. In this paper, we show that, injecting bursty background traffic may actually lead to new type of synchronization and result in unfairness to foreground TCP flows with longer RTTs. We propose three different metrics to characterize traffic burstiness and show that these metrics are reliable predictors of TCP unfairness.

• The Journal of The Korea Institute of Intelligent Transport Systems
• /
• v.11 no.5
• /
• pp.1-6
• /
• 2012

Unlike the past, modern urban intersections have dramatic growth in size and utilizations. As a result, continual traffic signal control is essential. Hence the individual or regional electrical blackout may bring about uncontrollable traffic congestion. Late summer of 2011 a regional blackout brought about traffic nightmare not including time and revenue loss associated with this disaster. Due to this disaster our national police agency and other government agencies are in process of introducing an UPS (uninterruptible power supply) system into essential intersections. This study estimates the power consumption necessary to sustain at least 2 continuous hours for a standard four-legged intersection. Prototype was studied using these standards. The field experiment of prototype showed positive results and was able to meet standard guidelines set forth. Prototype tested was able to meet standards in medium to large capacity of traffic size.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.39 no.2
• /
• pp.59-68
• /
• 2002

In this paper, we compared and analyzed two new models of cyclic packet dropping algorithm, Adaptive Cyclic Packet Dropping algorithm (ACPD), and Non-adaptive Cyclic Packet Dropping algorithm (NCPD) with RIO. The ACPD algorithm drops adaptively packets for the congestion control, as predicting traffic pattern between each cycle. Therefore the ACPD algorithm makes up for the drawback of RIO algorithm and minimizes the wastes of the bandwidth being capable of predicting in the NCPD algorithm. We modelled two cyclic packet drop algorithms and executed a simulation and analyzed the throughput and packet drop rate based on Sending Priority changing dynamically depending on network traffic. In this algorithm, applying the strict drop precedence policy, we get better performance on priority levels. The results show that two new algorithms may provide more efficient and stricter drop precedence policy as compared to RIO independent of traffic load. The ACPD algorithm can provide better performance on priority levels and keep stricter drop policy than other algorithms.

• The KIPS Transactions:PartC
• /
• v.10C no.1
• /
• pp.51-60
• /
• 2003

One of the most important matters in designing network and realizing service, is to grip on the traffic characteristics. Conventional traffic prediction and analysis used the models which based on the Poisson or Markovian. Recently, experimental research on the LAN, WAN and VBR traffic properties have been pointed rut that they weren't able to display actual real traffic specificities because the models based on the Poisson assumption had been underestimated the long range dependency of network traffic and self-similar peculiarities, it has been lately presented that the new approach method using self-similarity characteristics as similar as the real traffic models. Therefore, in this paper, we generated self-similar data traffic like real traffic as background load. On the existing ABR congestion control algorithm, we analyzed by classify into ACR, buffer utilization. cell drop rate, transmission throughput with the representative EFCI, ERICA, EPRCA and NIST twitch algorithm to show the efficient reaction about the burst traffic.

• 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.

• Journal of Korean Society of Transportation
• /
• v.20 no.4
• /
• pp.151-162
• /
• 2002

The object of this study is to develop an operating time prediction model for expressways using toll collection data. A Prediction model based on modular neural network model was developed and tested using real data. Two toll collection system(TCS) data set. Seoul-Suwon section for short range and Seoul-Daejeon section for long range, in Kyongbu expressway line were collected and analyzed. A time series analysis on TCS data indicated that operating times on both ranges are in reasonable prediction ranges. It was also found that prediction for the long section was more complex than that for the short section. However, a long term prediction for the short section turned out to be more difficult than that for the long section because of the higher sensitivity to initial condition. An application of the suggested model produced accurate prediction time. The features of suggested prediction model are in the requirement of minimum (3) input layers and in the ability of stable operating time prediction.

• Proceedings of the Korean Institute of Navigation and Port Research Conference
• /
• 2015.07a
• /
• pp.239-241
• /
• 2015

인적오류는 해양사고의 주요한 원인을 차지하고 있으나 그동안 이에 대한 연구가 미흡한 실정이다. 본 연구에서는 해양사고의 인적요소 중 혼잡해역이나 협수로 등에서 타 선박에 대한 다양한 조우 상황별 항해사가 받는 스트레스 값을 실험하였다. 또한 GEV distribution을 적용하여 인적오류 평가모델을 개발하고자 하였고 선박 실험을 통하여 도출된 데이터를 통하여 분포함수와 스트레스 수치 사이의 오차를 계산하고 평가하였다. 향후 본 모델의 개발을 통하여 선박 운항자의 스트레스 정도를 예측 할 수 있고 이에 따른 사고 예방 조치 및 적절한 교육훈련 실시 등 다양한 인적 오류 저감을 위한 대책마련에 도움이 되고자 하는 목적이다.

• Proceedings of the KOR-KST Conference
• /
• 1998.10a
• /
• pp.41-41
• /
• 1998

ITS틀 내의 한 분야인 도로교통정보체계 (ATIS: Advanced Traveler Information system)는 실시간 교통정보를 운전자에게 직접 제공하는 것으로서, 이를 위해 매 순간마다 가로망에 배정되는 교통량 및 통행시간을 예측할 수 있는 범용의 동적 통행배정모형(dynamic route choice model)의 개발이 필히 수반되어야 한다. 본 연구에서는 ITS사업에서 필수적으로 수반되어야 할 최적 제어이론에 의한 동적 통행 배정모형을 ATIS의 핵심 소프트웨어로 응용하기 위해 기존 연구성과를 발판으로, 순간 동적 통행 배정모형(Ran, Boyce &LeBlanc, 1993)의 통행제약조건인 링크통행함수, 특히, 과부하 시 엘켈릭의 일반식의 파라메터를 조정, 적용하여, 서울시 강남지역의 실제 가로망의 사례연구를 통해 지체식의 각각의 파라메터에 따른 결과를 O/D에 따른 통행시간, 링크통행시간, 혼잡도를 중심으로 비교 평가하여, ATIS의 핵심 소프트웨어로서 순간 동적 통행배정을 통해 보다 현실여건을 잘 반영할 수 있는 링크 통행 성능 함수를 도출하였다.

• Proceedings of the KSR Conference
• /
• 2005.11a
• /
• pp.65-71
• /
• 2005

본 논문에서는 PRT(Personal Rapid Transit) 시스템의 성능과 시스템의 안전에 영향을 미치는 PRT 시스템의 운전시격(Headway)에 대해서 다룬다. 어떤 차량과 다음 차량과의 운전 간격을 나타내는 운전시격은 대중교통수단에서 교통 혼잡의 문제를 풀 수 있는 중요한 단서가 되는 성로용량을 평가하는 중요한 인자들 중의 하나이다. 운전시격을 결정하기 위한 중요한 인자들에는 고장 차량의 감속비, 고장차량의 후미에 있는 차량의 비상 제동 감속비, 차량의 선로속도, 차량의 제동을 위한 지연시간 등이 있다. 이들 인자들을 이용한 간단한 해석적 방정식은 차량의 선속도, 감속도와 운전시격에 대한 상관관계를 예측할 수 있도록 해준다. 본 논문에서는 간단한 해석 방정식을 이용한 수치 해석적 방법을 통해서 최소 운전시격에 대한 평가를 예를 간단한 모의시험을 통해서 보인다.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2010.04a
• /
• pp.733-736
• /
• 2010

VANET(Vehicular Ad-hoc Network)은 노드를 차량으로 가정하는 개념의 MANET(Mobile Ad-hoc Network)로서 노드의 빠른 이동으로 인해 급격한 토폴로지의 변화가 일어난다. 하지만 차량 노드의 이동은 도로 상에서 제한되어 있기 때문에 토폴로지에 대한 상대적인 예측 가능성을 가지고 있다. 이는 교통이 혼잡한 도로 환경에서 그리디 기법을 이용하여 다음 홉을 결정할 때 보다 높은 정확성을 제공할 수 있어 경유 노드의 수와 포워딩 실패를 최소화한다. 본 논문은 위기 정보와 운전 시스템 정보를 기반으로 하는 차량 간 통신 라우팅 최적화 기법을 제안하고 기존의 GPSR(Greedy Perimeter Stateless Routing) 기법과 SAR(Spatial Aware Routing) 기법과의 비교를 통해 효율성과 신뢰성의 향상을 증명하였다.