基于Windows Server Failover Cluster的Apache故障转移集群应用实践

在当前互联网时代,Web应用程序的高可用性和可靠性是确保业务持续运行的关键因素。针对Apache Web服务器,介绍了利用Windows Server 2019 Failover Cluster构建Apache故障转移集群的实践方案。通过配置两个节点的故障转移集群,当某个节点发生故障时,Apache服务将自动在另一个节点上重新启动,从而最大程度地减少系统中断的时间,提高Web应用的可用性。详细阐述了集群搭建的具体步骤、配置要点、集群验证方法以及运行时的监控与维护方法,为构建高可用Apache Web服务器提供一种实用的解决方案。

A ＂cluster＂ based search scheme in peer-to-peer network

This paper presents a "cluster" based search scheme in peer-to-peer network. The idea is based on the fact that data distribution in an information society has structured feature. We designed an algorithm to cluster peers that have similar interests. When receiving a query request, a peer will preferentially forward it to another peer which belongs to the same cluster and shares more similar interests. By this way search efficiency will be remarkably improved and at the same time good resilience against peer failure (the ability to withstand peer failure) is reserved.

Veritas Cluster Server集群成员仲裁与数据保护研究

伴随时代进步,由于服务器技术的迅猛发展,服务器系统被广泛应用于各行各业,极大地促进了社会经济的发展,但同时也对服务器系统的可靠性和稳定性提出了更高的要求。集群技术是近年来推出的一种解决高可用系统的方案。本文主要介绍了Veritas Cluster Server(VCS)集群系统。重点讨论了Veritas Cluster Server(VCS)集群系统的成员仲裁与数据保护。

Modeling and Performance Analysis of Dispatching Policies in Dispatcher-Based Web Server Cluster

There are two kinds of dispatching policies in content-aware web server cluster; segregation dispatching policy and mixture dispatching policy. Traditional scheduling algorithms all adopt mixture dispatching policy. They do not consider that dynamic requests＇ serving has the tendency to slow down static requests＇ serving, and that different requests have different resource demands, so they can not use duster＇s resource reasonably and effectively. This paper uses stochastic reward net （SRN） to model and analyze the two dispatching policies, and uses stochastic Petri net package （SPNP） to simulate the models. The simulation results and practical tests both show that segregation dispatching policy is better than mixture dispatching policy. The principle of segregation dispatching policy can guide us to design efficient scheduling algorithm.

A Web Server Cluster Solution Based on Twitter Storm

Single Web server would become a bottleneck that influences the availability and stability of Web service. Ten years ago, what had been proposed is to add Web servers for resolving this problem—Web Server Cluster. In recent years, the concept of cloud computing has got rapid development, and is becoming the future development trend of the IT industry. One of the characteristics of cloud computing is putting lots of computing resources together to provide users with a unified service. In this paper, we have proposed a new Cloud-Based Web Server Cluster Solution, based on the existing cloud computing model—Twitter Storm. It involves a new way to handle the web request from client and some other new features compared to the traditional Web Server Cluster. Combining with cloud computing, it would be the new trend of Web Server Cluster, and its feasibility is described in the paper too.

DYNAMIC REQUEST DISPATCHING ALGORITHM FOR WEB SERVER CLUSTER

Distributed architectures support increased load on popular web sites by dispatching client requests transparently among multiple servers in a cluster. Packet Single-Rewriting technology and client address hashing algorithm in ONE-IP technology which can ensure application-session-keep have been analyzed, an improved request dispatching algorithm which is simple, effective and supports dynamic load balance has been proposed. In this algorithm, dispatcher evaluates which server node will process request by applying a hash function to the client IP address and comparing the result with its assigned identifier subset; it adjusts the size of the subset according to the performance and current load of each server, so as to utilize all servers' resource effectively. Simulation shows that the improved algorithm has better performance than the original one.

Block-based logical hierarchical cluster for distributed multimedia architecture on demand server

A structure of logical hierarchical cluster for the distributed multimedia on demand server is proposed. The architecture is mainly composed of the network topology and the resource management of all server nodes. Instead of the physical network hierarchy or the independent management hierarchy, the nodes are organized into a logically hieraxchical cluster according to the multimedia block they caches in the midderware layer. The process of a member joining/leaving or the structure adjustment cooperatively implemented by all members is concerned with decentralized maintenance of the logical cluster hierarchy. As the root of each logically hierarchical cluster is randomly mapped into the system, the logical structure of a multimedia block is dynamically expanded across some regions by the two replication policies in different load state respectively. The local load diversion is applied to fine-tune the load of nodes within a local region but belongs to different logical hierarchies. Guaranteed by the dynamic expansion of a logical structure and the load diversion of a local region, the users always select a closest idle node from the logical hierarchy under the condition of topology integration with resource management.

