1-5hit |
Akio KAWABATA Bijoy CHAND CHATTERJEE Eiji OKI
This paper proposes a network design model, considering data consistency for a delay-sensitive distributed processing system. The data consistency is determined by collating the own state and the states of slave servers. If the state is mismatched with other servers, the rollback process is initiated to modify the state to guarantee data consistency. In the proposed model, the selected servers and the master-slave server pairs are determined to minimize the end-to-end delay and the delay for data consistency. We formulate the proposed model as an integer linear programming problem. We evaluate the delay performance and computation time. We evaluate the proposed model in two network models with two, three, and four slave servers. The proposed model reduces the delay for data consistency by up to 31 percent compared to that of a typical model that collates the status of all servers at one master server. The computation time is a few seconds, which is an acceptable time for network design before service launch. These results indicate that the proposed model is effective for delay-sensitive applications.
Carlos PEREZ-LEGUIZAMO P. Josue HERNANDEZ-TORRES J.S. Guadalupe GODINEZ-BORJA Victor TAPIA-TEC
Recently, the Services Oriented Architectures (SOA) have been recognized as the key to the integration and interoperability of different applications and systems that coexist in an organization. However, even though the use of SOA has increased, some applications are unable to use it. That is the case of mission critical information applications, whose requirements such as high reliability, non-stop operation, high flexibility and high performance are not satisfied by conventional SOA infrastructures. In this article we present a novel approach of combining SOA with Autonomous Decentralized Systems (ADS) in order to provide an infrastructure that can satisfy those requirements. We have named this infrastructure Autonomous Decentralized Service Oriented Architecture (ADSOA). We present the concept and architecture of ADSOA, as well as the Loosely Couple Delivery Transaction and Synchronization Technology for assuring the data consistency and high reliability of the application. Moreover, a real implementation and evaluation of the proposal in a mission critical information system, the Uniqueness Verifying Public Key Infrastructure (UV-PKI), is shown in order to prove its effectiveness.
Fengjung LIU Chu-sing YANG Yao-kuei LEE
Replication to mask the effects of failures is a basic technique for improving reliability of a file system. Consistency control protocols are implemented to ensure the consistency among these replicas. The native token-based mechanism which merely sequences the distributed requests suffered from the poor system utilization due to the lack of dependence checking between writes and management of out-of-ordered requests. Hence, in this paper, by utilizing the idempotent property of NFS and executing ahead most of independent WRITE requests, the new consistency control scheme is proposed to improve the performance of operations and failure recovery. Finally, a numeric case shows the efficiency of the new scheme.
The explosive growth of the Web contents has led to increasing attention on two major challenges: scalability and high availability of network file system. In this paper, based on our previous reports, we introduced the concept of intermediate file handle to cover the heterogeneity of file system and proposed a new data consistency scheme to reduce the overhead of write request in the reliable network file system. In addition, we also proposed a simple load-sharing mechanism for NFS client to switch to a lightly-load server in order to improve the response time of READ requests. With such an approach, NFS Clients are always active. They issued their requests and waited the corresponding replies. Finally, we analyzed the new data consistency scheme. It shows truly that the scheme is able to improve the performance of our network file system
Masahiro KURODA Ryoji ONO Yoshiki SHIMOTSUMA Takashi WATANABE Tadanori MIZUNO
The optimistic consistency scheme has been established with respect to data consistency and availability in distributed systems. The nomadic data consistency model using version vectors to support data versioning for data synchronization and concurrent conflict detection is suitable for an optimistic replication system that supports large-scale wireless networks. This paper describes the architecture and its data consistency model using data versioning and its access domain control targeted for nomadic data sharing systems, such as collaborative works using database and messaging, and the data transfer optimizations of the model. We evaluate our data versioning scheme comparing with a traditional data versioning and the data transfer optimization by estimation and measurement assuming a mobile worker's job. We generate arithmetic formulas for data transfer estimation using the optimizing techniques and apply them to large-scale data sharing configurations in which collaboration groups are dynamically formed and data is exchanged in each group. The data versioning with an access domain increases flexibility in data sharing configurations, such as mobile collaboration systems and client/server type mobile systems. We confirmed that the combination of the general optimizations and the access domain configurations based on our data consistency model is applicable for large-scale mobile data sharing systems.