article

Free access

The multicast packing problem

Editor: Mostafa H. Ammar Authors:

Shiwen Chen,

Oktay Günlük,

Bülent YenerAuthors Info & Claims

IEEE/ACM Transactions on Networking (TON), Volume 8, Issue 3

Pages 311 - 318

https://doi.org/10.1109/90.851977

Published: 01 June 2000 Publication History

PDF eReader

References

[1]

M. Baldi, Y. Ofek, and B. Yener, "Adaptive real time group multicast," in Proc. IEEE INFOCOM, Kobe, Japan, 1997.

Crossref

Google Scholar

[2]

T. Ballardie, P. Francis, and J. Crowcroft, "Core based trees (cbt): An architecture for scalable inter-domain multicast routing," in Proc. ACM SIGCOMM, Oct. 1993, pp. 85-95.

Crossref

Google Scholar

[3]

E Barahona, "Separating from the dominant of the spanning tree polytope," Oper. Res. Lett., vol. 12, pp. 201-203, 1992.

Google Scholar

[4]

D. Bienstock and O. Gtinltik, "Computational experience with a difficult multicommodity flow problem," Math. Program., vol. 68, pp. 213-238, 1995.

Crossref

Google Scholar

[5]

J. Chang and N. E Maxemchuck, "Reliable broadcast protocol," ACM Trans. Comp. Syst., vol. 2, no. 3, pp. 251-273, Aug. 1984.

Crossref

Google Scholar

[6]

S. Chopra and M. R. Rao, "The Steiner tree problem i: Formulations, compositions and extension of facets," Math. Program., vol. 64, pp. 209-229, 1994.

Crossref

Google Scholar

[7]

~, "The Steiner tree problem ii: Properties and classes of facets," Math. Program., vol. 64, pp. 231-246, 1994.

Crossref

Google Scholar

[8]

S.E. Deering and D. R. Cheriton, "Multicast routing in datagram internetworks and extended LANs," ACM Trans. Comp. Syst., vol. 8, no. 2, pp. 85-110, May 1990.

Crossref

Google Scholar

[9]

S. Deering, D. Estrin, D. Farinacci, V. Jacobson, C.-G. Liu, and L. Wei, "An architecture for wide-area multicast routing," in Proc. ACM SIG- COMM, 1994, pp. 126-135.

Crossref

Google Scholar

[10]

M. Goemens, "The Steiner tree polytope and related polyhedra," Math. Program., vol. 63, pp. 157-182.

Crossref

Google Scholar

[11]

M. GrOtchel, A. Martin, and R. Weismantel, "Packing Steiner trees: A cutting plane algorithm and computation," Math. Program., vol. 72, pp. 125-145, 1996.

Crossref

Google Scholar

[12]

~, "Packing Steiner trees: Polyhedral investigations," Math. Program., vol. 72, pp. 101-123, 1996.

Crossref

Google Scholar

[13]

J. Gu and X. Huang, "Efficient local search with search space smoothing: A case study of the traveling salesman problem (tsp)," IEEE Trans. Syst., Man, Cybern., vol. 24-5, pp. 728-735.

Google Scholar

[14]

O. Gtinltik, "A branch-and-cut algorithm for capacitated network design problems," Math. Program., vol. 86-1, pp. 17-39, 1999.

Google Scholar

[15]

E K. Hwang, D. S. Richards, and E Winter, "The Steiner Tree Problem," inAnnal of Discrete Math. 53. CITY?, STATE?: North-Holland, 1992.

Google Scholar

[16]

E. Lawler, J. K. Lenstra, A. H. G. Rinnooy Kan, and D. B. Shmoys, The Travelling Salesman Problem. New York, NY: Wiley, 1987.

Google Scholar

[17]

J. C. Lin and S. Paul, "Rmtp: A reliable multicast protocol," in Proc. IEEE INFOCOM, Mar. 1996, pp. 1414-1425.

Crossref

Google Scholar

[18]

C. A. Noronha and E A. Tobagi, "Optimum routing of multicast streams," in IEEE INFOCOM, 1994, pp. 865-873.

Google Scholar

