Current Proceedings on Technology

Yazarlar: Mohsen Heydarian, Forough Shirin Abkenar

Konular:-

Anahtar Kelimeler:Merging sessions,Linear programming,Optimal routing,Congestion,Quality of service,Multichannel path

Özet: In communication networks, data transmission in a minimum time is so important. One way to do this is multicast routing. Multicast routing algorithms transmit packets from one source node to a group of destination nodes. In fact, corresponding to each multicast session, the routing algorithm is separately performed once. If the number of multicast session increases to n≥2, the multicast routing algorithm must be performed n times. It means that each session must be waited until the session with high preference is completed, then it can be begun. In this paper we present a new approach which combines n≥2 multicast sessions together to make a single session. By doing this, for fulfilling multicast sessions, we perform routing algorithm only one time and there is no need to n performances.In fact, with merging these n sessions, all of the resources, such as bandwidth, are allocated to more than one session equally or not. The simulation results and numerical computations will show that our new approach as compared to available multicast routing algorithms has more data rate and efficiency and reduces computation time. It also uses the maximum size of bandwidth capacity. Our approach which is based on linear programming, supports quality of service, traffic management and multichannel paths, reduces congestion and we call it as: Optimal Multicast Multi-Sources Routing(OMMSR) algorithm.

---