• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2018.05a
• /
• pp.229-231
• /
• 2018

As autonomous vehicle technology has been gradually developed, robots that have introduced autonomous navigation systems have been actively involved in areas where there is a lot of livelihoods such as industrial sites and accident sites. For this reason, the unmanned transportation system equipped with the autonomous traveling system is widely used in harmful environments where human access is difficult. In addition, the introduction of the autonomous driving system reduces the collision and casualties that occur in a mobility environment like the industrial field, and it helps the efficient work process. In addition, autonomous driving vehicles can be handled more safely and quickly in a wider area by transmitting the surrounding environment of each vehicle to a server connected to each autonomous driving vehicle and passing it through the main server. In this paper, by utilizing V2X communication for autonomous unmanned forklift system, it can increase industrial workload, reduce loss of life and damage to property through wide area forklifts.

• The Transactions of the Korea Information Processing Society
• /
• v.2 no.3
• /
• pp.288-298
• /
• 1995

Load balancing attempts to improve the performance of a distributed computing system by transferring some of the workload of a congested site to others. A load balancing scheme that supports both the source-initiated and the server- initiated load balancing is proposed in this paper. It can model both the m/m/1 queue(no load balancing) and the m/m/n queue(perfect load balancing) as the extreme State variables are replicated into every site, and copy consistency constraints are relaxed more weakly. We propose weak copy consistency constraints which correlate the outdated state information to that of the current state. We also derive sufficient conditions under which each scheduler can guarantee the load balancing without communication Using this model, the problem of load balancing is converted to that of maintaining the consistency of states and communication overhead becomes less than that of the bidding algorithm. The scheme is simulated by event tracing, compared to the two extreme cases and the bidding algorithm. The results show that the mean response time and the number of messages are reduced by 0-35% and 40-100% respectively, compared with the bidding algorithm. Finally the effects of some system parameters are described.

• The KIPS Transactions:PartB
• /
• v.12B no.7 s.103
• /
• pp.775-782
• /
• 2005

In this paper, we propose multicast technique in order to reduce the required network bandwidth by n times, by merging the adjacent multicasts depending on the number of HENs (Head-End-Nodes) n that request the same video. Allowing new clients to immediately join an existing multicast through patching improves the efficiency of the multicast and offers services without any initial latency. A client might have to download data through two channels simultaneously, one for multicast and the other for patching. The more the frequency of requesting the video is, the higher the probability of caching it among HENs increases. Therefore, the requests for the cached video data can be served by HENs. Multicast from server is generated when the playback time exceeds the amount of cached video data. Since the interval of multicast can be dynamically expanded according to the popularity of videos, it can be reduced the server's workload and the network bandwidth. We perform simulations to compare its performance with that of conventional multicast. From simulation results, we confirm that the Proposed multicast technique offers substantially better performance.

• KNOM Review
• /
• v.24 no.1
• /
• pp.1-12
• /
• 2021

VM (Virtual Machine) live migration is a server virtualization technique for deploying a running VM to another server node while minimizing downtime of a service the VM provides. Currently, in cloud data centers, VM live migration is widely used to apply load balancing on CPU workload and network traffic, to reduce electricity consumption by consolidating active VMs into specific location groups of servers, and to provide uninterrupted service during the maintenance of hardware and software update on servers. It is critical to use VMlive migration as a prevention or mitigation measure for possible failure when its indications are detected or predicted. In this paper, we propose two VNF live migration methods; one for predictive load balancing and the other for a proactive measure in failure. Both need machine learning models that learn periodic monitoring data of resource usage and logs from servers and VMs/VNFs. We apply the second method to a vEPC (Virtual Evolved Pakcet Core) failure scenario to provide a detailed case study.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.7 no.7
• /
• pp.1610-1623
• /
• 2013

