Design of a service oriented architecture for efficient resource allocation in media environments

In many business domains, Grids and Service Oriented Architectures are considered to improve application design, integration and execution. In the audiovisual industry, applications are very data-intensive, time-constrained and computationally demanding, and design of a Service Oriented Architecture in this domain is no straightforward task. Efficient resource allocation-especially in terms of network usage-is paramount to meet users’ requirements in terms of deadlines and responsiveness, and offer high scalability at the same time. We present a resource- and network-aware management architecture addressing the issues in media environments, incorporating a number of scheduling algorithms and advance reservation systems to ensure efficient resource usage.     

Service oriented architectures: approaches,technologies and research issues

Service-oriented architectures (SOA) is an emerging approach that addresses the requirements of loosely coupled, standards-based, and protocol- independent distributed computing. Typically business operations running in an SOA comprise a number of invocations of these different components, often in an event-driven or asynchronous fashion that reflects the underlying business process needs. To build an SOA a highly distributable communications and integration backbone is required. This functionality is provided by the Enterprise Service Bus (ESB) that is an integration platform that utilizes Web services standards to support a wide variety of communications patterns over multiple transport protocols and deliver value-added capabilities for SOA applications. This paper reviews technologies and approaches that unify the principles and concepts of SOA with those of event-based programing. The paper also focuses on the ESB and describes a range of functions that are designed to offer a manageable, standards-based SOA backbone that extends middleware functionality throughout by connecting heterogeneous components and systems and offers integration services. Finally, the paper proposes an approach to extend the conventional SOA to cater for essential ESB requirements that include capabilities such as service orchestration, “intelligent” routing, provisioning, integrity and security of message as well as service management. The layers in this extended SOA, in short xSOA, are used to classify research issues and current research activities.     

A time-aware Bayesian approach for optimal manufacturing service recommendation in distributed manufacturing environments

With the growing emergence of distributed collaborative manufacturing systems, the utilization of service-oriented manufacturing to offer seamless access to a variety of complex, distributed and dynamic manufacturing resources has become a challenging issue. This paper presents a novel time-aware probabilistic Bayesian approach for recommending a few optimal manufacturing services based on the user preference for an initial manufacturing service. The Bayesian approach operates over a comprehensive, formal representation of manufacturing services, which adds the time-aware probability of satisfied service execution in manufacturing service ontology to take into account the statistical nature of the dynamic manufacturing environment. The Bayesian approach is useful because it infers a few top ranked hypotheses of manufacturing service that have the largest probability as the optimal selection in a specified context of user preference. A prototype system is built and validated with an illustrative example from manufacturing industry to demonstrate the feasibility of the proposed approach for optimal service recommendation.     

Towards multi-task transfer optimization of cloud service collaboration in industrial internet platform

Cloud Manufacturing (CMfg) has gained significant attention owing to its capability in reshaping the cooperation paradigm among multiple geographically dispersed enterprises, which is conducive to handle a complex production task flexibly through the industrial internet platform. Cloud Service Assembly (CSA) is concerned with integrating a series of services together for serving a complex manufacturing task, which, as one of bottlenecks for CMfg, plays a critical role in efficient utilization of resources. Evolutionary Algorithms (EAs) have been widely used in resolving CSA in the past. However, they are always executed from scratch for tackling a single task in each run, whereas handling a batch of tasks collectively via leveraging inter-task knowledge transfer has been scarcely studied. Notably, CMfg is often faced with situation of multiple tasks arriving dynamically. In light of this, we propose a Multi-task Transfer EA (MTEA), where several service collaboration tasks are optimized jointly to speed up the search efficiency by exploiting knowledge extraction among tasks. Specifically, data models derived from evolving populations are learned to capture valuable knowledge for transfer so as to boost problem-solving efficacy, a parameter online learning strategy is utilized to tune the intensity of knowledge transfer across tasks. Extensive experiments are conducted on a series of CSA instances, results prove the feasibility and competence of MTEA against state-of-the-art peers.     

面向服务的数据挖掘平台体系结构研究*

