• Nuclear Engineering and Technology
• /
• v.54 no.9
• /
• pp.3347-3352
• /
• 2022

In 2013, the International Atomic Energy Agency (IAEA) changed the recommended maximum range of the Emergency Planning Zone (EPZ) to 30 km, and the Kori Nuclear Power Plant in Republic of Korea has also expanded the EPZ to 30 km, following the recommendation. As a result, metropolitan cities with a high population density are contained within the EPZ, and evacuating millions of people should be considered if the 30 km range of evacuation is to take place. This study proposes an evacuation plan using buses (public transportation) to transport people outside of the EPZ, quickly and efficiently. To verify the appropriate mode share ratio of buses that can guarantee the right of vulnerable road users and reduce traffic congestion, a model was built simulating the Kori Nuclear Power Plant in Ulsan Metropolitan City. The scenarios were established by changing the mode share ratio of buses and passenger cars by 10%. Considering a large-scale network analysis at the city level, a cell transmission model was applied to calculate the evacuation time in each scenario. The result shows that the optimal mode share ratio of buses is 40%, with a total evacuation time of 132 min, considering feasible bus fleets in Ulsan Metropolitan City.

• Journal of the Korean Society for Aviation and Aeronautics
• /
• v.30 no.4
• /
• pp.1-8
• /
• 2022

In this study, we propose trajectory-based arrival management using CDO (Continuos Descent Operations). The operational procedures with TBO (Trajectory-Based Operations) concept were established to allow aircraft and ground system to share the trajectories with each other in real time. The proposed operational concept was validated in the air traffic control simulation environment, which consists of controller working position, pseudo pilot system, air traffic generation system, and controllers' decision support system for arrival management using CDO. Simulation results compared with actual flight data indicate that proposed concept could improve the efficiency of traffic flow management in terms of total descending time and fuel consumption. And it was confirmed that if there is a system that can share and utilize the synchronized trajectory, it can be helpful to control arrival aircraft and apply CDO concept.

• The Journal of the Korea Contents Association
• /
• v.22 no.2
• /
• pp.1-9
• /
• 2022

To provide real-time traffic conditions, crowd sourcing based traffic information services in which users directly report and share traffic conditions are being developed. However, the existing traffic information service provides limited traffic conditions because it only shares information reported by specific service participants. In this paper, we design and develop a crowd sourcing based traffic information service that provides real-time traffic conditions by collecting direct reports from users and public traffic conditions. The proposed service allows users to directly report traffic conditions by voice and text, and collects and integrates traffic conditions published by external organizations. The collected traffic conditions are provided in real time through a push service, and new traffic conditions are transmitted when the user's location changes. The proposed service can report traffic conditions and share real-time traffic conditions through an Android app.

• The Transactions of the Korea Information Processing Society
• /
• v.6 no.11S
• /
• pp.3269-3277
• /
• 1999

To promote the inclusion of end-to-end congestion control in the design of future protocols using best-effort traffic, we propose a router mechanism, Extended FRED(ex-FRED). In this paper, we catagorize the TCP controlled traffics into robust and fragile traffic and discuss several unfairness conditions between them caused by the diverse applications. For example, fragile traffic from bursty application cannot use its fair share due to their slow adaptation. Ex-FRED modifies the FRED(Fair Random Early Drop), which can show wrong information due to the narrow view of actual buffer. Therefore, Ex-FRED uses per-flow accounting in larger virtual buffer to impose an each flow a loss rate that depends on the virtual buffer use of a flow. The simulation results show that Ex-FRED uses fair share and has good throughput.

• Proceedings of the KOR-KST Conference
• /
• 2003.02a
• /
• pp.127-150
• /
• 2003

This research presents a novel application of static traffic assignment methods, but with a variable time value, for estimating the market share of a high-speed rail (HSR) in the NW-SE corridor of Korea which is currently served by the airline (AR), conventional rail (CR), and highway (HWY) modes. The proposed model employs the time-space network structure to capture the interrelations among all competing transportation modes, and to reflect their supply- and demand-sides constraints as well as interactions through properly formulated link-node structures. The embedded cost function for each network link offers the flexibility for incorporating all associated factors, such as travel time and fare, in the model computation, and enables the use of a distribution rather than a constant to represent the time-value variation among all transportation mode users. To realistically capture the tripmakers' value-of-time (VOT) along the target area, a novel method for VOT calibration has been developed with aggregate demand information and key system performance data from the target area. Under the assumption that intercity tripmakers often have nearly "perfect" travel information, one can solve the market share of each mode after operations of HSR for each O-D pair under the time-dependent demand with state-of-the-art traffic assignment. Aside from estimating new market share, this paper also investigated the impacts of HSR on other existing transportation modes.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.10 no.8
• /
• pp.3753-3771
• /
• 2016

Increasingly, numerous and various Internet-capable devices are connected in end user networks, such as a home network. Most devices use the combination of TCP and 802.11 DCF as a system platform, but whereas some devices such as a streaming video persistently generate traffic, others such as a motion sensor do so only intermittently with lots of pauses. This study addresses the issue of performance in this heterogeneous traffic wireless LAN environment from the perspective of fairness. First, instantaneous fairness is introduced as a notion to indicate how immediately and how closely a user obtains its fair share, and a new time-based metric is defined as an index. Second, extensive simulation experiments have been made with TCP Reno, Vegas, and Westwood to determine how each TCP congestion control corresponds to the instantaneous fairness. Overall, TCP Vegas yields the best instantaneous fairness because it keeps the queue length shorter than the other TCPs. In the simulations, about 60% of a fair share of the effective user bandwidth is immediately usable in any circumstance. Finally, we introduce two simple strategies for adjusting TCP congestion controls to enhance instantaneous fairness and validate them through simulation experiments.

