We have completed a full set of experiments on local and wide area networks. The experiments were conducted over a local cluster in our lab, the CAIRN wide area network, and at the Emulab facility hosted by the University of Utah. We were able to accurately emulate the physical topology of the CAIRN network on the Emulab machines. The Emulab machines have processing and disk IO resources comperable to those of our local cluster and we were able to get excellent results for the replication engine that showed the efficiency of the replication architecture and the practical capibility for wide area database replication.
Wackamole now supports four platforms, Linux, FreeBSD, Solaris 8, and Mac OSX. This release also focused on making Wackamole more robust and fixing deployment issues we received from users. Based on email queries and downloads Wackamole has started to make an impact as a different model for IP failover for clusters and to be used in practice.
The Archipelago system allows us to investigate efficient ways to form an extended ad-hoc network of laptops, handhelds, and other wireless capable devices, and bridge it to the Internet. Archipelago constructs a multi-hop dynamic network using the wireless devices of participating users. The current system is fully operational, capable of supporting up to about fifty participants using handhelds (Windows CE) and desktops or laptops (Windows and Linux), and up to 10 hops in network diameter.
| From Total Order to Database Replication |
|
ps,
ps.gz,
pdf.
Technical Report CNDS-2001-6, November 2001.
Yair Amir, and Ciprian Tutu. This paper presents in detail an efficient and provably correct algorithm for database replication over partitionable networks. Our algorithm avoids the need for end-to-end acknowledgments for each action while supporting network partitions and merges and allowing dynamic instantiation of new replicas. One round of end-to-end acknowledgments is required only upon a membership change event such as a network partition. New actions may be introduced to the system at any point, not only while in a primary component. We show how performance can be further improved for applications that allow relaxation of consistency requirements. We provide experimental results that demonstrate the superiority of this approach.
|
| Global Flow Control for Wide Area Overlay Networks: A Cost-Benefit Approach |
|
ps,
ps.gz,
pdf.
Accepted to the Fifth IEEE Conference on Open Architectures and Network Programming June 2002.
Yair Amir, Baruch Awerbuch, Claudiu Danilov, Jonathan Stanton This paper presents a flow control for multi-sender multi-group multicast and unicast in wide area overlay networks. The protocol is analytically grounded and achieves real world goals, such as simplicity, fairness and minimal resource usage. Flows are regulated based on the "opportunity" costs of network resources used and the benefit provided by the flow. In contrast to existing window-based flow control schemes, we avoid end-to-end per sender or per group feedback by looking only at the state of the virtual links between participating nodes. This produces control traffic proportional only to the number of overlay network links and independent of the number of groups, senders or receivers. We show the effectiveness of the resulting protocol through simulations and validate the simulations with live Internet experiments.
|
We plan to investigate techniques to make our overlay network architecture seamless to existing applications that use TCP/IP.