Scheduled System Maintenance:
On May 6th, single article purchases and IEEE account management will be unavailable from 8:00 AM - 12:00 PM ET (12:00 - 16:00 UTC). We apologize for the inconvenience.
By Topic

Future Trends of Distributed Computing Systems, 2008. FTDCS '08. 12th IEEE International Workshop on

Date 21-23 Oct. 2008

Filter Results

Displaying Results 1 - 25 of 49
  • [Front cover]

    Publication Year: 2008 , Page(s): C1
    Save to Project icon | Request Permissions | PDF file iconPDF (277 KB)  
    Freely Available from IEEE
  • [Title page i]

    Publication Year: 2008 , Page(s): i
    Save to Project icon | Request Permissions | PDF file iconPDF (15 KB)  
    Freely Available from IEEE
  • [Title page iii]

    Publication Year: 2008 , Page(s): iii
    Save to Project icon | Request Permissions | PDF file iconPDF (47 KB)  
    Freely Available from IEEE
  • [Copyright notice]

    Publication Year: 2008 , Page(s): iv
    Save to Project icon | Request Permissions | PDF file iconPDF (46 KB)  
    Freely Available from IEEE
  • Table of contents

    Publication Year: 2008 , Page(s): v - viii
    Save to Project icon | Request Permissions | PDF file iconPDF (133 KB)  
    Freely Available from IEEE
  • Welcome from the Steering Chair

    Publication Year: 2008 , Page(s): ix
    Save to Project icon | Request Permissions | PDF file iconPDF (94 KB) |  | HTML iconHTML  
    Freely Available from IEEE
  • Welcome from Workshop Chair(s)

    Publication Year: 2008 , Page(s): x
    Save to Project icon | Request Permissions | PDF file iconPDF (93 KB)  
    Freely Available from IEEE
  • Message from Program Chair(s)

    Publication Year: 2008 , Page(s): xi
    Save to Project icon | Request Permissions | PDF file iconPDF (94 KB) |  | HTML iconHTML  
    Freely Available from IEEE
  • Committee Lists

    Publication Year: 2008 , Page(s): xii - xiii
    Save to Project icon | Request Permissions | PDF file iconPDF (122 KB)  
    Freely Available from IEEE
  • list-reviewer

    Publication Year: 2008
    Save to Project icon | Request Permissions | PDF file iconPDF (93 KB)  
    Freely Available from IEEE
  • Plenary Panel Session A:  Grand Challenges in Distributed Computing Systems

    Publication Year: 2008 , Page(s): 3
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (134 KB) |  | HTML iconHTML  

    First Page of the Article
    View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Energy Efficient Detections of Critical Events in Wireless Sensor Networks

    Publication Year: 2008 , Page(s): 4 - 10
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (713 KB) |  | HTML iconHTML  

    In many mission critical applications, one of the central tasks is to obtain aggregate values, such as AVERAGE and SUM, based on which critical conditions can be detected. Immediate measures can subsequently be taken to remove associated risks timely. However, there is no successful work for detecting such critical events energy efficiently. In this paper we propose a novel approach. A fully distributed algorithm is designed, in which each sensor makes the decision purely locally. The elegance of the algorithm is that a global network behavior can be presented based on individual node actions, without a central authority to coordinate. This effectively reduces unnecessary sensor reports for network-wide coordination. Our proposed algorithm, called MEES, has the property of a zero event-missing rate, i.e., critical events are always detected. There is a trade-off between the energy cost and the false positive. Simulation experimental results show that MEES is more appropriate for large-scale WSNs with highly dynamic sensing environments. The energy cost can be saved up to 70%. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Design and Evaluation of a Dynamic Continuous Media Streaming Supporting Method on the Basis of Logical Grid Hierarchy for MANETs

    Publication Year: 2008 , Page(s): 11 - 15
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (259 KB) |  | HTML iconHTML  

    As wireless connectivity is integrated into many handheld devices, streaming multimedia content among mobile ad-hoc peers is becoming a popular application. In this paper, we propose a dynamic service replication algorithm for providing guaranteed continuous streaming services to all nodes in mobile ad-hoc networks (MANETs). First, a MANET is comprised of logical grid hierarchy, and a streaming service is replicated to a lower server region of the logical grid hierarchy by considering the link availability between a mobile node and the streaming server within a server region or the popularity of the streaming service. We evaluate analytically the performance of the proposed algorithm, and compared with that of existing Qin's algorithm. Evaluation results show that our algorithm can achieve better streaming performance than Qin's algorithm. Therefore, the proposed algorithm not only improves the sharing availability of replicated streaming services but also controls efficiently the number of streaming service replications. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • An Adaptive Polling Scheme Supporting Audio/Video Streaming in Wireless LANs

    Publication Year: 2008 , Page(s): 16 - 22
    Cited by:  Papers (1)
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (274 KB) |  | HTML iconHTML  

    Nowadays IEEE 802.11 family is the most popular technology amongst wireless protocols including Bluetooth, UWB and WiMAX for wireless services, among which media streaming such as voice over Internet Protocol (VoIP) and IPTV are most demanded with high challenge. To accommodate the QoS issues, EDCA and HCCA functions are defined in IEEE 802.11e. However, EDCA provides QoS based on probability, so it is still unable to fulfill the requirements of time sensitive applications such as VoIP. In this study, we focus on HCCA polling scheme. We design a new time-based polling scheduler called Adaptive Time-Stamp Polling (ATSP) scheme for QoS improvement, as well as design a mechanism that detects silence mode of a VoIP conversation so as to reduce the frequency of polling silent stations. When the station comes back to talk-spurt mode, we revert to the original frequency to poll. Simulation results show that our scheme improves the QoS on throughput, jitter, and access delay significantly. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Towards Role-Based Authorization for OSGi Service Environments

    Publication Year: 2008 , Page(s): 23 - 29
    Cited by:  Papers (1)
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (313 KB) |  | HTML iconHTML  

    OSGi framework enables diverse devices to conveniently establish a local area network environment such as homes, offices, and automobiles. Access control is one of the crucial parts which should be considered in such emerging environments. However, the current OSGi authorization mechanism is not rigorous enough to fulfill security requirements involved in dynamic and open OSGi environments. This paper provides a systematic way to adopt a role-based access control approach in OSGi environments. We demonstrate how our authorization framework can achieve important RBAC features and enhance existing primitive access control modules in OSGi service environments. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Performance Analysis of Service Composition Using Ordinary Differential Equations

    Publication Year: 2008 , Page(s): 30 - 36
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (291 KB) |  | HTML iconHTML  

    Service composition accelerates rapid application development, service reuse, and complex service consummation, thus, quantitative characteristics such as service execution throughput should be evaluated to measure the system performance. Based on Continuous Petri Net, we build differential equation model for service composition. The service behavior can be analyzed from the curves of the solutions of the differential equations. The advantage of our method is that we can avoid state explosion problem while doing performance analysis. Our equations can be solved by Matlab and simulated with a tool: Snoopy. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • The BCD View Model: Business Analysis View, Service Composition View and Service Design View for Service Oriented Software Design and Development

    Publication Year: 2008 , Page(s): 37 - 43
    Cited by:  Papers (3)
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (504 KB) |  | HTML iconHTML  

    Service-Oriented Architecture (SOA) is a conceptual architecture that was proposed for supporting service-oriented computing. To obtain a successful design and development of service-oriented software, an architectural view model to represent and document various aspects of service-oriented software based on the SOA conceptual template is required. Various architectural view models have been proposed to support the design and development of objectoriented and component-based software, e.g., the 4+1 view model and Soni's architecture. However, research and academic literature on architectural approaches for service-oriented software are still scarce. We propose a practical and simple architectural view model focused on the design and development of service-oriented software called BCD, which consists of a Business analysis view, a service Composition view, and a service Design view. Using the BCD architectural view model, stakeholders in service-oriented software design and development can reduce development, communication, and maintenance costs, and improve product quality. Our view can also improve the efficiency of the design and development of service-oriented software by providing defined templates. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Event-Based Data Dissemination on Inter-Administrative Domains: Is it Viable?

    Publication Year: 2008 , Page(s): 44 - 50
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (769 KB) |  | HTML iconHTML  

    Middleware for timely and reliable data dissemination is a fundamental building block of the event driven architecture (EDA), an ideal platform for developing air traffic control, defense systems, etc. Many of these middlewares are compliant to the data distribution service (DDS) specification and they have been traditionally designed to be deployed on managed environments where they show predictable behaviors. However, the enterprise setting can be unmanaged and characterized by geographic inter-domain scale and heterogeneous resources. In this paper we present a study aimed at assessing the strengths and weaknesses of a commercial DDS implementation deployed on an unmanaged setting. Our experiments campaign outlines that, if the application manages a small number of homogeneous resources, this middleware perform timely and reliably. In a more general setting with fragmentation and heterogeneous resources, reliability and timeliness rapidly degenerate pointing out a need of research in self-configuring scalable event dissemination with QoS guarantee on unmanaged settings. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Human-Intention Driven Self Adaptive Software Evolvability in Distributed Service Environments

    Publication Year: 2008 , Page(s): 51 - 57
    Cited by:  Papers (3)
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (475 KB) |  | HTML iconHTML  

    Evolvability is essential to adapting to the dynamic and changing requirements in response to the feedback from context awareness systems. However, most of current context models have limited capability in exploring human intentions that often drive system evolution. To support service requirements analysis of real-world applications in distributed service environments, this paper focuses on human-intention driven software evolvability. In our approach, requirements analysis via an evolution cycle provides the means of speculating requirement changes, predicting possible new generations of system behaviors, and assessing the corresponding quality impacts. Furthermore, we also discuss evolvability metrics by observing intentions from user contexts. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Why Moodle

    Publication Year: 2008 , Page(s): 58 - 64
    Cited by:  Papers (9)
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (142 KB) |  | HTML iconHTML  

    Using the Internet to enhance e-learning has become a trend in modern higher education institutes. E-learning systems are increasingly becoming an important part of the strategy for delivering online and flexible e-learning. The main advantage of e-learning is the opportunity for students to interact electronically with each other and their teachers during forums, on discussion boards, by e-mail and in chat rooms. Though recognizing that the world at large will continue to use terminology in different and often ambiguous ways, the term of virtual learning environments (VLE) is used to refer to the on-line interactions of a variety of kinds that take place between learners and instructors. There are many pieces of software available that provide VLE systems, both commercial and open source software (OSS). One such system that has been gradually gaining worldwide popularity is known as Moodle. This paper focuses on this platform and on a comparison between VLE (Moodle) and other VLE systems in order to discover their strengths and limitations. The comparative study is in two phases. The first phase is based on the features and capabilities of VLE tools and the second phase is based on the technical aspects of the VLE platforms. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Distributed Scientific Workflow Management for Data-Intensive Applications

    Publication Year: 2008 , Page(s): 65 - 73
    Cited by:  Papers (1)
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (464 KB) |  | HTML iconHTML  

    Grids and service-oriented technologies are emerging as dominant approaches for distributed systems. Rising complexity of grid applications places new requirements and increases needs to improve the design and reusability of grid workflow systems. In particular, scientific data-intensive workflows require new approaches for integration and coordination of distributed resources. Traditional centralized approaches for workflow execution can be quite inefficient for such workflows. In order to clarify these issues, the paper surveys existing workflow management systems evaluating them practically on some use cases for management of natural resources from the multidisciplinary research project GLOWA Volta. Subsequently, the most important obstacles are identified and a new approach facilitating semantic oriented composition, reuse and distributed execution of workflows is proposed. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Developing Service-Based Software Systems with QoS Monitoring and Adaptation

    Publication Year: 2008 , Page(s): 74 - 80
    Cited by:  Papers (4)
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (278 KB) |  | HTML iconHTML  

    The rapid adoption of SOA in many large-scale distributed applications requires the development of adaptive service-based software systems (ASBS), which have the capability of monitoring the changing system status, analyzing and controlling tradeoffs among multiple QoS features, and adapting its service configuration to satisfy multiple QoS requirements simultaneously. In this paper, a performance-model-oriented approach to developing ASBS is presented. This approach consists of the establishment of performance models for SBS through controlled experiments, the development of QoS monitoring and adaptation (M/A) modules based on the performance models, and the validation of ASBS design through simulations. In our approach, four QoS features: timeliness, throughput, accuracy and security, which are important for many critical applications, are considered. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Progressive Ripple-Based Service Discovery for High Response Time in Autonomous Decentralized Community System

    Publication Year: 2008 , Page(s): 81 - 87
    Cited by:  Papers (3)
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (414 KB) |  | HTML iconHTML  

    Location based services (LBS) are expected to play crucial role in future of e-commerce. Although, LBS consider service provision on the basis of location, but don't take into consideration time aspect and user's interests. We propose incorporation of time-awareness and demand-oriented contexts along with location to develop idea of community pervasive services (CPS).To identify appropriate service provider subjected to real-time constraint in highly dynamic operational environment of autonomous decentralized community system (ADCS), efficient searching technique is required. Many existing resource discovery strategies in area of peer to peer and wireless ad hoc network can be captured by the n-ring model, which can't meet real time requirements in highly unpredictable and dynamic operating environment of ADCS. Therefore, we present novel idea of steady expanding search coupled with snail's pace advancement and swift boundary confining mechanism to seek appropriate service provider. Simulation results verify the effectiveness of the proposed technique. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • GSON: A Group Based Hierarchically Structured Overlay Network

    Publication Year: 2008 , Page(s): 88 - 94
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (355 KB) |  | HTML iconHTML  

    In a structured peer-to-peer (P2P) overlay network, the stability of the entire network will be greatly affected by simultaneous join-in and drop-out of large amount of nodes. Aiming at reducing the overhead of handling this activity, we propose a group-based hierarchically structured overlay network, GSON. GSON is also a structured P2P overlay network using distributed hash table (DHT). In GSON, nodes that are physically close to each other or under a common administrative control form a group by using a self-organizing protocol. Each group has a delegate to join the DHT on behalf of other nodes in the group. The information about the resource and membership is shared within the group. The delegate is responsible for passing information to all group members and publishing group resource to other groups. The resource of each group is mapped into the DHT. Simulation results show that GSON is more scalable, and can reach stable state more quickly than normal chord system under the circumstances that a large number of nodes joining and quitting the system simultaneously. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A Credit Evaluation Model for Computational Grid Nodes

    Publication Year: 2008 , Page(s): 95 - 98
    Save to Project icon | Request Permissions | Click to expandQuick Abstract | PDF file iconPDF (245 KB) |  | HTML iconHTML  

    Computational grid is a cooperative computing environment which collects all kinds of high performance software and hardware computing resources distributed in WAN and provides networked computing services. The computational grid systems that have been the focus of much research activities in the past years for controlled sharing of resources across institutional boundaries. Credit is one major concern in grid resource management that enables remote scheduling and execution. For the sake of improving the self-adaptability of resource management and accelerating the application and development of computational grid, an evaluation model of a computational grid nodepsilas credit is put forward which is based on the execution results of computational grid jobs on the node. Using this model the resource consumers and resource providers should abandon the vicious evaluating voluntarily. Applied in NPU Campus Computational Grid, this model achieves good effect. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.