SFES: A scalable, fault-tolerant, efficient search scheme in a peer-to-peer network

This paper presents SFES: a scalable, fault-tolerant, efficient search scheme in a peer-to-peer network. The idea is based on the fact that data distribution in an information society has structured features. We designed an algorithm to cluster peers that have similar interests. When receiving a query request, a peer will preferentially forward it to another peer which belongs to the same cluster and shares more similar interests. By this method, search efficiency will be remarkably improved and at the same time good resistance against peer failure (the ability to withstand peer failure) is reserved. Keyword partial-match is supported, too.

Reliability analysis of web server cluster systems based on proportional hazards model

An approach for web server cluster(WSC)reliability and degradation process analysis is proposed.The reliability process is modeled as a non-homogeneous Markov process(NHMH)composed of several non-homogeneous Poisson processes(NHPPs).The arrival rate of each NHPP corresponds to the system software failure rate which is expressed using Cox s proportional hazards model(PHM)in terms of the cumulative and instantaneous load of the software.The cumulative load refers to software cumulative execution time,and the instantaneous load denotes the rate that the users requests arrive at a server.The result of reliability analysis is a time-varying reliability and degradation process over the WSC lifetime.Finally,the evaluation experiment shows the effectiveness of the proposed approach.

A LIMITED RESOURCE VECTOR LOAD-BALANCING ALGORITHM FOR SOFTSWITCH-BASED HETEROGENEOUS CLUSTERED MEDIA SERVER

Based on the system feature of softswitch-based heterogeneous clustered media server, this paper proposed a limited resource vector load-balancing algorithm. The purpose of the algorithm was to balance the load of clusters by utilizing all system resources effectively and to avoid violent shaking of the system per- formance. A lot of simulations on the Petri net model of load balance system are conducted and the algorithm is compared with some traditional algorithms on balancing ability for heterogeneity, system throughput, re- quest response time and performance stability. The results of simulations show that the algorithm achieves system higher performance and it has excellent ability to deal with the heterogeneity of clustered media server.

A NEW DYNAMIC QUOTA-BASED ADMISSION CONTROL WITH SUB-NEGOTIATION FOR SOFTSWITCH-BASED CLUSTERED MEDIA SERVER

Based on the demand of the admission control of softswitch-based clustered media server, this pa- per proposed a new dynamic quota-based admission control algorithm that has a sub-negotiation process. The strongpoint of quota-based algorithm had been inherited in the algorithm and at the same time some new ideas had also been introduced into it. Simulations of the algorithm had been conducted on the Petri net model and the results show that this algorithm has excellent performance. In order to find the optimal resource quota set- ting in real time, the paper proposed two approximation analysis methods. It can be seen from analysis results that these two methods can be used to get sub-optimal quota values quickly and effectively. These two ap- proximation analysis methods will play important roles in implementation of the algorithm in system.

使用Cluster Shared Volume时，我需要在Windows Server 2008 R2群集网络中启用哪些服务？

在Windows Clustering的早期版本中，你只需要在NIC群集通信中使用TCP／IP服务。管理员通常禁用File and Print Sharing for Microsoft Networks和CIient for MicrosoftNetworks服务功能。如果你正在使用CIuster Shared Volume，当Cluster Shared Volume需要在群集网络（该网络也用于CSV通信）中执行SMB通信时，情况将发生变化。你必须启用以下服务，如图1。

如何在Exchange Server 2007中部署Cluster Continuous Replication——在多台服务器中实现自动失败转移

如果你有多台Exchange Server2007服务器。Cluster Continuous Replication为我们提供了高可用性和自动失败转移的功能。下面。让我们来学习如何准备和配置CCR。

LONGSHINE CLUSTER SERVER集群解决方案

该方案运行于标准的TCP／IP协议网络之上的，可以将不同生产厂家、不同硬件配置的计算机通过网络联接在一起，作为一个单一的网站服务器对外服务，同时，它还可以自动检测整个系统中的硬件、操作系统、网员服务、守护进程等故障，并智能地切换到另一台服务器上，从而绕过有故障的机器来增加容错性。

微软发布全新产品Windows Compute Cluster Server 2003

