• Journal of the Institute of Electronics Engineers of Korea SD
• /
• v.42 no.2 s.332
• /
• pp.89-96
• /
• 2005

In this paper, we propose a customer premise platform for processing multimedia data service on the ATM network. The proposed platform has a specific AAL2 processor that includes AAL2 protocol and scheduler algorithm so as to off-load large potion of burden from host processor and make it easy to process multimedia data from the ATM network in real time compared with conventional platform in which AAL/ATM tasks are processed by software. The ATS scheduler that is implemented based on 2-level time slot ring provides a simple and efficient method for scheduling data of VBR-rt, UBR and CBR traffics. TMS320C5402 DSP is used to process voice-related tasks such as voice compression and voice packet manupulation and AAL2 processor is implemented on $0.35\;{\mu}m$ process line. We implemented the customer premise equipment for VoDSL service and tested the proposed platform on a test bed network. The experimental results show that the proposed equipment has the call success rate of $97\%$ at least and provides voice service of toll-qualify.

• Journal of KIISE:Software and Applications
• /
• v.31 no.6
• /
• pp.829-839
• /
• 2004

Methods based on integer programming have been shown to be very effective in solving various crew pairing optimization problems. However, their applicability is limited to problems with linear constraints and objective functions. Also, those methods often require an unacceptable amount of time and/or memory resources given problems of larger scale. Heuristic methods such as neighborhood search, on the other hand, can handle large-scaled problems without too much difficulty and can be applied to problems having any form of objective functions and constraints. However, neighborhood search often gets stuck at local optima when faced with complex search spaces. This paper presents ,i hybrid algorithm of neighborhood search and integer programming, which nicely combines the advantages of both methods. The hybrid algorithm has been successfully tested on a large-scaled crew pairing optimization problem for a real subway line.

• The KIPS Transactions:PartC
• /
• v.9C no.4
• /
• pp.543-550
• /
• 2002

This paper proposes the dynamic slot allocation method for real-time VBR (rt-VBR) services in wireless ATM networks. The proposed method is characterized by a contention-based mechanism of the reservation request, a contention-free polling scheme for transferring the dynamic parameters. The base station scheduler allocates a dynamic parameter minislot to the wireless terminal for transferring the residual lifetime and the number of requesting slots as the dynamic parameters. The scheduling algorithm uses a priority scheme based on the maximum cell transfer delay parameter. Based on the received dynamic parameters, the scheduler allocates the uplink slots to the wireless terminal with the most stringent delay requirement. The simulation results show that the proposed method guarantee the delay constraint of rt-VBR services along with its cell loss rate significantly reduced.

• Proceedings of the Korea Water Resources Association Conference
• /
• 2023.05a
• /
• pp.28-28
• /
• 2023

Most countries worldwide are finding it difficult to make decisions regarding the utilization of water resources and the ecological flow protection of rivers because of serious water shortages and global climate warming. To overcome this difficulty, accurate ecological flow processes and protected ecological objectives are required. Since the introduction of the concept, ecological flow calculations have been developed for more than 60 years. This technical development has always been dominated by countries such as the United States, Australia, and the United Kingdom. The technical applications, however, vary substantially worldwide. Some countries, for instance, did not readjust the method because of a lack of understanding of the ecological effect or because they failed to achieve elaborate scheduling. Mostly, readjustments were not made because the users could not make their choices from among numerous methods for ecological flow. This paper presents three research results based on a systematic review of 240 methods with clear connotation boundaries. First, the ecological flow algorithm was developed along with the scientific and technological progress in the river ecosystem theory, ecohydrological relationship, and characterization and simulation of hydrological and hydrodynamic processes. In addition, the basis of the method has evolved from the hydrological process of the ecosystem, hydraulics-habitat conditions, and social development interference to whole ecosystem simulation. Second, 240 methods were classified into 50 sub-categories to evaluate their advantages and disadvantages according to the ecological flow algorithms of hydrology, hydraulics, habitat, and other comprehensive methods. According to this evaluation, 60% of the methods were not suitable for further application, including the method based on the percentage of natural runoff. Furthermore, the applicability of the remaining methods was presented according to the evaluation based on the aspects of allocation of water resources, water conservancy project scheduling, and river ecological evaluation. Third, In the future, most developing countries should strengthen the guarantee of high-standard ecological flow via a coordination mechanism for the ecological flow guarantee established under a sustainable framework or via an ecological protection pattern at the national level according to the national system. Concurrently, a reliable ecological flow demand process should also be established on the basis of detailed investigation and research on the relationship between river habitats, ecological hydrology, and ecological hydraulics. This will ensure that the real-time evaluation of ecological flow forces the water conservancy project scheduling and accurate allocation of water.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.42 no.4
• /
• pp.932-938
• /
• 2017

This paper presents the structure of an energy management system for distributed energy resources of a grid-connected microgrid. The energy management system of a grid-connected microgrid collects information of the microgrid such as the status of distributed energy resources and the time varying pricing plan through various protocols. The energy management system performs forecasting and optimization based on the collected information. It derives the operation schedule of distributed energy resources to reduce the microgrid electricity bill. In order to achieve optimal operation, the energy management system should include an optimal scheduling algorithm and a protocol that transfers the derived schedule to distributed energy resources. The energy management system operates as a rolling horizon controller in order to reduce the effect of a prediction error. Derived control schedules are transmitted to the distributed energy resources in real time through the international standard communication protocol.

