SIWN Abstracts Index
Technology of Spam Filtering Based on Latent Semantic Analysis
Qiuyu Zhang and Jingtao Sun
System and Information Sciences Notes, Vol. 1, No. 3, July 2007, pp. 213-216
Abstract: with the rapidly increasing of Spam, more people are much concerned about anti-Spam problem. At present, there exists a Spam filtering system which its filtering ability is becoming feeble because of metamorphous feature phrase in Spam. So we present a novel approach to automatically recognize the metamorphous feature phrase by expanding latent semantic analysis (ELSA). ELSA is used to mark latent feature phrase, so the semantic analysis is introduced to the Spam filtering technique. It also overcomes the problem which is the filtering system working mechanically because of lack of apriori information in the traditional latent semantics analysis. Experimental results show that it outperformed the Naďve Byes filter algorithm in efficiency and performance, and the increase of recall rate of anti-Spam is about 14%. Thus, it can be a novel method to improve the ability of E-mail filtering model.
Keywords: expanding latent semantic analysis; singular value decomposition, Spam filtering; metamorphous feature phrase.
Coordinated Attacks Detection Based on Event Sequence Matching
Kuo Zhao, Kuo Tang, Dong Guo, Yanmei Huo and Liang Hu
System and Information Sciences Notes, Vol. 1, No. 3, July 2007, pp. 217-220
Abstract: The complexity of coordinated attacks is difficult to detect efficiently by using the traditional methods such as misuse detection or anomaly detection. In this paper, we make an extension to the scope of event. An event is not only referred to alerts generated by IDS but also to events in network management or corresponding audit records in an operating system. Then we build a time series model based on temporal actions of coordinated attacks, and propose a comprehensive detection framework of coordinated attacks based on event sequence matching. The design and implementation of a hash-based sequence matching algorithm are provided. A distinctive feature of this detection framework is its ability to account for concurrent interdependent attackers’ actions.
Keywords: coordinated attacks, event sequence, matching.
A Simple and Efficient Approach for Retrieving Live HTML-Based Internet Information
Nader Mohamed and Jameela Al-Jaroodi
System and Information Sciences Notes, Vol. 1, No. 3, July 2007, pp. 221-224
Abstract: Dynamic HTML documents on the Internet contain useful information that can be reused by other applications. Unlike XML documents, the problem with HTML documents is that they do not have any semantics for the data in the page. Although a programmer can write a program that retrieves a peace of information from a specific HTML document available on the Internet, it will be very difficult to write several different programs to retrieve information from different dynamic HTML pages with varying formats. This paper develops a simple and generic approach to retrieve dynamic HTML Internet-based information. In this approach, several techniques that can be used to retrieve data from dynamic HTML documents are developed. These techniques were developed as a Java class which programmers can use to integrate and reuse HTML Internet Information for other real-time applications that need this information for their operations. The integrated Internet information can be weather information, stock prices, and top news. A number of experiments were conducted to measure the performance of these techniques. In addition, the paper discusses a number of applications that may benefit from this approach.
Keywords: HTML information retrieval, internet information, Java.
Theories for an Analysis of IPv6 Firewall
System and Information Sciences Notes, Vol. 1, No. 3, July 2007, pp. 225-230
Abstract: The IPv6 will be put into use in the near future. Meanwhile, the connection between institutes and internet is constantly expanded, so the security on the network is urgently needed. A proper design of firewall rules which are free of conflicts is needed to increase network security levels. There are a large number of research studies supporting the analysis of IPv4 firewall rule-list, but they are not suitable for the IPv6 firewall. In addition, the analysis of IPv4 firewall rules can sometimes be done by seeing with bare eyes. For example, mistakes can be found in Cisco ACL which consists of only few lines; however, it is difficult to be done on the IPv6 firewall rules. This research presents a theory and a model which can be applied in creating software for the analysis of the IPv6 firewall rules. The purpose is to analyze the conflicts occurring in the IPv6 firewall rules. This will ease the detection and elimination of mistakes, resulting in an increase in network security levels for the IPv6 network.
Keywords: IPv6, firewall, analysis, theory.
An Improved Hybrid Alarm Correlation Analysis Scheme for SDH Networks
In-Soo Lee, Do-Hyeun Kim, You-Ze Cho, Sung-Hyup Lee and Yang-Moon Yoon
System and Information Sciences Notes, Vol. 1, No. 3, July 2007, pp. 231-236
Abstract: A number of alarms occur in SDH (Synchronous Digital Hierarchy) transmission networks. However, effective alarms that are directly related to the original fault comprising with only a small part of them. These fault alarms can be classified into the original alarms and the derived ones. In this paper, we propose a new alarm correlation analysis scheme for the classification of the extracted original fault alarms. The proposed scheme uses the rule-based correlation analysis method and the codebook method using the pattern of common alarm generation features. In addition, we apply the correlation grouping method using a family composition mechanism for the alarms of end-to-end circuits to minimize extraction complexity. Finally, we design and implement the prototype of the proposed hybrid alarm correlation scheme for SDH transmission networks.
Keywords: SDH (synchronous digital hierarchy), alarm correlation, transmission network.
Measuring One-Way Packet Delay Variation in IP Networks: Concepts and Experiences
Ming Chen, Changyou Xing and Ke Ding
System and Information Sciences Notes, Vol. 1, No. 3, July 2007, pp. 237-242
Abstract: Network Delay Variation is of great influence to real time applications. In this paper firstly a definition of one-way delay variation metric VD in IP networks is given, and then we propose the principle of constructing sample measurement packet sequence and present a related measurement algorithm Tjitter. To measure VD, a tool named TJTool is also implemented, which can measure VD easily without keeping the clock synchronization between measurement points. Then we give the definition and architecture of delay variation test bed. At last we implement a delay variation test bed TjitterBed under Linux’s user mode. Experiment results show that these conceptions are rational.
Keywords: algorithm, IPDV, network measurement, measurement tools, testbed.
SVVM: The Securized Virtual Virtual Machine
Mohammed Nadjib Tabbiche and Abdellah Chouarfia
System and Information Sciences Notes, Vol. 1, No. 3, July 2007, pp. 243-246
Abstract: This work allowed us the installation of a simple PKI, using OpenSSL Note, in order to allow the certification of the VVMs, the checking of the identities of different VMLets scripts loaded to the top of the µVM using VMLet from safety. In other terms, each MVV must have a means of identification in a surer and reliable of a way personal (the owner of VMLets) using a X.509 certificate. This operation must be carried out without degrading the performances and the reliability of the dynamic and reflexive compiler, the µVM.
Keywords: dynamic adaptation, certificate, PKI (public key infrastructure), security, VVM (virtual virtual machine), µVM (micro-virtual machine).
A Rate-Controlled Fast Fair Scheduler based on Timeslot Reservation
Ji Li, Huaxin Zeng and Haiying Wang
System and Information Sciences Notes, Vol. 1, No. 3, July 2007, pp. 247-250
Abstract: The work presented in this paper is backed up by the research work on scheduling with the Ethernet-oriented Physical Frame Timeslot Switching (EPFTS) aiming at a SUPANET (Single physical layer User-data transfer & switching Platform Architecture Network). In high-speed switching, it is vital to maintain a constant time-complexity of a scheduling algorithm, not only for fairness of a scheduler to all inputs, but also for meeting QoS requirements of different streams. This can be done with the proposed algorithm is called STRR (Surplus-Timeslot based Round Robin) which imports a new concept named surplus-timeslot to adjust the service rate of flows. With STRR only flows possess one or more surplus-timeslot can join in round-robin scheduling for output. Both theoretical analysis and simulation results have shown that STRR provides a service with better fairness for inputs and better insured throughput for streams. Moreover, the time complexity for STRR is O(1), a favorable feature in high-speed switching.
Keywords: fair scheduling, rate-controlled, SUPANET, timeslot reservation, surplus-timeslot.
Virtual Queue Based RED-VBR
Mei Han and Yao Liang
System and Information Sciences Notes, Vol. 1, No. 3, July 2007, pp. 251-254
Abstract: RED-VBR, a renegotiated deterministic variable bit rate scheme, is a well-known approach to support delay-sensitive VBR video traffic. However, the original RED-VBR suffers some limitations, such as the difficulty of dimensioning of D-BIND traffic descriptors for real-time videos, and the relatively high computation complexity. In this paper, we present a novel approach, referred to as virtual-queue-based RED-VBR, to overcome those limitations. Our proposed scheme has been demonstrated through extensive simulations with real-world MPEG-4 VBR video traces.
Keywords: multimedia networks, quality-of-service, VBR video, MPEG4.
Replication Approach for Manets
S. Moussaoui, M. Guerroumi and N. Badache
System and Information Sciences Notes, Vol. 1, No. 3, July 2007, pp. 255-262
Abstract: In mobile ad hoc networks data accessibility is reduced due to frequent network partition. Data replication is a key approach for achieving high accessibility to data shared by multiples hosts. It’s a process of creation and relocation of data replicas. If a partition occurs, a node can reach a local replica on its partition although the original data is on another partition. In this paper, a new replication approach is proposed. It is based on two main phases. In the first phase, primary replicas for new shared data are created on the network. To avoid storage overhead, the replicas are distributed at k hops. The aim is to avoid the drawbacks of network partitioning before knowing the user behaviors. In the second phase, these replicas are dynamically relocated. It considers the user needs to maintain data availability and to optimize the response time.
Three data replication methods based on this two phase approach are proposed. The first method creates the primary replicas for each new shared data. To limit replication cost, the second method creates the primary replicas only for the very important data. In these two methods the user needs are evaluated through an access frequency rate. The third method considers this frequency and the access time to have better access performances. The experimental results indicate that the methods can increase the data accessibility. The second and third ones offer a compromise between availability and traffic load.
Keywords: access time, data access frequency, data availability, mobile ad hoc networks, replication.
Modal Policy Driven Heterogeneous Network Measurement Platform
Guomin Zhang, Ming Chen and Huan Xiong
System and Information Sciences Notes, Vol. 1, No. 3, July 2007, pp. 263-266
Abstract: With the development of Mobile Ad hoc Network (MANET), the combination of fixed network and MANET has become the current research hot spot. MANET is highly dynamic in nature, as formed over wireless links that are susceptible to failure. Strict requirements on stability and reliability provide a strong motivation for monitoring and evaluating the running state of this kind of heterogeneous network. Therefore, a modal policy driven Heterogeneous Network Measurement Platform (HNMP) is proposed. HNMP provides a scheduling and controlling mechanism independent of network measurement tools and application. The tightly-coupled resource management mechanism of HNMP can ensure the reliable running and collaborating of heterogeneous measurement tools under unreliable network environment. Moreover, it enhances the flexibility and scalability of platform. Finally, a brief account of the prototype system is also given.
Keywords: MANET, modal policy, network measurement, state-consistent.
Posterior Cramer-Rao Bound for Collaborative Multi-Sensor Tracking in Wireless Sensor Networks
Xinrong Li and Jue Yang
System and Information Sciences Notes, Vol. 1, No. 3, July 2007, pp. 267-272
Abstract: Sensing data without knowing sensors’ location is meaningless. Thus, sensor localization is an important research issue in wireless sensor networks. In many applications, sensor devices can be mobile so that sensors’ location needs to be estimated continuously, which necessitates design of suitable tracking algorithms for sensor networks. In sensor networks, individual nodes have severely limited resources. Thus, collaboration of a large number of resource-constrained, unreliable sensor nodes is extremely important to achieving substantial sensing and processing capability in the aggregate and to providing collectively reliable network behavior in mission-critical applications. In this paper, we propose a collaborative multi-sensor tracking paradigm in sensor networks and demonstrate that sensors’ mobility, together with collaboration among sensor nodes, can be exploited to significantly improve sensor localization performance. In this paper, we focus on performance lower bound analysis of the proposed method. The benefits of the proposed collaborative multi-sensor tracking methodology as compared with the existing localization and tracking methods are studied through numerical results of the posterior Cramer-Rao bound.
Keywords: bayesian estimation, collaborative signal processing, multi-sensor tracking, posterior cramer-rao bound (PCRB), wireless sensor networks.
Registration-Free Paging for Multiaccess
System and Information Sciences Notes, Vol. 1, No. 3, July 2007, pp. 273-278
Abstract: This work designs a registration-free paging scheme for multiaccess networks and devices, where the specific radio accesses with and without own paging functions can coexist and be benefited. It presents a scalable paging approach for the multiaccess networks and addresses the privacy concerns of the multiaccess devices, especially when they are in the service scope of foreign networks. It also works to benefit those radio accesses without own paging functions for their further power saving in the multiaccess environment. Numerical analysis is then done to investigate the different degrees of battery lifetime saving under different communication usages, network and device settings.
Keywords: paging, multiaccess, power management, battery lifetime, numerical analysis.
A New Authentication Considering Convergence of Wireless Networks
SuJung Yu and JooSeok Song
System and Information Sciences Notes, Vol. 1, No. 3, July 2007, pp. 279-282
Abstract: The converged network of existing wireless networks evolves to all Internet Protocol (IP)-based services. Specifically, this paper focuses on converged network of Universal Mobile Telecommunications System (UMTS) and Digital Video Broadcasting-Handheld (DVB-H) networks. UMTS networks provide broadcasting service as DVB networks to users with various return channels as well as access to the external world and a high mobility two-way multimedia service with a medium bit rate. The DVB-H provides high bit rate mobile reception, but restricted to a unidirectional one-to-one. The converged networks of telecommunication and broadcasting have problem about how to support mutual authentication between a user and a broadcasting network. In this paper, we propose a new authentication scheme that authenticates each other. The access terminal checks the user identity (Uid) with Program Specific Information/Service Information (PSI/SI) which is transmitted through interface Ii. When the user moves into the new cell in the converged network, the DVB-H checks confirm message in PSI/SI table. If PSI/SI table is correct, the DVB-H network transmits data with unnecessary authentication. The new authentication scheme provides efficient authentication and re-authentication using return channel in the converged network. The session key is used in every session to encapsulate the data sent to the user. Our proposed authentication scheme provides a fast mutual authentication for the converged network.
Keywords: authentication, DVB-H, mobile converged networks, PSI/SI table, re-authentication, security, UMTS.
Design and Implementation of a RFID Based Real-Time Emergency Medical Information System
Hee Joung Hwang and Jin Tak Choi
System and Information Sciences Notes, Vol. 1, No. 3, July 2007, pp. 283-287
Abstract: Many emergency medial experts have been regarded that the significant problem in the conventional emergency medical system is difficulties in the fast recognition of patient information as a site-level and communication between ambulance, hospital, and medical staffs in a patient transferring stage. It is possible to improve the level of the conventional emergency medial service if we share emergency medical resources between hospitals in real-time.
This paper introduced ubiquitous computing concepts in on-site reinforcement and transferring stages and developed a real-time emergency medical information system using RFID (Radio Frequency Identification). The developed system is able to recognize the major diagnosis of patients, sign of infectious diseases, and contact information of patient’s protectors and transmit the measurement of patient’s vital signs and their records measured on-site without any help from protectors or patients to an emergency room in order to prepare emergency treatments in a hospital. In addition, it makes possible to provide fast medical examination and treatment for the patient due to the automatically transmitted patient arrival information to the desk of an emergency room after passing the hospital’s gate without any specific procedures. In particular, it is able to automatically manage emergency rescue records that have been displeased with paramedics.
Keywords: EMR, healthcare, medical information system, RFID, u-healthcare, ubiquitous computing.
Possible Design Failures of Body-Based Multimodal Interaction
Robert C.C. Chen, William Cheng-Chung Chu, Tin-Kai Chen and Hong-Ji Yang
System and Information Sciences Notes, Vol. 1, No. 3, July 2007, pp. 288-291
Abstract: Technological trends of multimodal interaction are likely to merge with mobile communication, hence the effect of device difference on body-based human performance cannot be ignored in terms of quality of use. A comprehensive literature review of human computer interaction and development of body-based multimodal interfaces is given. The study aims to reveal the effect of body-based multimodal interaction on human performance and to identify possible design failures. As a result, it reveals that a sensor system has a great impact on human performance in terms of longer cursor movement time, longer movement time and greater arm and shoulder fatigue in comparison with a mouse. Finally, identification of design failures and design consideration for further study are made.
Keywords: body-based multimodal interaction, human-computer interaction, ISO 9241.
A Collaborative Resource Discovery Approach for Mobile Systems
Jameela Al-Jaroodi and Nader Mohamed
System and Information Sciences Notes, Vol. 1, No. 3, July 2007, pp. 292-296
Abstract: In this paper, we investigate the requirements and challenges of introducing mobility in large distributed systems. One major obstacle is resource discovery in the presence of mobile nodes. Collaborative resource discovery mechanisms are available to handle static to semi-static resources. However, incorporating mobile users introduces a different set of problems. First, how do we know when a resource becomes available? How do we identify the resource, its current location and its moving patterns? A middleware framework to conceptualize the mobile environment and the associated issues is introduced. It involves the collaboration of software agents residing on the group members’ nodes to collect, organize and efficiently exchange resources information.
Keywords: collaborative agents, middleware, mobile computing, pervasive computing, resource discovery.
Autonomic Networking: The Knowledge Plane
Maďssa Mbaye and Francine Krief
System and Information Sciences Notes, Vol. 1, No. 3, July 2007, pp. 297-302
Abstract: Knowledge management is becoming more and more crucial towards the autonomic network management. Indeed, the knowledge plane has been designed to give self-management functions to network elements in the autonomic architecture. This paper focuses on the use of machine learning paradigm to realize the knowledge plane and gives an example of knowledge plane that tries to self-optimize the configuration of a DiffServ router.
Keywords: autonomic networking, DiffServ, knowledge plane, machine learning, quality of service, self-management.
A Self-organizing Service Discovery System Based on Semantic Overlay Networks
Shanshan Jiang, Finn Arve Aagesen and Hao Ding
System and Information Sciences Notes, Vol. 1, No. 3, July 2007, pp. 303-309
Abstract: A network of autonomous directories forming a large-scale distributed service discovery system is considered. It is proposed to organize directories into Semantic Overlay Networks (SON) based on service ontology. The various SONs are further organized in super-peer networking structures. The focus is on the functionality for the organization of directories into SONs and the self-organizing construction and maintenance of super-peer SON networks. Simulations indicate that the proposed functionality gives super-peer networks with a small number of SONs and a small SON size that require a small management procedure overhead. The self-organization time is short both for SON initial construction and in node leaving situations. Moreover, discovery procedure overhead is significantly reduced compared to a system based on a random overlay network.
Keywords: self-organizing, semantic overlay network, service discovery, super-peer network.
MASSOP: A Self-organizing Protocol for Multi-agent Systems Inspired by Bacteria Colonies
H. Mellah, S. Hassas and H. Drias
System and Information Sciences Notes, Vol. 1, No. 3, July 2007, pp. 310-314
Abstract: Among the problems characterizing communication networks we quote the establishment and maintenance of cooperation between nodes. The communication network can be regarded as a Multi-agent System (MAS) where each agent represents a node. The protocol (MASSOP) that we propose ensures a continuous assessment in the MAS. When a problem is detected by the means of a keep-alive signal exchange between agents, and then located either at the agent level or on communication network level, the routing process is launched. This protocol emerges new organizations so that the interactions between the agents always continue; each agent temporarily has the privilege to be a leader. These features give to the system a self-organizing aspect whose principal inspiration source is taken from bacterial colony life.
Keywords: protocol, multi-agent systems, self-organization, bacteria colonies.
Link Maintenance and Compensation for Cognitive UWB Radio Systems
Jin Tian and Guangguo Bi
System and Information Sciences Notes, Vol. 1, No. 3, July 2007, pp. 315-320
Abstract: The paper puts forward a new model of link maintenance and compensation for cognitive UWB (ultra-wideband) radio systems. In this model, the link maintenance is combined with change of modulation method. Performance analysis conducted for this model shows that Cognitive UWB supports sub-carriers selection model of band with 528 MHz wide, and primary users appearance affects goodput through channel processes. The retransmission of last data and the change of modulation method enhance the robustness against primary users interference, and compensate to data corruption due to primary users interference.
Keywords: cognitive radio, link compensation, link maintenance, UWB.
Towards Self-Configuration in Multiple Network Interfaces Communications
System and Information Sciences Notes, Vol. 1, No. 3, July 2007, pp. 321-325
Abstract: Multiple network interface cards between a pair of computers can be utilized to enhance communication performance properties such as throughput, transfer time, and reliability between them. One model that can be used for enabling communication through multiple network interface cards is MuniSocket (Multiple-Network-Interface Socket). Unlike regular socket, MuniSocket can be configured to deal with multiple network interfaces to enhance communication. Although the MuniSocket model has some communication performance advantages over the regular socket, it has a number of usability drawbacks including the complexity of connection establishment configuration and configuration for good communication performance. This paper discusses several enhancements for MuniSocket using self-configuration techniques, which enhance communication performance among computers and reduce the complexity of configuring MuniSockets. While these enhancements improve the process of configuring MuniSocket for good communication performance, they also make the MuniSocket interface compatible with the regular TCP socket interface, which enhances usability.
Keywords: autonomic communication, computer networks, MuniSocket.
Static Task Scheduling Algorithm in the Grid
Zhongping Zhang and Xinyuan Liu
System and Information Sciences Notes, Vol. 1, No. 4, July 2007, pp. 327-331
Abstract: Efficient scheduling of processes onto processors of a grid system has always been an important and challenging area of research. However the problem of discovering the schedule that gives the minimum finish time is NP-Complete. By combining several innovative techniques, including task duplication and insertion-based scheduling, we present a new heuristic, known as Duplication and Insertion Based Scheduling (DIBS), It can execute multiple application programs simultaneously and sorting the task by the decisive path to reduce the total executing time of the application programs. The algorithm balances the load among each processor as well. We compare the performance of DIBS, under a range of input conditions, with two of the best existing heuristics scheduling algorithm namely LHCNF and STDS. We show that DIBS outperforms the two heuristics in the makespan and the number of processors employs over a wide range of parameters. This algorithm is more suitable for the complex environment and assures the QoS of tasks more effectively in the grid.
Keywords: DAG; finish time; grid; heuristic, makespan; scheduling; task duplication.
An Adaptive Proxy Certificate Management Framework for Grid Security
Jingbo Xia and Ying Liu
System and Information Sciences Notes, Vol. 1, No. 4, July 2007, pp. 332-335
Abstract: Grid Security Infrastructure (GSI) that is the portion of the Globus Toolkit has been developed to support Grid security environments. GSI provides a delegation capability by using Proxy Certificates. This paper analyses the mechanism of the Proxy Certificates in GSI and a new adaptive Proxy Certificates management scheme is brought forward based on the hierarchical one-way hash chains. The hierarchical one-way chain consists of two or more levels of chains, where values of a first-level chain act as roots of a set of second-level chains and each Proxy Certificate is protected by a hash value, so the Proxy Certificates’ available time can be controlled adaptively and safely. The experimental results indicate that the improved scheme can achieve higher success ratio of Grid tasks and not bring additional overhead.
Keywords: Grid, GSI, hash value, one-way hash chains, proxy certificate.
Sharing Data by Spatial Information Grid for Geo-Computation
ZhenChun Huang, Yi Zeng, ZhongLiang Ai and GuoQing Li
System and Information Sciences Notes, Vol. 1, No. 4, July 2007, pp. 336-341
Abstract: A distributed, platform-independent, extensible, robust, autonomic data sharing system which can on-stop serve the users and applications is needed for the geo-computation research. In this paper, based on spatial information grid (shortly SIG), a 4-layered data sharing system which is built up by data nodes, data sources, data agencies, support libraries, and other components is proposed. It adopts an XML based extensible data accessing language as the operating protocol for the data sources and data agencies. Furthermore, some primary data sources and data agencies are designed and implemented; and based on them, a prototype of the data sharing system is constructed and tested. The test shows that the SIG based data sharing system can provide different sources, types and formats of spatial information data and make it easier to build up application for geo-computation.
Keywords: data sharing, spatial information grid.
A Service-Oriented Medical Data Analysis Grid Platform
Xin Wang, Jiankun Wu, Linpeng Huang, Gang Huang and Bin Chu
System and Information Sciences Notes, Vol. 1, No. 4, July 2007, pp. 342-346
Abstract: Digital medical data analysis is important for health care. But the expanding of data and the need of large-scale computing power in distributed environment are main challenges for it. Grid techniques can provide the high performance of computing environment. It offers an effective way to deal with medical data analysis challenges. So in this paper, we propose a service-oriented medical data analysis grid platform. In the platform, all the resources and functions are wrapped as web services. Service management is provided for these services. This platform introduces MATLAB into grid environment to improve the ability of analyzing medical data. At the end of this paper, we also present the implementation of the platform.
Keywords: grid platform, MATLAB, medical data analysis, web service.
Evaluation Model for BPEL-Based Web Service Composition
System and Information Sciences Notes, Vol. 1, No. 4, July 2007, pp. 347-352
Abstract: The trustworthiness is the key of service selection, application and integration. The challenge is brought by dynamic characteristics and multi-dimension of Web service composition for evaluating Web service composition. Based on complexity of architecture and application, and dynamics of Web service composition, an adaptive evaluation model for BPEL-based Web service composition is proposed in this paper. In this model, a new approach to rank Web service composition is adopted, and the contribution of quality factor to service evaluation is adjusted dynamically to evaluate the quality of the Web service composition effectively. The quantitative quality of BPEL-based Web service composition is decided by occurrence probability and the quality of constituent activities. The probabilistic analysis is presented to calculate the quality of Web service composition according to the composite way. The evaluation model is supported by fluctuating weight theory, standard quantity metrics, and the probabilistic analysis. We also give an example to illustrate the adaptive evaluation model of BPEL-based Web service composition.
Keywords: business process execution language for web services, evaluation model, fluctuating weight, service quality dimension.
PERCHE: A Public Registry for Choreographies
Liliana Ardissono, Roberto Furnari, Anna Goy, Giovanna Petrone and Marino Segnan
System and Information Sciences Notes, Vol. 1, No. 4, July 2007, pp. 353-358
Abstract: When Web Service composition takes place in an open environment, involving services that belong to different organizations, a choreography-level registry can play a major role. Such a registry acts as a “mediator” between companies providing individual services and companies providing complex business models as choreographies. We propose a framework, called PERCHE, that supports the management of public registries for choreographies: when a provider aims at offering a complex service which involves the cooperation of different participants (roles), it publishes the choreography specification onto the registry. The choreography (global view) is splitted into the interaction protocols of the individual roles (local views). To join a choreography, a company applies for a specific role, by providing an implementation of the corresponding interaction protocol. We present the architecture and functionality of the PERCHE framework, discussing the relations between global and local views, briefly facing the issue of the choice of a suitable choreography language, and providing an example, to show how a registry based on the PERCHE framework works.
Keywords: choreography, heterogeneous services interoperation, registry, service composition, service discovery, service infrastructure, service interaction, web service.
mobiWSC: A Mobile Agent Based Broker for Web Service Composition
Zhuzhong Qian, Sanglu Lu and Li Xie
System and Information Sciences Notes, Vol. 1, No. 4, July 2007, pp. 359-364
Abstract: Currently composite web services have been applied in various environments. However, the execution of a composite service supported by prevailing WSC engines needs a central peer to coordinate the available services and all the data transfers are through the center. This kind of centralized approach is not suitable in a pervasive environment, because of bandwidth and relatively unstable connection. This paper presents a mobile agent based broker mobiWSC to achieve WSC tasks which is a decentralized approach without a physical central peer, so that it can effectively reduce the data transmission. And for the autonomy of agent, it can achieve composite services in unreliable environments. This paper focuses on the architecture, lifecycle and communication mechanism of mobile agents that achieve composite service effectively.
Keywords: mobile agent, orchestration, web service composition.
Design of An SLA-Based Service Monitor System Using Agents
Li-Der Chou, Chien-Chi Chen, Yung-Shih Wang and Po-Chia Tseng
System and Information Sciences Notes, Vol. 1, No. 4, July 2007, pp. 365-368
Abstract: With the development of Web Service technologies, it becomes more and more popular in recent years. Web Service is based on the open standard protocol and provides a platform for distributed system. Besides, in the aspect of service requesters, Quality of Service (QoS) is the key issue to decide whether to use the service or not. In the paper, we propose a mechanism to monitor the service using agent. The mechanism aims to manage the Service Level Agreement (SLA) and monitor the SLA negotiated with service requesters and service providers. While any action infringes SLA, the mechanism will handle it with some appropriate functionality.
Keywords: quality of service, service level agreement, web services.
MDA and SOA: Two New Architectures to Improve the Software Development Process
Rasoul karimi, Mohammad Ahmadi, Farnaz Nekui, Amir Bahram Behroozi and Kianoosh Mafakheri
System and Information Sciences Notes, Vol. 1, No. 4, July 2007, pp. 369-372
Abstract: Most of the software projects are not performed on the anticipated time and cost and their quality is lower than what users want. Many efforts have been done since several decades ago to solve this problem by offering new methodologies, architectures, tools, modeling languages and programming languages. Model Driven Architecture (MDA) and Service Oriented Architecture (SOA) are two new architectures that software companies have found them serious and significant to cope with this problem and are very promising. In this article we describe these architectures and state how they can be effective in software development. We then introduce the integration of these architectures which is a hot discussion in software academic world. We also provide an analytical examination to show the significance of MDA to facilitate the software development.
Keywords: model driven architecture (MDA), service oriented architecture (SOA).
Towards Dynamic Update in Component-Based Services
Xiaohui Xu, Linpeng Huang and Dejun Wang
System and Information Sciences Notes, Vol. 1, No. 4, July 2007, pp. 373-379
Abstract: The service-oriented software system is highly vulnerable and subject to constant change, but there is no appropriate time to bring down a service to perform maintenance operations. So the dynamic updates issue is becoming more urgent as developers are dealing with a more distributed set of software components that aren’t necessarily under their control. This paper proposes the Dynamic Update Adapter (DUAdapter), a framework structured as an independent generic middleware component resides on top of the constituent components, to allow service updates on the fly and it includes all the necessary functionalities that support performing the identified kinds of dynamic updates and provide necessary service state transformation.
Keywords: dynamic update, service-oriented computing, software component.
Verification and Implementation of Reliable Service Composition for High-Performance Service Computing
Ruonan Rao, Qingjun Xiao and Jinyuan You
System and Information Sciences Notes, Vol. 1, No. 4, July 2007, pp. 380-383
Abstract: Reliable Service Composition is an important field of high-performance service computing, however it lacks mature formalized methods in modeling and verification. Since there’re many effective tools in concurrent systems such as extension automata and temporal logic, we try to use SPIN -a conventional model-checking tool to analyze reliability and liveness of WSAT protocol, indicate counter case to locate inappropriateness in current version of WS-AT and propose improvement for the standard. We also suggest a framework to combine WS-AT with WS-BPEL and an implementation for declarative transaction demarcation based on decorator pattern in Petri nets.
Keywords: model checking, Petri nets, reliable service composition, web service, WS-AT, WS-BPEL.
A SLA-Based Web Services Response Performance Guarantee Model
Chuanchang Liu, Zhongwei Li and Junliang Chen
System and Information Sciences Notes, Vol. 1, No. 4, July 2007, pp. 384-389
Abstract: With Web services technique is widely applied in e-business, how to guarantee Web services response performance is becoming a hot topic. Combining Web services invocation model, the paper analyzes factors influencing on Web services response performance from three levels of service transmission, SOAP protocol realization and Web services runtime environment. Then, based on the idea of differentiating web services, the paper proposes a SLA-based Web services response performance guarantee model to improve Web services runtime environment, and expatiates on the key techniques of realizing the mode. Experiments prove the model can ensure the response performance of different level Web services requests.
Keywords: genetic algorithm, resource allocation, web services response performance, utility function.
DDoS Attack Detection and Defense based on Feature and Data Fusion
Shaohua Teng, Wei Zhang, Zhaohui Zhu and Naiqi Wu
System and Information Sciences Notes, Vol. 1, No. 4, July 2007, pp. 390-395
Abstract: Based on the analysis of damage and principle of DDoS attack, a detection algorithm model on DDoS attack is designed and realized, and a tracking method on DDos attack is then given. Attack based on TCP’s 3-way handshake protocol is the most common DDoS attack, for which a defense method is given in the last.
Keywords: DDoS, defense, feature fusion, intrusion detection, multi-agent.
An Algorithm for Web Service Discovery Based on Semantic Similarity of Service Properties
Tian Qiu, Lei Li and Pengfei Li
System and Information Sciences Notes, Vol. 1, No. 4, July 2007, pp. 396-401
Abstract: The proliferation of web services raises the challenging problem of service discovery. UDDI has the limitation of lack of semantic inference support, and the search mechanism based on keyword and categorization information leads to a limited performance. The problem can be addressed by adopting OWL-S in web service discovery. In this paper a matching algorithm for service discovery is proposed based on semantic similarity of service properties, aiming at enhancing both recall and precision of web service search. The algorithm includes a key function of semantic similarity measure that produces numeric similarity degree of ontology entity concepts. In this paper the algorithm is described in details, and experimental results are also presented to show the effectiveness of the algorithm.
Keywords: OWL-S, semantic similarity, web service.
A Web Service Retrieval Method Based on Behavior Specification Matching
Fanchao Meng, Dechen Zhan and Xiaofei Xu
System and Information Sciences Notes, Vol. 1, No. 4, July 2007, pp. 402-408
Abstract: The capability to accurately and efficiently find useful business process services becomes increasingly critical in Service Oriented Architecture (SOA). However, current approaches for web services retrieval are limited to the matching of key words or the input/output of services, which can not meet the needs of business process in efficiency and accuracy. Aiming to this problem, this paper presents a web service retrieval method based on behavior specification matching. We use finite state machine to describe the behavior specification, and OWL-S capture the semantics of type classes contained in web services. Based on the semantics of the type classes, we give the definition of operation specification relationship between operations and present four types of behavior specification relationships between web services. To retrieve most suitable web service from candidate web services, a set of metrics are used to calculate the matching cost between the web service of user requirement and candidate web services. Our approach can not only judge whether the behavior of a web service exactly satisfies user requirement, but also consider an approximate matching.
Keywords: web service, service retrieval, behavior specification, finite state automata, matching cost.
Improved Tradeoff-Based Models of the Internet
Anthony Spatharis, Ilias Foudalis, Minas Gjoka, Panagiota Krouska, Christos Amanatidis, Christos Papadimitriou and Martha Sideri
System and Information Sciences Notes, Vol. 1, No. 4, July 2007, pp. 409-414
Abstract: This paper introduces and evaluates several new models of the Internet graph, inspired by the model proposed by Fabrikant, Koutsoupias, and Papadimitriou (FKP), in which connections are chosen based on a tradeoff between a geometric objective and a topology objective. For each new node, the proposed models add at least two edges which optimize in addition to the original tradeoff, secondary criteria such as path independence, and then proceed to add, with some small probability, a new edge from the receiving node. In another version of the model, new edges can be added only to certain nodes, which are designated as fertile, an attribute that changes dynamically. These models are evaluated by comparing them to the real Internet AS graph (or network, interchangeably) with respect to a suite of many test parameters (such as power law exponent and local clustering rank) proposed in the literature.
Keywords: complex networks, Internet topology, multi-objective optimization, network modeling and simulation, power-law, scale-free graphs.
Evolution of Internet Topology in the Past Decade
Yuchun Guo and Changjia Chen
System and Information Sciences Notes, Vol. 1, No. 4, July 2007, pp. 415-419
Abstract: Internet topology characterizing and modeling has been an interdisciplinary research focus after the discovery of power-law degree distribution in Internet AS-level topology. Some researches on the temporal evolution of AS-level topology have been given based on the RouteViews topology data from late 1997 till early 2002. In this paper, we present a much longer time-spanned temporal evolution analysis of the Internet AS-level topology in the past decade. Our analysis indicates that the growth patterns and the statistical properties of the AS graphs afterwards are quite different from the observations reported for the earlier shorter period. This work may enable a more comprehensive understanding of the Internet evolution as well as some perspectives to revisit the characterizing and modeling of Internet topology evolution.
Keywords: evolution, internet, topology, degree distribution, degree-degree correlation.
The Trust Model on Internet-Based Interorganizational Systems
Viny W. L. Tong and Ivan K. W. Lai
System and Information Sciences Notes, Vol. 1, No. 4, July 2007, pp. 420-425
Abstract: Collaboration among companies can strengthen competitiveness in the highly changing market. Due to the emergence of Internet and the trend of globalization, there has been a rapid increase in the adoption of Internet-based Interorganizational Systems (IIOS) to facilitate the collaboration. Though IIOS brought many benefits, the problems of security and trust of the IIOS perceived by the users pose the hesitation to adopt IIOS. There are many studies on the trust issues on consumer-to-business environment. However, little literature was found on business-to-business context. There is a need to have a holistic framework of trust to facilitate the effective planning of IIOS to adapt to the highly competitive environment. In this paper, a trust model with six factors, which covered both the technical and psychological aspects, is proposed. In order to validate this model, further study is suggested. This trust model facilitates the decision making of both senior management and IT practitioners when making adoption decision on IIOS. It also provides a base for further research on the critical success factors of IIOS adoption.
Keywords: Internet-based Interorganizational systems (IIOS), Partnership, Security, Trust.
A Coordination Model for Dynamic Updating of Distributed Components
Dejun Wang, Linpeng Huang, JianKun Wu and Xiaohui Xu
System and Information Sciences Notes, Vol. 1, No. 4, July 2007, pp. 426-430
Abstract: In this paper, we present a coordination model for dynamic updating of distributed components. This model mainly concerns on control of updating time, order and state transferring and version change of dependent distributed components. This model mainly presents a coordination algorithm to control safe and updatable state’s arriving of multiple dependent components and execute dynamic updating orderly to preserve distributed system state’s consistency before and after updating.
Keywords: dynamic updating, distributed system, distributed components, coordination model.
Design and Implementation of SIGRE -- A Spatial Information Grid Runtime Environment for Geo-computation
ZhenChun Huang, ZhongLiang Ai, GuoQing Li, Bin Du, Yi Zeng and Lei Gu
System and Information Sciences Notes, Vol. 1, No. 4, July 2007, pp. 431-434
Abstract: Spatial Information Grid is a kind of application grid which tries to connect geo-computing resources and builds a distributed, robust, flexible and powerful infrastructure for geo-computation. It needs a powerful and easy-to-use running environment. In this paper, a runtime environment is proposed and named SIGRE -- the Spatial Information Grid Runtime Environment. Based on it, SIG resources can be distributed, discovered, and matched autonomically. Based on the implementation of SIGRE by java language, a SIG testbed is constructed, and the test on it shows that SIGRE can provide a powerful, easy-to-use, and robust runtime environment for SIG, and developers can develop SIG resources and SIG applications on SIGRE easily and quickly.
Keywords: geo-computation, runtime environment, spatial information grid.
Management and Context Integration Based on Ontologies Behind the Interoperability in Autonomic Communications
J. Martín Serrano, Joan Serrat, John Strassner and Mícheál Ó Foghlú
System and Information Sciences Notes, Vol. 1, No. 4, July 2007, pp. 435-442
Abstract: Next generation networks and services operation involve information management capabilities for improving the efficacy of the communication systems supporting pervasive services. This paper presents research challenges in self-management of network services, focusing on the modelling and integration of context information for supporting the management operations of such services in next generation networks. The research focuses on service management operations and the context information interoperability within the framework of pervasive services and autonomic communications. In this paper a novel management technique using information and data models, combined with context information based on ontologies, is introduced. We describe the use of Ontology-based management and modelling techniques within a distributed and scalable framework, and outline representative ontology solutions for information management to support pervasive services using ontology-based models. This provides a flexible approach for end-user communications services in heterogeneous technology systems.
Keywords: Autonomic communications, context integration, context-awareness, next generations networks and services, ontology engineering, ontology-based integration, pervasive services, self-management, interoperability.
Copyright © 2007 Systemics and Informatics World Network