QOS evaluation model for a campus-wide network: an alternative approach focussing on availability

This paper discusses a model for evaluating the quality of service (QOS) of a campus-wide network. The main goal is to achieve a mathematical model that can be applied to any network, providing its availability. The network where it will be tested has more than 5000 nodes with SNMP managed network devices.The model discards the classical approach to QOS that considers parameters such as delay or jitter. Instead, we evaluate quality as a function of the availability indexes for either the services or the network itself.Once the model is described, we will explain how it has been implemented at the Universitat Autònoma de Barcelona Campus network and the requirements––software and hardware––to install such a system in any network.     

Location awareness through trajectory prediction

Location-aware computing is a type of ubiquitous computing that uses user’s location information as an essential parameter for providing services and application-related optimization. Location management plays an important role in location-aware computing because the provision of services requires convenient access to dynamic location and location-dependent information. Many existing location management strategies are passive since they rely on system capability to periodically record current location information. In contrast, active strategies predict user movement through trajectories and locations. Trajectory prediction provides richer location and context information and facilitates the means for adapting to future locations. In this paper, we present two models for trajectory prediction, namely probability-based model and learning-based model. We analyze these two models and conduct experiments to test their performances in location-aware systems.     

Location-based services in ubiquitous computing environments

This paper presents a framework for providing dynamically deployable services in ubiquitous computing settings. The goal of the framework is to provide people, places, and objects with computational functionalities to support and annotate them. Using RFID-based tracking systems, the framework detects the locations of physical entities, such as people or things, and deploys services bound to the entities at proper computing devices near where they are located. It enables location-based and personalized information services to be implemented as mobile agents and operated at stationary or mobile computing devices, which are at appropriate locations, even if the services do not have any location-information. This paper presents the rationale, design, implementation, and applications of our prototype infrastructure.     

LACO: A location-aware cooperative query system for securely personalized services

Location-aware computing technology becomes promising for pervasive personalization services which run anytime, anywhere, and on any device. These services should be based on contextual queries that are provided in a fast and flexible manner. To do so, cooperative query answering may be useful to support query relaxation and to provide both approximate matches as well as exact matches. To facilitate query relaxation, a knowledge representation framework has been widely adopted which accommodates semantic relationships or distance metrics to represent similarities among data values. However, research shows few legacy cooperative query mechanisms that consider location-awareness. Hence, the purpose of this paper is to propose a securely personalized location-aware cooperative query that supports conceptual distance metric among data values, while considering privacy concerns around user context awareness. To show the feasibility of the methodology proposed in this paper, we have implemented a prototype system, LACO, in the area of site search in an actual large-scale shopping mall.     

Parallel computation of the eigenvalues of symmetric Toeplitz matrices through iterative methods

This paper presents a new procedure to compute many or all of the eigenvalues and eigenvectors of symmetric Toeplitz matrices. The key to this algorithm is the use of the “Shift–and–Invert” technique applied with iterative methods, which allows the computation of the eigenvalues close to a given real number (the “shift”). Given an interval containing all the desired eigenvalues, this large interval can be divided in small intervals. Then, the “Shift–and–Invert” version of an iterative method (Lanczos method, in this paper) can be applied to each subinterval. Since the extraction of the eigenvalues of each subinterval is independent from the other subintervals, this method is highly suitable for implementation in parallel computers. This technique has been adapted to symmetric Toeplitz problems, using the symmetry exploiting Lanczos process proposed by Voss [H. Voss, A symmetry exploiting Lanczos method for symmetric Toeplitz matrices, Numerical Algorithms 25 (2000) 377–385] and using fast solvers for the Toeplitz linear systems that must be solved in each Lanczos iteration. The method compares favourably with ScaLAPACK routines, specially when not all the spectrum must be computed.     

StopGap: elastic VMs to enhance server consolidation

