Efficient solutions to multicast routing in communication networks

S. Aggarwal and A. Raghav, DUALCAST: A scheme for reliable multicasting,Proc. Int. Conf. on Network Protocols, Boston Massachusetts, (October 25?28, 1994) pp. 15?22.

M.H. Ammar, S.Y. Cheung and C.M. Scoglio, Routing Multipoint Connections using virtual paths in an ATM network,Proc. IEEE INFOCOM (1993) pp. 98?105.

B. Awerbuch and D. Plege, Concurrent online tracking of mobile users,Proc. ACM SIGCOMM Symp. on Communications, Architectures and Protocols (September 1991) pp. 221?233.

B. Awerbuch and D. Plege, Online tracking of mobile users, J. ACM 42 (1995) 1021?1058.

P. Bhagwat and C. Perkins, A mobile networking system based on internet protocol (IP),Proc. USENIX Symp. on Mobile & Location-Independent Computing (August 1993) pp. 69?82.

K. Bharath-Kumar and J. Jaffee, Routing to multiple destinations in computer networks, IEEE Trans. Commun. 31 (1983) 343?351.

X. Chen and V. Kumar, Multicast routing in self-routing multistage networks,Proc. IEEE INFOCOM (June 1994).

C.H. Chow, On multicast path finding algorithms,Proc. IEEE INFOCOM, New York (1991) pp. 1274?1283.

R. Cohen and A. Segell, Connection management and rerouting in ATM networks,Proc. IEEE INFOCOM (June 1994) pp. 67?75.

S. Deering and D. Cheriton, Multicast routing in datagram internetworks and extended lans, ACM Trans. Comp. Syst. (May 1990) 85?111.

S. Deering, D. Estrin, V. Farinacci, C. Jacobson, C. Liu and L. Wei, An architecture for wide-area multicast routing,Proc. ACM SIGCOMM, London (September, 1994) pp. 102?110.

E.E. Dijkstra, A note on two problems in connection with graphs. Numer. Mathematik 1 (1995) 269?271.

D. Duchamp, S.K. Feiner, J. Gerald and Q. Maguire, Software technology for wireless mobile computing, IEEE Network Mag. (November 1991) 12?18.

R.W. Flod, Algorithm 97: Shortest path, Commun. ACM 5 (1962) 345.

G.H. Forman and J. Zahorjan, The challenges of mobile computing, IEEE Comp. 27 (4) (1994) 38?47.

M.L. Fredman and R.E. Tarjan, Fibonacci heaps and their uses in improved network optimization, J. ACM 34 (1985) 596?615.

M.R. Gary, R.L. Graham and D.S. Johnson, The complexity of computing steiner trees, SIAM J. Appl. Math. 32 (1977) 835?859.

M.R. Gary and D.S. Johnson, Computers and intractability, A Guide to the Theory of NP-Completeness (Freeman, San Francisco, 1979).

E.N. Gilbert and H.O. Pollak, Steiner minimal trees, SIAM J. Appl. Math. 16 (1968) 1?29.

D. Hayden, The new age of wireless, Mobile Office (May 1992) 34?41.

J. Ioannidis, D. Duchamp, J. Gerald and Q. Maguire, IP-based protocols for mobile internetworking,Proc. ACM SIGCOMM Symp. on Communications, Architectures and Protocols (September 1991) 235?245.

D. Johnson, Ubiquitous mobile host internetworking,Proc. IEEE Fourth Workshop on Workstation Operating Systems (October 1993) 212?219.

R.M. Karp, The reducibility among combinatorial problems,Complexity of Computer Communications, eds. R.E. Miller and J.W. Thatcher (Plenum Press, New York, 1972) pp. 85?104.

V.P. Kompella, J.C. Pasquale and G.C. Polyzos, Multicast routing for multimedia communications, ACM/IEEE Trans. Networking (June 1993).

V.P. Kompella, J.C. Pasquale and G.C. Polyzos, Multicasting for multimedia applications,1992 Proc. IEEE INFOCOM, Florence, Italy (May 1992).

L. Kou and K. Makki, An even faster approximation algorithm for the Steiner tree problem in graphs,Congressus Numerantium 59 (1987) 147?154.

L. Kou, G. Markowsky and L. Berman, A fast algorithm for Steiner Trees, Acta Informatica 15 (1981) 141?145.

H.V. Leong and A. Si, Data broadcasting strategies over multiple unreliable wireless channels,Proc. ACM Fourth Int. Conf. on Information and Knowledge Management (November 1995) pp. 96?104, 141?145.

K. Makki, A new approximation algorithm for the Steiner tree problem, Congressus Nmerantium 80 (1991).

K. Makki and N. Pissinou, The Steiner tree problem with minimum number of vertices in graphs,IEEE Proc. Second Great Lakes Symp. on VLSI, Kalamazoo, Michigan (February 1992.

J. Moy, Multicast routing extensions for OSPF, Commun. ACM 37(8) (1994) 61?66.

A. Myles and D. Skellern, Comparison of mobile host protocols for IP internetworking, Res. and Exp 4 (1993) 175?194.

S. Paul, K. Sabnani and D. Kristol, Multicast transport protocols for high speed networks,Proc. Int. Conf. on Network Protocols, Boston Massachusetts (October 25?28, 1994) pp. 4?14.

V.J. rayward-Smith, The computation of nearly minimal Steiner trees in graphs, Int. J. Math. Educ. Sci. Tech. (14) (1) (1983) 15?23.

H. Takahashi and A. Matsuyama, An approximate solution for the Steiner problem in graphs,Math. Japonica 6 (1980) 573?577.

F. Teraoka, Y. Yokote and M. Tokoro, A network architecture providing host migration transparency,Proc. ACM SIGCOMM Symp. Communications, Architectures and Protocols (September 1991) pp. 209?220.

B.M. Waxman, Routing of multipoint connections, IEEE J. Sel. Areas in Commun. 6 (1988) 1617?1622.

L. Wei and D. Estrin, The trade-offs of multicast trees and algorithms,Proc. Third Int. Conf. Computer Communications and Networks, San Francisco, California (September 11?14, 1994) pp. 17?24.

Y.F. Wu, P. Widmayer and C.K. Wong, A faster approximation algorithm for the Steiner problem in graphs, Acta Informatica 23 (1986) 223?229.

A.Z. Zelikovsky, An 11/6-approximation algorithm for the network Steiner problem, Algorithmica 9 (1993) 463?470.