• Journal of Internet Computing and Services
• /
• v.18 no.6
• /
• pp.47-53
• /
• 2017

Recently, huge datasets have been generating rapidly in a variety of fields. Then, there is an urgent need for technologies that will allow efficient and effective processing of huge datasets. Therefore the problems of partitioning a huge dataset effectively and alleviating the processing overhead of the partitioned data efficiently have been a critical factor for scalability and performance in distributed database system. In our work we utilized multicore servers to provide scalable service to our distributed system. The partitioning of database over multicore servers have emerged from a need for new architectural design of distributed database system from scalability and performance concerns in today's data deluge. The system allows uniform access through a web service interface to concurrently distributed databases over multicore servers, using SQMD (Single Query Multiple Database) mechanism based on publish/subscribe paradigm. We will present performance results with the distributed database system built on multicore server, which is time intensive with traditional architectures. We will also discuss future works.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.27 no.11C
• /
• pp.1040-1045
• /
• 2002

This paper focuses on a hash-based, distributed Wet caching network that eliminates inter-cache communication. An agent program on cache servers, a mapping program on the DNS server, and other components comprised in a distributed Web caching network were modified and developed to implement a so-called "consistent" hashing. Also, a dynamic load balancing algorithm is proposed to address the load-balancing problem that is a key performance issue on distributed architectures. This algorithm effectively balances the load among cache servers by distributing the calculated amount of mapping items that have higher popularity than others. Therefore, this developed network can resolve the imbalanced load that is caused by a variable page popularity, a non-uniform distribution of a hash-based mapping, and a variation of cache servers.

• The Journal of the Korea Contents Association
• /
• v.7 no.11
• /
• pp.69-75
• /
• 2007

In this paper, we propose a new distributed processing scheme to support MMORPG (Massively Multiplayer Online Role-Playing Games). But existing distributed game servers have some problems such as hotspot, congestion, server failure problems, and so on. To solve such problems, our proposed scheme begins by splitting the large virtual world into smaller regions, each region handled by a different server. We present a scheme that reduces the bandwidth requirements for both game servers and clients. Also our scheme allows seamless interaction among players residing on areas handled by different servers. We show an excellence of the proposed solution through various experiments.

• Journal of the Korea Computer Industry Society
• /
• v.2 no.8
• /
• pp.1035-1044
• /
• 2001

The existing search engine cause heavy loads on web servers and networks, because they operate robots not considering the loads of many distributed diverse web servers and networks. As the information update period is 3～4 weeks, information is not updated at proper time. Although there is no contents to be updated on web servers, the robot collects and updates the contents of the web servers. This study proposes a intelligential search engine considering the load of web servers and networks, designs a real-time controlled search engine and intelligent robots, and implements them. The intelligent robot updates distributed information real-time. Robot control policies are also proposed, which can upgrade the overall performance of the system by monitoring the loads of web servers and networks.

• Journal of Digital Contents Society
• /
• v.12 no.4
• /
• pp.559-565
• /
• 2011

In this paper, I propose a distributed game server system which has flexibility of enormous game character's processing in MMORPG using block scheme. I proposed game servers in distributed system grouped with zone which charge of each map, and the game servers in this zone divide game map into several unit blocks and process distributing blocks to game servers according to its performance. I proposed distributed game server system using block scheme can add/drop game map to/from easily through block process method in game and communication servers. Therefore, my proposed system can enormous character processing and add user created game map to existed game map easily in the future as well. Also, my scheme increases the system utilization and upgrades system stability by dynamic distribution of game map according to the number of characters and performance of servers.

• Journal of the Korean Society for information Management
• /
• v.17 no.1
• /
• pp.7-20
• /
• 2000

The study attempts to propose a distributed bibliographic information retrieval system using distributed retrieval servers and distributed databases. CORBA and JAVA applications have been employed to solve both the bottleneck and the problems that simultaneous searches in distributed databases cannot deal with under the CGI or JAVA applications. The proposed distributed bibliographic retrieval system using two distributed servers with their distributed databases was successfully experimented. However, it is recommended that both heterogeneous information retrieval systems and databases are included in further studies.

