Multicast algorithms in service overlay networks

Computer Communications

Volumn 31, Issue 3, 2008, Pages 489-505

  Pompili, Dario ^a   Scoglio, Caterina ^b   Lopez, Luca ^c  

^a RUTGERS UNIVERSITY   (United States)

^b Kansas State University   (United States)

^c SAPIENZA UNIVERSITY OF ROME   (Italy)

Author keywords

Mathematical programming optimization; Multicast; Multirate layering; Overlay networks

Indexed keywords

ALGORITHMS; DATA TRANSFER; DATABASE SYSTEMS; INTERNET PROTOCOLS; MULTICASTING; TELECOMMUNICATION TRAFFIC;

MULTICAST ALGORITHMS; MULTIRATE LAYERING; OVERLAY NETWORKS; REPLICATED DATABASES;

NETWORK ROUTING;

EID: 38549131451     PISSN: 01403664     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.comcom.2007.08.023     Document Type: Article

References (42)

1. CPLEX, .
2. Ahuja R.K., Magnanti T.L., and Orlin J.B. Network Flows: Theory, Algorithms, and Applications (1993), Prentice Hall, Englewoof Cliffs, NJ
3. D.G. Andersen, H. Balakrishnan, M.F. Kaashoek, R. Morris, Resilient overlay networks, in: Proceedings of ACM Symposium on Operating Systems Principles (SOSP), October 2001, Banff, Canada, 2001.
4. T. Ballardie, Core Based Trees (CBT version 2) Multicast Routing, Technical report, IETF RFC 2189, September 1997.
5. Ballardie T., Francis P., and Crowcroft J. Core based trees (CBT): an architecture for scalable inter-domain multicast routing. Computer Communication Review 23 Oct. (1993) 85-95
6. T. Ballardie, P. Francis, J. Crowcroft, Core based trees (CBT) and architecture for scalable inter-domain multicast routing, in: Proceedings of ACM Special Interest Group on Data Communications (SIGCOMM), September 1993, San Francisco, USA, 1993.
7. S. Banerjee, C. Kommareddy, K. Kar, B. Bhattacharjee, S. Khuller, Construction of an efficient overlay multicast infrastructure for realtime applications, in: Proceedings of IEEE Conference on Computer Communications (INFOCOM), March 2003, vol. 2, San Francisco, CA, USA, 2003, pp. 1521-1531.
8. S. Baset, H. Schulzrinne, An analysis of the skype peer-to-peer internet telephony protocol, in: Proceedings of IEEE Conference on Computer Communications (INFOCOM), April 2006, Barcelona, Spain, 2006.
9. S. Bhattacharyya, J. Kurose, D. Towsley, Efficient multicast flow control using multiple multicast groups, Technical report, CMPSCI, TR 97-15, March 1997.
10. Y. Birk and D. Crupnicoff, A multicast transmission schedule for scalable multi-rate distribution of bulk data using non-scalable erasure-correcting codes, in: Proceedings of IEEE Conference on Computer Communications (INFOCOM), July 2003, San Francisco, USA, 2003.
11. Calvert K., Doar M., and Zegura E. Modeling Internet topology. IEEE Communications Magazine 35 6 (1997) 160-163
12. M. Castro, P. Druschel, A. Kermarrec, A. Nandi, A. Rowstron, A. Singh, Splitstream: high-bandwidth multicast in cooperative environments, in: Proceedings of ACM Symposium on Operating Systems Principles (SOSP), October 2003, Bolton Landing, NY, USA, 2003.
13. Castro M., Druschel P., Kermarrec A., and Rowstron A. SCRIBE: a large-scale and decentralized application-level multicast infrastructure. IEEE Journal on Selected Areas in Communications 20 8 (2002) 1489-1499
14. C. Cheng, R. Riley, S.P.R. Kumar, J.J. Garcia-Luna-Aceves, A loop-free Bellman-Ford Routing protocol without bouncing effect, in: Proceedings of ACM International Conference on Measurement and Modeling of Computer Systems (SIGMETRICS), September 1989, Oakland, California, USA, 1989, pp. 224-237.
15. A. Claus, N. Maculan, Une Nouvelle Formulation du Probleme de Steiner sur un Graphe. Technical report, Centre de Recerche sur les Transports, Universite de Montreal, 1983.
16. Duan Z., Zhang Z., and Hou Y. Service overlay networks: SLAs, QoS, and bandwidth provisioning. IEEE/ACM Transactions on Networking 11 6 (2003) 870-883
17. J. Fan and M. Ammar, Dynamic topology configuration in service overlay networks: a study of reconfiguration policies, in: Proceedings of IEEE Conference on Computer Communications (INFOCOM), April 2006, Barcelona, Spain, 2006.
18. N. Feamster, D. Andersen, H. Balakrishnan, F. Kaashoek, Measuring the effects of internet path faults on reactive routing, in: Proceedings of ACM International Conference on Measurement and Modeling of Computer Systems (SIGMETRICS), June 2003, San Diego, CA, USA, 2003.
19. Fourer R., Gay D.M., and Kernighan B.W. AMPL: a modeling language for mathematical programming (2002), Duxbury Press, Cole Publishing Co.
20. P.G. Franciosa, D. Frigioni, R. Giaccio, Semi-dynamic shortest paths and breadth-first search on digraphs, in: Proceedings of Symposium on Theoretical Aspects of Computer Science, Lubeck, Germany, February/March 1997, pp. 33-46.
21. Garey M.R., and Johnson D.S. Computer and intractability: a guide to the theory of NP-completeness (1979), W.H. Freeman and Co., San Francisco, CA
22. Gross J.L., and Yellen J. Handbook of graph theory. Discrete Mathematics and Its Applications vol. 25 (2003), CRC Press, Boca Raton
23. X. Gu, K. Nahrstedt, R. Chang, C. Ward, QoS-assured service composition in managed service overlay networks, in: Proceedings IEEE International Conference on Distributed Computing Systems (ICDCS), May 2003, Providence, Rhode Island, USA, 2003.
24. T. Jiang, M.H. Ammar, E.W. Zegura, Inter-receiver fairness: A novel performance measure for multicast ABR sessions, in: Proceedings of ACM International Conference on Measurement and Modeling of Computer Systems (SIGMETRICS), Madison, Wisconsin, USA, 1998.
25. D. Kostic, A. Rodriguez, J. Albrecht, A. Vahdat, Bullet: High Bandwidth Data Dissemination Using an Overlay Mesh, in: Proceedings of ACM Symposium on Operating Systems Principles (SOSP), October 2003, Bolton Landing, NY, USA, 2003.
26. L. Lao, J.-H. Cui, M. Gerla, TOMA: a viable solution for largescale multicast service support, in: Proceedings of IFIP International Conference of Networking, May 2005, Waterloo, Ontario, Canada, 2005, pp. 906-917.
27. Li Z., and Mohapatra P. Qron: Qos-aware routing in overlay networks. IEEE Journal on Selected Areas in Communications (JSAC) 22 1 (2004) 29-40
28. Lichtenstein D. Planar formuale and their use. SIAM Journal on Computing 11 2 (1982) 329-343
29. Low C.P., and Wang N. On finding feasible solutions to group multicast routing problem. IEICE Transactions on Communications E85-B 1 (2002) 268-277
30. A. Nakao, L. Peterson, A. Bavier, A routing underlay for overlay networks, in: Proceedings of ACM International Conference on Measurement and Modeling of Computer Systems (SIGMETRICS), June 2003, San Diego, CA, USA, 2003.
31. V. Pai, K. Kumar, K. Tamilmani, V. Sambamurthy, A. Mohr, Chainsaw: eliminating trees from overlay multicast, in: Proceedings of International Workshop on Peer-to-Peer Systems (IPTPS), February 2005, Ithaca, NY, USA, Feb. 2005.
32. P. Paul and S. Raghavan, Survey of multicast routing algorithms and protocols, in: Proceedings of the International Conference on Computer Communication (ICCC), August 2002, Bandra, Mumbai, India, 2002.
33. Sahasrabuddhe L.H., and Mukherjee B. Multicast routing algorithms and protocols: a tutorial. IEEE Network 14 1 (2000) 90-102
34. S.Y. Shi, J.S. Turner, Routing in Overlay Multicast Networks, in: Proceedings of IEEE Conference on Computer Communications (INFOCOM), June 2002, New York, NY, USA, 2002.
35. S.Y. Shi, J.S. Turner, Routing in Overlay Multicast Networks, in: Proceedings of IEEE Conference on Computer Communications (INFOCOM), June 2002, vol. 3, New York, NY, USA, 2002. pp. 1200-1208.
36. Takahashi H., and Matsuyama A. An approximate solution for the steiner problem in graphs. Mathematica Japonica 6 (1980) 573-577
37. S. Vieira, J. Liebeherr, Topology design for service overlay networks with bandwidth guarantees, in: Proceedings of IEEE International Workshop on Quality of Service (IWQoS), June 2004, Montreal, Canada, 2004, pp. 211-220.
38. N. Wang, C.P. Low, On finding feasible solutions to group multicast routing problem, in: Proceedings of IFIP International Conference of Networking, May 2000, Paris, France, 2000.
39. Waxman B.M. Routing of multipoint connections. IEEE Journal on Selected Areas in Communications 6 9 (1988) 1617-1622
40. Wong R.T. A dual ascent approach for steiner tree problems on a directed graph. Mathematical Programming 28 (1984) 271-287
41. H. Zhang, J. Kurose, D. Towsley, Can an overlay compensate for a careless underlay? in: Proceedings of IEEE Conference on Computer Communications (INFOCOM), April 2006, Barcelona, Spain, 2006.
42. Zhu Y., Dovrolis C., and Ammar M. Dynamic overlay routing based on available bandwidth estimation: a simulation study. Computer Networks (Elsevier) 50 6 (2006) 742-762