• 제목/요약/키워드: High Performance Web Server

검색결과 78건 처리시간 0.014초

자가 치유 기법을 이용한 고가용도 웹 서버 클러스터 (High Availability Web Server Cluster Using Self-healing Technique)

  • 정지영;김영로
    • 디지털산업정보학회논문지
    • /
    • 제5권1호
    • /
    • pp.23-32
    • /
    • 2009
  • Although the web is becoming a widely accepted medium, it provides relatively poor performance and low availability. A cluster consists of a collection of interconnected stand-alone computers working together and provides a high-availability solution in application area such as web services or information systems. Web server clusters require a high-availability service with a proactive and practical fault management. However, as the system complexity grows, it is not easy to meet the requirement. Therefore, web server clusters must have self-fault management capability for meeting high-availability requirement. In this paper, we propose high availability web server clusters using self-healing technique with a minimal human intervention. Our experimental results show that a proposed method can be used to improve the availability of web server clusters.

웹 서버 성능 가속기 (Web-server accelerator - CDA(Contents Delivery Accelerator))

  • 조준우;최현진;박규호
    • 대한전자공학회:학술대회논문집
    • /
    • 대한전자공학회 2003년도 컴퓨터소사이어티 추계학술대회논문집
    • /
    • pp.73-76
    • /
    • 2003
  • Current web-server deals a multimedia data as well as text data. But dealing a multimedia data is high burden to web-server. So it can degrade web-server response. We introduce H/W feature CDA (Contents Delivery Accelerator). Main function of this H/W is transferring data between SCSI disk and NIC by direct path, and TCP offloading. These 2 functions can accelerate web-server performance. In this paper we will explain problem of current web-server and suggest our new architecture and say various implementation issues.

  • PDF

실시간 압축 전송 아키텍쳐를 이용한 고성능 웹 서버 구현 (Development of a High Performance Web Server Using A Real-Time Compression Architecture)

  • 민병조;강명석;우천희;남의석;김학배
    • 한국컴퓨터산업학회논문지
    • /
    • 제5권3호
    • /
    • pp.345-354
    • /
    • 2004
  • 현재 인터넷은 HTTP 프로토콜을 중심으로 구성되어 있다. 전자상거래, 전자정부, 인터넷 멀티미디어, 흠 네트워킹 등 현재 인터넷으로 가능한 서비스는 점점 증가하고 있지만, 비교적 단순한 메시지의 전송에 기반 해 설계된 HTTP가 현재의 이러한 복잡한 서비스와는 적합하지 않는 경우도 있다. 즉, 점점 더 다양해지는 서비스로 인해, 서버 쪽에서는 클라이언트당 점점 더 많은 양의 데이터를 전송하게 되는 것이다. 이러한 웹 서버 측의 메시지 전송 부담과 전송 시간, 대역폭의 절감을 위해서, HTTP 프로토콜의 압축전송헤더를 이용한 실시간 압축 전송 아키텍쳐를 개발하였다. 이를 이용하여, 정적 페이지를 실시간으로 압축/전송함으로써, 웹 서버 측의 대역폭을 절감하였고, 전송속도를 증가시켰다. 또한, 상대적으로 CPU 집중적인 압축연산을 커널 영역에서 수행하여, 압축연산으로 인한 서버 측의 CPU 자원사용을 최소화하였다.

  • PDF

