支持高负载的短信服务软件性能研究

目前普遍应用的在确定资源环境下的FCFS短信服务调度机制在处理请求过载的情况下难以保证服务质量,本文提出的系统自适应组网以及根据获益分析动态调整资源的模型,实验证明了对于提高服务器服务质量的有效性.     

支持高负载的短信服务软件性能研究

目前普遍应用的在确定资源环境下的FCFS短信服务调度机制在处理请求过载的情况下难以保证服务质量．本文提出的系统自适应组网以及根据获益分析动态调整资源的模型．实验证明了对于提高服务器服务质量的有效性．     

面向智能电子商务的移动Agent迁移策略研究

以智能电子商务系统为应用研究背景,综合考虑商家服务质量、网络负载等影响查询效率的因素,引入时间片概念,提出了一种基于商品智能搜索的Agent迁移策略模型。在模型中给出了一种客观准确的商家服务质量评价方法,采用申请与应答的方式有效避免了因网络负载和商家服务器负载等原因造成的迁移失败的问题,同时减少了网络带宽和服务器资源的浪费。     

流媒体服务器服务能力基准实验与性能模型

流媒体服务提供商需要了解如何对服务器的服务能力进行测试,如何对系统实时负荷进行估计.本文提出了一组基准实验,测量服务内容为变码率视频时,服务器提供不同质量和方式的视频点播服务的能力,得到与负载相关的服务器性能模型和实时负荷估计方法.实际系统上的验证实验表明,该性能模型可以准确刻画服务器的实时负荷.     

Collaborative multi-step mono-level multi-strategy classification

In this paper, we address the problem of retrieving a movie from a set of multimedia(MM) servers by the clients on a network. We consider a strategy in which multiple MM servers are deployed by the service provider (SP) to retrieve a requested MM movie to the clients, for minimizing the access time (the waiting time of the client before initiating the playback) and maximizes the system reliability. We design a movie retrieval strategy that explicitly considers issues such as reliability and/or availability factors of the multimedia servers and the communication channels in the problem formulation. We develop a mathematical model for this retrieval strategy and derive an optimal size of each movie portion that is expected to be rendered by each server. We then derive a closed-form expression for the access time of the MM document and the system reliability which gives a trade-off relationship between access time and reliability (availability) of the service by our strategy. We extend our study to investigate on the effect of sequencing of the servers, the order in which movie portions are to be retrieved, to minimize the access time and to maximize the system reliability. With system reliability factors, we identify an optimal sequence, which maximizes system reliability out of all possible retrieval sequences. We then propose two methods to retrieve any missing movie portions upon a server failure during the retrieval process. In order to measure the quality of service provided by the service provider to its customers, we introduce a QoS parameter that can tune the playback rate to avoid any data underflow or overflow situations. Then, from probabilistic perspective, we obtain an estimate of the failure time of a single server and its resulting missing movie portion caused by this server failure. We conduct rigorous simulation experiments to testify all the theoretical findings reported. Illustrative examples are provided for the ease of understanding.     

Power optimization for dynamic configuration in heterogeneous web server clusters

To reduce the environmental impact, it is essential to make data centers green, by turning off servers and tuning their speeds for the instantaneous load offered, that is, determining the dynamic configuration in web server clusters. We model the problem of selecting the servers that will be on and finding their speeds through mixed integer programming; we also show how to combine such solutions with control theory. For proof of concept, we implemented this dynamic configuration scheme in a web server cluster running Linux, with soft real-time requirements and QoS control, in order to guarantee both energy-efficiency and good user experience. In this paper, we show the performance of our scheme compared to other schemes, a comparison of a centralized and a distributed approach for QoS control, and a comparison of schemes for choosing speeds of servers.     

Effective-capacity-based stochastic delay guarantees for systems with time-varying servers, with an application to IEEE 802.11 WLANs

Many network applications rely on stochastic QoS guarantees. With respect to loss-related performance, the effective bandwidth/capacity theory has proved useful for calculating loss probabilities in queues with complex input and server processes and for formulating simple admission control tests to ensure associated QoS guarantees. This success has motivated the application of the theory for delay-related QoS too. However, up until now this application has been justified only heuristically for queues with variable service rate. The paper fills this gap by establishing rigorously that the effective bandwidth/capacity theory may be used for the asymptotically correct calculation and enforcement of delay tail-probabilities in systems with variable rate servers too. Subsequently, the paper applies the general results to IEEE 802.11 WLANs, by representing each IEEE 802.11 station as an On/Off server and employing the effective capacity function for this model. Comparison of analytical results with simulation validates the effectiveness of the On/Off IEEE 802.11 model for delay-related QoS, complementing earlier results on loss-related performance.     

网络服务器进程动态迁移实现技术研究

本文论述了网络服务器进程动态迁移（NSPDM）的实现技术,其主要工作是提取进程状态并在另一节点上再生该进程。使用NSPDM技术能够为用户提供不中断服务,是增强网络服务生存能力的重要手段。     