Virtualized cloud infrastructures (also known as IaaS platforms) generally rely on a server consolidation system to pack virtual machines (VMs) on as few servers as possible. However, an important limitation of consolidation is not addressed by such systems. Because the managed VMs may be of various sizes (small, medium, large, etc.), VM packing may be obstructed when VMs do not fit available spaces. This phenomenon leaves servers with a set of unused resources (‘holes’). It is similar to memory fragmentation, a well‐known problem in operating system domain. In this paper, we propose a solution which consists in resizing VMs so that they can fit with holes. This operation leads to the management of what we call elastic VMs and requires cooperation between the application level and the IaaS level, because it impacts management at both levels. To this end, we propose a new resource negotiation and allocation model in the IaaS, called HRNM. We demonstrate HRNM's applicability through the implementation of a prototype compatible with two main IaaS managers (OpenStack and OpenNebula). By performing thorough experiments with SPECvirt_sc2010 (a reference benchmark for server consolidation), we show that the impact of HRNM on customer's application is negligible. Finally, using Google data center traces, we show an improvement of about 62.5% for the traditional consolidation engines. Copyright © 2017 John Wiley & Sons, Ltd.     

高性能遥感图像处理与空间信息网格建模

将空间信息网格技术（SIG）应用于遥感图像处理中，就是利用网格计算的特点，来解决遥感图像数据以及处理算法资源的共享、海量遥感图像数据的实时快速处理等问题。文章以此为主线，在分析高性能遥感图像处理问题的基础上，探讨了在网格环境下构造高性能遥感图像处理系统的可行性及相关关键技术的实现，提出了基于开放网格服务体系结构的系统模型，并实现了原型系统。实验表明，SIG用于遥感图像处理是可行的，并取得了一定的成果。     

Real-time dependable channels: customizing QoS attributes fordistributed systems

Communication services that provide enhanced Quality of Service (QoS) guarantees related to dependability and real time are important for many applications in distributed systems. This paper presents real-time dependable (RTD) channels, a communication-oriented abstraction that can be configured to meet the QoS requirements of a variety of distributed applications. This customization ability is based on using CactusRT, a system that supports the construction of middleware services out of software modules called micro-protocols. Each micro-protocol implements a different semantic property or property variant and interacts with other micro-protocols using an event-driven model supported by the CactusRT runtime system. In addition to RTD channels CactusRT and its implementation are described. This prototype executes on a cluster of Pentium PCs running the OpenGroup/RI MK 7.3 Mach real-time operating system and CORDS, a system for building network protocols based on the x-kernel     

Distributed implementations of communicating objects

The paper presents the design and implementation of a CSP-based object-oriented system. The system consists of a specification model, Communicating-object, and a prototype system, C-OBJECT, supporting the model. The objects execute in a set of parallel processes called actions. The dynamic communicating objects exchange messages by both data transmissions and function invocations. The C-OBJECT prototype is constructed in a MIMD architecture (32-node transputer) with C++ which is composed of two parts: network configuration and a Communicating-object service subsystem (library) providing various levels of message-passing primitives. The initial prototype with good performance has shown its availability for C and C++ programming. The integrated system facilitates application software with tools of specification, design and implementation.     

User needs for location-aware mobile services

Mobile contexts of use vary a lot, and may even be continuously changing during use. The context is much more than location, but its other elements are still difficult to identify or measure. Location information is becoming an integral part of different mobile devices. Current mobile services can be enhanced with location-aware features, thus providing the user with a smooth transition towards context-aware services. Potential application fields can be found in areas such as travel information, shopping, entertainment, event information and different mobile professions. This paper studies location-aware mobile services from the user's point of view. The paper draws conclusions about key issues related to user needs, based on user interviews, laboratory and field evaluations with users, and expert evaluations of location-aware services. The user needs are presented under five main themes: topical and comprehensive contents, smooth user interaction, personal and user-generated contents, seamless service entities and privacy issues.     

A parallel Aitken-additive Schwarz waveform relaxation suitable for the grid

The objective of this paper is to describe a grid-efficient parallel implementation of the Aitken–Schwarz waveform relaxation method for the heat equation problem. This new parallel domain decomposition algorithm, introduced by Garbey [M. Garbey, A direct solver for the heat equation with domain decomposition in space and time, in: Springer Ulrich Langer et al. (Ed.), Domain Decomposition in Science and Engineering XVII, vol. 60, 2007, pp. 501–508], generalizes the Aitken-like acceleration method of the additive Schwarz algorithm for elliptic problems. Although the standard Schwarz waveform relaxation algorithm has a linear rate of convergence and low numerical efficiency, it can be easily optimized with respect to cache memory access and it scales well on a parallel system as the number of subdomains increases. The Aitken-like acceleration method transforms the Schwarz algorithm into a direct solver for the parabolic problem when one knows a priori the eigenvectors of the trace transfer operator. A standard example is the linear three dimensional heat equation problem discretized with a seven point scheme on a regular Cartesian grid. The core idea of the method is to postprocess the sequence of interfaces generated by the additive Schwarz wave relaxation solver. The parallel implementation of the domain decomposition algorithm presented here is capable of achieving robustness and scalability in heterogeneous distributed computing environments and it is also naturally fault tolerant. All these features make such a numerical solver ideal for computational grid environments. This paper presents experimental results with a few loosely coupled parallel systems, remotely connected through the internet, located in Europe, Russia and the USA.     

