This Article 
 Bibliographic References 
 Add to: 
Scalable Stability Detection Using Logical Hypercube
September 2002 (vol. 13 no. 9)
pp. 972-984

Abstract—This paper proposes to use a logical hypercube structure for detecting message stability in distributed systems. In particular, a stability detection protocol that uses such a superimposed logical structure is presented, and its scalability is being compared with other known stability detection protocols. The main benefits of the logical hypercube approach are scalability, fault-tolerance, and refraining from overloading a single node or link in the system. These benefits become evident both by an analytical comparison and by simulations. Another important feature of the logical hypercube approach is that the performance of the protocol is in general not sensitive to the topology of the underlying physical network.

[1] The Ensemble Home Page, , 2002.
[2] R. Ahuja, S. Keshav, and H Saran, “Design, Implementation, and Performance of a Native Mode ATM Transport Layer,” IEEE/ACM Trans. Networking vol. 4, no. 4, pp. 502-515, Aug. 1996.
[3] Ö. Babaoglu, R. Davoli, L. Giachini, and M. Baker, “Relacs: A Communication Infrastructure for Constructing Reliable Applications in Large-Scale Distributed Systems,” Technical Report UBLCS-94-15, Dept. of Computer Science, Univ. of Bologna, June 1994, revised Jan. 1995.
[4] O. Baudon, G. Fertin, and I. Havel, “Routing Permutations and 2-1 Routing Requests in the Hypercube,” Discrete Applied Math., vol. 113, no. 1, pp. 43-58, 2000.
[5] K. Birman and T. Joseph., “Exploiting Virtual Synchrony in Distributed Systems,” Proc. ACM Symp. Operating Systems Principles, ACM Press, New York, 1987, pp. 123‐138.
[6] K. Calvert and E. Zegura, GT-ITM Random Network Generator,, 2002.
[7] B.S. Chlebus, K. Diks, and A. Pelc, "Optimal Broadcasting in Fault Hypercubes," Proc. IEEE 21st Int'l Symp. Fault-Tolerant Computing, pp. 266-273, June 1991.
[8] B.S. Chlebus, K. Diks, and A. Pelc, "Fast Gossiping With Short Unreliable Messages," Discrete Applied Math., special issue on gossiping, vol. 53, pp. 15-24, 1994.
[9] F. Cristian and S. Mishra, “The Pinwheel Asynchronous Atomic Broadcast Protocols,” Proc. Second Int'l Symp. Autonomous Decentralized Systems, 1995, Also: Technical Report CSE93-331, Dept. of Computer Science&Eng., Univ. of Calif., San Diego.
[10] D. Dolev and D. Malki, “The Transis Approach to High Availability Cluster Communication,” Comm. ACM, vol. 39, no. 4, pp. 64–70, 1996.
[11] R. Feldmann, J. Hromkovic, S. Madhavapeddy, B. Monien, and P. Mysliwietz, “Optimal Algorithms for Dissemination of Information in Generalized Communication Networks,” Proc. Parallel Architectures and Languages Europe, pp. 115-130, 1992.
[12] S. Floyd et al., "A Reliable Multicast Framework for Light-weight Sessions and Application Level Framing," Proc. 1995 ACM SIGComm Conf., ACM Press, New York, 1995, pp. 342-356.
[13] K. Guo, “Scalable Message Stability Detection Protocols,” PhD thesis, Computer Science Dept., Cornell Univ., May 1998.
[14] K. Guo and I. Rhee, “Message Stability Detection for Reliable Multicast,” Proc. of IEEE INFOCOM '2000, Mar. 2000.
[15] K. Guo, R. van Renesse, W. Vogels, and K. Birman, “Hierarchical Message Stability Tracing Protocols,” technical report, Dept. of Computer Science, Cornell Univ., 1997.
[16] M. Hayden, “The Ensemble System,” Technical Report TR98-1662, Dept. of Computer Science, Cornell Univ., Jan. 1998.
[17] J. J'aJ'a, An Introduction to Parallel Algorithms.New York: Addison-Wesley, 1992.
[18] H.P. Katseff, "Incomplete Hypercubes," IEEE Trans. Computers, vol. 37, no. 5, pp. 604-608, May 1988.
[19] D.W. Krumme, “Fast Gossiping for the Hypercube,” SIAM J. Computing, vol. 21, no. 2, pp. 365-380, Apr. 1992.
[20] R. Ladin, B. Liskov, L. Shrira, and S. Ghemawat, "Providing High Availability Using Lazy Replication," ACM Trans. Computer Systems, vol. 10, no. 4, pp. 360-391, Nov. 1992.
[21] F.T. Leighton,Introduction to Parallel Algorithms and Architectures: Arrays, Trees, Hypercubes.San Mateo, Calif.: Morgan Kaufmann, 1992.
[22] J. Liebeherr and T. K. Beam, “HyperCast: A Protocol for Maintaining Multicast Group Members in a Logical Hypercube Topology,” Proc. First Int'l Workshop Networked Group Comm. (NGC '99), pp. 72-89, July 1999.
[23] C. Malloth, P. Felber, A. Schiper, and U. Wilhelm, “Phoenix: A Toolkit for Building Fault-Tolerant Distributed Application in Large Scale,” technical report, Dept. d'Informatique, Ecole Polytechnique Federale de Lausanne, July 1995.
[24] S. Manor, “Scalable Multicast in a Logical Hypercube,” Master's thesis, Dept. of Computer Science, Technion - Israel Inst. of Tech nology, Aug. 1999.
[25] S. McCanne and S. Floyd NS (Network Simulator) Home Page,, 2002.
[26] L.E. Moser, P.M. Melliar-Smith, D.A. Agarwal, R.K. Budhia, and C.A. Lingley-Papadopoulos, “Totem: A Fault-Tolerant Multicast Group Communication System,” Comm. ACM, vol. 39, no. 4, pp. 54–63, 1996.
[27] OMG. CORBA/IIOP Specification 2. 4. 2. formal/2001-02-33, 2001.
[28] S. Paul, K.K. Sabnani, J.C.H. Lin, and S. Bhattacharyya, “Reliable Multicast Transport Protocol,” IEEE J. Selected Areas in Comm., vol. 15, no. 3, pp. 407–421, Mar. 1997.
[29] C.G. Plaxton, R. Rajaraman, and A.W. Richa, "Accessing Nearby Copies of Replicated Objects in a Distributed Environment," Proc. ACM Symp. Parallel Algorithms and Architectures, ACM Press, New York, 1997, pp. 311-320.
[30] Y. Saad and M. Schultz, "Topological Properties of Hypercubes," IEEE Trans. Computers, vol. 37, no. 7, pp. 867-872, July 1988.
[31] D.S. Scott, "Efficient All-to-All Communication Patterns in Hypercube and Mesh Topologies," Proc. Sixth Conf. Distributed Memory Concurrent Computers, pp. 398-403, 1991.
[32] I. Stoica et al., "Chord: A Scalable Peer-to-Peer Lookup Service for Internet Applications," Proc. ACM SIGCOMM, ACM Press, 2001, pp. 149-160.
[33] A.S. Tanenbaum, Computer Networks, third ed. Prentice Hall, 1996.
[34] R. van Renesse, “Masking the Overhead of Protocol Layering,” Proc. ACM SIGCOMM '96, pp. 96-104, Aug. 1996.
[35] R. van Renesse, K.P. Birman, and S. Maffeis, “Horus: A Flexible Group Communication System,” Comm. ACM, vol. 39, no. 4, pp. 76–83, 1996.
[36] B.Y. Zhao, J.D. Kubiatowicz, and A.D. Joseph, “Tapestry: An Infrastructure for Fault-Tolerant Wide-Area Location and Routing,” Technical Report UCB/CSD-01-1141, Computer Science Dept., Univ. of California at Berkeley, Apr. 2001.

Index Terms:
Distributed systems, reliable multicast, group communication, scalability.
Roy Friedman, Shiri Manor, Katherine Guo, "Scalable Stability Detection Using Logical Hypercube," IEEE Transactions on Parallel and Distributed Systems, vol. 13, no. 9, pp. 972-984, Sept. 2002, doi:10.1109/TPDS.2002.1036070
Usage of this product signifies your acceptance of the Terms of Use.