The Escrow transactional method
ACM Transactions on Database Systems (TODS)
Semantics based transaction management techniques for replicated data
SIGMOD '88 Proceedings of the 1988 ACM SIGMOD international conference on Management of data
Handling hot spot data in DB-sharing systems
Information Systems
Analysis of Task Assignment Policies in Scalable Distributed Web-Server Systems
IEEE Transactions on Parallel and Distributed Systems
Data-valued partitioning and virtual messages (extended abstract)
PODS '90 Proceedings of the ninth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Comparative Models of the File Assignment Problem
ACM Computing Surveys (CSUR)
A fractional data allocation method for distributed databases
PDIS '94 Proceedings of the third international conference on on Parallel and distributed information systems
High Throughput Escrow Algorithms for Replicated Databases
VLDB '92 Proceedings of the 18th International Conference on Very Large Data Bases
An Analysis of Borrowing Policies for Escrow Transactions in a Replicated Data Environment
Proceedings of the Sixth International Conference on Data Engineering
Lottery scheduling: flexible proportional-share resource management
OSDI '94 Proceedings of the 1st USENIX conference on Operating Systems Design and Implementation
Deno: A Decentralized, Peer-to-Peer Object-Replication System for Weakly Connected Environments
IEEE Transactions on Computers
Reservations for Conflict Avoidance in a Mobile Database System
Proceedings of the 1st international conference on Mobile systems, applications and services
| Hi-index | 0.00 |
Abstract: The proliferation of e-commerce has enabled a new set of applications that allow globally distributed purchasing of commodities such as books, CDs, travel tickets, etc., over the Internet. These commodities can be represented on line by tokens, which can be distributed among servers to enhance the performance and availability of such applications. There are two fundamental approaches for distributing such tokens partitioning and replication. Partitioning-based approaches eliminate the need for tight quorum synchronization required by replication-based approaches. The effectiveness of partitioning, however, relies on token redistribution techniques that allow dynamic migration of tokens to where they are needed. We propose pair-wise token redistribution strategies to support applications that involve wide-area commodity distribution. Using a detailed simulation model and real Internet message traces, we investigate the performance of our redistribution strategies and a previously proposed replication-based scheme. Our results reveal that, for the types of applications and environment we address, partitioning-based approaches perform superior primarily due to their ability to provide higher server autonomy.