• Proceedings of the KOR-KST Conference
• /
• 1998.10b
• /
• pp.297-297
• /
• 1998

고속도로의 교통혼잡을 관리하기 위해서는 근본적으로 혼잡지점 상류부의 진입교통량을 제어해야 한다. 이를 위한 효과적인 램프미터링 운영전략이나 고속도로 교통정보제공방안을 수립하기 위해서는 혼잡영향권(대기행렬길이)에 관한 신뢰성 있는 데이터가 반드시 필요하다. 고속도로의 대기행렬길이를 산정하기 위해 일반적으로 충격파이론과 Queueing이론을 제시하고 있다. 그러나, 기존의 충격파 이론을 포물선형의 교통량-밀도관계식을 근거로 하고 있어 충격파간에 발생하는 부수적인 충격파를 해석하는 과정이 수학적으로 불가능하여 실질적인 목적으로 사용할 수 없음은 이미 잘 알고 있는 사실이다. 최근에 이러한 한계를 극복할 수 있는 새로운 방법으로 교통량 밀도간의 관계식을 삼각형으로 가정하고 교통량 대신에 누적교통량을 사용하는 Simplified Theory of Kinematic Waves In Highway Traffic이 개발(Newell, 1993)되었지만, 이 방법을 적용하기 위해서는 기본적으로 대상 고속도로 구간의 교통량-밀도관계식을 규명해야 하는 어려움이 있다.(사실 실시간으로 밀도데이터를 수집하기란 불가능하다.) Queueing이론에서 제시하는 대기행렬은 모두 대기차량이 병목지점에 수직으로 정렬하여 도로를 점유하지 않는 Point Queue(혹은 Vertical stack Queue)로서 실제로 도로상에 정렬된 대기행렬(Real Physical Queue)과는 전혀 다르다. 이미 입증된 바 있어, Queueing이론을 이용함은 타당성이 없다. 이러한 사실에 근거하여 본 연구는 고속도로 대기행렬길이를 산정할 수 있는 모형개발을 위한 기초연구로서 혼잡상태의 연속류 특성을 분석하는데 목적이 있다. 이를 위해, 본 연구에서는 서울시 도시고속도로에서 수집한 실제 데이터를 이용하여 진입램프지점의 혼잡상태에서 대기행렬의 증가 또는 감소하는 과정을 분석하였다. 주요 분석결과는 다음과 같다. 1. 혼잡초기의 대기행렬은 다른 혼잡시기에 비해 상대적으로 급속한 속도로 증가함. 2. 혼잡초기의 대기행렬의 밀도는 다른 혼잡시기에 비해 비교적 낮음. 3. 위의 두 결과는 서로 관계가 있으며, 혼잡시 운전자의 행태(차두간격)과 혼잡기간중에도 변화함을 의미함. 4. 교통변수 중에서 대기행렬길이를 산정하는데 적합한 교통변수를 교통량과 밀도로 판단됨. 5. Queueing이론에서 제시하는 대리행렬길이 산정방법인 대기차량대수$\times$평균차두간격은 대기행렬내 밀도가 일정하지 않아 부적합함을 재확인함. 6. 혼잡초기를 제외한 혼잡기간 중 대기행렬길이는 밀도데이터 없이도 혼잡 상류부의 도착교통량과 병목지점 본선통과교통량만을 이용하여 추정이 가능함. 7. 이상에 연구한 결과를 토대로, 고속도로 대기행렬길이를 산정할 수 있는 기초적인 도형을 제시함.

• Journal of KIISE:Information Networking
• /
• v.41 no.4
• /
• pp.177-185
• /
• 2014

It has been occurred many times that wireless sensor networks (WSNs) had congested areas because all the sensing data collected by multiple sensor nodes are delivered to one sink node. Typically, in order to control congested areas, it used to reduce the traffic by increasing the sensing period or discarding packets. However, those schemes have a disadvantage that it loses the reliability when delivering sensing data. Moreover, there are no schemes considering case of having poor quality of links between nodes in practical terms. In this paper, we suggest a scheme not to reduce the traffic but to distribute the traffic by changing routing paths depends on the traffic and the quality of links. Also, it can be seen that the reliability of delivering of the sensing data is improved with the experiments improving collection rates and shortening end-to-end delay.

• Journal of Korean Society of Transportation
• /
• v.25 no.1 s.94
• /
• pp.7-21
• /
• 2007

The purpose of this study is to examine the transportation, equity and efficiency impacts of cordon pricing schemes in the Seoul Capital Region of Korea. Autos would be required to pay a toll of 2.000 Won each time they enter cordons around the CBD or the subcenters during morning peak periods. The imposition of the toll would produce a substantial decrease in traffic volumes within the cordons as well as throughout the Capital Region. The lower the income level of commuters is, the more the share of auto decreases and that of transit increases. For equity impacts, the welfare of commuters would increase or decrease according to the cordon pricing schemes but would produce progressive impacts irrespective of the schemes. However, the commuters who have the highest value of time would experience welfare gains and it would result in regressive impacts. The schemes would result in a substantial net social welfare gain for the efficiency impacts. When the toll is charged at the CBD cordon only, the net social welfare would increase more.

• Journal of Digital Contents Society
• /
• v.16 no.3
• /
• pp.381-388
• /
• 2015