[19]

Y. Ofek and B. Yener, "Reliable concurrent multicast from bursty sources," IEEE J. Select. Areas Commun., vol. 14, pp. 434-444, Apr. 1997.

Crossref

Google Scholar

[20]

M. Padberg and G. Rinaldi, "Optimization of a 532-city traveling salesman problem by branch-and-cut," Oper. Res. Lett., vol. 6, 1987.

Google Scholar

[21]

~, "A branch-and-cut algorithm for the resolution of large-scale symmetric traveling salesman problems," SlAM Rev., vol. 33, pp. 60-100, 1991.

Crossref

Google Scholar

[22]

C. Patridge and S. Pink, "An implementation of the revised internet stream protocol (st-2)," J. Internetworking: Research and Experience, vol. 4, Mar. 1992.

Google Scholar

[23]

S. Paul, K. Sabnani, and D. Kristol, "Multicast protocols for high speed networks," in Proc. IEEE ICNP, May 1994, pp. 4-14.

Google Scholar

[24]

B. Yener, S. Chen, and O. Gtinltik, "Optimal packing of group multicastings," in Proc. IEEE INFOCOM, San Francisco, CA, Apr. 1998.

Google Scholar

[25]

D.G. Thaler and C. V. Ravishankar, "Distributed center-location algorithms," IEEE J. Select. Areas. Commun., vol. 15, Apr. 1997.

Crossref

Google Scholar

[26]

L. Wei and D. Estrin, "A Comparison of Multicast Trees and Algorithms," Dept. of Comput. Sci., Univ. Southern California, Tech. Rep. USC-CS-93-560, Sept. 1993.

Google Scholar

Cited By

View all

Fourour SLebbah Y(2020)Equitable Optimization for Multicast CommunicationInternational Journal of Decision Support System Technology10.4018/IJDSST.202007010112:3(1-25)Online publication date: 1-Jul-2020
https://dl.acm.org/doi/10.4018/IJDSST.2020070101
(2018)An algorithm based on Voronoi diagrams for the multi-stream multi-source multicast routing problemInternational Journal of Innovative Computing and Applications10.5555/3302729.33027329:4(216-229)Online publication date: 1-Jan-2018
https://dl.acm.org/doi/10.5555/3302729.3302732
Zhang XYang MZhao YZhang JGe J(2017)An SDN-Based Video Multicast Orchestration Scheme for 5G Ultra-Dense NetworksIEEE Communications Magazine10.1109/MCOM.2017.170040555:12(77-83)Online publication date: 1-Dec-2017
https://dl.acm.org/doi/10.1109/MCOM.2017.1700405
Show More Cited By

Index Terms

The multicast packing problem

Recommendations

Scalable Internet multicast routing
ICCCN '95: Proceedings of the 4th International Conference on Computer Communications and Networks

Abstract: In distributed network applications such as multiparty teleconferencing, users often need to send the same message to several other users. To achieve such one-to-many or many-to-many communication efficiently in wide-area internetworks, it is ...
Multicast congestion control scheme over wireless access links: problem and enhancement

In wireless networks, random loss due to bit error leads to significant performance degradation to conventional multicast congestion control schemes. In this paper, we evaluate the performance of PGMCC (Rizzo, 2000) in wireless access networks, and ...
Novel Multicast Operation Method in Metro Ethernet Networks
CIT '11: Proceedings of the 2011 IEEE 11th International Conference on Computer and Information Technology

Metro Ethernet networks are rapidly becoming the networks of choice for aggregation of user traffic toward the core. It allows a wide variety of services to be carried over its infrastructure as Voice over IP (VoIP), Video conferencing, Live video ...

Comments

Please enable JavaScript to view thecomments powered by Disqus.

Information & Contributors

Information

Published In

cover image IEEE/ACM Transactions on Networking

IEEE/ACM Transactions on Networking Volume 8, Issue 3

June 2000

147 pages

ISSN:1063-6692

Editor:
Mostafa H. Ammar
Georgia Institute of Technology, Atlanta

Issue’s Table of Contents

Publisher

IEEE Press

Publication History

Published: 01 June 2000

