A Multicast Routing Scheme for the Internet: Simulation and Experimentation in Large-Scale Networks

With the globalisation of the multimedia entertainment industry and the popularity of streaming and content services, multicast routing is (re-)gaining interest as a bandwidth saving technique. In the 1990’s, multicast routing received a great deal of attention from the research community; nevertheless, its main problems still remain mostly unaddressed and do not reach the acceptance level required for its wide deployment. Among other reasons, the scaling limitation and the relative complexity of the standard multicast protocol architecture can be attributed to the conventional approach of overlaying the multicast routing on top of the unicast routing topology. In this paper, we present the Greedy Compact Multicast Routing (GCMR) scheme. GMCR is characterised by its scalable architecture and independence from any addressing and unicast routing schemes; more specifically, the local knowledge of the cost to direct neighbour nodes is enough for the GCMR scheme to properly operate. The branches of the multicast tree are constructed directly by the joining destination nodes which acquire the routing information needed to reach the multicast source by means of an incremental two-stage search process. In this paper we present the details of GCMR and evaluate its performance in terms of multicast tree size (i.e., the stretch), the memory space consumption, the communication cost, and the transmission cost. The comparative performance analysis is performed against one reference algorithm and two well-known protocol standards. Both simulation and emulation results show that GCMR achieves the expected performance objectives and provide the guidelines for further improvements.

Performance evaluation for a unicast Non Delay Tolerant position based routing protocols in VANETs

Vehicular Ad hoc Networks are special kind of Mobile Ad Hoc Networks. VANET is an emerging technology, which enables an extensive range of applications, including road safety, passenger convenience, self-driven vehicles, and intelligent transportation. Routing in Vehicular Ad hoc Networks is a challenging task due to the unique characteristics of the network. Unicast routing protocols in VANETs are the most fundamental protocols in ad hoc environment and they form the basis for constructing other types of protocols. Unicast routing protocols further classified into topology based, position based, cluster based and hybrid protocols. In this paper protocols belonging to unicast non-delay tolerant position based are discussed. We have implemented our comparison on the NS2 simulator. Simulation of NDT routing protocols A-STAR, CAR, and GyTAR are carried out and the results are presented

A New Unicast Routing Algorithm for Hyper Hexa-Cell Interconnection Networks

The Hyper Hexa-Cell topology; HHC for short; is a new interconnection network topology that has many attractive topological properties compared to other traditional topologies. There have been a number of studies in the literature on the HHC to explore the promising topological properties of this topology. Furthermore, other studies extend this topology by combining it with OTIS technology to produce a new version called OHHC. We have found that there is a lake of presenting any point to point routing algorithm for the HHC, although there were some efforts on building routing algorithms for the OHHC. To cover this shortage, this paper introduces a new unicast routing algorithm for the HHC. The new routing algorithm for the HHC uses store-and-forward technique which allows a message to be transmitted through a path from the source node to the destination node. In addition to presenting the routing algorithm, we present an example to explore the algorithm steps and also an enhancement on the routing algorithm to apply adaptively on the routing based on parameterized criteria. Finally, we present a theoretical theorem to prove that the algorithm routes any message from any source to any destination via an optimal path.