In recent years, the Internet has incremented the several incipient applications that rely on multicast transmission. This paper discusses the challenges of scheduling algorithms for multicast in high-speed switches that reduces the overhead of adaptation by selecting a HOL (Head of Line Cell) using Round Robin pointer. The objective of this paper is to design a scheduling algorithm called MDDR (Multicast Due Date Round-Robin) scheduling to achieve maximum throughput and low delay that has two phases request and grant. In request phase, MDDR assigns a Due Date (Request Time Slot) for HOL cells of each queue in the input port. Round Robin Pointer is utilized in the grant phase to select a request if HOL occurs. MDDR achieves more preponderant performance than MDRR (Multicast Dual Round-Robin), since the request shall be made when the Due Date is reached. MDDR mainly minimizes many requests made for output ports and time complexity. The simulation results show that the proposed algorithm has good switching performance in throughput and average time delay under Bernoulli and bursty traffic conditions.

Wireless Sensor Network (WSN) is a collection of sensory nodes forming a provisional network without the assistance of any recognized infrastructure. Due to the minimal range of each node’s transmissions, it may be essential for one sensory node to request for the aid of other sensory node in transferring a packet between the source and sink. The important issue while designing WSN is the routing protocol that makes the best use of the severely minimal resource, especially the energy consumption. We propose a Energy Conscious multipath Routing Algorithm designed to improve the latency, resiliency and efficiency through discovering multiple routes between the source and sink. A Sink Originated Route Discovery (SORD) process provides the locality information of the source to the sink. One dominant and multiple alternate routes are generated at the end of the route discovering process. Apart from the dominant route, all the other nodes are put to sleep mode in order to conserve energy and create a concussion free route. Data is transmitted between the source and sink through the dominant route and if there is a disturbance in the existing route, the next preferred alternate route is used. If the route doesn’t exist between the source and sink, the process starts from the beginning. Further, we analyze how the proposed protocol overcomes the drawback of the existing protocols. This system is implemented by using NS-2.34. By altering route update guidelines of existing on-demand routing schemes the Performance gains in the order of 10-15 % could be achieved. The simulation results show that the proposed protocol has less control packet overhead, less average energy consumption and the algorithm is faster.