支持EJB动态分布的组件迁移模型与算法

Web应用服务器是Web计算环境下的新型中间件,为基于组件的分布式Web应用提供了基础运行平台.组件静态分布限制了事务性Web应用在运行期间适应执行环境变化的能力.为了满足Web应用的动态分布需求,Web应用服务器需在底层为组件提供一种动态迁移的能力.如何维持组件迁移前后的一致性是组件迁移中最棘手的问题之一.为解决此问题,定义了组件迁移一致性约束CMC(component migration constrains),并给出了在J2EE(Java 2 platform enterpnse edition)应用服务器中支持EJB(enterprise Java Bean)动态分布的组件迁移模型和SLB Copy,SFB_Copy,EB_Copy 3个迁移算法.分析得出SLB_Copy,SFB_Copy和EB_Copy均满足CMC约束.迁移模型和算法已在自主研制的Web应用服务器WebFrame2.0中实现,并已应用到自适应负载平衡、失效恢复等多个方面.     

一种两阶段自适应的IMS-Based IPTV应用服务器负载均衡策略

随着IPTV用户数目的增长,IPTV应用服务器的负担愈加繁重。在这种情况下,集群系统逐渐成为构建高性能和高服务质量的一种有效的应用服务器体系结构。保证应用服务器各节点的负载均衡,可以有效提高系统的吞吐量,提高IPTV服务质量。针对负载均衡问题,提出了一种基于IPTV用户行为特点的,两阶段自适应负载均衡策略,负载均衡器通过实时监控应用服务器集群内各节点的负载情况,动态修改各节点负载分配权值。算法在保持应用服务器各节点负载均衡的同时,维护用户会话的完整性,保证了服务质量QoS（Quality of Services）。仿真结果显示此算法具有较好的性能,能在保证服务质量的前提下有效地提高系统吞吐量。     

基于OSA的分布式应用服务器的管理模型设计

开放的业务平台是下一代核心网的关键技术,其中应用服务器又是提供开放业务的主要实现实体。ISC提出了两种应用服务器交互的框架,该文主要探讨的即是在此基础上提出的基于OSA的分布式应用服务器的实现框架比与其进行了比较。     

Stochastic modeling and analysis of hybrid mobility in reconfigurable distributed virtual machines

Virtualization provides a vehicle to manage the available resources and enhance their utilization in network computing. System dynamics requires virtual machines be distributed and reconfigurable. To construct reconfigurable distributed virtual machines, service migration moves the runtime services among physical servers when necessary. By incorporating the mobile agent technology, distributed virtual machines can improve their resource utilization and service availability significantly. This paper focuses on finding the optimal migration policies for service and agent migrations for high throughput in reconfigurable distributed virtual machines. We analyze three issues of this decision problem: migration candidate determination, migration timing and destination server selection. The service migration timing and destination server selection are formulated by two optimization models. We derive the optimal migration policy for distributed and heterogenous systems based on stochastic optimization theories. Renewal processes are applied to model the dynamics of migration. We solve the agent migration problem by dynamic programming and extend the optimal service migration decision by considering the interplay of the hybrid mobility. We verify the accuracy of our migration decision policy in simulations.     

A calculus for stochastic QoS analysis

The issue of Quality of Service (QoS) performance analysis in packet-switched networks has drawn a lot of attention in the networking community. There is a lot of work including an elegant theory under the name of network calculus, which focuses on analysis of deterministic worst case QoS performance bounds. In the meantime, researchers have studied stochastic QoS performance for specific schedulers. However, most previous works on deterministic QoS analysis or stochastic QoS analysis have only considered a server that provides deterministic service, i.e. deterministically bounded rate service. Few have considered the behavior of a stochastic server that provides input flows with variable rate service, for example wireless links. In this paper, we propose a stochastic network calculus to analyze the end-to-end stochastic QoS performance of a system with stochastically bounded input traffic over a series of deterministic and stochastic servers. We also prove that a server serving an aggregate of flows can be regarded as a stochastic server for individual flows within the aggregate. Based on this, the proposed framework is further applied to analyze per-flow stochastic QoS performance under aggregate scheduling.     

视频点播服务器的服务质量控制框架

视频点播服务器工作于开放的网络环境中,系统负载难以预测,其运行时资源瓶颈依赖于实时服务类型.基于性能模型和实时负荷估计方法,本文提出视频点播服务器的服务质量控制框架,提供系统负荷监控、准入控制和区分服务等三种服务质量控制.实际系统的验证实验表明,本文的方法可以有效的对系统负荷进行监控,确保系统负荷稳定在服务提供商希望的水平线以下,向不同级别的用户提供不同质量级别的服务.     

SLA-Driven Clustering of QoS-Aware Application Servers

