The Experts below are selected from a list of 1050 Experts worldwide ranked by ideXlab platform

Kil To Chong - One of the best experts on this subject based on the ideXlab platform.

  • APWeb - A Simple Client-Based Hybrid Robust Hash Routing Web Caching System (2HRCS)
    Advanced Web Technologies and Applications, 2004
    Co-Authors: Jong-ho Park, Kil To Chong
    Abstract:

    This paper proposes a simple Hybrid Robust Hash Routing Web Caching System(2HRCS) that clients can directly perform object allocation and load balancing without an additional DNS for load balancing. The proposed system reduces the cost of setup and operation by removing DNS that needs to balance the load in the existing system and does the original role of the DNS server for the shared proxies. The proposed system has clients with a Consistent Hashing method, so it extends its environment to other distributed web caching system that has caches of different capacity. A distributed web caching system is composed and tested to evaluate the performance. As a result, it shows superior performance to Consistent Hashing systems. Since this system can maintain performance of the existing system and reduce costs, it also has the advantage of constructing medium or small size CDN (Contents Delivery Network).

  • A simple client-based Hybrid Robust Hash Routing Web Caching System (2HRCS)
    Lecture Notes in Computer Science, 2004
    Co-Authors: Jong-ho Park, Kil To Chong
    Abstract:

    This paper proposes a simple Hybrid Robust Hash Routing Web Caching System(2HRCS) that clients can directly perform object allocation and load balancing without an additional DNS for load balancing. The proposed system reduces the cost of setup and operation by removing DNS that needs to balance the load in the existing system and does the original role of the DNS server for the shared proxies. The proposed system has clients with a Consistent Hashing method, so it extends its environment to other distributed web caching system that has caches of different capacity. A distributed web caching system is composed and tested to evaluate the performance. As a result, it shows superior performance to Consistent Hashing systems. Since this system can maintain performance of the existing system and reduce costs, it also has the advantage of constructing medium or small size CDN (Contents Delivery Network).

David R. Karger - One of the best experts on this subject based on the ideXlab platform.

  • Web caching with Consistent Hashing
    1999
    Co-Authors: David R. Karger, Alex Sherman, Andy Berkheimer, Bill Bogstad, Rizwan S. Dhanidina, Ken Iwamoto, Brian Kim, Luke Matkins, Yoav Yerushalmi
    Abstract:

    Ak ey performance measure for the World Wide Web is the speed with which content is served to users. As traff ic on the Web increases, users are faced with increasing delays and failures in data delivery. Web caching is one of the key strategies that has been explored to improve performance. An important issue in many caching systems is how to decide what is cached where at any given time. Solutions have included multicast queries and directory schemes. In this paper, we offer a new Web caching strategy based on Consistent Hashing .C onsistent Hashing provides an alternative to multicast and directory schemes, and has several other advantages in load balancing and fault tolerance. Its performance was analyzed theoretically in previous work; in this paper we describe the implementation of a Consistent-Hashing-based system and experiments that support our thesis that it can provide performance improvements.  1999 Published by Elsevier Science B.V. All rights reserved.

  • Consistent Hashing and random trees distributed caching protocols for relieving hot spots on the world wide web
    Symposium on the Theory of Computing, 1997
    Co-Authors: David R. Karger, Eric Lehman, Tom Leighton, Rina Panigrahy, Matthew S Levine, Daniel M Lewin
    Abstract:

    We describe a family of caching protocols for distrib-uted networks that can be used to decrease or eliminate the occurrence of hot spots in the network. Our protocols are particularly designed for use with very large networks such as the Internet, where delays caused by hot spots can be severe, and where it is not feasible for every server to have complete information about the current state of the entire network. The protocols are easy to implement using existing network protocols such as TCP/IP, and require very little overhead. The protocols work with local control, make efficient use of existing resources, and scale gracefully as the network grows. Our caching protocols are based on a special kind of Hashing that we call Consistent Hashing. Roughly speaking, a Consistent hash function is one which changes minimally as the range of the function changes. Through the development of good Consistent hash functions, we are able to develop caching protocols which do not require users to have a current or even Consistent view of the network. We believe that Consistent hash functions may eventually prove to be useful in other applications such as distributed name servers and/or quorum systems.

  • STOC - Consistent Hashing and random trees: distributed caching protocols for relieving hot spots on the World Wide Web
    Proceedings of the twenty-ninth annual ACM symposium on Theory of computing - STOC '97, 1997
    Co-Authors: David R. Karger, Eric Lehman, Tom Leighton, Rina Panigrahy, Matthew S Levine, Daniel M Lewin
    Abstract:

    We describe a family of caching protocols for distrib-uted networks that can be used to decrease or eliminate the occurrence of hot spots in the network. Our protocols are particularly designed for use with very large networks such as the Internet, where delays caused by hot spots can be severe, and where it is not feasible for every server to have complete information about the current state of the entire network. The protocols are easy to implement using existing network protocols such as TCP/IP, and require very little overhead. The protocols work with local control, make efficient use of existing resources, and scale gracefully as the network grows. Our caching protocols are based on a special kind of Hashing that we call Consistent Hashing. Roughly speaking, a Consistent hash function is one which changes minimally as the range of the function changes. Through the development of good Consistent hash functions, we are able to develop caching protocols which do not require users to have a current or even Consistent view of the network. We believe that Consistent hash functions may eventually prove to be useful in other applications such as distributed name servers and/or quorum systems.