• Journal of Broadcast Engineering
• /
• v.5 no.1
• /
• pp.130-138
• /
• 2000

The paper describes a push system, a broadcasting system in the internet, which is developed for internet and intranet use. In this paper, we carried out research on the method to support the large number of users in the intranet environment. Particularly the paper analyzes the effects on the network traffic according to the number of the user connected to the push system and the frequency of the connections when push servers are distributed over the intranet. Push system described here uses two different kinds of channels, common channel and local channel. Common channel is the channel to be replicated among the push servers in the intranet. This paper shows that the method using the common channel synchronization is efficient in supporting the large number of intranet users. We introduce an algorithm to make the interconnections between channels efficiently amongpush servers distributed over the intranet.

• International Journal of Computer Science & Network Security
• /
• v.24 no.4
• /
• pp.60-66
• /
• 2024

Host's data during transmission. Data tempering results in loss of host's sensitive information, which includes number of VM, storage availability, and other information. In the distributed cloud environment, each server (computing server (CS)) configured with Local Resource Monitors (LRMs) which runs independently and performs Virtual Machine (VM) migrations to nearby servers. Approaches like predictive VM migration [21] [22] by each server considering nearby server's CPU usage, roatative decision making capacity [21] among the servers in distributed cloud environment has been proposed. This approaches usage underlying server's computing power for predicting own server's future resource utilization and nearby server's resource usage computation. It results in running VM and its running application to remain in waiting state for computing power. In order to reduce this, a decentralized decision making hybrid model for VM migration need to be proposed where servers in decentralized cloud receives, future resource usage by analytical computing system and takes decision for migrating VM to its neighbor servers. Host's in the decentralized cloud shares, their detail with peer servers after fixed interval, this results in chance to tempering messages that would be exchanged in between HC and CH. At the same time, it reduces chance of over utilization of peer servers, caused due to compromised host. This paper discusses, an roatative decisive (RD) approach for VM migration among peer computing servers (CS) in decentralized cloud environment, preserving confidentiality and integrity of the host's data. Experimental result shows that, the proposed predictive VM migration approach reduces extra VM migration caused due over utilization of identified servers and reduces number of active servers in greater extent, and ensures confidentiality and integrity of peer host's data.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.20 no.12
• /
• pp.2252-2258
• /
• 2016

CCMP(centralized conferencing manipulation protocol) enables adding and removing conference participants, changing their roles, adding and removing media streams in conference system. In this paper, by using extended CCMP, a new distributed conference system architecture which can be used to multiple servers distributed conference system in SIP(session initiation protocol) environment has been presented. In this study, according to increasing number of participants, a new extended CCMP architecture which can distribute conference system loads to multiple servers dynamically to decrease loads of servers has been designed. This extended CCMP architecture also can add dynamically new servers from the prepared servers pool. Furthermore, new conference information data format which can represent extended CCMP has been designed, and exchange procedures of extended CCMP control messages which can distribute loads between servers have also been presented. The performance of the proposed system has been analysed by simulation.

• The Transactions of the Korea Information Processing Society
• /
• v.7 no.4
• /
• pp.1050-1061
• /
• 2000

This paper presents a new object model, LOM(Lightweight Object Model) and an implementation method for the distributed trader in heterogeneous distributed computing environment including mobile network. Trader is third party object that enables clients to find suitable servers, which provide the most appropriate services to client in distributed environment including dynamic reconfiguration of services and servers. Trading service requires simpler and more specific object model than genetic object models which provide richer multimedia data types and semantic characteristics with complex data structures. LOM supports a new reference attribute type instead of the relationship, inheritance and composite attribute types of the general object oriented models and so LOM has simple data structures. Also in LOM, the modelling step includes specifying of the information about users and the access right to objects for security in the mobile environment and development of the distributed storage for trading service. Also, we propose and implementation method of the distributed trader, which integrates the LOM-information object model and the OMG (object Management Group) computational object model.