Published in TON Volume 8, Issue 3

Author Tags

Qualifiers

Article

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

18
Total Citations
View Citations
698
Total Downloads

Downloads (Last 12 months)48
Downloads (Last 6 weeks)5

Reflects downloads up to 09 Jan 2025

Other Metrics

View Author Metrics

Citations

Cited By

View all

Fourour SLebbah Y(2020)Equitable Optimization for Multicast CommunicationInternational Journal of Decision Support System Technology10.4018/IJDSST.202007010112:3(1-25)Online publication date: 1-Jul-2020
https://dl.acm.org/doi/10.4018/IJDSST.2020070101
(2018)An algorithm based on Voronoi diagrams for the multi-stream multi-source multicast routing problemInternational Journal of Innovative Computing and Applications10.5555/3302729.33027329:4(216-229)Online publication date: 1-Jan-2018
https://dl.acm.org/doi/10.5555/3302729.3302732
Zhang XYang MZhao YZhang JGe J(2017)An SDN-Based Video Multicast Orchestration Scheme for 5G Ultra-Dense NetworksIEEE Communications Magazine10.1109/MCOM.2017.170040555:12(77-83)Online publication date: 1-Dec-2017
https://dl.acm.org/doi/10.1109/MCOM.2017.1700405
Lifeng Lai Siu-Wai Ho (2015)Key Generation Algorithms for Pairwise Independent Networks Based on Graphical ModelsIEEE Transactions on Information Theory10.1109/TIT.2015.245072961:9(4828-4837)Online publication date: 1-Sep-2015
https://dl.acm.org/doi/10.1109/TIT.2015.2450729
Zheng XCho CXia Y(2015)Content distribution by multiple multicast trees and intersession cooperationComputer Networks: The International Journal of Computer and Telecommunications Networking10.1016/j.comnet.2015.03.00483:C(100-117)Online publication date: 4-Jun-2015
https://dl.acm.org/doi/10.1016/j.comnet.2015.03.004
Kucharzak MWalkowiak K(2011)An improved annealing algorithm for throughput maximization in static overlay-based multicast systemsProceedings of the 6th international conference on Hybrid artificial intelligent systems - Volume Part I10.5555/2021442.2021490(364-371)Online publication date: 23-May-2011
https://dl.acm.org/doi/10.5555/2021442.2021490
Gopinathan ALi Z(2011)Optimal layered multicastACM Transactions on Multimedia Computing, Communications, and Applications10.1145/1925101.19251027:2(1-20)Online publication date: 7-Mar-2011
https://dl.acm.org/doi/10.1145/1925101.1925102
Sarem MZheng YChen C(2009)A new lossy and lossless image representation by using non-symmetry and anti-packing model with rectangles for gray imagesJournal of Mobile Multimedia10.5555/2011050.20110535:2(125-139)Online publication date: 1-Jun-2009
https://dl.acm.org/doi/10.5555/2011050.2011053
Maniyar RGhosh PSen A(2009)A unified approach for multiple multicast tree construction and max-min fair rate allocationProceedings of the 15th international conference on High Performance Switching and Routing10.5555/1715730.1715738(48-55)Online publication date: 22-Jun-2009
https://dl.acm.org/doi/10.5555/1715730.1715738
Terlaky TVannelli AZhang H(2008)On routing in VLSI design and communication networksDiscrete Applied Mathematics10.1016/j.dam.2008.01.014156:11(2178-2194)Online publication date: 1-Jun-2008
https://dl.acm.org/doi/10.1016/j.dam.2008.01.014
Show More Cited By

View Options

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

References

Cited By

Index Terms

Recommendations

Scalable Internet multicast routing

Multicast congestion control scheme over wireless access links: problem and enhancement

Novel Multicast Operation Method in Metro Ethernet Networks

Comments

Information

Published In

Publisher

Publication History

Author Tags

Qualifiers

Contributors

Other Metrics

Bibliometrics

Article Metrics

Other Metrics

Citations

Cited By

View options

PDF

eReader

Login options

Full Access

Figures

Other

Share

Share this Publication link

Share on social media

Affiliations