• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.25 no.8A
• /
• pp.1160-1168
• /
• 2000

This paper presents a real-time integrated traffic management (RITM) scheme that can effectively manage variable bit rate (VBR) and available bit rate (ABR) traffics having unpredictable characteristics in asynchronous transfer mode (ATM) networks. An unique feature of this scheme is that it has a special ATM cell control block which makes it possible to monitor bursty traffics in real-time so that the delay incurred to measure cell arrival rate is minimized. Additionally, the proposed scheme intends to dynamically reassign the leftover network resources to VBR/ABR connections without any deterioration in quality of service (QoS) of the existing connections. The RITM scheme has been verified to reliably monitor incoming traffics and to efficiently manage network resources by computer simulations. The capability of managing the incoming ATM traffics in real-time helps determine an optimal acceptable number of user connections for a given network condition. We can use this value as a threshold to protect the network from being congested and to find out a cost-effective buffer design method.

• Journal of KIISE:Information Networking
• /
• v.28 no.2
• /
• pp.229-235
• /
• 2001

With the explosive popularity of the World Wide Web, the low penonnance of network often leads web clients to wait a long time for web server's response. To resolve this problem, web caching (proxy) has been considered as the most efficient technique for web server to handle this problem. The placement of web proxy is critical to the overall penonnance, and Li et al. showed the optimal placement of proxies for a web server in the internet with the linear and tree topology when the number of proxies, ]M, is given [4, 5]. They focused on minimizing the over all access time. However, it is also considerable for target web server to minimize the total number of proxies while each proxy server guarantees not to exceed certain res(Xlnse time for each request from its clients. In this paper, we consider the problem of finding the optimal number and placement of web proxies with the lin~ar and tree topology under the given threshold cost for delay time.

• Journal of the Korean Institute of Illuminating and Electrical Installation Engineers
• /
• v.21 no.1
• /
• pp.28-34
• /
• 2007

In this research, the characteristics of the DC discharge that was the logical gate input of discharge logic gate PDP newly proposed was considered. The logical output is induced by controlling the potential difference of inter-electrode according to the discharge path in the discharge logic gate. From the experimental result the discharge time lag was shortened to 1/3 and the voltage has decreased to 1/2 in the case to apply priming discharge for improving stability of these DC discharges compared with the case when it is not applied. Moreover, after the priming discharge ends, the space charge generated by this discharge influences it up to about $30[{\mu}s]$. And, as a measured result of the influence that the space charge exerts on the DC discharge with the change in time and spatial distance, it has been understood that there is a possibility that going away spatially can slip out the influence of the discharge easily as for going away from the discharge time-wise. Therefore the conclusion that the discharge logic gates of each scanning electrode can be operated independently is obtained.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.28 no.7A
• /
• pp.493-502
• /
• 2003

In this paper, to solve some problems of the Mobile IP and local registration strategy we propose a method that can effectively support real-time traffics sensitive to delay time and packet loss. The proposed method reduces the registration time after a Mobile Node's movement between networks by carrying out the pre-registration for the domain which it will move into the network information of the link layer of cdma2000 system, at the boundary cell's handoff zone. Through the cost analysis and simulation it is shown that the proposed scheme yield a better performance compared with the Mobile IP and local registration strategies in terms of packet loss for parameters; variation of the velocity of a Mobile Node, and a distance between the Mobile Node and home networks, etc.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.26 no.1
• /
• pp.94-103
• /
• 2022

As a large amount of data generated by sensors or devices at the manufacturing site is transmitted to the server or client, problems arise in network processing time delay and storage resource cost increase. To solve this problem, considering the manufacturing site, where real-time responsiveness and non-disruptive processes are essential, QRC (Quotient Remainder Compression) and BL_beta compression algorithms that enable real-time and lossless compression were applied to actual manufacturing site sensor data for the first time. As a result of the experiment, BL_beta had a higher compression rate than QRC. As a result of experimenting with the same data by slightly adjusting the data size of QRC, the compression rate of the QRC algorithm with the adjusted data size was 35.48% and 20.3% higher than the existing QRC and BL_beta compression algorithms.

• The Journal of Society for e-Business Studies
• /
• v.25 no.2
• /
• pp.15-27
• /
• 2020

This study starts with the idea that the process of creating a Gantt Chart for schedule planning is similar to Tetris game with only a straight line. In Tetris games, the X axis is M machines and the Y axis is time. It is assumed that all types of orders can be worked without separation in all machines, but if the types of orders are different, setup cost will be incurred without delay. In this study, the game described above was named Gantris and the game environment was implemented. The AI-scheduling table through in-depth reinforcement learning compares the real-time scheduling table with the human-made game schedule. In the comparative study, the learning environment was studied in single order list learning environment and random order list learning environment. The two systems to be compared in this study are four machines (Machine)-two types of system (4M2T) and ten machines-six types of system (10M6T). As a performance indicator of the generated schedule, a weighted sum of setup cost, makespan and idle time in processing 100 orders were scheduled. As a result of the comparative study, in 4M2T system, regardless of the learning environment, the learned system generated schedule plan with better performance index than the experimenter. In the case of 10M6T system, the AI system generated a schedule of better performance indicators than the experimenter in a single learning environment, but showed a bad performance index than the experimenter in random learning environment. However, in comparing the number of job changes, the learning system showed better results than those of the 4M2T and 10M6T, showing excellent scheduling performance.

• The Transactions of the Korea Information Processing Society
• /
• v.5 no.4
• /
• pp.1033-1043
• /
• 1998

