article

Routing of multipoint connections

IEEE Journal on Selected Areas in Communications · 1988 · Vol. 6(9) · pp. 1617–1622

Bernard M. Waxman✉(Washington University in St. Louis)

Abstract

The author addresses the problem of routing connections in a large-scale packet-switched network supporting multipoint communications. He gives a formal definition of several versions of the multipoint problem, including both static and dynamic versions. He looks at the Steiner tree problem as an example of the static problem and considers the experimental performance of two approximation algorithms for this problem. A weighted greedy algorithm is considered for a version of the dynamic problem which allows endpoints to come and go during the life of a connection. One of the static algorithms serves as a reference to measure the performance of the proposed weighted greedy algorithm in a series of experiments.< <ETX xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">></ETX>

VLSI and FPGA Design Techniques Complexity and Algorithms in Graphs Network Traffic and Congestion ControlComputer scienceRouting (electronic design automation)Steiner tree problemGreedy algorithmConnection (principal bundle)Network packetTree (set theory)Theoretical computer scienceMathematical optimizationAlgorithm

Citations

2,852

FWCI

2.11

field-weighted impact

References

Percentile

87%

vs. same field & year

Citations per year

Cited by

The Internet Topology Zoo