In this paper, we discuss the design, implementation, and experimental evaluation of a middleware architecture for enabling service level agreement (SLA)-driven clustering of QoS-aware application servers. Our middleware architecture supports application server technologies with dynamic resource management: application servers can dynamically change the amount of clustered resources assigned to hosted applications on-demand so as to meet application-level quality of service (QoS) requirements. These requirements can include timeliness, availability, and high throughput and are specified in SLAs. A prototype of our architecture has been implemented using the open-source J2EE application server JBoss. The evaluation of this prototype shows that our approach makes possible JBoss' resource usage optimization and allows JBoss to effectively meet the QoS requirements of the applications it hosts, i.e., to honor the SLAs of those applications     

OnceAS/Q:一个面向QoS的Web应用服务器

网络分布计算环境下应用系统的需求多样化和复杂性的增长,要求位于中间件层次的Web应用服务器(web application server,简称WAS)从原来的"尽力而为"服务模型转变为服务质量(quality of service,简称QoS)保障模型,为具有不同需求的应用分别提供适宜的服务质量保障.目前的WAS系统在此方面仍然比较薄弱.OnceAS/Q是一个面向QoS的WAS系统,它以QoS规约为基础,为不同应用提供不同的QoS保障能力.OnceAS/Q实现了一个应用QoS保障框架,提供了一组QoS服务组件支持具有QoS需求的应用开发和运行.介绍了OnceAS/Q的体系结构和主要组件,详细阐述了两个关键问题,一是QoS规约的定义及其映射,另一个是面向QoS的服务组件和资源的动态重配.OnceAS/Q原型在Ecperf测试基准下,对其QoS保障能力进行了实验.实验数据表明,在较大规模的应用环境下,OnceAS/Q能够提供更好的服务质量,并且开销是可接受的.     

Server Allocation Algorithms for Tiered Systems

Many web-based systems have a tiered application architecture, in which a request needs to transverse all the tiers before finishing its processing. One of the most important QoS metrics for these applications is the expected response time for the user. Since the expected response time in any tier depends upon the number of servers allocated to this tier, and a request's total response time is the sum of the response times over all the tiers, many different configurations (number of servers allocated to each tier) can satisfy the expected response-time requirement. Naturally, one would like to find the configuration that minimizes the total system cost while satisfying the total response-time requirement. This is modeled as a non-linear optimization problem using an open-queuing network model of response time, which we call the server allocation problem for tiered systems (SAPTS). In this paper we study the computational complexity of SAPTS and design efficient algorithms to solve it. For a variable number of tiers, we show that the decision version of SAPTS is NP-complete. Then we design a simple two-approximation algorithm and a fully polynomial-time approximation scheme (FPTAS). If the number of tiers is a constant, we show that SAPTS is polynomial-time solvable. Furthermore, we design a fast polynomial-time exact algorithm to solve the important two-tier case. Most of our results extend to the general case in which each tier has an arbitrary response-time function.     

应用服务器中Web服务支持功能的设计与实现

随着Web服务技术的发展和步人实用，主流应用服务器给应用开发人员提供了在应用服务器上开发、部署和调用Web服务的功能。叙述了通过集成开源Web服务项目Axis的设计方案，在现有的符合J2EE1．3标准的应用服务器中增加Web服务支持功能，并说明了具体的实现结构，使得应用开发人员可以在该应用服务器上开发、部署和调用Web服务。     

共享式Web应用服务器集群的资源整合方法研究

PaaS(platform as a service)平台是一种重要的云计算服务类型,但传统的Web应用服务器集群管理方式无法为PaaS平台多承租和动态资源管理提供有效支持。针对上述问题,提出了一种基于进程隔离的共享式集群拓扑结构,支持多个Web应用服务器集群共享相同的物理服务器环境。同时给出了针对此共享集群的服务器整合方法,以满足租户应用的性能需求和提高服务器的有效资源使用率。实验证明,平台能够根据当前共享集群的状态选择适当数量的服务器,服务器整合方法有效可行。     

Energy-Efficient Redundant Execution of Processes in a Fault-Tolerant Cluster of Servers

This paper investigates into fault tolerance of cluster of servers and their energy efficiency to realize a reliable and energy aware server cluster system. A client issues a request to one server in a server cluster and the server sends a reply to the client in information systems. Once the server stops by fault, the client does not receive a reply of the request. Even if the request is performed on another server on detection of fault of the server, some QoS requirements like response time may not be satisfied. Hence, each request has to be redundantly performed on multiple servers to be tolerant of server faults. The redundant power consumption laxity-based (RPCLB) algorithm is discussed where multiple servers are selected to redundantly and energy-efficiently perform a request process in our previous studies. Since each application process is redundantly performed on more than one server, the larger amount of electric power is consumed. In this paper, we propose a novel and improved RPCLB (IRPCLB) algorithm to reduce the power consumption of servers, where once a process successfully terminates on one server, meaningless redundant processes are forced to terminate on the other servers. In the evaluation, we show the total power consumption of servers and total execution time of processes are reduced in homogeneous and heterogeneous types of clusters by the IRPCLB algorithm than the RPCLB and RR algorithms.