In this paper, we describe an efficient coordinated checkpointing and recovery algorithm which can work even when the channels are assumed to be non-FIFO, and messages may be lost. Nodes are assumed to be autonomous, ...
详细信息
the method of finding the optimal processing method to answer a query is called Query optimization, whereas a collection of various sites, distributed over a computer network is called distributed database. In Distrib...
详细信息
ISBN:
(纸本)9781509030385
the method of finding the optimal processing method to answer a query is called Query optimization, whereas a collection of various sites, distributed over a computer network is called distributed database. In distributed Database, the site communicates with each other through networks. the processing cost and the transmission cost are the important issues arise during evaluation of query cost. Several algorithms have been developed to find the best optimal solution for a particular query;however they all have their certain limitations. Hence, to find the optimal cost for a particular query is emerging as an open challenge for many researchers. therefore the cost-based query optimization technique has emerged as an important concept for dealing withthe query optimization. Withthe help of fragmentations one can replicate each fragment to various distributed sites, since
the significant resource requirements of distributed realtime multimedia applications often push today's system platforms to their limits. As a consequence, efficient, economic and adaptive management of resources...
详细信息
ISBN:
(纸本)9783540681397
the significant resource requirements of distributed realtime multimedia applications often push today's system platforms to their limits. As a consequence, efficient, economic and adaptive management of resources is a major issue in distributed multimedia systems. this paper outlines a model-based time service encompassing three different aspects of time that are fundamental for sophisticated strategies within cross layer failure semantics, flow control, and synchronization.
Network distributed radar track fusion with hierarchical structure is enhanced for distributed data fusion, it has its own characteristic and difficult. In this paper, a two hierarchical structure based fusion frame i...
详细信息
ISBN:
(纸本)9781612846835
Network distributed radar track fusion with hierarchical structure is enhanced for distributed data fusion, it has its own characteristic and difficult. In this paper, a two hierarchical structure based fusion frame is describe, simulation plat base on HLA is proposed, the component and framework is described, the process and realization during the whole fusion course for low-lever and high lever fusion center is analyzed, finally the demonstrated simulation is shown.
Checkpointing distributed database systems is useful for recovery from failures as well as for audit purposes. In this paper, we present a non-intrusive checkpointing algorithm for distributed database systems. Our ap...
详细信息
ISBN:
(纸本)9783540681397
Checkpointing distributed database systems is useful for recovery from failures as well as for audit purposes. In this paper, we present a non-intrusive checkpointing algorithm for distributed database systems. Our approach uses both checkpoints and transaction logs to capture a transaction-consistent state of the database which helps in reducing overall checkpointing overhead. Out approach is non-intrusive and hence does not block arriving or executing transactions during checkpointing.
Fog computing emerged as a new paradigm that pushes cloud applications to the network edge. the fog infrastructure contains mainly distributed and heterogeneous fog nodes that are characterized by their complex distri...
详细信息
ISBN:
(纸本)9781728148328
Fog computing emerged as a new paradigm that pushes cloud applications to the network edge. the fog infrastructure contains mainly distributed and heterogeneous fog nodes that are characterized by their complex distribution, high mobility and sporadic resources availability. this dynamic fog nodes behavior triggers new challenges in the resource management process, such as resources coordination for continuous quality-of-service satisfaction. In this paper, we propose a smart online resource allocation approach adapted for dynamic fog computing environments, aiming at maximizing the number of satisfied user requests within a predefined delay threshold. We model the fog computing environment as a Markov discrete process, where dynamic fog node behavior / mobility and resources availability are considered. then, we present our smart deep-reinforcement-learning resource allocation algorithm. Considering real-world mobility data sets, the near-optimal performance of the proposed solution is illustrated through simulations, and its superiority over heuristic state-of-the-art approaches is exposed.
Scientific experiments in a variety of domains are producing increasing amounts of data that need to be processed efficiently. distributedcomputing Infrastructures are increasingly important in fulfilling these large...
详细信息
ISBN:
(纸本)9781467344661;9781467344678
Scientific experiments in a variety of domains are producing increasing amounts of data that need to be processed efficiently. distributedcomputing Infrastructures are increasingly important in fulfilling these large-scale computational requirements.
the recent explosion of mobile Internet traffic has resulted in an evolution of mobile network architectures. Mobile network architectures are being flattened to cope withthe recent traffic growth. Existing IP mobili...
详细信息
the need for a safe and economically efficient traffic represents a challenge for creating traffic management systems. this paper deals with merging three basic concepts, namely cloud-based technologies, agent-based a...
详细信息
ISBN:
(纸本)9781509041237
the need for a safe and economically efficient traffic represents a challenge for creating traffic management systems. this paper deals with merging three basic concepts, namely cloud-based technologies, agent-based approaches and fuzzy cognitive maps to solve the localisation and path planing for several vehicles of different types in the form of independent agents, which communicate with a supervisory system located on the cloud. the proposed system was directly tested on a playground and obtained results were analysed using several selected criteria. Finally, some further possibilities of potential utilization and future research are mentioned.
Clustering in vanets is of crucial importance in order to cope withthe dynamic features of the vehicular topologies. Algorithms that give good results in Manets fail to create stable clusters since vehicular nodes ar...
详细信息
暂无评论