Multicast Routing Algorithms for Manhattan Street Network

	This Article
	Subscribers, please Login Purchase article: $19 PDF IEEE Xplore Subscribers RSS feed
	Share
	Email this Article to a friend
	Bibliographic References
	ASCII Text BibTex RefWorks Procite/RefMan/Endnote
	Add to:
	Digg Furl Spurl Blink Simpy Google Del.icio.us Y!MyWeb
	Search
	Similar Articles Articles by Hoyoung Hwang Articles by Hyoungjun Kim Articles by Yanghee Choi Articles by Chongsang Kim

Proceedings of the 22nd EUROMICRO Conference

Prague, Czech Republic

September 02-September 05

ISBN: 0-8186-7487-3

	ASCII Text	x
	Hoyoung Hwang, Hyoungjun Kim, Yanghee Choi, Chongsang Kim, "Multicast Routing Algorithms for Manhattan Street Network," EUROMICRO Conference, pp. 0397, Proceedings of the 22nd EUROMICRO Conference, 1996.

	BibTex	x
	@article{ 10.1109/EURMIC.1996.546463, author = {Hoyoung Hwang and Hyoungjun Kim and Yanghee Choi and Chongsang Kim}, title = {Multicast Routing Algorithms for Manhattan Street Network}, journal ={EUROMICRO Conference}, volume = {0}, year = {1996}, isbn = {0-8186-7487-3}, pages = {0397}, doi = {http://doi.ieeecomputersociety.org/10.1109/EURMIC.1996.546463}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, }

	RefWorks Procite/RefMan/Endnote	x
	TY - CONF JO - EUROMICRO Conference TI - Multicast Routing Algorithms for Manhattan Street Network SN - 0-8186-7487-3 SP EP A1 - Hoyoung Hwang, A1 - Hyoungjun Kim, A1 - Yanghee Choi, A1 - Chongsang Kim, PY - 1996 KW - network routing; Manhattan Street Network; multicast services; multicast routing; MSN; dynamic multicast tree VL - 0 JA - EUROMICRO Conference ER -

Hoyoung Hwang, Dept. of Comput. Eng., Seoul Nat. Univ., South Korea

Hyoungjun Kim, Dept. of Comput. Eng., Seoul Nat. Univ., South Korea

Yanghee Choi, Dept. of Comput. Eng., Seoul Nat. Univ., South Korea

Chongsang Kim, Dept. of Comput. Eng., Seoul Nat. Univ., South Korea

DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/EURMIC.1996.546463

Abstract: In spite of the attractive characteristics of Manhattan Street Network (MSN), it is generally thought that providing multicast services over MSN is inherently difficult. We consider here new multicast routing algorithms for MSN. In the proposed algorithms, packets are routed along a dynamic multicast tree which is determined at each routing time. The detailed algorithms and simulation results are presented in this paper. The performance curves obtained show that the proposed algorithms are feasible and practical solutions for the multicast routing over MSN.

Index Terms:

network routing; Manhattan Street Network; multicast services; multicast routing; MSN; dynamic multicast tree

Citation:

Hoyoung Hwang, Hyoungjun Kim, Yanghee Choi, Chongsang Kim, "Multicast Routing Algorithms for Manhattan Street Network," euromicro, pp.0397, Proceedings of the 22nd EUROMICRO Conference, 1996

Peer Review Notice | Give Us Feedback

Usage of this product signifies your acceptance of the Terms of Use.