ARIES: a rearrangeable inexpensive edge-based on-line Steiner algorithm

This publication has 18 references indexed in Scilit:

• How bad is naive multicast routing?
  Published by Institute of Electrical and Electronics Engineers (IEEE) ,2002
• Comparison of dynamic multicast routing algorithms for wide-area packet switched (asynchronous transfer mode) networks
  Published by Institute of Electrical and Electronics Engineers (IEEE) ,2002
• Distributed algorithms for multicast path setup in data networks
  Published by Institute of Electrical and Electronics Engineers (IEEE) ,2002
• The PIM architecture for wide-area multicast routing
  IEEE/ACM Transactions on Networking, 1996
• Core based trees (CBT)
  ACM SIGCOMM Computer Communication Review, 1993
• Greedy algorithms for the on-line steiner tree and generalized steiner problems
  Published by Springer Nature ,1993
• Steiner's problem in graphs: heuristic methods
  Discrete Applied Mathematics, 1992
• Dynamic Steiner Tree Problem
  SIAM Journal on Discrete Mathematics, 1991
• Multicast routing in datagram internetworks and extended LANs
  ACM Transactions on Computer Systems, 1990
• Routing of multipoint connections
  IEEE Journal on Selected Areas in Communications, 1988