The search functionality is under construction.

Keyword Search Result

[Keyword] web server(4hit)

1-4hit
  • Distributing Requests by (around k)-Bounded Load-Balancing in Web Server Cluster with High Scalability

    MinHwan OK  Myong-soon PARK  

     
    PAPER-Parallel/Distributed Algorithms

      Vol:
    E89-D No:2
      Page(s):
    663-672

    Popular Web sites form their Web servers into Web server clusters. The Web server cluster operates with a load-balancing algorithm to distribute Web requests evenly among Web servers. The load-balancing algorithms founded on conventional periodic load-information update mechanism are not scalable due to the synchronized update of load-information. We propose a load-balancing algorithm that the load-information update is not synchronized by exploiting variant execution times of executing scripts in dynamic Web pages. The load-information of each server is updated 'individually' by a new load-information update mechanism, and the proposed algorithm supports high scalability based on this individual update. Simulation results have proven the improvement in system performance through another aspect of high scalability. Furthermore, the proposed algorithm guarantees some level of QoS for Web clients by fairly distributing requests. A fundamental merit of the proposed algorithm is its simplicity, which supports higher throughput of the Web switch.

  • A Feedback Controller for Overloaded Web Requests

    Sukyong JUNG  Bongjik KANG  Jangbok KIM  Kyunghee CHOI  Gihyun JUNG  

     
    LETTER-Multimedia Systems for Communications" Multimedia Systems for Communications

      Vol:
    E87-B No:9
      Page(s):
    2816-2819

    We propose a feedback controller to efficiently control web requests especially on overloaded networks. The controller is designed based on a feedback closed loop that prevents overload of web server and enforces target CPU utilization via controlling the amount of input web requests. The main contribution of this letter is the use of feedback control theory to design the controller that delicately regulates web requests even under the dynamic changes in processing power of web server. In contrast with many previous heuristic methods, the proposed controller uses a systematic approach to adaptively control web requests taking account of the dynamic behavior of web server. Simulation results performed in overloaded cases show that the proposed controller lets web server effectively control input web requests and reach its CPU utilization to desired levels in relatively small settling times.

  • Dynamic Mirroring for Efficient Web Server Performance Management

    Shadan SANIEPOUR E.   Behrouz Homayoun FAR  Jingde CHENG  

     
    PAPER-Network

      Vol:
    E85-B No:8
      Page(s):
    1585-1595

    Server performance is a major issue in improving the overall performance of the World Wide Web (WWW). This article introduces a dynamic mirroring-based approach to improve WWW servers' performance. In contrast to static mirroring, where mirror servers are allocated statically, our mirror servers' setup is driven by network traffic measurement. Performance in terms of latency is inferred from a queuing model. According to this model we show that latency of an overloaded server can be tuned by delegating a portion of the load to a cooperative mirror server. Cost is evaluated by the amount of load hosted by the mirror servers. The goal is then to keep the latency within a tolerable threshold, while minimizing the delegated load. This problem is formulated as a constrained optimization problem where the task is to assign a portion of load corresponding to each document to each mirror server. As the result of this work, we will have a balanced load among the servers, and a smoother traffic along the Internet, as well. Empirical results show that this approach can guarantee to maintain the performance while showing a significant decrease in the amount of load transferred to the mirror servers.

  • A Network-Supported Server Load Balancing Method: Active Anycast

    Miki YAMAMOTO  Hirokazu MIURA  Kenji NISHIMURA  Hiromasa IKEDA  

     
    PAPER

      Vol:
    E84-B No:6
      Page(s):
    1561-1568

    In server load balancing where replicated servers are dispersed geographically and accesses from clients are distributed to replicated servers, a way of distributing the accesses from clients to an adequate server plays an important role from the viewpoint of load balancing. In the paper, we propose a new network paradigm for server load balancing using active anycast. In active anycast, an end user only sends its request to group of servers using an anycast address. When this request arrives at an active router, it selects an adequate server from the viewpoint of load balancing and changes the anycast address of a packet to the unicast address of the selected server. The decision which server is the best one from the viewpoint of server load balancing is made by an active router rather than an end user, so active anycast is a network-initiated method. Simulation results show that active anycast can accomplish efficient server load balancing, even when a small part of routers are equipped with active network technology.