本文研究了廣域網(wǎng)分布式集群的設(shè)計(jì)。與LVS 相比，這種集群的結(jié)構(gòu)雖然復(fù)雜，但
是能夠克服傳統(tǒng)集群的局限性，提供質(zhì)量好，容量大，性價(jià)比高的解決方案。根據(jù)一種稱之為CG 樹的分布式集群的抽象模型，作者設(shè)計(jì)了自己CG 樹算法。這種方案能有效的減少網(wǎng)絡(luò)節(jié)點(diǎn)之間的通信開銷，并能在集群系統(tǒng)出現(xiàn)故障時(shí)自動進(jìn)行調(diào)整，保證了高可用性。模擬實(shí)驗(yàn)結(jié)果表明，該系統(tǒng)具有很好的性能。
關(guān)鍵字：分布式 集群 CG 樹 LVS

Abstract：The paper studies the designs of wide-area distributed cluster. Although these kinds of cluster have more complex structure, they can overcome limitations of traditional cluster and provide resolutions with good quality, large capacity and high performance compared to LVS. Base on a model of distributed cluster, named CG tree, the author design his algorithms to manipulate CG trees. The scheme can efficiently reduce the cost of intercommunication between different networks, and can automatically adjust tree to ensure high availability when cluster faults occur. The result of simulated experiments indicates that the system has quite good performance.
Key words：Distributed cluster CG tree LVS