An Efficient MultiCast Distributed On-Line Scheduling With Cloud Computing

Abstract

Abstract— The few common applications well, e.g., datacenter (DC) backup, multicast-oriented tasks need to be handled in inter-DC networks. In this project is proposed by an approach to schedule and route multicast -oriented tasks in inter-DC networks with arbitrary topologies. Specifically, in this project is leverage optimization by the develop a distributed online approach that can maximize the time-average profit with only local information. In networks with continuously heavy traffic, the sensors need not invoke any special neighbor discovery protocol during normal operation. This is because any new node, or a node that has lost connectivity to its neighbors, can hear its neighbors simply by listening to the channel for a short time. However, for sensor networks with low and irregular traffic, a special neighbor discovery scheme should be used. Besides the destination grouping scheme is address by the scalability issue of our proposed approach, and demonstrates that the number of queues in the system can be reduced significantly. Extensive simulations verify the performance of the proposed approaches.

Author

AFIYAMA ANGELEN DIVYA HEERA SHARMILA Mr.N.NASRUDEEN

[1]         kaiyue wbu,ping lu,zuqing zhu,DistributedOnline Scheduling and Routing Of Multicast-oriented Tasks For Profit Driven Cloud Computing, 1089-

7798(c)2015IEEE.Personaluseispermitted, but republication/redistribution requires IEEE permission.

[2]         D. Lietal.,“ESM : Efficient and scalable data center multicast routing, ”IEEE/ACM Trans, Netw ., vol. 20, pp. 944- 955, Jun. 2012

[4]         G. Paschos et al., Multi-rate Multicasting With Network Coding : ,” in a Proc. of INFOCOM 2014, pp. 343 – 351, Apr. 2014