Edge computing, as a new computing paradigm, brings cloud computing’s and storage capacities to network edge for providing low latency services users. The networked servers in specific area constitute edge systems (ESSs), where popular data can be stored serve the users area. novel ESSs raise many opportunities well unprecedented challenges. Most existing studies of focus on replicas sys...

As an important component of China’s transportation data sharing system, high-speed railway data sharing is a typical application of data-intensive computing. Currently, most high-speed railway data is shared in cloud computing environment. Thus, there is an urgent need for an effective cloud-computing-based data placement strategy in high-speed railway. In this paper, a new data placement stra...

Grid presents a continuously changing environment. It also introduces a new set of failures. The data grid initiative has made it possible to run data-intensive applications on the grid. Data-intensive grid applications consist of two parts: a data placement part and a computation part. The data placement part is responsible for transferring the input data to the compute node and the result of ...

The retrieval process of a continuous media is considered as a periodic request which each subrequest retrieves a block of data. The next data block has to be ready before the display of the current data block is completed. The size of data block, called buuer size, along with the access time of the data block then determine the number of such requests that can be supported. This implies that t...

Cloud data storage platforms have attracted increasing attention in data management. Data replication is a well-known technique that reduces access latency, thus improving cloud data storage availability and performance. Nonetheless, replica placement algorithms are among the significant issues in data replication, which affect data availability and access performance considerably. Replica plac...

Communication placement analysis is an important step in the compilation of data-parallel programs. However, to simplify the placement analysis, previous techniques ignored most machine-dependent resource constraints. This paper demonstrates the necessity of incorporating resource constraints in ensuring the correctness of the communication placement. It presents a new placement analysis techni...

Routing is a challenging issue in Mobile Ad hoc Network to pass the data packets through intermediate hops in an efficient manner. In this paper, Reactive routing protocols namely AODV and DSR are evaluated under the feasible placement and random placement models. Simulation results shows that AODV and DSR are performing better in feasible placement approach comparative to the existing random p...