针对当前数据挖掘软件中普遍存在的功能耦合过于紧密、资源共享程度不高、软件难以重用、可扩展性不好等问题,提出了一种面向服务的数据挖掘平台(SODMP)的概念模型,并给出了SODMP平台的设计方案.该平台由DM应用、DM服务代理、DM服务、操作系统接口四部分组成,在结构上实现了应用与服务的分离,具有开放、灵活、易重用、易扩展等特点.     

Ontological map of service oriented architecture for shared services management

Service oriented architecture (SOA) and shared services (SS) have been widely studied in the information technology literature. However, there is a lack of tools for shared services management (SSM) to apply SOA. This paper proposes an ontological map for SSM to apply SOA. This mapping approach, based on the well-known Zachman framework of information architecture, specifies the ontological perspective of SOA for SSM. The ontological map semantically links all aspects of SOA for SSM. Through a case study, a design artifact of computerized ontological map of SOA demonstrates the usability of the artifact for SSM.     

Research on the collaboration of service selection and resource scheduling for IoT simulation workflows

Cloud resources provide a promising way to efficiently perform the needed simulation tasks for a complex manufacturing process. Most of the existing work focuses only on how to effectively schedule computing resources to execute computing requirements of simulation workflows in Internet of Things (IoT) applications. Research on the scheduling of simulation workflows in consideration of task ordering, service selection, and resource allocation altogether has not been lacking. To fill in this void, this paper proposes a cloud-based 3-stage workflow scheduling model. Before scheduling computing resources to complete task requirements, the order of the tasks is determined and the services that can meet the task requirements are selected. In this model, the workload to satisfy task requirements is not fixed and takes on a different value depending upon the service selected with its unique complexity and accuracy. An optimization function that transforms and integrates makespan, cost, and accuracy in a unique way is proposed. For its solution, the relatively new symbiotic organisms search (SOS) algorithm is modified and two SOS-based optimization strategies are developed, i.e., joint optimization-based SOS (JOSOS) and split optimization-based SOS (SOSOS). The simulation results reveal that SOS-based algorithms, especially the SOSOS method, outperform all compared algorithms. Based on the proposed method, simulation services and computing resources can be rationally selected and scheduled to ensure the requirements of IoT applications.     

Bi-level dynamic scheduling architecture based on service unit digital twin agents

Pure reactive scheduling is one of the core technologies to solve the complex dynamic disturbance factors in real-time. The emergence of CPS, digital twin, cloud computing, big data and other new technologies based on the industrial Internet enables information acquisition and pure reactive scheduling more practical to some extent. However, how to build a new architecture to solve the problems which traditional dynamic scheduling methods cannot solve becomes a new research challenge. Therefore, this paper designs a new bi-level distributed dynamic workshop scheduling architecture, which is based on the workshop digital twin scheduling agent and multiple service unit digital twin scheduling agents.Within this architecture, scheduling a physical workshop is decomposed to the whole workshop scheduling in the first level and its service unit scheduling in the second level. On the first level, the whole workshop scheduling is executed by its virtual workshop coordination (scheduling) agent embedded with the workshop digital twin consisting of multi-service unit digital twins. On the second level, each service unit scheduling coordinated by the first level scheduling is executed in a distributed way by the corresponding service unit scheduling agent associated with its service unit digital twin. The benefits of the new architecture include (1) if a dynamic scheduling only requires a single service unit scheduling, it will then be performed in the corresponding service unit scheduling without involving other service units, which will make the scheduling locally, simply and robustly. (2) when a dynamic scheduling requires changes in multiple service units in a coordinated way, the first level scheduling will be executed and then coordinate the second level service unit scheduling accordingly. This divide-and-then-conquer strategy will make the scheduling easier and practical.The proposed architecture has been tested to illustrate its feasibility and practicality.     

基于自治系统与动态概率包标记的DDoS攻击溯源优化方法

针对分布式拒绝服务(DDoS)攻击对于网络的严重威胁问题,提出基于自治系统(AS)与动态概率包标记(DPPM)的DDoS攻击溯源优化方法。在该方法中,设计了一种新的包标记方案,该方案设置两套标记,分别作为域标记和路由标记,用作域间溯源和域内溯源。域标记和路由标记过程同时进行,标记过程采用动态包标记的方法。最后,通过域间和域内的路径重构实现对攻击节点的快速溯源。实验结果表明该算法是高效、可行的,能为DDoS攻击的防范提供重要依据。