\begin{thebibliography}{10}

\bibitem{AGUILAR}
L.~Aguilar.
\newblock Datagram routing for internet multicasting.
\newblock In {\em Proc. ACM SIGCOMM '84 Communications Architectures and
  Protocols}, pages 58--63. ACM, June 1984.

\bibitem{AWERBUCH}
B.~Awerbuch, A.~Bar-Noy, and M.~Gopal.
\newblock Approximate distributed {B}ellman-{F}ord algorithms.
\newblock {\em IEEE Tran. on Communications}, 42(8):2515--2517, August 1994.

\bibitem{BELKEIR}
N.~E. Belkeir and M.~Ahamad.
\newblock Low cost algorithms for message delivery in dynamic multicast groups.
\newblock In {\em Proc. 9th Intl. Conf. Distributed Computing Systems}, pages
  110--117. IEEE, June 1989.

\bibitem{BERTSEKAS}
Dimitri Bertsekas and Robert Gallager.
\newblock {\em Data networks}.
\newblock Printice-Hall, Inc., 2nd edition, 1992.

\bibitem{BHARATH}
K.~Bharath-Kumar and J.~M. Jaffe.
\newblock Routing to multiple destination in computer networks.
\newblock {\em IEEE Tran. on Communications}, COM-31(3):343--351, March 1983.

\bibitem{DEERING}
S.~E. Deering.
\newblock {\em Multicast routing in a datagram internetwork}.
\newblock PhD thesis, Dept. of Electrical Engeering, Stanford University,
  December 1991.

\bibitem{HUMBLET}
P.~A. Humblet.
\newblock Another adaptive distributed shortest path algorithm.
\newblock {\em IEEE Tran. on Communications}, 39(6):995--1003, June 1991.

\bibitem{HWANG}
F.~K. Hwang, D.~S. Richards, and P.~Winter.
\newblock {\em The Steiner Tree Problem}.
\newblock North-Holand, P.O. Box 211, 1000 AE Amsterdam, The Netherlands, 1992.

\bibitem{KNISELY}
J.~Knisely and R.~Laskar.
\newblock Minimal cyclic broadcast graphs.
\newblock {\em Congressus Numerantium}, 104:210--214, 1994.

\bibitem{MCDOUGALL}
M.~H. Macdougal.
\newblock {\em Simulating computing systems}.
\newblock M.I.T. Press, Cambridge, Massachusetts 02142, 1987.

\bibitem{SEDGEWICK}
R.~Sedgewick.
\newblock {\em Algorithms}.
\newblock Addison-Wesley Publishing Company, Inc, New York, 2nd edition, 1989.

\bibitem{SPINELLI}
J.~M. Spinelli and R.~Gallager.
\newblock Event driven broadcast without sequence numbers.
\newblock {\em IEEE Tran. on Communications}, 37(5):468--474, May 1989.

\bibitem{STALLINGS}
W.~Stallings.
\newblock {\em Data and computer communications}.
\newblock MacMillan Publishing Company, New York, 4th edition, 1994.

\bibitem{STASSINOPOULOS}
G.~I. Stassinopoulos.
\newblock Optimal dynamic routing in multidestination networks.
\newblock {\em IEEE Tran. on Communications}, COM-35(4):472--475, April 1987.

\bibitem{STASSINOPOULOSa}
G.~I. Stassinopoulos and M.~G. Kazantzakis.
\newblock A computationally efficient iterative solution of the
  multidestination optimal dynamic routing problem.
\newblock {\em IEEE Tran. on Communications}, 39(9):1370--1378, 1991.

\end{thebibliography}
