An efficient QoS routing algorithm for quorumcast communication

Computer Networks

Volumn 44, Issue 1, 2004, Pages 43-61

  Wang, Bin ^a   Hou, Jenifer C ^b  

^a Wright State University   (United States)

^b University of Illinois at Urbana Champaign   (United States)

Author keywords

Fault tolerance; Multicast; Quality of service routing; Quorumcast

Indexed keywords

ALGORITHMS; COST EFFECTIVENESS; FAULT TOLERANT COMPUTER SYSTEMS; QUALITY OF SERVICE; ROUTERS;

QUORUMCAST;

MULTICASTING;

EID: 0242302635     PISSN: 13891286     EISSN: None     Source Type: Journal    
DOI: 10.1016/S1389-1286(03)00322-0     Document Type: Article

References (40)

1. Ahamad M., Ammar M.H. Performance characterization of quorum-consensus algorithms for replicated data. IEEE Trans. Software Eng. 15(4):1989;492-496.
2. M.H. Ammar, Probabilistic multicast: Generalizing the multicast paradigm to improve scalability, in: Proceedings of IEEE INFOCOM'94, Toronto, Ontario, Canada, June 1994, pp. 848-855.
3. F. Bauer, Multicast routing in point-to-point networks under constraints, Ph.D. dissertation, University of California, Santa Cruz, 1996.
4. Bauer F., Varma A. ARIES: A rearrangeable inexpensive edge-based on-line Steiner algorithm. IEEE J. Selected Areas Commun. 15(3):1997;382-397.
5. S. Bhattacharjee, M.H. Ammar, E.W. Zegura, Z. Fei, Application-layer anycasting, in: Proceedings of IEEE INFOCOM'97, Kobe, Japan, vol. 3, April 1997, pp. 1388-1396.
6. A. Chakrabarti, G. Manimaran, A case for scalable multicast tree migration, in: Proceedings of IEEE Globecom'01, San Antonio, TX, vol. 3, November 2001, pp. 2026-2030.
7. A. Chakrabarti, A. Striegel, G. Manimaran, A case for tree evolution in QoS multicasting, in: Proceedings of IEEE/IFIP IWQoS, Miami Beach, FL, May 2002, pp. 116-125.
8. S.Y. Cheung, A. Kumar, Efficient quorumcast routing algorithm, in: Proceedings of IEEE INFOCOM'94, Toronto, Ontario, Canada, June 1994, pp. 840-847.
9. Cormen T.H., Leiserson C.E., Rivest R.L. Introduction to Algorithms. 1997;MIT Press, Cambridge, MA.
10. C. Dovrolis, P. Ramanathan, D. Moore, What do packet dispersion techniques measure? in: Proceedings of IEEE INFOCOM'01, Anchorage, AK, vol. 2, April 2001, pp. 905-914.
11. Z. Fei, S. Bhattacharjee, E.W. Zegura, M.H. Ammar, A novel server selection technique for improving the response time of a replicated service, in: Proceedings of IEEE INFOCOM'98, San Francisco, CA, vol. 2, March/April 1998, pp. 783-791.
12. A. Goel, K.G. Ramakrishnan, D. Kataria, D. Logothetis, Efficient computation of delay-sensitive routes from one source to all destinations, in: Proceedings of IEEE INFOCOM'01, Anchorage, AK, vol. 2, April 2001, pp. 854-858.
13. I. Goldberg, Institute for the advanced study of information warfare. http://www.psycom.net/iwar.1.html, 2001.
14. B.K. Haberman, G. Rouskas, Cost, delay, and delay variation conscious multicast routing, Technical Report TR-97-03, North Carolina State University, 1997.
15. S. Hong, H. Lee, B.H. Park, An efficient multicast routing algorithm for delay-sensitive applications with dynamic memberships, in: Proceedings of IEEE INFOCOM'98, San Francisco, CA, vol. 3, March/April 1998, pp. 1433-1440.
16. Hwang F.K., Richards D. Steiner tree problems. Networks. 22(1):1992;55-89.
17. Internet2 multicast working group, Multicast WG homepage, http://multicast.internet2.edu/index.html.
18. Kompella V.P., Pasquale J.C., Polyzo G.C. Multicast routing for multimedia communication. IEEE/ACM Trans. Network. 1(3):1993;286-292.
19. K. Lai, M. Baker, Measuring bandwidth, in: Proceedings of IEEE INFOCOM'99, New York, vol. 1, March 1999, pp. 235-245.
20. K. Lai, M. Baker, Measuring link bandwidths using a deterministic model of packet delay, in: Proceedings of the ACM SIGCOMM 2000 Conference, Stockholm, Sweden, August 2000.
21. K. Lai, M. Baker, Nettimer: A tool for measuring bottleneck link bandwidth, in: Proceedings of the 3rd USENIX Symposium on Internet Technologies and Systems, San Francisco, CA, March 2001.
22. G. Malkin, RIP version 2: carrying additional information, RFC 1723, 1994.
23. Matta I., Guo L. QDMR: An efficient qos dependent multicast routing algorithm. J. Commun. Networks. 2(2):2000.
24. A. Myers, P. Dinda, H. Zhang, Performance characteristics of mirror servers on the Internet, in: Proceedings of IEEE INFOCOM'99, New York, vol. 1, March 1999, pp. 304-312.
25. P. Narvaez, K. Siu, H. Tzeng, New dynamic SPT algorithm based on a ball-and-string model, in: Proceedings of IEEE INFOCOM'99, New York, vol. 2, March 1999, pp. 973-981.
26. Parsa M., Zhu Q., Garcia-Luna-Aceves J. An iterative algorithm for delay-constrained minimal-cost multicasting. IEEE/ACM Trans. Network. 6(4):1998;461-474.
27. T. Pusateri, Distance vector multicast routing protocol, draft-ietf-idmr-dvmrp-v3-09.txt, 1999.
28. S. Raman, S. McCanne, A model, analysis, and protocol framework for soft state-based communication, in: Proceedings of ACM SIGCOMM'99, Cambridge, MA, September 1999.
29. Rouskas R.N., Baldine I. Multicast routing with end-to-end delay and delay variation constraints. IEEE J. Selected Areas Commun. 15(3):1997;346-356.
30. H.F. Salama, Multicast routing for real-time communication on high speed networks, Ph.D. dissertation, North Carolina State University, Raleigh, 1996.
31. Sriram R., Manimaran G., Murthy C. A rearrangeable algorithm for the construction of delay-constrained dynamic multicast trees. IEEE/ACM Trans. Network. 7(4):1999;514-529.
32. Takahashi H., Matsuyama A. An approximate solution for the steiner problem in graphs. Math. Japonica. 24:1980;573-577.
33. H.-Y. Tyan, C.-J. Hou, Javasim: A component-based compositional network simulation environment, in: Western Simulation Multiconference - Communication Networks and Distributed Systems Modeling and Simulation, January 2001.
34. H.-Y. Tyan, C.-J. Hou, Design, realization, and evaluation of a component-based, compositional network simulation environment, in: 2002 SCS Western Multiconference on Computer Simulation - Communication Networks and Distributed Systems Modeling and Simulation Conference, January 2002.
35. Wang B., Hou J.C. Multicast routing and its QoS extension: Problems, algorithms, and protocols. IEEE Network. 14(1):2000;22-36.
36. J. Wang, A survey of Web caching schemes for the Internet, ACM SIGCOMM Computer Communication Review, vol. 29(5), 1999.
37. Waxman B. Routing of multipoint connections. IEEE J. Selected Areas Commun. 6:1988;1617-1622.
38. Winter P. Steiner problem in networks: a survey. Networks. 17:1987;129-167.
39. Zegura E.W., Ammar M.H., Fei Z., Bhattacharjee S. Application-layer anycasting: a server selection architecture and use in a replicated Web service. IEEE/ACM Trans. Network. 8(4):2000;455-466.
40. Q. Zhu, M. Parsa, J. Garcia-Luna-Aceves, A source-based algorithm for delay-constrained minimal-cost multicasting, in: Proceedings of IEEE INFOCOM'95, Boston, MA, vol. 1, 1995, pp. 377-385.