TCP, which performs congestion control in congestion condition, is able to help a reliable transmission. However, packet loss can be increased because congestion window is increased by the time the packet is dropped in the process of congestion avoidance. In this paper, to solve the above problem, we propose a new congestion estimation based TCP congestion control scheme using the weighted average value of the RTT. After measuring a SRTT, which means the weighted average value of RTTs, at this point of time when a buffer overflow is occurred by an overloaded packet, the proposed scheme estimates the time, when the same SRTT is made in packet transmission, as a congestion time and then decreases the congestion window. The simulation results show that the proposed schem has a good performance in terms of packet loss rate and throughput when the packet loss due to buffer overflow is larger than that due to wireless channel.

• Proceedings of the Korean Information Science Society Conference
• /
• 2000.10c
• /
• pp.558-560
• /
• 2000

일 대 다수의 정보를 전송하는데 있어서 멀티캐스트는 네트웍의 자원을 절약할 수 있고 송신자의 부하를 감소시킬 수 있는 등 여러 가지 장점을 제공한다. 그러나, 그것을 효율적으로 실현시키기 위한 확장성 문제와 더불어 혼잡 제어를 통한 기존 인터넷 트래픽과의 공존성 문제를 주의 깊게 다루어야 한다. 본 논문에서는 지정된 서버(Designated Server)를 이용하여 혼잡 제어 방식에 있어서 기존 인터넷 트래픽과 자원을 공평하게 나누어 사용하며, 멀티캐스트 특성상 나타날 수 있는 수신자들의 불공정성 문제를 해결함으로써 보다 효율적인 정보전송이 이루어지도록 하였다.

• Proceedings of the Korean Institute of Navigation and Port Research Conference
• /
• 2023.05a
• /
• pp.61-62
• /
• 2023

There have been cases where the number of port workers has temporarily decreased due to COVID-19. To prevent the spread of COVID-19, a number of workers were quarantined, resulting in bottlenecks and waiting throughout the port operation process, increasing the congestion of terminals. As a result, problems such as a decrease in terminal operation efficiency occurred. However, it is understood that congestion centered on unloading equipment inside the terminal is not clearly calculated. Terminal congestion is thought to be a key factor directly related to the operational efficiency of the terminal. The congestion calculation method generally used in various fields measures congestion based on image-based data. Due to the nature of the loading and unloading equipment that moves according to the quantitative loading plan, it is unreasonable to apply the existing congestion calculation method. Therefore, this study presented a method of calculating terminal congestion using equipment waiting time and turnaround time, and verified the statistical significance of the congestion calculated using data from Terminal A of Busan Port.

• The Journal of the Korea Contents Association
• /
• v.16 no.9
• /
• pp.12-21
• /
• 2016

The emergency evacuation support system supports evacuation assistance when an urgent disaster occurs. We have implemented evacuation route search algorithm to assist people's escape when a disaster occurs such as fires or terrorism in the building. The algorithm will guide the escape route at the fastest emergency exit of each region at the emergency state. The algorithm calculates the escape route by applying the weighting factor of age groups and population density around the emergency exit and of other regions. So the system helps escape to bypass the crowded emergency exit and the disaster area, and reduces the congestion of emergency exit and overloading of evacuation route.

• Journal of KIISE:Information Networking
• /
• v.34 no.6
• /
• pp.466-474
• /
• 2007

Asymmetric networks that the downlink bandwidth is larger than the uplink bandwidth may cause the degradation of the TCP performance due to the uplink congestion. In order to solve this problem, this paper designs and implements the Dynamic Segment Size Control mechanism which offers a suitable segment size for current networks. The proposed mechanism does not require any changes in customer premises but suppress the number of ACKs using segment reassembly technique to avoid the uplink congestion. The gateway which adapted the Dynamic Segment Size Control mechanism, detects the uplink congestion condition and dynamically measures the bandwidth asymmetric ratio and the packet loss ratio. The gateway reassembles some of segments received from the server into a large segment and transmits it to the client. This reduces the number of corresponding ACKs. In this mechanism, the SACK option is used when occurs the bit error during the transmission. Based on the simulation in the GEO satellite network environment, we analyzed the performance of the Dynamic Segment Size Control mechanism.

• Journal of Advanced Navigation Technology
• /
• v.16 no.4
• /
• pp.641-648
• /
• 2012

The up-streams of the continuous streaming of data packets with lower importance level in the wireless sink node can cause congestion and delay, they affect on energy efficiency, memory size, buffer size, and throughput. This paper proposes a new wireless sink congestion control mechanism based on tournament scheduling. The proposed method consists of two module parts: stream decision module part and service differentiation module part. The final winner in the tournament controls congestion effectively, minimizes packet loss due to congestion, decreases energy consumption, and improves QoS. The simulation result shows that the proposed method is more effective and has better performance compared with those of congestion descriptor-based control method, reliability-based control method, and best-effort transmission control method.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.35 no.1B
• /
• pp.154-161
• /
• 2010

In wireless sensor networks, due to the many-to-one convergence of upstream traffic, congestion more probably appears. The existing congestion control protocols avoid congestion by controlling incoming traffic, but the duty-cycle operation of MAC(Medium Access Control) layer has not considered. In this paper, we propose DCA(Duty-cycle Based Congestion Avoidance), an energy efficient congestion control scheme using duty-cycle adjustment for wireless sensor networks. The DCA scheme uses both a resource control approach by increasing the packet reception rate of the receiving node and a traffic control approach by decreasing the packet transmission rate of the sending node for the congestion avoidance. Our results show that the DCA operates energy efficiently and achieves reliability by its congestion control scheme in duty-cycled wireless sensor networks.