Multicast routing algorithms for Manhattan Street Network

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.