• Title/Summary/Keyword: Web Cluster System

Search Result 118, Processing Time 0.024 seconds

Vehicular Web Server Cluster Design for Next Generation Centralized Navigation Services (차세대 집중형 항행 서비스를 위한 이동체 웹 서버 클러스터 설계)

  • Kim, Ronny Yongho;Kim, Young Yong
    • Journal of Advanced Navigation Technology
    • /
    • v.13 no.5
    • /
    • pp.669-676
    • /
    • 2009
  • HTTP or audio/video streaming services are good candidates for future centralized navigation system and in order to provide stability for such services, service providers use a cluster of web servers. In this paper, we provide the criteria for web server cluster design of vehicular users with consideration of differentiated access per different user classes. Several feasible scenarios are examined and their performance analysis using queueing theory is presented to provide the foundation for web server cluster design using traffic load balancer. Through the thorough analysis, efficient criteria for traffic load balancer design is derived. In order to satisfy users' service requirements, priority services controlled by traffic load balancer are considered and analyzed. We also provide the evaluation of the accuracy of the analytical model through simulation.

  • PDF

A study on high availability of the linux clustering web server (리눅스 클러스터링 웹 서버의 고가용성에 대한 연구)

  • 박지현;이상문;홍태화;김학배
    • 제어로봇시스템학회:학술대회논문집
    • /
    • 2000.10a
    • /
    • pp.88-88
    • /
    • 2000
  • As more and more critical commercial applications move on the Internet, providing highly available servers becomes increasingly important. One of the advantages of a clustered system is that it has hardware and software redundancy. High availability can be provided by detecting node or daemon failure and reconfiguring the system appropriately so that the workload can be taken over bi the remaining nodes in the cluster. This paper presents how to provide the guaranteeing high availability of clustering web server. The load balancer becomes a single failure point of the whole system. In order to prevent the failure of the load balancer, we setup a backup server using heartbeat, fake, mon, and checkpointing fault-tolerance method. For high availability of file servers in the cluster, we setup coda file system. Coda is a advanced network fault-tolerance distributed file system.

  • PDF

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

  • Kim, Sung-Soo;Chung, Ji-Yung
    • Journal of KIISE:Information Networking
    • /
    • v.28 no.4
    • /
    • pp.550-558
    • /
    • 2001
  • 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. In this paper, we propose a load balancer architecture under the web server cluster that provides high-availability, high performance and scalability. In addtion, we propose an efficient load balancing algorithm that considers access rate and size of documents. Specially, our algorithm does not require the nodes running under similar configurations and the same operating system. Also, server cache can be utilized more efficiently.

  • PDF

Library Management and Services for Software Component Reuse on the Web (Web 소프트웨어 컴포넌트 재사용을 위한 라이브러리 관리와 서비스)

  • Lee, Sung-Koo
    • Journal of KIISE:Software and Applications
    • /
    • v.29 no.1_2
    • /
    • pp.10-19
    • /
    • 2002
  • In searching and locating a collection of components on the Web, users require a Web browser. Since the Web libraries tend to grow rapidly, there needs to be an effective way to organize and manage such large libraries. Traditional Web-based library(retrieval) systems provide various classification scheme and retrieval services to store and retrieve components. However, these systems do not include invaluable services, for example, enabling users to grasp the overall contents of the library at the beginning of retrieval. This paper discusses a Web-based library system, which provides the efficient management of object-oriented components and a set of services beyond simple component store and retrieval. These services consist of component comprehension through a reverse engineering process, automated summary extraction, and comprehension-based retrieval. Also, The performance of an automated cluster-based classification scheme adopted on the system is evaluated and compared with the cluster-based classification scheme adopted on the system is evaluated and compared with the performance of two other systems using traditional classification scheme.

PDFindexer: Distributed PDF Indexing system using MapReduce

  • Murtazaev, JAziz;Kihm, Jang-Su;Oh, Sangyoon
    • International Journal of Internet, Broadcasting and Communication
    • /
    • v.4 no.1
    • /
    • pp.13-17
    • /
    • 2012
  • Indexing allows converting raw document collection into easily searchable representation. Web searching by Google or Yahoo provides subsecond response time which is made possible by efficient indexing of web-pages over the entire Web. Indexing process gets challenging when the scale gets bigger. Parallel techniques, such as MapReduce framework can assist in efficient large-scale indexing process. In this paper we propose PDFindexer, system for indexing scientific papers in PDF using MapReduce programming model. Unlike Web search engines, our target domain is scientific papers, which has pre-defined structure, such as title, abstract, sections, references. Our proposed system enables parsing scientific papers in PDF recreating their structure and performing efficient distributed indexing with MapReduce framework in a cluster of nodes. We provide the overview of the system, their components and interactions among them. We discuss some issues related with the design of the system and usage of MapReduce in parsing and indexing of large document collection.

