• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2003.10a
• /
• pp.716-719
• /
• 2003

P2P (Peer to Peer) is part that is discussed much in the latest Internet and is interested. P2P changes the structure of Client-Server into Information sharing between client that is the structure of p2p. But perfect P2P system has many problems awaiting solution. In this treatise we can realize network communication to compose one virtual server and one virtual client which is intergrated several client and distributed computer that decentralize network traffic into the traffic of several pc by sharing resource and cpu between client. Our nam purpose is not real P2P system but realization, organization of the P2P internet system which is composed by distributed computing and network load balancing in P2P internet system environment.

• 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.

• The Transactions of the Korea Information Processing Society
• /
• v.7 no.10
• /
• pp.3148-3154
• /
• 2000

In this paper. the design and implementationof the on-line registration system for the school affairs is described. The environments for the system configurations include a PC server under Linux Iperating System. Apache Web-server, and MySQL as database engine. In addition, PHP, which becomes a popular Internet server-based script language lately, is used to implement a real-time database. In order to avoid overload problems during short-term registration period, which deconstraces the typical surge of traffics, the proposed system is designed to minimize the unnecessary interfacing tasks. On administrator side task, the sytem is designed to have environments by separating the dechcated server that restricts the scope of specific database thasks. In doing so, it become possibal to build an optical system by distributing, balancing the transaction load, maintainimg the security and efficient administrative tasks.

• The Transactions of the Korea Information Processing Society
• /
• v.6 no.11S
• /
• pp.3340-3349
• /
• 1999

Supporting object group on distributed object system give merits such as load balancing, fault tolerance and high availability. In this paper, we describe a CORBA ORB that has been designed to support object group based on active replication. The ORB supports the operational model in which it uses the IIOP for communication between client and server and total ordered multicast protocol for consistency control among group members. And through extension of ORB, it provides functions required for support of object group. Since it provides transparency of object replication, the ORB is interoperable with the existing CORBA products. It make possible for existing server application to be easily extended to application supporting object group as adding interface functions which should be used for building applications is minimized. A prototype is implemented, and performance of the replicated object group is tested and compared with a single object invocation.

• Proceedings of the Korean Information Science Society Conference
• /
• 2008.06b
• /
• pp.484-488
• /
• 2008

AHU(Autonomic Healing Utility)는 결함발생요인을 관리하고 결함이 발생할 가능성이 있는 응용프로그램을 검출하기 위하여 결함예방서비스와 더불어 프로액티브한 결함복구서비스를 지원한다. Server-Client 구조를 갖는 AHU는 하나의 AHU 서버에 너무 많은 AHU 클라이언트들이 자가치유 서비스를 요청하는 경우 병목현상이 발생하여 AHU 서버의 처리용량을 넘게 되고 AHU가 제공하는 자가치유시간을 증가시켜 자가치유서비스의 질을 저하시키거나 AHU의 SPOF(Single Point of Failure)로 작용하여 AHU의 전반적인 결함을 발생시키는 원인이 된다. 따라서 본 논문에서는 AHU 시스템의 부하를 분산시켜서 AHU 서버에 생기는 병목현상을 해소하기 위한 방법을 제안하고 이를 구현하여 기존의 AHU와 AHU 서버들 사이의 부하분산 방법을 적용한 AHU를 비교하는 성능평가를 수행하였다.

• Proceedings of the KIEE Conference
• /
• 1999.07c
• /
• pp.1120-1122
• /
• 1999

This paper introduces a clustering for Central Control System in New Distribution Automation System. There are three primary benefits to use clustering: improved availability, easier manageability and more cost-effective scalability. Availability: Clustering can automatically detect the failure of an application or server and quickly restart it on a surviving server. Clients only experience a momentary pause in service. Manageability: Clustering lets administrators quickly inspect the status of all cluster resources and easily move workload around onto different servers within a cluster. Scalability: Applications can use the Clustering services through the MSCS Application Programming Interface(API) to do dynamic load balancing and scale across multiple servers within a cluster.

• The KIPS Transactions:PartA
• /
• v.8A no.4
• /
• pp.461-468
• /
• 2001

Large-scale distributed applications based on Internet and client/server applications have to deal with series of problems such as load balancing, unpredictable communication delays, partial errors, and networking failures. Therefore, sophisticated applications such as teleconferencing, video-on-demand, and concurrent software engineering require an abstracted communication. In this paper, we present our design, implementation and performance analysis of group communication using the CORBA ORB, JAVA RMI, Socket based on distributed computing. We anticipate our study may apply to the various field of applications such as fault-tolerant client/server system, groupware, scalable text retrieval system, and financial information systems.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.11 no.5
• /
• pp.217-228
• /
• 2011

In centralize CDN systems, the content server selection is performed by service node for every user request, and the selected node is notified to the user. In this paper, we present distributed CDN architecture and algorithm in which the request from a user is delivered to the content source by a P2P algorithm utilizing DHT(distributed hash table) through the overlay network and the user selects one of the source nodes based on real-time user-centric criteria. For this purpose, we propose a modified Pastry algorithm for contents registration, search and selection, in addition to the distributed architecture. The proposed architecture has the advantages of load balancing, traffic balancing, scalability, fault-tolerance due to the self-configuration, self-healing attributes of distributed architecture. Various simulation shows the feasibility of the proposed architecture and algorithm, and the performance is compared and discussed for the variations of the proposed scheme.

• Journal of KIISE:Computer Systems and Theory
• /
• v.33 no.8
• /
• pp.505-513
• /
• 2006

To satisfy SLA(Service Level Agreement) contract between a client and a service provider, the client requests are classified and processed by priorities. In providing differentiated service, a request from a client who has low priority can be dealt with less important. In this paper, we study static and dynamic partitioning mechanism of web servers and also admission control policy for multiclass request distribution. Through simulation experiments, we analyze web server throughput and response time considering SLA.

• Journal of KIISE:Software and Applications
• /
• v.35 no.1
• /
• pp.22-32
• /
• 2008

To overcome the weakness of the image retrieval system using the existing Ontology and the distributed image based on the database having a simple structure, HERMES was suggested to ensure the self-control of various image suppliers and support the image retrieval based on semantic, the mentioned framework could not solve the problems which are not considered the deterioration in the capacity and scalability when many users connect to broker server simultaneously. In this paper the tables are written which in the case numerous users connect at the same time to the supply analogous level of services without the deterioration in the capacity installs Broker servers and then measures the performance time of each inner Broker Component through Monitoring System and saved and decides the ranking in saved data. As many Query performances are dispersed into several Servers User inputted from the users Interface with reference to Broker Ranking Table, Load Balancing system improving reliability in capacity is proposed. Through the experiment, the scheduling technique has proved that this schedule is faster than existing techniques.