Architecting and implementing distributed Web applications using the graph‐oriented approach

This paper presents a graph‐oriented framework, called WebGOP, for architecture modeling and programming of Web‐based distributed applications. WebGOP is based on the graph‐oriented programming (GOP) model, under which the components of a distributed program are configured as a logical graph and implemented using a set of operations defined over the graph. WebGOP reshapes GOP with a reflective object‐oriented design, which provides powerful architectural support in the World Wide Web environment. In WebGOP, the architecture graph is reified as an explicit object which itself is distributed over the network, providing a graph‐oriented context for the execution of distributed applications. The programmer can specialize the type of graph to represent a particular architecture style tailored for an application. WebGOP also has built‐in support for flexible and dynamic architectures, including both planned and unplanned dynamic reconfiguration of distributed applications. We describe the WebGOP framework, a prototypical implementation of the framework on top of SOAP, and a performance evaluation of the prototype. The prototype demonstrated the feasibility of our approach. Results of the performance evaluation showed that the overhead introduced by WebGOP over SOAP is reasonable and acceptable. Copyright © 2003 John Wiley & Sons, Ltd.     

一体化办公系统分布式部署

信息化的发展,移动互联的猛进,进一步催生了云计算的健康发展,在互联网环境下办公是IT发展的趋势,如何满足现代化办公的需要,如何建立高效、方便的运维方式,是我们认真考虑的问题。基于互联网,在系统架构时必须考虑可靠性、安全性,还要考虑系统能动态的方便扩充和访问流畅行,这便要求产品要有良好的系统架构,支持动态扩展和高效并发。本文以永中云办公为例,介绍了一体化办公系统分布式部署解决方案。     

Dynamic load‐balancing mechanism for distributed Java applications

Program environments or operating systems generally leave the decision on the allocation of program entities to the developer, offering either placement directives, or tools available through the manipulation of a graphical interface. These approaches cannot always take into account the dynamic behavior of applications, dynamicity in the execution environment or the heterogeneity of the execution platform. Transparent deployment algorithms are necessary for automizing and optimizing application distribution. The Adaptive Distributed Applications in Java (ADAJ) project deals with placement and migration of Java objects. It automatically deploys parallel Java applications on a cluster of workstations using monitoring information about the application behavior. The transparency obtained through the integration of these tools in the middleware makes such an environment easy to use and improves efficiency. Copyright © 2005 John Wiley & Sons, Ltd.     

Software release management for component‐based software

Software release management is the process through which software is made available to and obtained by its users. Until now, this process has been relatively straightforward. However, the emergence of component‐based software is complicating software release management. Increasingly, software is constructed via the assembly of pre‐existing, independently produced, and independently released components. Both developers and users of such software are affected by these complications. Developers need to accurately document the complex and changing dependencies among the components constituting the software. Users must be involved in locating, retrieving, and assembling components in order to appropriately bring the software into their particular environment. In this paper, we introduce the problem of release management for component‐based software and discuss SRM, a prototype software release management tool we have developed that supports both developers and users in the software release management process. Copyright © 2002 John Wiley & Sons, Ltd.     

Composing and scheduling service‐oriented applications in time‐triggered distributed real‐time Java environments

During the last decade, the number of distributed application domains with temporal requirements has significantly augmented, arising the necessity of exploring new concepts and paradigms that allow, on the one hand, the development of dynamic and flexible distributed applications and, on the other hand, the reusability of code. Service‐oriented paradigms have been successfully applied to distributed environments, increasing their flexibility and allowing the reusability of their components. Besides, distributed real‐time Java technologies have shown to be a good candidate to deploy real‐time distributed applications. This paper presents a model for service‐oriented applications on a time‐triggered distributed real‐time Java environment, focusing on the definition of the temporal model of an application and its schedulability, applying and evaluating this model in real‐time service‐oriented composition algorithms. Copyright © 2012 John Wiley & Sons, Ltd.     

分布式蠕虫蜜罐部署策略分析

蜜罐的捕获能力来自于其数量和分布位置,在同一网络拓扑中,运用合理的部署策略,可以部署最少的蜜罐,在最短的时间内捕获到蠕虫样本。本文讨论了蜜罐以及蠕虫扫描策略的研究内容,对红色代码蠕虫进行了深入的分析,根据随机扫描扫描策略建立了蜜罐部署策略模型,针对红色代码这种网络蠕虫的扫描策略,在模拟环境下对蜜罐部署策略进行了验证。     

A middleware‐transparent approach to developing distributed applications

An innovative middleware‐transparent approach to developing distributed applications is presented. The approach uses an aspect‐oriented software development technique to separate an application's middleware‐independent functionality from its middleware‐specific functionality. Application elements that are specific to the middleware are localized in aspects that can be seamlessly integrated into middleware‐independent application designs. The middleware‐transparent approach is used to decouple business functionality from middleware‐specific functionality. The decoupling allows developers to change middleware application elements without significantly modifying business functionality. Middleware technologies such as Java Remote Method Invocation (RMI), Jini, Simple Object Access Protocol (SOAP) remote procedure call (RPC) and .Net are used as examples to illustrate the approach. Copyright © 2005 John Wiley & Sons, Ltd.     