Daniel M Lewin - One of the best experts on this subject based on the ideXlab platform.

  • Consistent Hashing and random trees distributed caching protocols for relieving hot spots on the world wide web
    Symposium on the Theory of Computing, 1997
    Co-Authors: David R. Karger, Eric Lehman, Tom Leighton, Rina Panigrahy, Matthew S Levine, Daniel M Lewin
    Abstract:

    We describe a family of caching protocols for distrib-uted networks that can be used to decrease or eliminate the occurrence of hot spots in the network. Our protocols are particularly designed for use with very large networks such as the Internet, where delays caused by hot spots can be severe, and where it is not feasible for every server to have complete information about the current state of the entire network. The protocols are easy to implement using existing network protocols such as TCP/IP, and require very little overhead. The protocols work with local control, make efficient use of existing resources, and scale gracefully as the network grows. Our caching protocols are based on a special kind of Hashing that we call Consistent Hashing. Roughly speaking, a Consistent hash function is one which changes minimally as the range of the function changes. Through the development of good Consistent hash functions, we are able to develop caching protocols which do not require users to have a current or even Consistent view of the network. We believe that Consistent hash functions may eventually prove to be useful in other applications such as distributed name servers and/or quorum systems.

  • STOC - Consistent Hashing and random trees: distributed caching protocols for relieving hot spots on the World Wide Web
    Proceedings of the twenty-ninth annual ACM symposium on Theory of computing - STOC '97, 1997
    Co-Authors: David R. Karger, Eric Lehman, Tom Leighton, Rina Panigrahy, Matthew S Levine, Daniel M Lewin
    Abstract:

    We describe a family of caching protocols for distrib-uted networks that can be used to decrease or eliminate the occurrence of hot spots in the network. Our protocols are particularly designed for use with very large networks such as the Internet, where delays caused by hot spots can be severe, and where it is not feasible for every server to have complete information about the current state of the entire network. The protocols are easy to implement using existing network protocols such as TCP/IP, and require very little overhead. The protocols work with local control, make efficient use of existing resources, and scale gracefully as the network grows. Our caching protocols are based on a special kind of Hashing that we call Consistent Hashing. Roughly speaking, a Consistent hash function is one which changes minimally as the range of the function changes. Through the development of good Consistent hash functions, we are able to develop caching protocols which do not require users to have a current or even Consistent view of the network. We believe that Consistent hash functions may eventually prove to be useful in other applications such as distributed name servers and/or quorum systems.

Jong-ho Park - One of the best experts on this subject based on the ideXlab platform.

  • APWeb - A Simple Client-Based Hybrid Robust Hash Routing Web Caching System (2HRCS)
    Advanced Web Technologies and Applications, 2004
    Co-Authors: Jong-ho Park, Kil To Chong
    Abstract:

    This paper proposes a simple Hybrid Robust Hash Routing Web Caching System(2HRCS) that clients can directly perform object allocation and load balancing without an additional DNS for load balancing. The proposed system reduces the cost of setup and operation by removing DNS that needs to balance the load in the existing system and does the original role of the DNS server for the shared proxies. The proposed system has clients with a Consistent Hashing method, so it extends its environment to other distributed web caching system that has caches of different capacity. A distributed web caching system is composed and tested to evaluate the performance. As a result, it shows superior performance to Consistent Hashing systems. Since this system can maintain performance of the existing system and reduce costs, it also has the advantage of constructing medium or small size CDN (Contents Delivery Network).

  • A simple client-based Hybrid Robust Hash Routing Web Caching System (2HRCS)
    Lecture Notes in Computer Science, 2004
    Co-Authors: Jong-ho Park, Kil To Chong
    Abstract:

    This paper proposes a simple Hybrid Robust Hash Routing Web Caching System(2HRCS) that clients can directly perform object allocation and load balancing without an additional DNS for load balancing. The proposed system reduces the cost of setup and operation by removing DNS that needs to balance the load in the existing system and does the original role of the DNS server for the shared proxies. The proposed system has clients with a Consistent Hashing method, so it extends its environment to other distributed web caching system that has caches of different capacity. A distributed web caching system is composed and tested to evaluate the performance. As a result, it shows superior performance to Consistent Hashing systems. Since this system can maintain performance of the existing system and reduce costs, it also has the advantage of constructing medium or small size CDN (Contents Delivery Network).

Zhou Gang - One of the best experts on this subject based on the ideXlab platform.

  • A new cooperative Web caching system based on Consistent Hashing
    Journal of Computer Applications, 2006
    Co-Authors: Zhou Gang
    Abstract:

    A new cooperative Web caching system (CHRCS) based on Consistent Hashing function was proposed. Aiming at reducing the multilevel latency in traditional cooperative Web caching systems, a efficient location and routing schema of Web objects was designed,through which a Web request can reach the target cache by only one hash computation and through less than one transfer. The strategy of invalidation-triggering was assumed to solve the problem of routing consistency, which reduced network traffic and made system more robust and scalable. Simulation results show that the performance of CHRCS is much better than that of systems of Internet cache protocol(ICP) and cache array routing protocol(CARP).