The Community for Technology Leaders
RSS Icon
Issue No.08 - August (2008 vol.19)
pp: 1057-1070
Collaborative multimedia applications (CMAs) on overlay networks are gaining popularity among users who are geographically dispersed. Examples of these kinds of applications include networked games and collaborative design and simulation. An important challenge in realizing CMAs is obtaining floor control, a problem in which the end-users compete among themselves to gain exclusive access to a shared resource. In this paper, we present deterministic and randomized distributed mechanisms for solving the floor control problem. In particular, we adapt the well-known MAC protocols viz. Distributed Queue Dual Bus (DQDB), ALOHA, and Carrier Sense Multiple Access (CSMA) as solutions for the floor control problem. Central to our adaptation is an algorithmic methodology that efficiently virtualizes the underlying network connecting the CMA participants so as to enhance the proposed solutions' performance. We present analytical and experimental studies on the performance of the proposed floor control protocols that bring out their essential characteristics.
Distributed Systems, Collaborative computing, Network Protocols, Algorithm/protocol design and analysis
Shankar M. Banik, Sridhar Radhakrishnan, Venkatesh Sarangan, Chandra N. Sekharan, "Implementation of Distributed Floor Control Protocols on Overlay Networks", IEEE Transactions on Parallel & Distributed Systems, vol.19, no. 8, pp. 1057-1070, August 2008, doi:10.1109/TPDS.2007.70807
[1] H.-P. Dommel and J.J. Garcia-Luna-Aceves, “Efficacy of Floor Control Protocols in Distributed Multimedia Environment,” Cluster Computing J., special issue on multimedia collaborative environments, vol. 2, no. 1, 1999.
[2] R. Yavatkar and K. Lakshman, “Communication Support for Distributed Collaborative Applications,” ACM/Springer Verlag J. Multimedia Systems, vol. 2, no. 2, 1994.
[3] G. Robins and A. Zelikovsky, “Improved Steiner Tree Approximation in Graphs,” Proc. 11th Ann. ACM-SIAM Symp. Discrete Algorithms (SODA '00), pp. 770-779, 2000.
[4] A.S. Tanenbaum, Computer Networks, third ed. Prentice Hall, 1996.
[5] K. Katrinis, G. Parissidis, and B. Plattner, “Activity Sensing Floor Control in Multimedia Collaborative Applications,” Proc. 10th Int'l Conf. Distributed Multimedia Systems (DMS '04), Sept. 2004.
[6] R. Qiu, F. Kuhns, and J.R. Cox, “A Conference Control Protocol for Highly Interactive Videoconferencing,” Proc. IEEE Global Telecomm. Conf. (GLOBECOM '02), pp. 2021-2025, Nov. 2002.
[7] J. Lennox and H. Schulzrinne, “A Protocol for Reliable Decentralized Conferencing,” Proc. 13th Int'l Workshop Network and Operating Systems Support for Digital Audio and Video (NOSSDAV '03), June 2003.
[8] G.N. Rouskas and I. Baldine, “Multicasting Routing with End-to-End Delay and Delay Variations Constraints,” IEEE J. Selection Areas in Comm., vol. 15, no. 3, pp. 346-356, 1997.
[9] K.C. Almeroth and M.H. Ammar, “Multicast Group Behavior in the Internet's Multicast Backbone (MBone),” IEEE Comm. Magazine, vol. 35, no. 6, pp. 124-129, June 1997.
[10] S.Y. Shi and J.S. Turner, “Multicast Routing and Bandwidth Dimensioning in Overlay Networks,” IEEE J. Selected Areas in Comm., vol. 20, no. 8, pp. 1444-1455, Oct. 2002.
[11] S.Y. Shi and J.S. Turner, “Routing in Overlay Networks,” Proc. IEEE INFOCOM '02, pp. 1200-1208, June 2002.
[12] E. Brosh and Y. Shavitt, “Approximation and Heuristic Algorithms for Minimum Delay Application-Layer Multicast Trees,” Proc. IEEE INFOCOM '04, Mar. 2004.
[13] S. Banerjee, C. Kommareddy, K. Kar, B. Bhattacharjee, and S. Khuller, “Construction of an Efficient Overlay Multicast Infrastructure for Real-Time Applications,” Proc. IEEE INFOCOM '03, Mar. 2003.
[14] A. Riabov, Z. Liu, and L. Zhang, “Overlay Multicast Trees of Minimal Delay,” Proc. 24th IEEE Int'l Conf. Distributed Computing Systems (ICDCS), 2004.
[15] Y.H. Chu, S.G. Rao, S. Seshan, and H. Zhang, “Enabling Conferencing Applications on the Internet Using an Overlay Multicast Architecture,” Proc. ACM SIGCOMM '01, pp. 55-67, Aug. 2001.
[16] S.M. Banik, S. Radhakrishnan, and C.N. Sekharan, “Multicast Routing with Delay and Delay Variation Constraints for Multimedia Applications,” Proc. Seventh IEEE Int'l Conf. High-Speed Networks and Multimedia Comm. (HSNMC '04), pp. 399-411, June 2004.
[17] D.W. Wall, “Mechanisms for Broadcast and Selective Broadcast,” PhD dissertation, Stanford Univ., June 1980.
[18] S.M. Hedetniemi, E.J. Cockayne, and S.T. Hedetniemi, “Linear Algorithms for Finding the Jordan Center and Path Center of a Tree,” Transportation Science, vol. 15, no. 2, pp. 98-114, May 1981.
[19] A. Rosenthal and J.A. Pino, “A Generalized Algorithm for Centrality Problems on Trees,” J. Assoc. Computing Machinery, vol. 36, no. 2, pp. 349-361, Apr. 1989.
[20] D.G. Thaler and C.V. Ravishankar, “Distributed Center-Location Algorithms,” IEEE J. Selected Areas in Comm., vol. 15, no. 3, pp. 291-303, Apr. 1997.
[21] S.C. Bruell, S. Ghosh, M.H. Karaata, and S.V. Pemmaraju, “Self-Stabilizing Algorithms for Finding Centers and Medians of Trees,” SIAM J. Computing, vol. 29, no. 2, pp. 600-614, 1999.
[22] K. Birman, A. Schiper, and P. Stephenson, “Lightweight Causal and Atomic Group Multicast,” ACM Trans. Computer Systems, vol. 9, no. 3, pp. 272-314, Aug. 1991.
[23] M. Kalantar and K. Birman, “Causally Ordered Multicast: The Conservative Approach,” Proc. 19th IEEE Int'l Conf. Distributed Computing Systems (ICDCS '99), pp. 36-44, June 1999.
[24] S.E. Goodman and S.T. Hedetniemi, “On Hamiltonian Walks in Graphs,” SIAM J. Computing, vol. 3, no. 3, pp. 214-221, Sept. 1974.
[25] S.M. Banik, S. Radhakrishnan, T. Zheng, and C.N. Sekharan, “Distributed Floor Control Protocols for Computer Collaborative Applications on Overlay Networks,” Proc. First IEEE Int'l Conf. Collaborative Computing: Networking, Applications and Worksharing (CollaborateCom '05), Dec. 2005.
[26] M. Claypool and K. Claypool, “Latency and Player Actions in Online Games,” Comm. ACM, vol. 49, no. 11, Nov. 2006.
[27] E.L. Hahne, A.K. Choudhury, and N.F. Maxemchuk, “Improving the Fairness of Distributed Queue Dual Bus Network,” Proc. IEEE INFOCOM '90, vol. 1, pp. 175-184, June 1990.
[28] S. Lodha and A. Kshemkalyani, “A Fair Distributed Mutual Exclusion Algorithm,” IEEE Trans. Parallel and Distributed Systems, vol. 11, no. 6, pp. 537-549, June 2000.
[29] J. Cao, J. Zhou, D. Chen, and J. Wu, “An Efficient Distributed Mutual Exclusion Algorithm Based on Relative Consensus Voting,” Proc. 18th Int'l Parallel and Distributed Processing Symp. (IPDPS '04), pp. 51-60, Apr. 2004.
[30] G. Ricart and A.K. Agrawala, “An Optimal Algorithm for Mutual Exclusion in Computer Networks,” Comm. ACM, vol. 21, no. 1, pp.9-17, Jan. 1981.
[31] M. Singhal, “A Heuristically Aided Algorithm for Mutual Exclusion in Distributed Systems,” IEEE Trans. Computers, vol. 28, no. 5, pp. 651-662, May 1989.
[32] D. Agrawal and A.E. Abbadi, “An Efficient and Fault-Tolerant Solution for Distributed Mutual Exclusion,” ACM Trans. Computer Systems, vol. 9, no. 1, pp. 1-20, Feb. 1991.
[33] J.M. Helary, A. Mostefaoui, and M. Raynal, “A General Scheme for Token- and Tree-Based Distributed Mutual Exclusion Algorithm,” IEEE Trans. Parallel and Distributed Systems, vol. 5, no. 11, pp. 1185-1196, Nov. 1994.
[34] G.L. Lann, “Distributed Systems: Towards a Formal Approach,” Proc. IFIP Congress '77, pp. 155-160, 1977.
[35] M. Naimi and M. Trehel, “An Improvement of the log(n) Distributed Algorithm for Mutual Exclusion,” Proc. Seventh IEEE Int'l Conf. Distributed Computing Systems (ICDCS '87), pp. 371-377, 1987.
[36] M. Raynal, “Simple Taxonomy for Distributed Mutual Exclusion Algorithms,” ACM Operating Systems Rev., vol. 25, pp. 189-193, 1990.
[37] M.L. Nielsen and M. Mizuno, “A DAG-Based Algorithm for Distributed Mutual Exclusion,” Proc. 11th IEEE Int'l Conf. Distributed Computing Systems (ICDCS '91), pp. 354-360, 1991.
[38] K. Raymond, “A Tree Based Algorithm for Distributed Mutual Exclusion,” ACM Trans. Computer Systems, vol. 7, pp. 61-77, 1989.
[39] H. Garcia-Molina, “Elections in a Distributed Computing System,” IEEE Trans. Computers, vol. 31, no. 1, pp. 48-59, 1982.
[40] C. Fetzer and F. Cristian, “A Highly Available Local Leader Election Service,” IEEE Trans. Software Eng., vol. 25, no. 5, pp.603-618, Sept./Oct. 1999.
[41] H. Abu-Amara and J. Lokre, “Election in Asynchronous Complete Networks with Intermittent Link Failures,” IEEE Trans. Computers, vol. 43, no. 7, pp. 778-788, July 1994.
[42] G. Singh, “Leader Election in the Presence of Link Failures,” IEEE Trans. Parallel and Distributed Systems, vol. 7, pp. 231-236, 1996.
[43] H.M. Sayeed, M. Abu-Amara, and H. Abu-Amara, “Optimal Asynchronous Agreement and Leader Election Algorithm for Complete Networks with Byzantine Faulty Links,” Distributed Computing, vol. 9, no. 3, pp. 147-156, 1995.
[44] G. Cornuejols, J. Fonlupt, and D. Naddef, “The Traveling Salesman Problem on a Graph and Some Related Integer Polyhedra,” Math. Programming, vol. 33, pp. 1-27, 1985.
[45] P. Chalermsook and J. Fakcharoenphol, “Simple Distributed Algorithms for Approximating Minimum Steiner Trees,” LNCS 3595, pp. 380-389, 2005.
[46] V. Kompella, J. Pasquale, and G. Polyzos, “Two Distributed Algorithms for the Constrained Steiner Tree Problem,” Proc. Second Int'l Conf. Computer Comm. and Networking (ICCCN '93), pp.343-349, 1993.
[47] D.G. Thaler and C.V. Ravishankar, “Distributed Center Location Algorithms,” IEEE J. Selected Areas in Comm., vol. 15, no. 3, pp. 291-303, Apr. 1997.
[48] A. Ballardie, “Core Based Trees (CBT) Multicast Routing Architecture,” IETF RFC 2201, Sept. 1997.
32 ms
(Ver 2.0)

Marketing Automation Platform Marketing Automation Tool