Clock synchronization for distributed media applications

Current video wall technology relies on custom processing hardware to drive the individual display channels. This hardware is both expensive to design and to maintain. Given that modern off‐the‐shelf computers have a significant amount of computing power, future video displays can be driven with this hardware at a lower cost. By using mass‐produced computers and a standard commercial operating system, the benefits of economies of scale can be brought to the custom video wall market. This paper describes a Windows library that provides the synchronized timing support necessary to drive a video wall with consumer hardware. The goal is to provide a key building block for the media software that will process the incoming video stream. This library exports several interfaces to the host software and provides support for synchronized timers, a synchronized clock, and reliable multicast messaging. The library uses common Windows APIs and protocols for maximum interoperability and portability. Through empirical testing, we are able to show that synchronization between any two machines in the system can be maintained to within 12 ms when run on Windows XP SP2. This synchronization is also shown to be consistent even when there is a heavy load on the processor. As a result, this library will successfully allow a commercial video wall to be driven from media software running on consumer hardware and software. Copyright © 2007 John Wiley & Sons, Ltd.     

可靠的分布式系统生存性保障模型

基于检查点的协同式回滚恢复机制是一种针对分布式系统生存性保障的有效机制,现有分布式系统中基于检查点的回滚恢复机制以分布式信道可靠作为假设前提,而实际应用场景中,该假设并不总是成立。针对分布式系统实际的应用环境,提出了适用于信道不可靠的分布式计算环境的协同式系统生存性保障模型。该模型在保留检查点回滚恢复机制优点的基础上,通过建立冗余通信链路和进程迁移来保障不可靠通信信道环境下分布式系统的生存性。     

面向大数据复杂应用的虚拟集群动态部署模型

针对计算负载的时变性和复杂性导致虚拟集群的资源利用率不高的问题,为提高虚拟集群资源的全局利用率,采用弹性资源管理策略来吸收多种计算模式混杂时的资源需求突变。在Docker容器技术的支持下提出一个根据作业需求变化的动态部署模型。该模型根据资源的动态需求变化,实时调整虚拟集群的计算形态,具体包括计算节点的类型及规模。该模型不仅实现用户作业执行环境的动态定制,而且达到错峰计算的目的。仿真实验表明,该模型使得虚拟节点CPU利用率提升5.3%,并且优化了计算作业的执行效率。该动态部署模型适合应用到数据中心或大规模集群中,能够有效提高计算资源的利用率。     

An event routing service for distributed applications: computer telephony—a case study

This paper presents an event routing service (ERS) that represents a pattern for the establishment and processing of lightweight sessions between a source and a destination of events. It is based on the CORBA notification service. To illustrate the features of the proposed service, its application in computer telephony is discussed in detail. Most of the positive features of the ERS are inherited from the CORBA notification service, but its implementation requires a novel protocol describing the lightweight session establishment mechanism. The implementation of ERS is described and its application to routing events in a computer telephony system is presented. The paper concludes with a performance measurement study. Copyright © 2002 John Wiley & Sons, Ltd.     

分布式应用开发中的Java技术分析与比较

由于Java技术的面向对象、面向网络和数据库及跨平台等特性,使用Java技术来开发分布式应用系统就变得相当容易。现在应用比较广泛的3种主要的Java分布式计算技术,如RMI、EJB以及Jini具有各自不同的特点,对此进行了详细介绍,在此基础上,还对各自的异同点和使用范围进行了分析比较。     

分布式网络性能监测代理自适应部署研究

分布式网络性能监测的关键问题是如何在管理域中的适当位置放置适当数目的代理,才能达到提高监测效率,减小额外监测流量和响应时间的目的。本文提出的算法是在管理员改变网络拓扑结构或者网络节点或链路失效时被启动,能够针对网络的变化自动地进行局部监测代理分布的调整,使监测系统恢复到近似最优状态。该算法使本监测系统具有良好的可扩展性和适应能力,仿真实验证明了算法的可行性。     

Grids and Grid technologies for wide‐area distributed computing

The last decade has seen a substantial increase in commodity computer and network performance, mainly as a result of faster hardware and more sophisticated software. Nevertheless, there are still problems, in the fields of science, engineering, and business, which cannot be effectively dealt with using the current generation of supercomputers. In fact, due to their size and complexity, these problems are often very numerically and/or data intensive and consequently require a variety ofheterogeneous resources that are not available on a single machine. A number of teams have conducted experimental studies on the cooperative use of geographically distributed resources unified to act as a single powerful computer. This new approach is known by several names, such as metacomputing, scalable computing, global computing, Internet computing, and more recently peer‐to‐peer or Grid computing. The early efforts in Grid computing started as a project to link supercomputing sites, but have now grown far beyond their original intent. In fact, many applications can benefit from the Grid infrastructure, including collaborative engineering, data exploration, high‐throughput computing, and of course distributed supercomputing. Moreover, due to the rapid growth of the Internet and Web, there has been a rising interest in Web‐based distributed computing, and many projects have been started and aim to exploit the Web as an infrastructure for running coarse‐grained distributed and parallel applications. In this context, the Web has the capability to be a platform for parallel and collaborative work as well as a key technology to create a pervasive and ubiquitous Grid‐based infrastructure. This paper aims to present the state‐of‐the‐art of Grid computing and attempts to survey the major international efforts in developing this emerging technology. Copyright © 2002 John Wiley & Sons, Ltd.     

