• Title/Summary/Keyword: Replicated Web Server

Search Result 6, Processing Time 0.024 seconds

Adaptive Server Selection Mechanism in the Replicated Web Server Environment (복제 웹 서버 환경에서 적응력 있는 서버 선택 메커니즘)

  • 김선호;신용태
    • 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.

An Efficient Dynamic Load Distribution for the Web Cluster Systems (웹 클러스터 시스템의 효율적인 동적 작업분배)

  • Seo, Kyung-Ryong
    • Journal of Korea Multimedia Society
    • /
    • v.7 no.8
    • /
    • pp.1097-1106
    • /
    • 2004
  • The typical web cluster architecture consists of replicated real servers and a virtual server that routes client requests among the real servers. In this paper, we proposed an efficient dynamic load distribution method with load prediction for the web cluster systems. The virtual server transmit status request message to real servers in other to get load states. However the load states dose not accurate during load distribution, thus the virtual server predict the load status of real servers and assign a request of the client to the minimum loaded real server. The proposed distribution methods works not related to partial breakdown of real servers, thus the system works with high availability. We also show that the proposed distribution method preserve scalable property and improve the throughput through a set of simulations.

  • PDF

An Agent System for Efficient VOD Services on Web (효율적 웹 기반 VOD 서비스를 위한 에이전트 시스템)

  • Lee Kyung-Hee;Han Jeong-Hye;Kim Dong-Ho
    • Journal of Digital Contents Society
    • /
    • v.2 no.1
    • /
    • pp.73-79
    • /
    • 2001
  • Most of the existing algorithms try to disseminate the multimedia contents of internet service provider(ISP), without taking into account the needs and characteristics of specific websites including e-learning systems with web-based .educational contents. Sometimes the client must select the best one among the replicated repositories. However, this is a less reliable approach because clients' selections are made without prior information on server load capacity. In this paper we propose an agent system inspired by the need of improving QoS of delivering web-based educational multimedia contents without incurring long access delays. This agent system consists of three components, Analyzer, Knowledge Base, and Automaton embedded the capacity algorithm. It analyzes and investigates traffic information collected from individual replicated server by learners' requests, and selects a server which is available and is expected to provide the fastest latency time and the lowest loaded capacity, and achieves high performance by dynamic replicating web resources among multiple repositories.

  • PDF

A Design of Redirection System for Server Selection on the Content Distribution Environment (콘텐츠 분산 환경에서 서버 선택을 위한 리다이렉션 시스템의 설계)

  • Kim, Seon-Ho;Ko, Hoon;Shin, Yongtae
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.29 no.2C
    • /
    • pp.283-290
    • /
    • 2004
  • With the development of Web technologies, the demand for multimedia contents and network bandwidth is increasing explosively. In this situation, Caching, P2P and CDN are using for fast transmission with low traffic. In this research, we designed and implemented a redirection system for best replica selection where contents are distributed to multiple replicated web servers. This redirection system selects a close and least loaded replica and redirect a client's request to the replica. As a result, this system improved user-perceived performance. It is expected that this redirection system will contribute to the faster and more stable transmission of massive multimedia contents.

Implementation of Intelligent Web Service Access Management for Supporting High Ava ilability and Business Continuity (고 가용성과 업무의 연속성 보장을 위한 지능적 웹 서비스 접속관리의 구현 방안에 관한 연구)

  • Joong Kang-Itrun;Lee Kwang-Eooung
    • Journal of the Korea Society of Computer and Information
    • /
    • v.10 no.5 s.37
    • /
    • pp.151-160
    • /
    • 2005
  • High availability and business continuity in the mission critical enterprise environment have been a matter of primary concern. It is desirable to implement replicated servers, duplicated devices and disaster recovery sites so that these issues are accomplished. When that happens, web browser's users may be accessed web server through a specific Uniform Resource Locator. A critical issue arises if web browser's users recklessly change the URL and access into other site. In this case, data integrity between duplicated sites may not be guaranteed. In this paper, we introduce the method of integrating the technologies of user authentication, certificate authority and business continuity and Propose the design and implementation of intelligent service access management.

  • PDF

Building B2B system using timestamp tree for data change detection in low speed network environment (저속 네트워크 환경에서 데이터 변화 탐지를 위해 타임스탬프 트리를 이용하는 B2B 시스템 구축)

  • Son Sei-Il;Kim Heung-Jun
    • The KIPS Transactions:PartD
    • /
    • v.12D no.6 s.102
    • /
    • pp.915-920
    • /
    • 2005
  • In this paper we expanded a existing web based B2B system to support users in low speed network. To guarantee shared dat a consistency between clients and a server, we proposed a method of data change detection by using a time stamp tree and the performance analysis of the proposed method was proved by a simulation. Under the worst condition that leaf nodes of a times tamp tree were changed uniform distribution, the simulation result showed that the proposed method was more efficient than a sequential detection until the percentage of changed nodes were below $15\%$. According to our observation, the monthly average of data change was below $7\%$ on a web-based construction MRO B2B system or a company A from April 2004 to August 2004. Therefore the Proposed method improved performance of data change detection in practice. The proposed method also reduced storage consumption in a server because it didn't require a server to store replicated data for every client.