실시간 압축 전송 아키텍쳐를 이용한 고성능 웹서버 구현 (Development of a High Performance Web Server Using A Real-Time Compression Architecture)

  • 민병조;황준;김학배
    • 정보처리학회논문지C
    • /
    • 제11C권6호
    • /
    • pp.781-786
    • /
    • 2004
  • 현재 인터넷은 HTTP 프로토콜을 중심으로 구성되어 있다. 전자상거래, 전자정부, 인터넷 멀티미디어, 홈 네트워킹 등 현재 인터넷으로 가능한 서비스는 점점 증가하고 있지만, 비교적 단순한 메시지의 전송에 기반해 설계된 HTTP가 현재의 이러한 복잡한 서비스와는 적합하지 않는 경우도 있다. 즉, 점점 더 다양해지는 서비스고 인해, 서버 쪽에서는 클라이언트당 점점 더 많은 양의 데이터를 전송하게 되는 것이다. 이러한 웹 서버측의 메시지 전송 부담과 전송 시간, 대역폭의 절감을 위해서, HTTP 프로토콜의 압축전송헤더를 이용한 실시간 압축 전송 아키텍쳐를 개발하였다. 이를 이용하여, 정적 페이지를 실시간으로 압축/전송함으로써, 웹서버측의 대역폭을 절감하였고, 전송속도를 증가시켰다. 또한, 상대적으로 CPU 집중적인 압축연산을 커널 영역에서 수행하여, 압축연산으로 인한 서버측의 CPU 자원사용을 최소화하였다.

Performance Impact of Large File Transfer on Web Proxy Caching: A Case Study in a High Bandwidth Campus Network Environment

  • Kim, Hyun-Chul;Lee, Dong-Man;Chon, Kil-Nam;Jang, Beak-Cheol;Kwon, Tae-Kyoung;Choi, Yang-Hee
    • Journal of Communications and Networks
    • /
    • 제12권1호
    • /
    • pp.52-66
    • /
    • 2010
  • Since large objects consume substantial resources, web proxy caching incurs a fundamental trade-off between performance (i.e., hit-ratio and latency) and overhead (i.e., resource usage), in terms of caching and relaying large objects to users. This paper investigates how and to what extent the current dedicated-server based web proxy caching scheme is affected by large file transfers in a high bandwidth campus network environment. We use a series of trace-based performance analyses and profiling of various resource components in our experimental squid proxy cache server. Large file transfers often overwhelm our cache server. This causes a bottleneck in a web network, by saturating the network bandwidth of the cache server. Due to the requests for large objects, response times required for delivery of concurrently requested small objects increase, by a factor as high as a few million, in the worst cases. We argue that this cache bandwidth bottleneck problem is due to the fundamental limitations of the current centralized web proxy caching model that scales poorly when there are a limited amount of dedicated resources. This is a serious threat to the viability of the current web proxy caching model, particularly in a high bandwidth access network, since it leads to sporadic disconnections of the downstream access network from the global web network. We propose a peer-to-peer cooperative web caching scheme to address the cache bandwidth bottleneck problem. We show that it performs the task of caching and delivery of large objects in an efficient and cost-effective manner, without generating significant overheads for participating peers.

Estimation-Based Load-Balancing with Admission Control for Cluster Web Servers

  • Sharifian, Saeed;Motamedi, Seyed Ahmad;Akbari, Mohammad Kazem
    • ETRI Journal
    • /
    • 제31권2호
    • /
    • pp.173-181
    • /
    • 2009
  • The growth of the World Wide Web and web-based applications is creating demand for high performance web servers to offer better throughput and shorter user-perceived latency. This demand leads to widely used cluster-based web servers in the Internet infrastructure. Load balancing algorithms play an important role in boosting the performance of cluster web servers. Previous load balancing algorithms suffer a significant performance drop under dynamic and database-driven workloads. We propose an estimation-based load balancing algorithm with admission control for cluster-based web servers. Because it is difficult to accurately determine the load of web servers, we propose an approximate policy. The algorithm classifies requests based on their service times and tracks the number of outstanding requests from each class in each web server node to dynamically estimate each web server load state. The available capacity of each web server is then computed and used for the load balancing and admission control decisions. The implementation results confirm that the proposed scheme improves both the mean response time and the throughput of clusters compared to rival load balancing algorithms and prevents clusters being overloaded even when request rates are beyond the cluster capacity.

  • PDF

