2013 IEEE 33rd International Conference on Distributed Computing Systems (2001)
Apr. 16, 2001 to Apr. 19, 2001
Ugur Çetintemel , University of Maryland, College Park
Banu Özden , Bell Laboratories, Lucent Technologies
Avi Silberschatz , Bell Laboratories, Lucent Technologies
Michael J. Franklin , University of California, Berkeley
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.
Ugur Çetintemel, Banu Özden, Avi Silberschatz, Michael J. Franklin, "Design and Evaluation of Redistribution Strategies for Wide-Area Commodity Distribution", 2013 IEEE 33rd International Conference on Distributed Computing Systems, vol. 00, no. , pp. 0154, 2001, doi:10.1109/ICDSC.2001.918944