• KIPS Transactions on Computer and Communication Systems
• /
• v.6 no.7
• /
• pp.297-306
• /
• 2017

Citizens want more accurate forecast information using Bus Information System. However, most bus information systems that use an average based short-term prediction algorithm include many errors because they do not consider the effects of the traffic flow, signal period, and halting time. In this paper, we try to improve the precision of forecast information by analyzing the influencing factors of the error, thereby making the convenience of the citizens. We analyzed the influence factors of the error using BIS data. It is shown in the analyzed data that the effects of the time characteristics and geographical conditions are mixed, and that effects on halting time and passes speed is different. Therefore, the halt time is constructed using Generalized Additive Model with explanatory variable such as hour, GPS coordinate and number of routes, and we used Hidden Markov Model to construct a pattern considering the influence of traffic flow on the unit section. As a result of the pattern construction, accurate real-time forecasting and long-term prediction of route travel time were possible. Finally, it is shown that this model is suitable for travel time prediction through statistical test between observed data and predicted data. As a result of this paper, we can provide more precise forecast information to the citizens, and we think that long-term forecasting can play an important role in decision making such as route scheduling.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2002.11a
• /
• pp.826-834
• /
• 2002

Asynchronous third generation mobile communication system is able to service Packet Switching through adding GPRS Network to the second generation system GSM. Therefore, it is necessary to study packet traffic service of GGSN node which is due to perform gateway role that GPRS Network is enable to inter-connect with Internet in order to optimize the capability and performance of GGSN. In this paper, the Internet packet traffic model that it is arrived to GGSN node from the Internet is studied and In order to process the Inter traffic efficiently, performance analysis model in GGSN is proposed to optimize packet processing capability of each processor. In order to guarantee QoS requirement of the real time traffic Speech and Video, several scheduling algorithm is applied to performance model and each mechanism is compared with several performance parameters.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2021.10a
• /
• pp.580-581
• /
• 2021

There are various Location-Based Services(LBS) that apply GPS technology in mobile devices such as smart-phone and tablet. In this paper, we designed non-face-to-face oriented LBS software in the reality that non-face-to-face services are increasing due to COVID-19. The proposed model searches location information for trading goods or services and utilizes information identified in real time. The proposed scheduling and priority control algorithm provides efficient service allocations and simulation was performed based on web/app to verify this. While commercialized LBS platforms focus on used goods transactions, the designed method is different in that it provides non-face-to-face services and not-direct transactions between individuals. It provides a wide range of transactions and services to users such as small business owners and franchises.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.12 no.1
• /
• pp.141-150
• /
• 2012

This paper suggests a critical path search algorithm that can easily draw PERT/GANTT chart which manages and plans a project schedule. In order to evaluate a critical path that determines the project schedule, Critical Path Method (CPM) is generally utilized. However, CPM undergoes 5 stages to calculate the critical path for a network diagram that is previously designed according to correlative relationship and execution period of project execution activities. And it may not correctly evaluate $T_E$ (The Earliest Time), since it does not suggest the way how to determine the sequence of the nodes activities that calculate the $T_E$. Also, the sequence of the network diagram activities obtained from CPM cannot be visually represented, and hence Lucko suggested an algorithm which undergoes 9 stages. On the other hand, the suggested algorithm, first of all, decides the sequence in advance, by reallocating the nodes into levels after Breadth-First Search of the network diagram that is previously designed. Next, it randomly chooses nodes of each level and immediately determines the critical path only after calculation of $T_E$. Finally, it enables the representation of the execution sequence of the project activity to be seen precisely visual by means of a small movement of $T_E$ of the nodes that are not belonging to the critical path, on basis of the $T_E$ of the nodes which belong to the critical path. The suggested algorithm has been proved its applicability to 10 real project data. It is able to get the critical path from all the projects, and precisely and visually represented the execution sequence of the activities. Also, this has advantages of, firstly, reducing 5 stages of CPM into 1, simplifying Lucko's 9 stages into 2 stages that are used to clearly express the execution sequence of the activities, and directly converting the representation into PERT/GANTT chart.

• The Transactions of the Korea Information Processing Society
• /
• v.7 no.8
• /
• pp.2484-2496
• /
• 2000

High speed switches have been developing to interconnect a large number of nodes. It is important to analyze the switch performance under various conditions to satisfy the requirements. Queueing analysis, in general, has the intrinsic problem of large state space dimension and complex computation. In fact, The petri net is a graphical and mathematical model. It is suitable for various applications, in particular, manufacturing systems. It can deal with parallelism, concurrence, deadlock avoidance, and asynchronism. Currently it has been applied to the performance of computer networks and protocol verifications. This paper presents a framework for modeling and analyzing ATM switch using stochastic activity networks (SANs). In this paper, we provide the ATM switch model using SANs to extend easily and an approximate analysis method to apply A TM switch models, which significantly reduce the complexity of the model solution. Cell arrival process in output-buffered Queueing A TM switch with finite buffer is modeled as Markov Modulated Poisson Process (MMPP), which is able to accurately represent real traffic and capture the characteristics of bursty traffic. We analyze the performance of the switch in terms of cell-loss ratio (CLR), mean Queue length and mean delay time. We show that the SAN model is very useful in A TM switch model in that the gates have the capability of implementing of scheduling algorithm.