Type-based initialization analysis of a synchronous dataflow language

One of the appreciated features of the synchronous dataflow approach is that a program defines a perfectly deterministic behavior. But the use of the delay primitive leads to undefined values at the first cycle; thus a dataflow program is really deterministic only if it can be shown that such undefined values do not affect the behavior of the system.This paper presents an initialization analysis that guarantees the deterministic behavior of programs. This property being undecidable in general, the paper proposes a safe approximation of the property, precise enough for most dataflow programs. This analysis is a one-bit analysis – expressions are either initialized or uninitialized – and is defined as an inference-type system with subtyping constraints. This analysis has been implemented in the Lucid Synchrone compiler and in a new Scade-Lustre prototype compiler at Esterel Technologies. The analysis gives very good results in practice.     

移动互联网业务管理建模及实现技术

随着业务的丰富,移动互联网的管理正变得日益困难和复杂。该文在分析典型业务的基础上,讨论了业务提供模式的变化,提出了移动互联网业务模型、管理模型及核心管理信息模型。最后介绍了实验室基于JMX的业务平台管理原型系统,它实现了文章提出的管理模型。     

A WEB‐BASED PERSONALIZED BUSINESS PARTNER RECOMMENDATION SYSTEM USING FUZZY SEMANTIC TECHNIQUES

The web provides excellent opportunities to businesses in various aspects of development such as finding a business partner online. However, with the rapid growth of web information, business users struggle with information overload and increasingly find it difficult to locate the right information at the right time. Meanwhile, small and medium businesses (SMBs), in particular, are seeking “one‐to‐one” e‐services from government in current highly competitive markets. How can business users be provided with information and services specific to their needs, rather than an undifferentiated mass of information? An effective solution proposed in this study is the development of personalized e‐services. Recommender systems is an effective approach for the implementation of Personalized E‐Service which has gained wide exposure in e‐commerce in recent years. Accordingly, this paper first presents a hybrid fuzzy semantic recommendation (HFSR) approach which combines item‐based fuzzy semantic similarity and item‐based fuzzy collaborative filtering (CF) similarity techniques. This paper then presents the implementation of the proposed approach into an intelligent recommendation system prototype called Smart BizSeeker, which can recommend relevant business partners to individual business users, particularly for SMBs. Experimental results show that the HFSR approach can help overcome the semantic limitations of classical CF‐based recommendation approaches, namely sparsity and new “cold start” item problems.     

Testable design of AND–EXOR logic networks with universal test sets

This paper presents a testability enhancement technique suited for AND–EXOR based logic networks that facilitates easy detection of stuck-at and bridging faults by a universal test set. Both cascaded and tree implementations of the EXOR-part are considered. The AND–EXOR based circuit implemented with a cascaded EXOR-part requires a universal test set of size (2n + 6) for an n-variable function implementation. For Generalized Reed–Muller (GRM) implementation, this test set detects all single stuck-at and bridging faults (both OR-type and AND-type) and also large number of multiple bridging faults. For an Exclusive-OR Sum-of-Products (ESOP) implementation, a few single bridging faults may remain untested under this test set, occurrence of which can be minimized by employing an appropriate design and layout technique. Next, it is shown that an AND–EXOR network with a tree-based EXOR-part can be tested for similar faults by a universal test set of size (2n + 8). This paper also solves an open problem of designing a universal test for a tree-based AND–EXOR circuit. Since the EXOR-tree has depth of (log₂s+1), where s is the number of product terms in the given AND–EXOR expression, this tree-based design reduces the circuit delay significantly compared to cascaded EXOR implementation. In both the cases, the test set can be stored in a ROM on-chip for built-in self-test (BIST) purposes. For several benchmark circuits, the universal test set is found to be much smaller in size than the ATPG-generated test sets.     

Real-time data attack isolation for commercial database applications

