article

Free access

Efficient solutions to multicast routing in communication networks

Authors:

Ophir FriederAuthors Info & Claims

Mobile Networks and Applications, Volume 1, Issue 2

Pages 221 - 232

https://doi.org/10.1007/BF01193338

Published: 01 October 1996 Publication History

Abstract

An important problemin both wireless and wired communication networks is to be able to efficiently multicast information to a group of network sites. Multicasting reduces the transmission overhead of both wireless and wired networks and the time it takes for all the nodes in the subset to receive the information. Since transmission bandwidth is a scarce commodity especially in wireless networks, efficient and near minimum-cost multicast algorithms are particularly useful in the wireless context. In this paper, we discuss methods of establishing efficient and near minimum-cost multicast routing in communication networks. In particular, we discuss an efficient implementation of a widely used multicast routing method which can construct a multicast tree with a cost no greater than twice the cost of an optimal tree. We also present two efficient multicast tree constructions for a general version of the multicast routing problem in which a network consists of different classes of nodes, where each class can have one or more nodes of the same characteristic which is different fromthe characteristics of nodes fromother classes. Because of their efficient running times, these multicast routing methods are particularly useful in the mobile communication environments where topology changes will imply recomputation of the multicast trees. Furthermore, the proposed efficient and near minimum-cost multicast routing methods are particularly suited to the wireless communication environments, where transmission bandwidth is more scarce than wired communication environments.

References

[1]

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.

[2]

M.H. Ammar, S.Y. Cheung and C.M. Scoglio, Routing Multipoint Connections using virtual paths in an ATMnetwork, Proc. IEEEINFOCOM (1993) pp. 98-105.

[3]

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

[4]

B. Awerbuch and D. Plege, Online tracking of mobile users, J. ACM42 (1995) 1021-1058.

[5]

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.

[6]

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

[7]

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

[8]

C.H. Chow, On multicast path finding algorithms, Proc. IEEE INFOCOM, NewYork (1991) pp. 1274-1283.

[9]

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

[10]

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

[11]

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

[12]

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

Digital Library

[13]

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

[14]

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

Digital Library

[15]

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

Digital Library

[16]

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

[17]

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

[18]

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

[19]

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

[20]

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

[21]

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.

[22]

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

[23]

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

[24]

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

[25]

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

[26]

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

[27]

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

Digital Library

[28]

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.

[29]

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

[30]

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.

[31]

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

Digital Library

[32]

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

[33]

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.

[34]

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

[35]

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

[36]

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.

[37]

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

Digital Library

[38]

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.

[39]

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.

[40]

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

Cited By

Papantoni-Kazakos PBurrell A(2009)Stable protocols for the medium access control in wireless networksProceedings of the 8th WSEAS international conference on Data networks, communications, computers10.5555/1670344.1670349(19-30)Online publication date: 1-Nov-2009
https://dl.acm.org/doi/10.5555/1670344.1670349
Garcia-Luna-Aceves JMeo MZomaya ADahlberg T(2002)Flow-oriented protocols for scalable wireless networksProceedings of the 5th ACM international workshop on Modeling analysis and simulation of wireless and mobile systems10.1145/570758.570759(1-6)Online publication date: 28-Sep-2002
https://dl.acm.org/doi/10.1145/570758.570759
Liang WHubaux JGarcia-Luna-Aceves JJohnson D(2002)Constructing minimum-energy broadcast trees in wireless ad hoc networksProceedings of the 3rd ACM international symposium on Mobile ad hoc networking & computing10.1145/513800.513815(112-122)Online publication date: 9-Jun-2002
https://dl.acm.org/doi/10.1145/513800.513815
Show More Cited By

Index Terms

Efficient solutions to multicast routing in communication networks

Recommendations

An efficient multicast routing protocol in wireless mobile networks

Providing multicast service to mobile hosts in wireless mobile networking environments is difficult due to frequent changes of mobile host location and group membership. If a conventional multicast routing protocol is used in wireless mobile networks, ...
Multicast routing in computer networks
Improving Internet multicast with routing labels
ICNP '97: Proceedings of the 1997 International Conference on Network Protocols (ICNP '97)

The IP-multicast architecture is extended with addressing information along multicast routing trees that permits more efficient and sophisticated multicast routing options and encourages communication and cooperation between IP and higher-layer ...

Comments

Information & Contributors

Information

Published In

cover image Mobile Networks and Applications

Mobile Networks and Applications Volume 1, Issue 2

Special issue: routing in mobile communications networks

Oct. 1996

140 pages

ISSN:1383-469X

Editors:
Imrich Chlamtac
Boston Univ., Boston, MA
,
S. Ramanathan
BBN Corp., Cambridge, MA
,
Martha Steenstrup
BBN Corp., Cambridge, MA

Issue’s Table of Contents

Publisher

Springer-Verlag

Berlin, Heidelberg

Publication History

Published: 01 October 1996

Qualifiers

Article

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

6
Total Citations
View Citations
600
Total Downloads

Downloads (Last 12 months)22
Downloads (Last 6 weeks)7

Reflects downloads up to 09 Feb 2025

Other Metrics

View Author Metrics

Citations

Cited By

Papantoni-Kazakos PBurrell A(2009)Stable protocols for the medium access control in wireless networksProceedings of the 8th WSEAS international conference on Data networks, communications, computers10.5555/1670344.1670349(19-30)Online publication date: 1-Nov-2009
https://dl.acm.org/doi/10.5555/1670344.1670349
Garcia-Luna-Aceves JMeo MZomaya ADahlberg T(2002)Flow-oriented protocols for scalable wireless networksProceedings of the 5th ACM international workshop on Modeling analysis and simulation of wireless and mobile systems10.1145/570758.570759(1-6)Online publication date: 28-Sep-2002
https://dl.acm.org/doi/10.1145/570758.570759
Liang WHubaux JGarcia-Luna-Aceves JJohnson D(2002)Constructing minimum-energy broadcast trees in wireless ad hoc networksProceedings of the 3rd ACM international symposium on Mobile ad hoc networking & computing10.1145/513800.513815(112-122)Online publication date: 9-Jun-2002
https://dl.acm.org/doi/10.1145/513800.513815
Chowdhury AFrieder OWan P(2002)On the Design, Development, Deployment, and Network Survivability Analysis of the Dynamic Routing System ProtocolThe Journal of Supercomputing10.1023/A:101410432683921:3(239-256)Online publication date: 1-Mar-2002
https://dl.acm.org/doi/10.1023/A%3A1014104326839
Li FNikolaidis I(2001)On Minimum-Energy Broadcasting in All-Wireless NetworksProceedings of the 26th Annual IEEE Conference on Local Computer Networks10.5555/871717.871792Online publication date: 14-Nov-2001
https://dl.acm.org/doi/10.5555/871717.871792
Burrell APapantoni-Kazakos P(2001)A comprehensive approach to signaling, transmission, and traffic management for wireless ATM networksWireless Networks10.1023/A:10166360128567:4(385-400)Online publication date: 1-Sep-2001
https://dl.acm.org/doi/10.1023/A%3A1016636012856

View Options

View options

PDF

View or Download as a PDF file.

eReader

View online with eReader.

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Full Access

Get this Publication

Figures

Tables

Media

View Issue’s Table of Contents