The Experts below are selected from a list of 4251 Experts worldwide ranked by ideXlab platform
J.h. No - One of the best experts on this subject based on the ideXlab platform.
-
DNS-based load balancing in Distributed Web-server systems
The Fourth IEEE Workshop on Software Technologies for Future Embedded and Ubiquitous Systems and the Second International Workshop on Collaborative Co, 2006Co-Authors: Y.s. Hong, J.h. NoAbstract:A cluster Web-server system can be deployed to support high request rates to Web application server (WAS) in Internet-banking. The domain name system (DNS) servers dispatch the client requests among the Web-servers through the URL-name to IP-address mapping mechanism. In this paper, we propose a cluster Web-server system arranged in the multiple logical ring connections, in which the DNS is integrated with an adaptive load balancing algorithm and evaluate the performance of the proposed Distributed Web-server system. We show the performance measurements for the proposed system
-
WORDS - Evaluation of fault-tolerant Distributed Web systems
10th IEEE International Workshop on Object-Oriented Real-Time Dependable Systems, 2005Co-Authors: Y.s. Hong, J.h. NoAbstract:Replication of information among multiple servers is necessary to service requests for Web application such as Internet banking. A dispatcher in Distributed Web systems distributes client requests among Web application servers and multiple dispatchers are also needed for fault-tolerant Web services. In this paper, we describe issues related to building fault-tolerant Distributed Web systems. We evaluate the performance of fault-tolerant Distributed Web systems based on replication. Our evaluation is conducted on LVS (Linux Virtual Server) and the Apache Web server using the request generator, LoadCube. We show some performance measurements for the systems.
-
Evaluation of fault-tolerant Distributed Web systems
10th IEEE International Workshop on Object-Oriented Real-Time Dependable Systems, 2005Co-Authors: Y.s. Hong, J.h. NoAbstract:Replication of information among multiple servers is necessary to service requests for Web application such as Internet banking. A dispatcher in Distributed Web systems distributes client requests among Web application servers and multiple dispatchers are also needed for fault-tolerant Web services. In this paper, we describe issues related to building fault-tolerant Distributed Web systems. We evaluate the performance of fault-tolerant Distributed Web systems based on replication. Our evaluation is conducted on LVS (Linux Virtual Server) and the Apache Web server using the request generator, LoadCube. We show some performance measurements for the systems.
Y.s. Hong - One of the best experts on this subject based on the ideXlab platform.
-
DNS-based load balancing in Distributed Web-server systems
The Fourth IEEE Workshop on Software Technologies for Future Embedded and Ubiquitous Systems and the Second International Workshop on Collaborative Co, 2006Co-Authors: Y.s. Hong, J.h. NoAbstract:A cluster Web-server system can be deployed to support high request rates to Web application server (WAS) in Internet-banking. The domain name system (DNS) servers dispatch the client requests among the Web-servers through the URL-name to IP-address mapping mechanism. In this paper, we propose a cluster Web-server system arranged in the multiple logical ring connections, in which the DNS is integrated with an adaptive load balancing algorithm and evaluate the performance of the proposed Distributed Web-server system. We show the performance measurements for the proposed system
-
WORDS - Evaluation of fault-tolerant Distributed Web systems
10th IEEE International Workshop on Object-Oriented Real-Time Dependable Systems, 2005Co-Authors: Y.s. Hong, J.h. NoAbstract:Replication of information among multiple servers is necessary to service requests for Web application such as Internet banking. A dispatcher in Distributed Web systems distributes client requests among Web application servers and multiple dispatchers are also needed for fault-tolerant Web services. In this paper, we describe issues related to building fault-tolerant Distributed Web systems. We evaluate the performance of fault-tolerant Distributed Web systems based on replication. Our evaluation is conducted on LVS (Linux Virtual Server) and the Apache Web server using the request generator, LoadCube. We show some performance measurements for the systems.
-
Evaluation of fault-tolerant Distributed Web systems
10th IEEE International Workshop on Object-Oriented Real-Time Dependable Systems, 2005Co-Authors: Y.s. Hong, J.h. NoAbstract:Replication of information among multiple servers is necessary to service requests for Web application such as Internet banking. A dispatcher in Distributed Web systems distributes client requests among Web application servers and multiple dispatchers are also needed for fault-tolerant Web services. In this paper, we describe issues related to building fault-tolerant Distributed Web systems. We evaluate the performance of fault-tolerant Distributed Web systems based on replication. Our evaluation is conducted on LVS (Linux Virtual Server) and the Apache Web server using the request generator, LoadCube. We show some performance measurements for the systems.
P.s. Yu - One of the best experts on this subject based on the ideXlab platform.
-
MASCOTS - Geographic load balancing for scalable Distributed Web systems
Proceedings 8th International Symposium on Modeling Analysis and Simulation of Computer and Telecommunication Systems (Cat. No.PR00728), 2000Co-Authors: V. Cardellini, M. Colajanni, P.s. YuAbstract:Users of highly popular Web sites may experience long delays when accessing information. Upgrading content site infrastructure from a single node to a locally Distributed Web cluster composed by multiple server nodes provides limited relief, because the cluster wide-area connectivity may become the bottleneck. A better solution is to distribute Web clusters over the Internet by placing content nodes in strategic locations. A geographically Distributed architecture where the Domain Name System (DNS) servers evaluate network proximity and users are served from the closest cluster reduces network impact on response time. On the other hand, serving closest requests only may cause unbalanced servers and may increase system impact on response time. To achieve a scalable Web system, we propose to integrate DNS proximity scheduling with an HTTP request redirection mechanism that any Web server can activate. We demonstrate through simulation experiments that this further dispatching mechanism augments the percentage of requests with guaranteed response time, thereby enhancing the Quality of Service of geographically Distributed Web sites. However, HTTP request redirection should be used selectively because the additional round-trip increases network impact on latency time experienced by users. As a further contribution, this paper proposes and compares various mechanisms to limit reassignments with no negative consequences on load balancing.
-
Geographic load balancing for scalable Distributed Web systems
Proceedings 8th International Symposium on Modeling Analysis and Simulation of Computer and Telecommunication Systems (Cat. No.PR00728), 2000Co-Authors: V. Cardellini, M. Colajanni, P.s. YuAbstract:Users of highly popular Web sites may experience long delays when accessing information. Upgrading content site infrastructure from a single node to a locally Distributed Web cluster composed by multiple server nodes provides limited relief, because the cluster wide-area connectivity may become the bottleneck. A better solution is to distribute Web clusters over the Internet by placing content nodes in strategic locations. A geographically Distributed architecture where the Domain Name System (DNS) servers evaluate network proximity and users are served from the closest cluster reduces network impact on response time. On the other hand, serving closest requests only may cause unbalanced servers and may increase system impact on response time. To achieve a scalable Web system, we propose to integrate DNS proximity scheduling with an HTTP request redirection mechanism that any Web server can activate. We demonstrate through simulation experiments that this further dispatching mechanism augments the percentage of requests with guaranteed response time, thereby enhancing the Quality of Service of geographically Distributed Web sites. However, HTTP request redirection should be used selectively because the additional round-trip increases network impact on latency time experienced by users. As a further contribution, this paper proposes and compares various mechanisms to limit reassignments with no negative consequences on load balancing.
H. Hassanein - One of the best experts on this subject based on the ideXlab platform.
-
Transparent Distributed Web caching with minimum expected response time
Conference Proceedings of the 2003 IEEE International Performance Computing and Communications Conference 2003., 2003Co-Authors: P. Martin, H. HassaneinAbstract:Web caching is a standard approach to improving the performance and quality of Web services. The effectiveness of a single cache in this environment, however, is relatively low. Cache hit rates of 40% or lower are typical in the Web. Distributed caching seeks to improve the effectiveness of Web caching by supporting the sharing of data across multiple cache servers. We describe the minimum expected response time (MRT) Distributed Web caching scheme. MRT uses a layer 5 switch to redirect cacheable HTTP requests transparently to the cache server with the minimum expected response time. The response time estimate produced is based on information about cache server content, cache server workload, Web server workload and network latency. We present simulation experiments to show that MRT outperforms existing Distributed Web caching schemes in terms of average HTTP request response times.
-
IPCCC - Transparent Distributed Web caching with minimum expected response time
Conference Proceedings of the 2003 IEEE International, 2003Co-Authors: P. Martin, H. HassaneinAbstract:Web caching is a standard approach to improving the performance and quality of Web services. The effectiveness of a single cache in this environment, however, is relatively low. Cache hit rates of 40% or lower are typical in the Web. Distributed caching seeks to improve the effectiveness of Web caching by supporting the sharing of data across multiple cache servers. We describe the minimum expected response time (MRT) Distributed Web caching scheme. MRT uses a layer 5 switch to redirect cacheable HTTP requests transparently to the cache server with the minimum expected response time. The response time estimate produced is based on information about cache server content, cache server workload, Web server workload and network latency. We present simulation experiments to show that MRT outperforms existing Distributed Web caching schemes in terms of average HTTP request response times.
-
LCN - Transparent Distributed Web caching
Proceedings LCN 2001. 26th Annual IEEE Conference on Local Computer Networks, 2001Co-Authors: Z. Liang, H. Hassanein, P. MartinAbstract:Layer 5 switching-based transparent Web caching intercepts HTTP requests and redirects requests according to their contents. This technique makes the deployment and configuration of a caching system easier and improves its performance by ensuring that non-cacheable HTTP requests bypass the cache servers. We propose a Load Balancing Layer 5 switching-based (LB-L5) Web caching scheme that uses the Layer 5 switching-based technique to support Distributed Web caching. We present simulation results that show that LB-L5 outperforms existing Web caching schemes, namely ICP, Cache Digest, and basic L5 transparent Web caching, in terms of cache server workload balancing and response time. LB-L5 is also shown to be more adaptable to high HTTP request intensity than the other schemes.
-
Transparent Distributed Web caching
Proceedings LCN 2001. 26th Annual IEEE Conference on Local Computer Networks, 2001Co-Authors: Z. Liang, H. Hassanein, P. MartinAbstract:Layer 5 switching-based transparent Web caching intercepts HTTP requests and redirects requests according to their contents. This technique makes the deployment and configuration of a caching system easier and improves its performance by ensuring that non-cacheable HTTP requests bypass the cache servers. We propose a Load Balancing Layer 5 switching-based (LB-L5) Web caching scheme that uses the Layer 5 switching-based technique to support Distributed Web caching. We present simulation results that show that LB-L5 outperforms existing Web caching schemes, namely ICP, Cache Digest, and basic L5 transparent Web caching, in terms of cache server workload balancing and response time. LB-L5 is also shown to be more adaptable to high HTTP request intensity than the other schemes.
V. Cardellini - One of the best experts on this subject based on the ideXlab platform.
-
Performance - Benchmarking Models and Tools for Distributed Web-Server Systems
Performance Evaluation of Complex Systems: Techniques and Tools, 2002Co-Authors: Mauro Andreolini, V. Cardellini, M. ColajanniAbstract:This tutorial reviews benchmarking tools and techniques that can be used to evaluate the performance and scalability of highly accessed Web-server systems. The focus is on design and testing of locally and geographically Distributed architectures where the performance evaluation is obtained through workload generators and analyzers in a laboratory environment. The tutorial identifies the qualities and issues of existing tools with respect to the main features that characterize a benchmarking tool (workload representation, load generation, data collection, output analysis and report) and their applicability to the analysis of Distributed Web-server systems.
-
MASCOTS - Geographic load balancing for scalable Distributed Web systems
Proceedings 8th International Symposium on Modeling Analysis and Simulation of Computer and Telecommunication Systems (Cat. No.PR00728), 2000Co-Authors: V. Cardellini, M. Colajanni, P.s. YuAbstract:Users of highly popular Web sites may experience long delays when accessing information. Upgrading content site infrastructure from a single node to a locally Distributed Web cluster composed by multiple server nodes provides limited relief, because the cluster wide-area connectivity may become the bottleneck. A better solution is to distribute Web clusters over the Internet by placing content nodes in strategic locations. A geographically Distributed architecture where the Domain Name System (DNS) servers evaluate network proximity and users are served from the closest cluster reduces network impact on response time. On the other hand, serving closest requests only may cause unbalanced servers and may increase system impact on response time. To achieve a scalable Web system, we propose to integrate DNS proximity scheduling with an HTTP request redirection mechanism that any Web server can activate. We demonstrate through simulation experiments that this further dispatching mechanism augments the percentage of requests with guaranteed response time, thereby enhancing the Quality of Service of geographically Distributed Web sites. However, HTTP request redirection should be used selectively because the additional round-trip increases network impact on latency time experienced by users. As a further contribution, this paper proposes and compares various mechanisms to limit reassignments with no negative consequences on load balancing.
-
Geographic load balancing for scalable Distributed Web systems
Proceedings 8th International Symposium on Modeling Analysis and Simulation of Computer and Telecommunication Systems (Cat. No.PR00728), 2000Co-Authors: V. Cardellini, M. Colajanni, P.s. YuAbstract:Users of highly popular Web sites may experience long delays when accessing information. Upgrading content site infrastructure from a single node to a locally Distributed Web cluster composed by multiple server nodes provides limited relief, because the cluster wide-area connectivity may become the bottleneck. A better solution is to distribute Web clusters over the Internet by placing content nodes in strategic locations. A geographically Distributed architecture where the Domain Name System (DNS) servers evaluate network proximity and users are served from the closest cluster reduces network impact on response time. On the other hand, serving closest requests only may cause unbalanced servers and may increase system impact on response time. To achieve a scalable Web system, we propose to integrate DNS proximity scheduling with an HTTP request redirection mechanism that any Web server can activate. We demonstrate through simulation experiments that this further dispatching mechanism augments the percentage of requests with guaranteed response time, thereby enhancing the Quality of Service of geographically Distributed Web sites. However, HTTP request redirection should be used selectively because the additional round-trip increases network impact on latency time experienced by users. As a further contribution, this paper proposes and compares various mechanisms to limit reassignments with no negative consequences on load balancing.