• Journal of Internet Computing and Services
• /
• v.5 no.6
• /
• pp.11-20
• /
• 2004

Proportional Fair (PF) share policy has been adopted as a downlink scheduling scheme in CDMA2000 l×EV-DO standard. Although It offers optimal performance in aggregate throughput conditioned on equal time share among users, it cannot provide a bandwidth guarantee and a strict delay bound. which is essential requirements of real-time (RT) applications. In this study, we propose a new scheduling policy that provides quality-of-service (QoS) guarantees to a variety of traffic types demanding diverse service requirements. In our policy data traffic is categorized Into three classes, depending on sensitivity of Its performance to delay or throughput. And the primary components of our policy, namely, Proportional Fair (PF), Weighted Fair Queuing (WFQ), and delay-based prioritized scheme are intelligently combined to satisfy QoS requirements of each traffic type. In our policy all the traffic categories run on the PF policy as a basis. However the level of emphasis on each of those ingredient policies is changed in an adaptive manner by taking into account the channel conditions and QoS requirements. Such flexibility of our proposed policy leads to offering QoS guarantees effectively and. at the same time, maximizing the throughput. Simulations are used to verify the performance of the proposed scheduling policy. Experimental results show that our proposal can provide guaranteed throughput and maximum delay bound more efficiently compared to other policies.

• Journal of KIISE:Information Networking
• /
• v.32 no.2
• /
• pp.134-146
• /
• 2005

Research about QoS in the ad-hoc networks for stable service of various applications has been needed as the expectation about the realization of the ad-hoc networks grows bigger. Existing researches about QoS in the ad-hoc network had the problems which can not guarantee the quantitative services or create the overhead. In this paper, we propose a novel algorithm of QFAN(QoS Framework for Ad-hoc Networks) the framework to resolve such problems and considered application of the proposed algorithm into the ad-hoc networks. Our model can guarantee the minimum bandwidth of the real-time traffic as minimized the overhead. And, disproportionate distribution of bandwidth problem can resolve by the proposed algorithm through the fair share between real-time traffic and best-effort traffic about available bandwidth. We design both the TiRe(Tiny Reservation) and the ADR(Adaptive Drop Rate) control algorithm to apply the proposed QFAN. Using simulation, we confirm fair share of available bandwidth between real-time traffic and best-effort traffic as guarantee minimum required bandwidth of real-time traffic.

• Journal of the Korean Society of Marine Environment & Safety
• /
• v.28 no.4
• /
• pp.515-524
• /
• 2022

To effectively collect, manage, and share the maritime traffic information, it is necessary to identify the technology trends concerning this particular information and analyze its current status and problems. Therefore, this study observes the domestic and foreign technology trends involving maritime traffic information while analyzing and summarizing the current status and problems in collecting, managing, and sharing it. According to the data analysis, the problems in the collecting stage are difficulties in collecting visual information from long-distance radars, CCTVs, and cameras in areas outside the LTE network coverage. Notably, this explains the challenges in detecting smuggling ships entering the territorial waters through the exclusive economic zone (EEZ) in the early stage. The problems in the management stage include difficult reductions and expansions of maritime traffic information caused by the lack of flexibility in storage spaces mostly constructed by the maritime transportation system. Additionally, it is challenging to deal with system failure with system redundancy and backup as a countermeasure. Furthermore, the problems in the sharing stage show that it is difficult to share information with external operating organizations since the internal network is mainly used to share maritime transportation information. If at all through the government cloud via platforms such as LRIT and SASS, it often fails to effectively provide various S/W applications that help use maritime big data. Therefore, it is suggested that collecting equipment such as unmanned aerial vehicles and satellites should be constructed to expand collecting areas in the collecting stage. In the management and sharing stages, the introduction and construction of private clouds are suggested, considering the operational administration and information disclosure of each maritime transportation system. Through these efforts, an enhancement of the expertise and security of clouds is expected.

• Journal of Information Processing Systems
• /
• v.13 no.4
• /
• pp.951-969
• /
• 2017

In this paper, we newly propose a traffic information service model that collects traffic information sensed by an individual vehicle in real time by using a smart device, and which enables drivers to share traffic information on all roads in real time using an application installed on a smart device. In particular, when the driver requests traffic information for a specific area, the proposed driver-personalized service model provides him/her with traffic information on the driving directions in advance by predicting the driving directions of the vehicle based on the learning of the driving records of each driver. To do this, we propose a traffic information management model to process and manage in real time a large amount of online-generated traffic information and traffic information requests generated by each vehicle. We also propose a road node-based indexing technique to efficiently store and manage location-based traffic information provided by each vehicle. Finally, we propose a driving learning and prediction model based on the hidden Markov model to predict the driving directions of each driver based on the driver's driving records. We analyze the traffic information processing performance of the proposed model and the accuracy of the driving prediction model using traffic information collected from actual driving vehicles for the entire area of Seoul, as well as driving records and experimental data.