• Journal of Korea Multimedia Society
• /
• v.14 no.5
• /
• pp.658-668
• /
• 2011

Over the past decade, the improvement of communications technologies and the rapid spread of www (World Wide Web) have brought on the exponential growth of users using Internet and real time multimedia multicast services like video conferencing, tele-immersive virtual reality, and Internet games. The dense-wavelength division multiplexing (DWDM) networks have been widely accepted as a promising approach to meet the ever-increasing bandwidth demands of Internet users, especially in next generation Internet backbone networks for nation-wide or global coverage. A major challenge in the next generation Internet backbone networks based on DWDM technologies is the resolution of the multicasting RWA (Routing and Wavelength Assignment) problem; given a set of wavelengths in the DWDM network, we set up light-paths by routing and assigning a wavelength for each connection so that the multicast connections are set-upped as many as possible. Finding such optimal multicast connections has been proven to be Non-deterministic Polynomial-time-complete. In this paper, we suggest a new heuristic multicast routing and wavelength assignment method for multicast sessions called DVS-PMIPMR (Differentiated Virtual Source-based Priority Minimum Interference Path Multicast Routing algorithm). We measured the performance of the proposed algorithm in terms of number of wavelength and wavelength channel. The simulation results demonstrate that DVS-PMIPMR algorithm is superior to previous multicast routing algorithms.

• International Journal of Advanced Culture Technology
• /
• v.5 no.1
• /
• pp.58-63
• /
• 2017

Emergencies and disasters can happen any time without any warning, and things can change and escalate very quickly, and often it is swift and decisive actions that make all the difference. It is a responsibility of the building facility management to ensure that a proven evacuation plan in place to cover various worst scenario to handled automatically inside the facility. To mapping out optimal safe escape routes is a straightforward undertaking, but does not necessarily guarantee residents the highest level of protection. The emergency evacuation navigation approach is a state-of-the-art that designed to evacuate human livings during an emergencies based on real-time decisions using live sensory data with pre-defined optimum path finding algorithm. The poor decision on causalities and guidance may apparently end the evacuation process and cannot then be remedied. This paper propose a cloud connected emergency evacuation system model to react dynamically to changes in the environment in emergency for safest emergency evacuation using IoT based emergency exit sign system. In the previous researches shows that the performance of optimal routing algorithms for evacuation purposes are more sensitive to the initial distribution of evacuees, the occupancy levels, and the type and level of emergency situations. The heuristic-based evacuees routing algorithms have a problem with the choice of certain parameters which causes evacuation process in real-time. Therefore, this paper proposes an evacuee routing algorithm that optimizes evacuation by making using high computational power of cloud servers. The proposed algorithm is evaluated via a cloud-based simulator with different "simulated casualties" are then re-routed using a Dijkstra's algorithm to obtain new safe emergency evacuation paths against guiding evacuees with a predetermined routing algorithm for them to emergency exits. The performance of proposed approach can be iterated as long as corrective action is still possible and give safe evacuation paths and dynamically configure the emergency exit signs to react for real-time instantaneous safe evacuation guidance.

• Journal of the Korea Society for Simulation
• /
• v.15 no.2
• /
• pp.31-39
• /
• 2006

The visibility graph is a well-known method for efficient path-finding with the minimum search space modelling the game world. The generalized visibility graph is constructed on the expanded obstacle boundaries to eliminate the "wall-hugging" problem which is a major disadvantage of using the visibility graph. The paths generated by the generalized visibility graph are guaranteed to be near optimal and natural-looking. In this paper we propose the method to apply the generalized visibility graph efficiently for game characters who moves among static obstacles between varying start and goal points. Even though the space is minimal once the generalized visibility graph is constructed, the construction itself is time-consuming in checking the intersection between every two links connecting nodes. The idea is that we build the map for static obstacles first and then incorporate start and goal nodes quickly. The incorporation of start and goal nodes is the part that must be executed repeatedly. Therefore we propose to use the rotational plane-sweep algorithm in the computational geometry for incorporating start and goal nodes efficiently. The simulation result shows that the execution time has been improved by 39%-68% according to running times in the game environment with multiple static obstacles.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.12 no.10
• /
• pp.1845-1852
• /
• 2008

The key elements of inter prediction are motion estimation(ME) and motion compensation(MC). Motion estimation is to find the optimum motion vectors, not only by using a distance criteria like the SAD, but also by taking into account the resulting number of 비트s in the 비트 stream. Motion compensation is compensate for movement of blocks of current frame. Inter-prediction Encoding is always the main bottleneck in high-quality streaming applications. Therefore, in real-time streaming applications, dedicated hardware for executing Inter-prediction is required. In this paper, we studied a motion estimator(ME) for H.264/AVC. The designed motion estimator is based on 2-D systolic array and it connects processing elements for fast SAD(Sum of Absolute Difference) calculation in parallel. By providing different path for the upper and lower lesion of each reference data and adjusting the input sequence, consecutive calculation for motion estimation is executed without pipeline stall. With data reuse technique, it reduces memory access, and there is no extra delay for finding optimal partitions and motion vectors. The motion estimator supports variable-block size and takes 328 cycles for macro-block calculation. The proposed architecture is local memory-free different from paper [6] using local memory. This motion estimation encoder can be applicable to real-time video processing.

• Journal of the Korean Association of Geographic Information Studies
• /
• v.26 no.3
• /
• pp.85-96
• /
• 2023

This study developed and evaluated a safe route guidance service for electric personal assistive mobility device used mainly by the mobility impaired people to improve their mobility. Thirteen underlying factors affecting the mobility of electric personal assistive mobility device have been derived through a survey with the mobility impaired people and employees in related organizations in Busan Metropolitan City. After assigning safety scores to individual factors and identifying the relevant factors along routes of interest with an object detection AI model, the safe route for electric personal assistive mobility device was provided through an optimal path-finding algorithm. As a result of comparing the general route of T-map and the recommended route of this study for the identical routes, the latter had relatively fewer obstacles and the gentler slope than the former, implicating that the recommended route is safer than the general one. As future works, it is necessary to enhance the function of a route guidance service based on the real-time location of users and to conduct spot investigations to evaluate and verify its social acceptability.