Traditional database security mechanisms are very limited in defending against data attacks. Authorized but malicious transactions can make a database useless by impairing its integrity and availability. This paper presents the design of a real-time data attack isolation system, denoted DAIS. DAIS isolates likely suspicious actions before a definite determination of intrusion is reported. In this way, the database can be immunized from many malicious transactions. DAIS is a COTS-DBMS-specific implementation of a general isolation algorithm that we developed [Liu P, Jajodia S, McCollum CD. Intrusion confinement by isolation in information systems. Journal of Computer Security, 2000;8(4):243–79]. In this paper, the design of the first DAIS prototype, which is for Oracle Server 9.2, is discussed. DAIS uses triggers and transaction profiles to keep track of the items read and written by transactions, isolates attacks by rewriting user SQL statements, and is transparent to end users. The DAIS design is very general. In addition to Oracle, it can be easily adapted to support many other database application platforms such as Microsoft SQL Server, Sybase, and Informix.     

Building Efficient Overlays

Peer-to-peer (P2P) and Grid computing systems have emerged as popular models aiming at further utilizing Internet information and resources, complementing the available client–server services. However, the mechanism of peers randomly choosing logical neighbors without any knowledge about underlying physical topology can cause a serious topology mismatch problems between the overlay network and the physical underlying network. The topology mismatch problem brings a great stress in the Internet infrastructure and greatly limits the performance gain from various search or routing techniques in P2P and Grid systems. Aiming at alleviating the mismatch problem and reducing the unnecessary traffic, we have proposed two approaches, adaptive overlay topology optimization (AOTO) and location-aware topology matching (LTM) techniques, to reduce the total traffic cost and average query response time. Both AOTO and LTM are scalable and completely distributed in the sense that they do not require any global knowledge of the whole overlay network when each node is optimizing the organization of its logical neighbors. This paper shows the effectiveness of AOTO and LTM and compares the performance of these two approaches through simulation studies.     

Effects of population size for location-aware node placement in WMNs: evaluation by a genetic algorithm--based approach

Wireless mesh networks (WMNs) are cost-efficient networks that have the potential to serve as an infrastructure for advanced location-based services. Location service is a desired feature for WMNs to support location-oriented applications. WMNs are also interesting infrastructures for supporting ubiquitous multimedia Internet access for mobile or fixed mesh clients. In order to efficiently support such services and offering QoS, the optimized placement of mesh router nodes is very important. Indeed, such optimized mesh placement can support location service managed in the mesh and keep the rate of location updates low. This node location-based problem has been shown to be NP-hard and thus is unlikely to be solvable in reasonable amount of time. Therefore, heuristic methods, such as genetic algorithms (GAs), are used as resolution methods. In this paper, we deal with the effect of population size for location-aware node placement in WMNs. Our WMN-GA system uses GA to determine the positions of the mesh routers and mesh clients in the grid area. We used a location-aware node placement of mesh router in cells of considered grid area to maximize network connectivity and user coverage. We evaluate the performance of the proposed and implemented WMN-GA system for low and high density of clients considering different distributions and considering giant component and number of covered users parameters. The simulation results show that for low-density networks, with the increasing of population size, GA obtains better result. However, with the increase in the population size, the GA needs more computational time. The proposed system has better performance in dense networks like hot spots for Weibull distribution when the population size is big.     

Certificate revocation system implementation based on the Merkle hash tree

Public-key cryptography is widely used to provide Internet security services. The public-key infrastructure (PKI) is the infrastructure that supports the public-key cryptography, and the revocation of certificates implies one of its major costs. The goal of this article is to explain in detail a certificate revocation system based on the Merkle hash tree (MHT) called AD–MHT. AD–MHT uses the data structures proposed by Naor and Nissim in their authenticated dictionary (AD) [20]. This work describes the tools used and the details of the AD–MHT implementation. The authors also address important issues not addressed in the original AD proposal, such as responding to a request, revoking a certificate, deleting an expired certificate, the status checking protocol for communicating the AD–MHT repository with the users, verifying a response, system security, and, finally, performance evaluation.     

目标Web服务描述本体和服务发现模型

目标Web服务描述语言和服务匹配算法是解决Web服务发现问题的方法。在分析现有Web服务描述语言的基础上,该文设计了一个目标Web服务描述本体,该本体从功能、性能和语义特征 3个方面描述Web服务,以提高服务发现的效率和质量为原则,提出了一个基于Web服务特征元素的服务发现模型,并结合旅游领域,实现了一个原型系统。