• Journal of the Korean Operations Research and Management Science Society
• /
• v.28 no.4
• /
• pp.21-29
• /
• 2003

The traffic scheduling problem for a satellite cluster with an arbitrary number of satellites is considered. which is one of the most interesting problems in the satellite communication scheduling area. This problem is to find a time slot assignment maximizing the transponder utilization for a satellite cluster This problem is known to be NP-complete, and several heuristic algorithms have been proposed. In this paper, we suggest new efficient algorithms for this problem, which have less time complexity than the best existing one and provide much better solution quality. Extensive simulation results are reported.

• Journal of the Korean Society of Industry Convergence
• /
• v.13 no.1
• /
• pp.5-13
• /
• 2010

Industrialization and urbanization occurred-traffic delay, traffic accident and parking problem etc.-variety of transportation problems. Parking problem is one of the transportation problem then transportation engineers would get involved in trying to solve parking problem. A way to overcome a variety of parking problems needs preliminary data for conditions of parking but it lacks the preliminary data to do so. Thus this study analyzed a characteristic of a parking through a field survey for parking in Daegu Metropolitan City. This study analyzed parking characteristic of parking operation method. This study result reveals difference between a toll parking and a no charge parking characteristic. Thus a close examination for a toll parking characteristic and a no charge parking characteristic is a prerequisite for a rational parking policy.

• Proceedings of the Korean Operations and Management Science Society Conference
• /
• 2002.05a
• /
• pp.426-433
• /
• 2002

This paper deals with an offline routing problem, which can be used as an explicit routing procedure in MPLS(Multiprotocol Label Switching) network, for traffic engineering. This problem is formulated as an MIP(Mixed Integer Programming) with the objective function which is to minimize the sum of the maximum link utilization for load balancing (link utilization) and the routing cost. Constraints arc composed of link capacity restriction and demand requirement that has origin-destination pair, bandwidth requirement and hop restriction. The problem is proved to be NP-hard so that the Lagrangean relaxation method is applied to propose a Lagrangean heuristic. To test the effectiveness & efficiency of the proposed algorithm, computational experiments are performed with numerical instances. The experiment results show that the proposed algorithm solves the problem within a reasonable time.

• Journal of KIISE:Information Networking
• /
• v.31 no.1
• /
• pp.70-80
• /
• 2004

In order to reduce the increasing packet loss rates caused by an exponential increase in network traffic, the IETF(Internet Engineering Task Force) is considering the deployment of active queue management techniques such as RED(Random Early Detection). But, RED configuration has been a problem since its first proposal. This problem is that proposed configuration is only good for the particular traffic conditions studied, but may have detrimental effects if used in other conditions. While active queue management in routers and gateways can potentially reduce packet loss rates in the Internet, this paper has demonstrated the inherent weakness of current techniques and shows that they are unstable for tile various traffic conditions. The inherent problem with these queue management algorithms is that they all use static parameter setting. In this paper, in order to solve this problem, a new active queue management algorithm called SQM(Stabilized Queue Management) is proposed. This paper shows that it is easy to parameterize SQM algorithm to perform well under different congestion scenarios. This algorithm can effectively reduce packet loss while maintaining high link utilizations and is good for the various traffic conditions.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.10 no.9
• /
• pp.4287-4306
• /
• 2016

Network resilience provides an effective way to overcome the problem of network failure and is crucial to Internet protocol (IP) network management. As one of the main challenges in network resilience, recovering from link failure is important to maintain the constancy of packets being transmitted. However, existing failure recovery approaches do not handle the traffic engineering problem (e.g., tuning the routing-protocol parameters to optimize the rerouting traffic flow), which may cause serious congestions. Moreover, as the lack of QoS (quality of service) restrictions may lead to invalid rerouting traffic, the QoS requirements (e.g., bandwidth and delay) should also be taken into account when recovering the failed links. In this paper, we first develop a probabilistically correlated failure model that can accurately reflect the correlation between link failures, with which we can choose reliable backup paths (BPs). Then we construct a mathematical model for the failure recovery problem, which takes maximum rerouting traffic as the optimizing objective and the QoS requirements as the constraints. Moreover, we propose a heuristic algorithm for link failure recovery, which adopts the improved k shortest path algorithm to splice the single BP and supplies more protection resources for the links with higher priority. We also prove the correctness of the proposed algorithm. Moreover, the time and space complexity are also analyzed. Simulation results under NS2 show that the proposed algorithm improves the link failure recovery rate and increases the QoS satisfaction rate significantly.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.34 no.8B
• /
• pp.777-785
• /
• 2009

