Our key project, CROWN (China Research and Development Environment Over Wide-area Network), aims to empower in-depth integration of resources and cooperation of researchers nationwide and worldwide using grid technolo...
详细信息
over the last few years, Grid technologies have progressed towards a service-oriented paradigm that enables a new way of service provisioning based on utility computing models. Users consume these services based on th...
详细信息
This paper specifies an advance reservation and co-allocation protocol for grid computing, and a simple framework for supporting well defined charging models. The protocol supports arbitrary level of nesting, that is ...
详细信息
The key issue of Peer Data Management systems (PDMSs) is how to efficiently organize and manage distributed resources in P2P networks to accurately route queries from the peer initiating the query to appropriate peers...
详细信息
In this paper, we propose four general queueing models based on input and server distributions, to analyze a special Grid system, VEGA grid system version 1.1 (VEGA1.1). The mean queue lengths and mean waiting times o...
详细信息
For wireless sensor networks, localization is crucial due to the dynamic nature of deployment. In relative localization, nodes use the distance measurements to estimate their positions relative to some coordinate syst...
详细信息
ISBN:
(纸本)0769523285
For wireless sensor networks, localization is crucial due to the dynamic nature of deployment. In relative localization, nodes use the distance measurements to estimate their positions relative to some coordinate system. In absolute localization, a few nodes (called anchors) need to know their absolute positions, and all the other nodes are absolutely localized in the coordinate system of the anchors. Relative and absolute localization methods differ in both the performance and the cost. We present a new approach to relative localization that we refer to as: Simple Hybrid Absolute-Relative Positioning (SHARP). In SHARP, a relative localization method (M1) is used to relatively localize N-r reference nodes. Then, an absolute localization method (M2) uses these N-r nodes as anchors to localize the rest of the nodes. Choosing N-r, M1, and M2 gives a wide range of performance-cost tuning. We have done extensive simulation using the multidimensional scaling (MDS) method as M1 and the Ad-hoc Positioning System (APS) method as M2. While previous research shows that MDS gives better localization results than APS, our simulation shows that SHARP outperforms MDS if both the localization error and the cost are considered.
DIET (distributed Interactive Engineering Toolbox) is a set of hierarchical components to design Network Enabled Server (NES) systems. In these systems, clients ask to agents (discovery and scheduling components) to f...
详细信息
Business rules change quite often. These changes cannot be handled efficiently by representing business rules embedded in the source code of the business logic. Efficient handling of rules that govern ones business is...
详细信息
ISBN:
(纸本)0769522777
Business rules change quite often. These changes cannot be handled efficiently by representing business rules embedded in the source code of the business logic. Efficient handling of rules that govern ones business is one factor for success. That is where business rules engines play an important role. The service-oriented computing paradigm is becoming more and more popular Services offered by different providers, are composed to new services by using Web service composition languages such as BPEL. Such process-based composition languages lack the ability to use business rules managed by different business rules engines in the composition process. In this paper we propose an approach on how to use and integrate business rules in a service-oriented way into BPEL.
Grid technologies enable the sharing of a wide variety of distributed resources. To fully utilize these resources, effective resource discovery mechanisms are necessities. However, the complicated and dynamic characte...
详细信息
Mobile agents are no longer a theoretical issue since different architectures for their realization have been proposed. With the increasing market of electronic commerce it becomes an interesting aspect to use autonom...
详细信息
ISBN:
(纸本)0780391799
Mobile agents are no longer a theoretical issue since different architectures for their realization have been proposed. With the increasing market of electronic commerce it becomes an interesting aspect to use autonomous mobile agents for electronic business transactions. Being involved in money transactions, supplementary security features for mobile agent systems have to he ensured. Fault-tolerance is fundamental to the further development of mobile agent applications. In the context of mobile agents, fault-tolerance prevents a partial or complete loss of the agent, i.e., ensures that the agent arrives at its destination. Simple approaches such as checkpointing are prone to blocking. Replication can in principle improve solutions based on checkpointing. However, existing solutions in this context either assume a perfect failure detection mechanism (which is not realistic in an environment such as the Internet), or rely on complex solutions based on leader election and distributed transactions, where only a subset of solutions prevents blocking This paper proposes a novel approach to fault-tolerant mobile agent execution, which is based on modeling agent execution as a sequence of agreement problems. Each agreement problem is one instance of the well-understood consensus problem. Our solution does not require a perfect failure detection mechanism, while preventing blocking and ensuring that the agent is executed exactly once.
暂无评论