• Journal of Information Processing Systems
• /
• v.2 no.2
• /
• pp.130-134
• /
• 2006

In the distributed replicating server model, the provision of replicated services will improve the performance of the providing service and efficiency for clients. Efficiently composing the server selection algorithm decreases the retrieval time for replicated data. In this paper, we define the system model that selects and connects the replicated server that provides an optimal service using the server-side downstream measurement and propose a server selection algorithm.

• Journal of the Korea Society for Simulation
• /
• v.14 no.2
• /
• pp.1-13
• /
• 2005

In distributed replicating server model, providing replicated services is able to improve the performance of providing a service and efficiency for several clients. And, the composition of the server selection algorithm is efficiently able to decrease the retrieval time for replicated data. In this paper, we define the system model that selects and connects the replicated server that provides optimal service using server-side downstream measurement and proposes an applicable algorithm.

• Journal of Korea Game Society
• /
• v.2 no.2
• /
• pp.20-27
• /
• 2002

In this paper, I tried to propose efficient online game server architecture that decrease server overload. I used replicated distributed sever type together with non-replicated distributed sever type. Replicated distributed sever type has the advantage to maintain efficient distribution of server overload and non-replicated distributed sever type has the advantage to move a game server to a different game server freely in one server group. I used these advantages suitably in this proposal, and I will show the efficiency of online game server architecture.

• Journal of KIISE:Computer Systems and Theory
• /
• v.31 no.9
• /
• pp.495-502
• /
• 2004

A rapid growth of the Internet user and rich media content cause an excessive server load and high network traffic, and thus it decreases the quality of service. A solution to this problem is to distribute the content on multiple replicated servers. However, in this circumstance, clients face additional task of selecting the best server to provide proper so${\gamma}$vice which clients request. This paper is intended to propose an adaptive server selection mechanism for a client request based on distance and server load. This will offer a fast and scalable service in response to the increase of massive and realtime multimedia content and contribute to floating a new business model of digital content service.

• The Transactions of the Korea Information Processing Society
• /
• v.7 no.3
• /
• pp.799-807
• /
• 2000

In this paper, object replication Client/server under distributed computing system is design and implementation. Today many end-users have a computer communication by using internet in the distributed system of client/server. If many users request services to a specific remote server, the server should have got a overhead for hat service processing, delayed the speed for replay, and bring a bottleneck in communication network. Therefore object replication method was proposed to solve this problems. The growth of internet works and distributed applications has increased the need for large scale replicated systems. However, existing replication protocols do not address scale and autonomy issues adequately. Further, current application protocol require consistency of different levels, and therefore should be the selection function of consistency in them, in order to have particular semantics of each level. In this paper, server overhead and bottleneck happening in remote procedure call be using server object replication. Therefore access transparency can be improved by sharing object duplicately. So it will Keep up with the consistency within the replicated objects.

• Journal of KIISE:Information Networking
• /
• v.29 no.3
• /
• pp.265-275
• /
• 2002

A default server strategy is a very popular scheme for managing location and state information of mobile hosts in cellular networks. But the communication cost increases if the call requests are frequent and the distant between the default server and the client is long. Still more any connection to a mobile host cannot be established when the default server of the destination mobile host fails. These problems can be solved by replicating default server and by letting nearest replicated default server process the query request which is sent from a client. It is important to allocate replicated default servers efficiently in networks and determine the number of replicated default servers. In this paper, we suggest and evaluate a default server replication strategy to reduce communication costs and to improve service availabilities. Furthermore we propose and evaluate an optimized allocation algorithm and an optimal replication degree for replicating: dofault servers in nn grid networks and binary tree networks.

• Journal of the Korean Data and Information Science Society
• /
• v.19 no.2
• /
• pp.645-655
• /
• 2008

As wireless connectivity is integrated into many handheld devices, streaming multimedia content among mobile ad-hoc peers is becoming a popular application. In this paper, we propose a dynamic service replication algorithm for providing guaranteed continuous streaming services to all nodes in mobile ad-hoc networks (MANETs). First, a MANET is comprised of logical grid hierarchy, and a streaming service is replicated to a lower server region of the logical grid hierarchy by considering the link availability between a mobile node and the streaming server within a server region or the popularity of the streaming service. We evaluate analytically the performance of the proposed algorithm, and compared with that of existing Qin's algorithm. Evaluation results show that our algorithm can achieve better streaming performance than Qin's algorithm. Therefore, the proposed algorithm not only improves the sharing availability of replicated streaming services but also controls efficiently the number of streaming service replications.

• Journal of Information Technology Services
• /
• v.8 no.2
• /
• pp.157-171
• /
• 2009

In mobile XML environments, the efficient synchronization technique is required to maintain the consistency of replicated XML data because the same data can be replicated between so many different XML documents. In this paper, we propose a message digest based synchronization technique to maintain the consistency of replicated data between client XML documents and a server XML database in mobile XML environments. The proposed an XML data synchronization technique(XSA) has the advantage of model generality aspect and storage space aspect by using the tuple-based message digest table to detect the data conflicts. The proposed technique can be applicable to the application requiring the consistency of replicated XML data without any restrictions in the heterogeneous(between hierarchical XML documents and relational XML databases) mobile environments.

• The Transactions of the Korea Information Processing Society
• /
• v.6 no.11
• /
• pp.3077-3085
• /
• 1999

Conventional caching system doesn't support Real-Time attributes and load balance. To solve these problems, this paper describes the design and implementation of the RIOP(Real-Time Inter-ORB Protocol) to provide QoS guarantees mechanism integrating RSVP and TAO ORB. Futhermore, it provides fast XCSLS(Extended Caching System for Load Balance) implementing main memory cache in Primary Server using locality of objects. In this paper, a key feature is presented : QoS enforcement, PS(Primary Server) and RS(Replicated Server)

• Journal of Korea Multimedia Society
• /
• v.7 no.5
• /
• pp.689-697
• /
• 2004

Rapid advances in mobile computing and the availability of wireless communications will soon provide mobile users with the ability to access data regardless of the location of the user or of the data. SRA(Static Replica Allocation) that is traditional scheme has been used for the replication method on the server. This replicates the data on the replica server after a moving host has been transferred to the cell. This strategy is simple and can easily relocate data. However, if a mobile user does not exist in the cell, the replicated data can be deleted in order to maintain data consistency. In addition to, if the mobile host leaves from replicated cell, it is difficult to access data in terms of replication route. Therefore, this paper proposes a new method of relocation based on data consistency strategy called USRAC(User Selection Replica Allocation based on Consistency) and also analyzes access cost according to the moving rate of mobile users, according to the access rate of mobile hosts, and according to the number of cells of mobile users and mobile hosts.