In recent wireless sensor networks, stationary nodes and mobile nodes co-exist to provide a diverse service. However, because there are multiple mobile nodes located in the wireless sensor network, there is a potential for the instability due to the frequent network reconfiguration and the traffic caused by densely concentration of mobile nodes while mobile nodes are switching locations. In order to solve this problem, we propose the pumping node architecture to solve this traffic congestion problem due to the crowds of mobile nodes. The pumping node can be reduced heavy traffic by pumping through the backbone network caused by the densely concentration of the mobile nodes. As a result, the architecture reduces the traffic in the sensor network with high reliability.

• Journal of Institute of Control, Robotics and Systems
• /
• v.22 no.2
• /
• pp.110-116
• /
• 2016

Autonomous vehicles must obey the traffic laws in order to drive actual roads. Traffic signs erected at the side of roads explain the road traffic information or regulations. Therefore, traffic sign recognition is necessary for the autonomous vehicles. In this paper, color characteristics are first considered to detect traffic sign candidates. Subsequently, we establish HOG (Histogram of Oriented Gradients) features from the detected candidate and recognize the traffic sign through a SVM (Support Vector Machine). However, owing to various circumstances, such as changes in weather and lighting, it is difficult to recognize the traffic signs robustly using only SVM. In order to solve this problem, we propose a tracking algorithm with RANSAC-based motion estimation. Using two-point motion estimation, inlier feature points within the traffic sign are selected and then the optimal motion is calculated with the inliers through a bundle adjustment. This approach greatly enhances the traffic sign recognition performance.

• Journal of the Ergonomics Society of Korea
• /
• v.18 no.1
• /
• pp.133-147
• /
• 1999

Traffic signs without a cognitive consideration in their design may cause information-processing problem that could result in a mental confusion among drivers often lead to a serious traffic accident. Therefore, in this study, several traffic signs currently used in Seoul Metropolitan area have been sampled and analyzed to identify design problems that usually caused by neglecting drivers cognitive ability. To classify the practical design problems, five major information-processing problems have been suggested: indistinguishable information, information conflict, missing information, sign-load mismatch, and information overload. In order to solve these cognitive problems, new traffic signs have been suggested in this study. An experiment was also performed to validate the new traffic sign. Twenty-four healthy subjects participated in the experiment. They were asked to answer the Question after observing the traffic signs continuously displayed on computer screen. The result indicated that subjects improved the accuracy in understanding the signs by 1.4 times when they used the suggested traffic sign compared to the old one. Based upon the results, a cognitive guideline was suggested for correct and speedy reading of traffic signs by improving information processing and reducing of human error. In conclusion, the traffic sign may well be applied to design an intelligent traffic sign system to increase the safety and comfort of drivers, especially in complex load condition.

• The Journal of The Korea Institute of Intelligent Transport Systems
• /
• v.5 no.1 s.9
• /
• pp.1-12
• /
• 2006

In order to estimate a dynamic origin and destination demand between on and off-ramps in the freeways, a traffic flow theory can be used to calculate a link distribution proportion of traffics moving between them. We have developed a dynamic traffic estimation model based on the three-phase traffic theory (Kerner, 2004), which explains the complexity of traffic phenomena based on phase transitions among free-flow, synchronized flow and moving jam phases, and on their complex nonlinear spatiotemporal features. The developed model explains and estimates traffic congestion in terms of speed breakdown, phase transition and queue propagation. We have estimated the link, on and off-ramp volumes at every time interval by using traffic data collected from vehicle detection systems in Korea freeway sections. The analyzed results show that the developed model describes traffic flows adequately.

• Journal of the Korean Society for Aviation and Aeronautics
• /
• v.25 no.3
• /
• pp.101-107
• /
• 2017

Demand for air transportation in Korea keeps increasing, and the number of airport operations also grows as a result. The major two airports in Korea, Incheon International Airport and Gimpo International Airport, share the metropolitan airspace, which is crowd with air traffic. As air traffic increases in the metropolitan airspace, the demand for the airport operations would outnumber the capacities of these airports. However, there is a room to efficiently manage the shortage of the airport capacity due to the different distributions of operations in these airports. This study presents a dynamic slot allocation that allows exchanging slots according to the traffic demand. The dynamic allocation mitigates the airports' capacity problem but the airspace capacity itself should be increased in order to tackle the problem fundamentally.