Similarity measure for P2P processing of semantic data (시맨틱웹 데이터의 P2P 처리를 위한 유사도 측정)

  • Kim, Byung Gon;Kim, Youn Hee
    • Journal of Korea Society of Digital Industry and Information Management
    • /
    • v.6 no.4
    • /
    • pp.11-20
    • /
    • 2010
  • Ontology is important role in semantic web to construct and query semantic data. Because of dynamic characteristic of ontology, P2P environment is considered for ontology processing in web environment. For efficient processing of ontology in P2P environment, clustering of peers should be considered. When new peer is added to the network, cluster allocation problem of the new peer is important for system efficiency. For clustering of peers with similar chateristics, similarlity measure method of ontology in added peer with ontologies in other clusters is needed. In this paper, we propose similarity measure techniques of ontologies for clustering of peers. Similarity measure method in this paper considered ontology's strucural characteristics like schema, class, property. Results of experiments show that ontologies of similar topics, class, property can be allocated to the same cluster.

Integrated Linux Cluster System Administration Tool (리눅스 클러스터 시스템 통합 관리 도구)

  • 김은회;김지연;박용관;권성주;최재영
    • Journal of KIISE:Computing Practices and Letters
    • /
    • v.8 no.6
    • /
    • pp.639-646
    • /
    • 2002
  • In this paper, we discuss the system configuration and the design issues of CATS-i, a set of installation and administration tools for Linux cluster systems. CATS-i enables users to manage cluster systems easily, quickly, and safety. It integrates many functions, ranging from installing operating systems and applications to real-time monitoring and management of various important resources. In addition, batch job submission and management are included. These functions support a single system image. Finally, a powerful graphic user interface based on Java lets users quickly understand the cluster status and conveniently use the CATS-i on the Web.

Design and Implementation of a Web Crawler System for Collection of Structured and Unstructured Data (정형 및 비정형 데이터 수집을 위한 웹 크롤러 시스템 설계 및 구현)

  • Bae, Seong Won;Lee, Hyun Dong;Cho, DaeSoo
    • Journal of Korea Multimedia Society
    • /
    • v.21 no.2
    • /
    • pp.199-209
    • /
    • 2018
  • Recently, services provided to consumers are increasingly being combined with big data such as low-priced shopping, customized advertisement, and product recommendation. With the increasing importance of big data, the web crawler that collects data from the web has also become important. However, there are two problems with existing web crawlers. First, if the URL is hidden from the link, it can not be accessed by the URL. The second is the inefficiency of fetching more data than the user wants. Therefore, in this paper, through the Casper.js which can control the DOM in the headless brwoser, DOM event is generated by accessing the URL to the hidden link. We also propose an intelligent web crawler system that allows users to make steps to fine-tune both Structured and unstructured data to bring only the data they want. Finally, we show the superiority of the proposed crawler system through the performance evaluation results of the existing web crawler and the proposed web crawler.

Back-end Prefetching Scheme for Improving the Performance of Cluster-based Web Servers (클러스터 웹 서버에서 성능 향상을 위한 노드간 선인출 기법)

  • Park, Seon-Yeong;Park, Do-Hyeon;Lee, Joon-Won;Cho, Jung-Wan
    • Journal of KIISE:Computer Systems and Theory
    • /
    • v.29 no.5
    • /
    • pp.265-273
    • /
    • 2002
  • With the explosive growth of WWW traffic, there is an increasing demand for the high performance Web servers to provide a stable Web service to users. The cluster-based Web server is a solution to core with the heavy access from users, easily scaling the server according to the loads. In the cluster-based Web sewer, a back-end node may not be able to serve some HTTP requests directly because it does not have the requested contents in its main memory. In this case, the back-end node has to retrieve the requested contents from its local disk or other back-end nodes in the cluster. To reduce service latency, we introduce a new prefetch scheme. The back-end nodes predict the next HTTP requests and prefetch the contents of predicted requests before the next requests arrive. We develop three prefetch algorithms bated on some useful information gathered from many clients'HTTP requests. Through trace-driven simulation, the service latency of the prefetch scheme is reduced by 10 ~ 25% as compared with no prefetch scheme. Among the proposed prefetch algorithms, Time and Access Probability-based Prefetch (TAP2) algorithm, which uses the access probability and the inter-reference time of Web object, shows the best performance.

BioCC: An Openfree Hypertext Bio Community Cluster for Biology

  • Gong Sung-Sam;Kim Tae-Hyung;Oh Jung-Su;Kwon Je-Keun;Cho Su-An;Bolser Dan;Bhak Jong
    • Genomics & Informatics
    • /
    • v.4 no.3
    • /
    • pp.125-128
    • /
    • 2006
  • We present an openfree hypertext (also known as wiki) web cluster called BioCC. BioCC is a novel wiki farm that lets researchers create hundreds of biological web sites. The web sites form an organic information network. The contents of all the sites on the BioCC wiki farm are modifiable by anonymous as well as registered users. This enables biologists with diverse backgrounds to form their own Internet bio-communities. Each community can have custom-made layouts for information, discussion, and knowledge exchange. BioCC aims to form an ever-expanding network of openfree biological knowledge databases used and maintained by biological experts, students, and general users. The philosophy behind BioCC is that the formation of biological knowledge is best achieved by open-minded individuals freely exchanging information. In the near future, the amount of genomic information will have flooded society. BioGG can be an effective and quickly updated knowledge database system. BioCC uses an opensource wiki system called Mediawiki. However, for easier editing, a modified version of Mediawiki, called Biowiki, has been applied. Unlike Mediawiki, Biowiki uses a WYSIWYG (What You See Is What You Get) text editor. BioCC is under a share-alike license called BioLicense (http://biolicense.org). The BioCC top level site is found at http://bio.cc/