Dynamic multicast routing algorithm for delay and delay variation-bounded Steiner tree problem

Kun Zhang; Yong Qi; Hong Zhang

doi:10.1016/j.knosys.2006.04.012

ScienceGate Book Chapters

JOURNAL ARTICLE

Dynamic multicast routing algorithm for delay and delay variation-bounded Steiner tree problem

Kun Zhang Yong Qi Hong Zhang

Year: 2006 Journal: Knowledge-Based Systems Vol: 19 (7)Pages: 554-564 Publisher: Elsevier BV

DOI: 10.1016/j.knosys.2006.04.012

Get Full-Text PDF Get Analytical Report

Keywords:

Computer science Steiner tree problem Multicast Elmore delay Variation (astronomy) Routing (electronic design automation) Bounded function Tree (set theory) Algorithm Distance Vector Multicast Routing Protocol Computer network Distributed computing Xcast Mathematical optimization Propagation delay Mathematics Delay calculation Combinatorics

Metrics

Cited By

3.36

FWCI (Field Weighted Citation Impact)

Refs

0.89

Citation Normalized Percentile

Is in top 1%

Is in top 10%

Citation History

Topics

Network Traffic and Congestion Control

Physical Sciences → Computer Science → Computer Networks and Communications

Peer-to-Peer Network Technologies

Physical Sciences → Computer Science → Computer Networks and Communications

Advanced Optical Network Technologies

Physical Sciences → Engineering → Electrical and Electronic Engineering

Dynamic multicast routing algorithm for delay and delay variation-bounded Steiner tree problem

Metrics

Citation History

Topics

Related Documents

Multicast routing for delay and delay variation bounded Steiner tree using simulated annealing

Distributed multicast routing for delay and delay variation-bounded Steiner tree using simulated annealing

An Efficient Algorithm For Delay Delay-Variation Bounded Least Cost Multicast Routing

A heuristic algorithm for delay delay-variation bounded least cost multicast routing

An Efficient Algorithm For Delay Delay-Variation Bounded Least Cost Multicast Routing