Finite‐time distributed control with time transformation

In this article, we propose distributed control algorithms for first‐ and second‐order multiagent systems for addressing finite‐time control problem with a priori given, user‐defined finite‐time convergence guarantees. The proposed control frameworks are predicated on a recently developed time transformation approach. Specifically, our contribution is twofold: First, a generalized time transformation function is proposed that converts the user‐defined finite‐time interval to a stretched infinite‐time interval, where one can design a distributed control algorithm on this stretched interval and then transform it back to the original finite‐time interval for achieving a given multiagent system objective. Second, for a specific time transformation function, we analytically establish the robustness properties of the resulting finite‐time distributed control algorithms against vanishing and nonvanishing system uncertainties. By contrast to existing finite‐time approaches, it is shown that the proposed algorithms can preserve a priori given, user‐defined finite‐time convergence regardless of the initial conditions of the multiagent system, the graph topology, and without requiring a knowledge of the upper bounds of the considered class of system uncertainties. Illustrative numerical examples are included to further demonstrate the efficacy of the presented results.     

Implementing a generic component‐based framework for telecontrol applications

The rapid growth of telecontrol systems is one of the major trends in today's network‐oriented community. The implementation of generic frameworks, consisting of reusable components that can form the basis for the development of such systems, is a necessity. There is a plethora of associated applications that can be developed in a distributed environment, such as audio/video teleconferencing, groupware and collaborative computing environments, remote controlled services, etc. In this paper we design and implement a generic framework of components that can be used for the realization of telecontrol applications. This category of applications focuses primarily on the issues of managing distributed units on remote end‐systems. Such applications contain remote units and administrators that are connected and exchange data and control messages. We analyse the outlined architecture of our framework and the most important system operations. We also describe the communication protocol used in message exchanges between the constituent components. Finally, we illustrate the usefulness of our framework by presenting two applications that were created by extending the basic software infrastructure. Copyright © 2007 John Wiley & Sons, Ltd.     

Improving scalability of event‐driven distributed objects architectures

The goal of this paper is to present practical techniques for improving the scalability of a distributed objects architecture built around an event‐driven paradigm and the evaluation of their effectiveness in the case of location systems. As a case study, the ABng location system constructed using a publisher/subscriber pattern over a CORBA compliant middleware is presented. The main contribution of this paper is the elaboration and evaluation of three main concepts that play a crucial role in improving the scalability of event‐driven architectures: events dissemination quality of service, notification tree based events‐routing, and transparent multicast event‐channel notification service. The applicability and efficiency of these techniques have been verified in practice by the ABng system implementation and performance testing. Copyright © 2000 John Wiley & Sons, Ltd.     

Klava: a Java package for distributed and mobile applications

Highly distributed networks have now become a common infrastructure for wide‐area distributed applications whose key design principle is network awareness, namely the ability to deal with dynamic changes of the network environment. Network‐aware computing has called for new programming languages that exploit the mobility paradigm as a basic interaction mechanism. In this paper we present the architecture of KLAVA , an experimental Java package for distributed applications and code mobility. We describe how KLAVA permits code mobility by relying on Java and present a few distributed applications that exploit mobile code programmed in KLAVA . Copyright © 2002 John Wiley & Sons, Ltd.     

A distributed problem‐solving framework for probabilistic software effort estimation

Distributed problem‐solving (DPS) systems use a framework of human organizational notions and principles of intelligent systems to solve complex problems. Human organizational notions are used to decompose a complex problem into sub‐problems that can be solved using intelligent systems. The solutions of these sub‐problems are combined to solve the original complex problem. In this paper, we propose a DPS system for probabilistic estimation of software development effort. Using a real‐world software engineering dataset, we compare the performance of the DPS system with a neural network (NN) and show that the performance of the DPS system is equal to or better than that of the NN with the additional benefits of modularity, probabilistic estimates, greater interpretability, flexibility and capability to handle incomplete input data.     

Playing MUSIC — building context‐aware and self‐adaptive mobile applications

Although the idea of context‐awareness was introduced almost two decades ago, few mobile software applications are available today that can sense and adapt to their run‐time environment. The development of context‐aware and self‐adaptive applications is complex and few developers have experience in this area. On the basis of several demonstrators built by the joint European research project MUSIC, this paper describes typical context and adaptation features relevant for the development of context‐aware and self‐adaptive mobile applications. We explain how the demonstrators were realised using the open‐source platform MUSIC and present the feedback of the developers of these demonstrators. The main contribution of this paper is to show how the development complexity of context‐aware and self‐adaptive mobile applications can be mastered by using an adaptation framework such as MUSIC. Copyright © 2012 John Wiley & Sons, Ltd.