From last many years traffic in internet is increasing very rapidly. But as internet in growing up it required quality and have to increase the efficiency of network. Also it should concentrate on load balancing & resource utilization. In today's internet world mostly Open Shortest Path First (OSPF) routing protocol is used which is based on link weighs, as optimizing link weight in OSPF to the group traffic is well-know NP-Hard problem. In the consideration of current situation of the network paper introduce a new method called Multi-Shortest Path First routing protocol to achieve optimal traffic engineering in network with the help of OSPF. It will reduce the time required to compute the weight on link and find the best links to forward the packet within short time. Our concept is to split the traffic over first few multiple shortest paths to reach to destination. As traffic increases our protocol automatically sends packet through next shortest path present in the network.. As compare with the OSPF packet forwarding mechanism is same just difference is in splitting mechanism.

No abstract

In wireless sensor networks (WSNs), many factors, for instance, mutual interference of wireless connections, battlefield applications and nodes presented to the environment without top physical safety, effects in the sensor nodes being extra powerless in against to the attacked compromised. For tackling the issues security, an effective appropriated trust model is proposed. They faces some issues, first is system was not focus on other trust metrics Trust is evaluated by the two ways direct and indirect trust on the basis of recommendation from third party. The third issue is offering the trust assessment on neighbour nodes become very essential. Fourth, trust relationship between sensor nodes frequently modified in wireless sensor networks because of the dynamic topology. For solving all these issues proposed the efficient distributed trust model for wireless sensor networks. This system can estimate dependability of sensor nodes more accurately and prevent the security breaches more considerably. Also for sending the data from subject node to object there are number of paths are generated, in this system we used Dijkastra algorithm for finding the shortest path. Also for the existing system faces the problem of security against the different attacks on network. For security purpose we used ECC algorithm. Experimental result shows that energy consumption for proposed system and existing system.

No abstract

IS-IS and OSPF are link state routing protocols. Both protocols suggest different procedures for this purpose. Since the procedures are quite different, but targeted to achieve the same goal; it is worthwhile comparing the two according to performance criteria common to both. The following criteria are chosen. The longest arrival time of an LSU packet at all the routers. Following this measure it can also find if all the LSA packets arrive successfully at all the routers before new instances of the packets are generated. The average arrival time of LSA packets at all the routers. The total required bandwidth in each scheme. The number of memory accesses a router performs in each scheme, which is evidence of the amount of internal work it performs.Clearly, a scheme in which more LSA packets arrive at all the routers more quickly, with a smaller amount of internal work and with the use of a smaller amount of bandwidth and within the routers, is more efficient. In terms of arrival times of routing update packets it find that in our model of broadcast networks the method suggested in OSPF is giving less performance than that of IS-IS. In particular, the OSPF performance in consideration with average arrival time of routing update packets is 2-10 times longer than in IS-IS There are scenarios where OSPF outperforms IS-IS and vice versa, in terms of the bandwidth each scheme consumes as well as the number of routers memory accesses perform in each scheme, IS-IS outperforms OSPF.