In-network caching is a key component of information-centric networking (ICN) for reducing content download time, network traffic, and server workload. Data center network (DCN) is an ideal candidate for applying the ICN design principles. In this paper, we have evaluated the effectiveness of caching placement and replacement in DCN with butterfly-topology. We also suggest a new cache placement policy based on the number of routing nodes (i.e., hop counts) through which travels the content. With a probability inversely proportional to the hop counts, the caching placement policy makes each routing node to cache content chunks. Simulation results lead us to conclude (i) cache placement policy is more effective for cache performance than cache replacement, (ii) the suggested cache placement policy has better caching performance for butterfly-type DCNs than the traditional caching placement policies such as ALWASYS and FIX(P), and (iii) high cache hit ratio does not always imply low average hop counts.

• Journal of the Korea Academia-Industrial cooperation Society
• /
• v.11 no.4
• /
• pp.1301-1306
• /
• 2010

The protocol based on password have very important qualifications that not only satisfy against attacks cause of restricting that have, but also efficiency of reducing users' workload. It has a problem of speculative attacks for the user authentication protocol based on password with most case, because users use password that can remember easily. Song and Etc. have proposed new mechanism that improved the problem of S/KEY system. The protocol proposed by Song has a problem in registration process, and user information can be abused by the malevolent server. We propose a new authentication protocol based on efficient OPT, that improved above problems.

• Journal of Navigation and Port Research
• /
• v.27 no.1
• /
• pp.19-24
• /
• 2003

This paper describes the computerization of medication management that is done manually now. That medication management effective and gives the enhanced way to provide information about seamen's medical condition check and the medicine habit. Transmission of detail information about medicine inventory through the wireless communication network is able to reduce the time required and workload. In this research, the server and client modules information between ships and shores.

• IE interfaces
• /
• v.16 no.spc
• /
• pp.76-81
• /
• 2003

BPMS (Business Process Management Systems) is aninformation system that systematically supports designing, administrating, and improving the business processes. It can execute the business processes by assigning tasks to human or computer agents according to the predefined definitions of the processes. In this research we developed a task assignment algorithm that can maximize overall process efficiency under the limitation of agents' capacity. Since BPMS manipulates the formal and predictable business processes, we can analyze the processes using queuing theory to achieve overall process efficiency. We first transform the business processes into queuing network model in which the agents are considered as servers. After that, workloads of agents are calculated as server utilization and we can determine the task assignment policy by balancing the workloads. This will make the workloads of all agents be minimized, and the overall process efficiency is achieved in this way. Another application of the results can be capacity planning of agents in advance and business process optimization in reengineering context. We performed the simulation analysis to validate the results and also show the effectiveness of the algorithm by comparing with well known dispatching policies.

• The KIPS Transactions:PartD
• /
• v.12D no.5 s.101
• /
• pp.765-772
• /
• 2005

For the excellent U web services, the program developers should create both user's client program and the sewer program Recently, the structural alteration of programs are often caused by infernal and external environment concerned with social trends and preferences as well as user's requirements expectations. So, for reducing the development time and workload of XML web service programs, it is necessary to develop the web program generation tools. This paper suggest how to design and implement the web-based XML Tree builder, which was able to provide the information for promptly and easily generating the XML Schema, XML Stylesheet and XML Document through the XML Development Supporting Server System.

• KIPS Transactions on Computer and Communication Systems
• /
• v.8 no.10
• /
• pp.239-244
• /
• 2019

In recent mobile environments, query processing costs have been rapidly increasing as users request large amounts of queries. In addition, the server's performance is increasing for many users to handle high-capacity queries, but the workload is increasing continuously. To solve these problems, we use the wireless broadcasting environment. However, in a existing wireless broadcasting environment, servers have a problem sending all the objects they manage to their clients. Therefore, we propose a new R-Bcast combining the advantages of demand-based and wireless broadcasting. R-Bcast is a technique that protects query information and reduces query processing time. Experiments have proved that R-Bcast is superior to conventional techniques.