A scalable multicast routing

Liu, Changdong; Lee, M.J.; Saadawi, Tarek

doi:10.1109/milcom.1997.646764

MILCOM 97 MILCOM 97 Proceedings

DOI: 10.1109/milcom.1997.646764

|View full text |Cite

A scalable multicast routing

Changdong Liu

M.J. Lee²,

Tarek Saadawi³

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...

Citation Types

Supporting

Mentioning

Contrasting

Publication Types

Select...

Other1

Relationship

Self Cite0

Independent1

Authors

Journals

Cited by 1 publication

References 6 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

Delay-Bounded Multicast routing with low complexity and low cost

Wang

2010

The 2nd International Conference on Information Science and Engineering

View full text Add to dashboard Cite

In the category of multicast routing problems, one of the most important is delay-bounded Steiner tree problem. The problem of computing such a constrained multicast tree is NPcomplete. A heuristic DBMA(Delay-Bounded Multicast routing Algorithm) to solve such a problem based on minimum delay path set and minimum cost path set is proposed in this paper. We prove that multicast trees found by this algorithm satisfy the delay constraint while the complexity is low. Simulation results further demonstrate that it is a delay constrained algorithm with low time complexity and low cost.

show abstract

Delay-Bounded Multicast routing with low complexity and low cost

Wang

2010

The 2nd International Conference on Information Science and Engineering

View full text Add to dashboard Cite

show abstract

scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.

Contact Info

customersupport@researchsolutions.com

10624 S. Eastern Ave., Ste. A-614

Henderson, NV 89052, USA

This site is protected by reCAPTCHA and the Google Privacy Policy and Terms of Service apply.

Blog Terms and Conditions API Terms Privacy Policy Contact Cookie Preferences Do Not Sell or Share My Personal Information

Made with 💙 for researchers

Part of the Research Solutions Family.

A scalable multicast routing

Cited by 1 publication

References 6 publications

Delay-Bounded Multicast routing with low complexity and low cost

Delay-Bounded Multicast routing with low complexity and low cost

Contact Info

Product

Resources

About