In this paper, we present an improved multicasting path assignment algorithm based on the minimum cost spanning tree. In the method presented in this paper, a multicasting path is assigned preferentially when a node to be received is found among the next degree nodes of the searching node in the multicasting path assignment of the constrained steiner tree (CST). If nodes of the legacy group exist between nodes of the new group, a new path among the nodes of new group is assigned as long as the nodes may be excluded from the new multicasting path assignment taking into consideration characteristics of nodes in the legacy group. In assigning the multicasting path additionally, where the source and destination nodes which can be set for the new multicasting path exist in the domain of identical network (local area network) and conditions for degree constraint are satisfied, a method of producing and assigning a new multicasting path is used. The results of comparison of CST with MCSTOP, MCSTOp algorithm enhanced performance capabilities about the communication cost, the propagation delay, and the computation time for the multicasting assignment paths more than CST algorithm. Further to this, research activities need study for the application of the international standard protocol(multicasting path assignment technology in the multipoint communication service (MCS) of the ITU-T T.120).

• Journal of Wetlands Research
• /
• v.19 no.3
• /
• pp.359-365
• /
• 2017

Impermeable surfaces such as transportation land uses including roads and parking lots accumulate high heavy metals and particulate matters concentration especially during dry season which worsens the river water quality and distort the water circulation system during rainfall events. Recently, the government has been promoting policies to install Low Impact Development (LID) facilities such as permeable pavements or grass blocks in parking lots or pavements. However, transition of asphalt-paved surfaces to permeable pavement generated asphalt wastes which are detrimental to the environment and has cost implications due to its removal and disposal. Therefore this study was conducted to provide a method of constructing a cost-effective permeable pavement to reduce waste generation and cost. In this study, comparative analysis of the water circulation capacity and economic efficiency of the traditional construction method and new method proposed in this study through the lab-scale experiment. The proposed method was to make holes in existing asphalt pavements, layout geotextile fabric and permeable base media such as sand before compaction. After compaction, layout grass blocks on the compacted base media then layout sand in between each grass blocks before compaction. Apparently, there was no significant difference between the traditional installation method of permeable pavement and the proposed method in this study considering surface runoff, infiltrated volume, stored volume, and rainfall-runoff delay time. The proposed method in this study generated 86% less wastes compared to the traditional installation method and has 70% cost reduction considering asphalt removal and disposal. The construction method proposed in this study yielded similar performance compared to the traditional installation method and water circulation effect, but was proven to be less complicated and economical.

• Journal of Korean Society of Forest Science
• /
• v.108 no.4
• /
• pp.574-581
• /
• 2019

The present study analyzed the productivity and cost of winching operations for evaluating the efficiency of a tractor-attached winch in a Pinus densiflora thinning site located in the Yangyang County of Gangwon-do. The mean yarding distance and mean timber volume were 29 m and 0.15 ㎥, respectively. In the 95 cycles of yarding operations, the uphill and downhill yarding operations constituted 51% and 49%, respectively, of the total yarding operations. The productivity of the uphill yarding operation was 2.28 ㎥/h, and the productivity of the downhill yarding operation was 1.89 ㎥/h. The findings of this study revealedthat productivity would increase by 0.5 ㎥/h when the rate of utilization of the machine is increased to 80% by reducing the operational delay time. The cost of the downhill yarding operation was 44,116 KRW/㎥, whereas that of the uphill yarding operation was 53,369 KRW/㎥. The difference in cost resulted from the difference in the number of yarding stems (stems/cycle). Furthermore, the results of the multiple linear regression equation developed for predicting the yarding operation times showed that productivity was significantly affected by working conditions such as yarding distance (m), the number of stems per cycle (stems/cycle), and the terrain slope (%) in the uphill and downhill yarding operations. Further research is required for developing an accurate prediction model equation according to a yarding direction.

• Journal of Korean Society of Transportation
• /
• v.23 no.2
• /
• pp.117-130
• /
• 2005

In both deteministic user Optimal Traffic Assignment Model (UOTAM) and stochastic UOTAM, travel time, which is a major ccriterion for traffic loading over transportation network, is defined by the sum of link travel time and turn delay at intersections. In this assignment method, drivers actual route perception processes and choice behaviors, which can become main explanatory factors, are not sufficiently considered: therefore may result in biased traffic loading. Even though there have been some efforts in Stochastic UOTAM for reflecting drivers' route perception cost by assuming cumulative distribution function of link travel time, it has not been fundamental fruitions, but some trials based on the unreasonable assumptions of Probit model of truncated travel time distribution function and Logit model of independency of inter-link congestion. The critical reason why deterministic UOTAM have not been able to reflect route perception cost is that the route perception cost has each different value according to each origin, destination, and path connection the origin and destination. Therefore in order to find the optimum route between OD pair, route enumeration problem that all routes connecting an OD pair must be compared is encountered, and it is the critical reason causing computational failure because uncountable number of path may be enumerated as the scale of transportation network become bigger. The purpose of this study is to propose a method to enable UOTAM to reflect route perception cost without route enumeration between an O-D pair. For this purpose, this study defines a link as a least definition of path. Thus since each link can be treated as a path, in two links searching process of the link label based optimum path algorithm, the route enumeration between OD pair can be reduced the scale of finding optimum path to all links. The computational burden of this method is no more than link label based optimum path algorithm. Each different perception cost is embedded as a quantitative value generated by comparing the sub-path from the origin to the searching link and the searched link.