• 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 the Korean Institute of Intelligent Systems
• /
• v.7 no.5
• /
• pp.8-13
• /
• 1997

In multi-server environment there are many servers which are able to process job requests. So we bave to design a mechanism that selects appropriate servers for processing each job request while maximizing server throughput and minimizing average response time of requests. Conventional methods ac~ opt the load of each server as criteria of server selection. that is, they select a server whose load is not bigger than the others. In this work we propose an approach that uses the degree of server performance, server load and the estimated service time of requested job as guidelines of server selection. We incorporate fuzzification techniques and expert knowledge in this approach. Comparing the performances c~f our approach to that of conventional one, experiments show that the proposed approach provides better performances.

• 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 KIPS Transactions:PartA
• /
• v.11A no.6
• /
• pp.413-418
• /
• 2004

According as computer hardware became smaller and its performing power became improved due to the developed computer technology, clients demand more powerful accessibility to various information through getting the information at every time and every place. These needs led to the Ubiquitous computing technology which makes it possible to have access to a specific information regardless of clients' physical location. In this paper, we propose an approach that mobile host can get data from proper contents server by applying Contents Distributing Network to wireless network. By simulation, this paper proves that this approach can Improve performance by using contents server selection in wireless network. This research will contribute to realizing the Ubiquitous computing technology.

• Journal of Communications and Networks
• /
• v.17 no.3
• /
• pp.306-320
• /
• 2015

Due to an explosive growth in services running in different datacenters, there is need for service selection and routing to deliver user requests to the best service instance. In current solutions, it is generally the client that must first select a datacenter to forward the request to before an internal load-balancer of the selected datacenter can select the optimal instance. An optimal selection requires knowledge of both network and server characteristics, making clients less suitable to make this decision. Information-Centric Networking (ICN) research solved a similar selection problem for static data retrieval by integrating content delivery as a native network feature. We address the selection problem for services by extending the ICN-principles for services. In this paper we present Queue and Latency, a network-driven service selection algorithm which maps user demand to service instances, taking into account both network and server metrics. To reduce the size of service router forwarding tables, we present a statistical method to approximate an optimal load distribution with minimized router state required. Simulation results show that our statistical routing approach approximates the average system response time of source-based routing with minimized state in forwarding tables.

• 제어로봇시스템학회:학술대회논문집
• /
• 2000.10a
• /
• pp.65-65
• /
• 2000

For Video on Demand(VoD) servers, a design of an efficient scheduler is important to the support a large number of clients having various playback speeds and receiving rates. In this paper, we propose the scheduling algorithm to handle establishing deadlines and selection using the earliest deadline first. To establish deadlines and selections, the period of the receiving rates for each client is located between the over-max receiving rate and the over-playback rate. To avoid video starvation and the buffer overflow of each client, the proposed algorithm guarantees providing the admission control. Because of establishing deadlines and selection, period of each client receiving is between one over max receiving rate and one over play back rate. Using Virtual Buffer in server, scheduling load is reduced. The efficiency of the proposed algorithm is verified using a Petri Net_Based simulation tool, Exspect.

• 제어로봇시스템학회:학술대회논문집
• /
• 2004.08a
• /
• pp.1084-1089
• /
• 2004

This paper describes the improvement of web cache server by scoping in replacement algorithm of data which are collected from the clients. We have found that each replacement algorithm is suitable for each type of data in the web pages. Therefore, we introduce the mechanism to select the replacement algorithm depending on the size of data called the Replacement Algorithm Selection Mechanism (RASM). RASM allows the web cache server to have the suitable replacement algorithm for each type of data. As the result, the byte hit ratio of web cache server can be increased and the congestion in the network can be alleviated.

• The Journal of Engineering Research
• /
• v.7 no.1
• /
• pp.29-36
• /
• 2005

In multi-server environment, We have to design a mechanism that selects appropriate servers for processing each service request while maximizing server throughput and minimizing average response of service requests. In this paper, we propose a job scheduling method for courseware delivery system using a idle computing resources on LAN. The proposed scheduling method propose an approach that uses client service request time, server available period and server load of requested service as guidelines of server selection. Comparing the our approach method to conventional one, experiments that the proposed approach provides better performance.

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