Multicast Tree Algorithm in ATM Network Environment
The world of computer networks is changing day by day in a positive way. With the use of computer networks lot of techniques and benefits have aroused. One of the technologies in this category is Multicasting. Multicasting is nothing but sending the same data to different multiple recipients. The data may be an audio file, video file, text file. Here in this paper I learned about usage of multicasting technique in ATM-based networks which is a complex situation.
Asynchronous Transfer Mode is the most widely studied and implemented form of high speed networks(1). Our goal is to minimize band width cost and reduce network traverse time at the same time make an efficient use of the network and establish fast connections. So this can be done but using the shortest path algorithm. So the author has proposed an algorithm based on the original topology of ATM networks. It considers the special characteristics of ATM switches and network connections(2). Generally the ATM graph can be represented with the help of a graph. The multicast communication is designed as per the user requirements in. In this way he designs the network based on Cost of establishing connections, Cost of band width, Cost of Switching etc(3). But the main objective of this multicasting network is to find a routing for a given number of destinations with the minimal overall cost of connection establishment.
So the researchers have taken an example connecting two VC’s. And they have considered the minimum spanning tree. Then the calculated the costs and they got a fair result. During this experiment, the problem faced was due to the complexity of the computing the ...
... middle of paper ...
...pe of message(4). Rather than packging a set of discrete tree edges in the routing messages, we package a converted binary tree to reduce the size of the payload about half. So as a result, the routing overhead of PSR is only a fraction or less compared with DSDV, OLSR and DSR yet it has a similar or better performance in transporting TCP and UDP data flows.
So here we the above proposed lightweight Proactive Routing Scheme is successfully done using different models. The proposed theory has a good scope in the future in the area of Mobile HOC networking.
Citations
1)Wikipedia
2)Chlamtic Mobile and HOC networking.
3)A Lightweight proactive source routing protocol for Mobile and HOC Networks by Zehua Wang, Yuanzhu Chen.
4)A Lightweight proactive source routing protocol for Mobile and HOC Networks by Zehua Wang, Yuanzhu Chen.