Web Server Cluster Load Balancing

  • Kyung Sung;Kim, Seok-Soo
    • Journal of information and communication convergence engineering
    • /
    • 제2권2호
    • /
    • pp.106-109
    • /
    • 2004
  • This study designs a load balancer via direct routing that share a virtual service on a single IP address in the Linux system and suggests an efficient load balancing method to improve transmission speed in the web server cluster environment. It will increase performance and scalability with fast packet transfer and removing bottleneck problem by using TCP Splicing and Content-Aware Distributor method. This method is expected to be the noticeable technology that provides an important interface, which make application services for e-commerce effectively be applied to high-speed network infrastructure. At this time, it is required to study further on the optimum balancing method in the web server cluster environment so as to apply the hybrid (optimum load balancing method by software and hardware) method and improve the reuse of security cession based on high-speed TCP connections.

AJAX를 이용한 소방엔진펌프의 모니터링과 제어 시스템 구현 (Implementation of Monitoring and Control System for Fire Engine Pump using the AJAX)

  • 양오;이헌국
    • 반도체디스플레이기술학회지
    • /
    • 제15권3호
    • /
    • pp.40-45
    • /
    • 2016
  • In this paper, the fire engine pump is controlled and monitored by the AJAX (Asynchronous Javascript and Xml) in the web server. The embedded system with built-in system having a processor and a memory of high performance occurs many problems in transmitting the large amount of data in real time through the web server. The AJAX is different from HTML (Hyper Text Makeup Language) with java script technology and can make RIA (Rich Internet Application). It process the necessary data by using asynchronous and it take advantage of usefulness, accessibility, a fast response time. Using AJAX can build up web server with real time and monitoring that fire engine pump status, check processing pump memory in the event of fire, also remotely monitors can do. The web server system can control the fire engine pump as like the black box. The experimental results show the effectiveness and commercialize possibility.

빅데이터 분석을 위한 비용효과적 오픈 소스 시스템 설계 (Designing Cost Effective Open Source System for Bigdata Analysis)

  • 이종화;이현규
    • 지식경영연구
    • /
    • 제19권1호
    • /
    • pp.119-132
    • /
    • 2018
  • Many advanced products and services are emerging in the market thanks to data-based technologies such as Internet (IoT), Big Data, and AI. The construction of a system for data processing under the IoT network environment is not simple in configuration, and has a lot of restrictions due to a high cost for constructing a high performance server environment. Therefore, in this paper, we will design a development environment for large data analysis computing platform using open source with low cost and practicality. Therefore, this study intends to implement a big data processing system using Raspberry Pi, an ultra-small PC environment, and open source API. This big data processing system includes building a portable server system, building a web server for web mining, developing Python IDE classes for crawling, and developing R Libraries for NLP and visualization. Through this research, we will develop a web environment that can control real-time data collection and analysis of web media in a mobile environment and present it as a curriculum for non-IT specialists.

웹 서버 클러스터를 위한 효율적인 부하 분배 알고리즘 (An Efficient Load Balancing Algorithm for Web Server Cluster)

  • 김성수;정지영
    • 한국정보과학회논문지:정보통신
    • /
    • 제28권4호
    • /
    • pp.550-558
    • /
    • 2001
  • 최근 인터넷과 웹은 널리 사용되는 미디어로 인식되고 있으나 상대적으로 빈약한 성능과 낮은 가용도를 제공한다. 클러스터 구조는 고가용도와 고성능 그리고 확장성을 요구하는 웹 서비스나 정보시스템 같은 응용 분야에서 저 비용으로 유용하게 사용 가능하다. 본 논문에서는 고가용도 및 확장성을 제공하는 클러스터링 웹 서버를 대상으로 부하 분배기의 구조를 제안하고 문서 접근 확률과 문서 크기 정보를 이용한 부하 분배 알고리즘을 개발하여 성능을 최대화할 수 있도록 하였다. 특히 제안된 알고리즘은 각 서버 노드가 동일한 운영체제로 구성되지 않아도 되고 처리 용량이 서로 달라도 되며 기존의 알고리즘에 비해 캐쉬 적중률을 향상시킨다.

  • PDF