2006年10月24日．微软（中国）有限公司宣布在中国正式发布Windows Compute Cluster Server 2003。Windows Compute Cluster Server 2003是专门设计用来运行并行化高性能计算（HPC）的全新软件产品．该产品的发布标志着微软正式进军日益重要的高性能计算领域．并在高端企业级市场上再次掀起关注热潮。微软公司技术计算副总裁Tony Hey先生、微软（中国）有限公司副总经理兼服务器产品总监孙建东先生、微软中国研发集团服务器及开发工具事业部总监、微软亚洲工程院上海分院院长谢恩伟先生出席了发布仪式。微软在高性能计算领域的战略合作伙伴上海高性能计算中心的王普勇主任，在高性能计算平台上开发高级CAE工具的独立软件开发商安世亚太（ANSYS—China）公司总裁张国明先生，曙光公司技术支持部总经理邵宗有先生也在发布会上发表了讲话。

一种联合边缘服务器部署与服务放置的方法

边缘计算(EC)在靠近用户的网络边缘部署边缘服务器(ES),并将服务放置在ES上,从而可以满足用户的服务需求。独立研究ES部署和服务放置问题的成果已有很多,但两者存在高度耦合关系。考虑到EC系统的收益,有必要提供付费服务,使得EC系统处理用户服务请求时会获得相应收入。同时,EC系统处理用户服务请求时会产生时延和能耗成本,为了最大化EC系统的收益,在用户服务请求和服务价格不同的约束下,需要合适的服务放置方案来提高EC系统的收益。为此,在ES与基站之间的位置关系、ES部署和服务放置之间的耦合关系、服务副本数和服务价格等约束下,提出一种包括改进的k-means算法和多智能体强化学习算法的两步方法,使EC系统的收益最大化。首先,构建一个联合ES部署和服务放置模型,其中ES部署明确考虑了基站之间的位置关系,服务放置明确考虑了ES部署的位置,以及不同的服务请求和价格;然后,基于基站的位置关系和基站的服务请求负载,通过带约束的k-means算法,在不同约束条件下分别确定最佳的ES部署位置以及ES的协作域;最后,以最大化EC系统收益为目标,通过多智能体强化学习算法在ES上放置服务。实验结果表明,与对比方法相比,所提方法能够提高收益7%~23%。

面向O-RAN的多级异构边缘资源分配与部署

为应对开放型无线接入网(Open Radio Access Network,O-RAN)中的数据传输成本过高及网络兼容不足等问题,研究了面向O-RAN的多级边缘服务资源分配与部署联合优化问题。首先,利用四层融合模型将多目标联合优化问题转化为异构边缘服务器数量选择及位置确定问题,并提出了一种负载约束和迭代优化的异构边缘服务器资源分配算法,解决了O-RAN网络中的异构资源分配与数据传输问题。然后,提出了一种能效驱动的异构节点部署优化算法,解决了多级异构资源最佳部署位置问题。最后,利用上海电信基站的真实数据集,验证了所提资源优化与部署算法的有效性,实验结果表明,所提算法较其它算法在部署成本上至少降低了22.5%,能效比值上至少提高了25.96%。

Web-Server集群结构与多任务实时调度的应用研究

探讨了开发Web-Server集群系统所需要解决的主要技术问题,以及当前计算机领域中的部分研究成果,并结合实际应用的需要,讨论了Web-Server集群技术在基于Web的电工电子实验系统中的应用,给出了该系统的结构模型,并详细分析了所采取的有效的任务实时调度策略,进行了算法描述。结合所采用的动、静态任务调度算法,实现了基于集群的远程实验系统的开发,获得了良好的教学和科研效果。

可扩展并行Web Server集群技术

采用并行Ｗｅｂ Ｓｅｒｖｅｒ 集群技术实现高性能Ｗ ｅｂ Ｓｅｒｖｅｒ已经成为一种趋势． 该技术具有性能高、可扩展性好、可靠性高、成本低等优点． 本文介绍了我们研制的ＴＨＷｅｂ Ｃｌｕｓｔｅｒ的工作原理、组成结构和所采用的几种关键技术， 并与现有的技术和方法进行了比较． 本文还简要介绍了ＴＨＷｅｂ Ｃｌｕｓｔｅｒ 上开发的两个应用系统ＴＨＷｅｂ Ｄｉｇｇｅｒ（信息挖掘工具）和ＴＨＷ ｅｂ Ｓｅａｒｃｈ（搜索引擎）， 并以此说明Ｗ ｅｂ Ｓｅｒｖｅｒ

基于VMware Server的课程群实验平台的应用

先对传统数据库课程群实验中出现的问题进行阐述,接着介绍VMware Server体系结构,并提出了采用VMware Serv-er软件虚拟数据库课程群实验平台,最后给出该课程群实验平台的优势。实践证明,VMware Server对提升实验室管理与维护,提高服务器硬件使用效率,加强学生动手能力,有着非常积极的意义。