Abstract: Scalability of Web servers becomes more and more important because of the rapid development of world wide web. Cluster is one of the most popular techniques to resolve this problem. However, most of known Web servers cluster schemes have a lot of disadvantages, such as lack of self-organization, existing bottleneck of system. This paper proposes a novel approach to construct Web servers cluster based on a decentralized location algorithm, Pastry, in peer-to-peer network. This cluster scheme has many attractive features that are derived from decentralized location algorithms, such as scalability, self-organization, fault-tolerance and decentralization. With these features, this scheme can overcome the above shortcomings of traditional Web servers clusters.

Key words: Decentralized location; Web servers cluster; Self-organization; Scalability

摘要： 随着WWW 用户快速增加，人们对Web 服务器的需求也越来越高，集群是解决这个问题的一种重要方案。但是现有的Web 服务 器集群还存在自适应性差、有系统瓶颈等不足。该文在分散式查找算法Pastry 的基础之上，提出了一种新的Web 服务器集群方案。它具有分散式查找算法的诸多优点，如可扩展、自组织、高容错和分散特性，较好地克服了传统Web 服务器集群方案的不足。

关键词: 分散式查找；Web 服务器集群；自组织性；可扩展性