MULTIPLE ROUTING CONFIGURATION

As the Internet takes an increasingly central role in our communications infrastructure; the slow convergence of routing protocols after a network failure becomes a growing problem. Internet plays a vital role in our day to day activities such as online banking, online shopping, online transactions and some other type of communications infrastructure; due to slow convergence of routing protocols after network failure becomes the massive problem for communication network. A recovery technique name Multiple Routing Configurations (MRC) is used to guarantee fast recovery from link and node failure in networks. In the communication network if the communication is done from the different nodes to transfer the data from source node to destination node, if the communication nodes are damaged or the communication link is broken due to some interference, then network stop and data may lost in this process. So recovery of the data from the network and keep the network functional even if the nodes in the network are failed is the most important for the communication network. So in this paper a detail review on multiple routing configurations (MRC) is done.

2013

Abstract-The internet has taken a central role in our communication infrastructure. The demand for internet has increased a lot but the problem is slow convergence of routing protocol after a failure has occurred. To assure a fast recovery from the link and node failures, we present new recovery scheme called multiple routing configuration (MRC).Our proposed scheme guarantees recovery from both link and node using single mechanism and without knowing root cause of the failure. I.

2014

Internet plays a vital role in our communications infrastructure, due to slow convergence of routing protocols after network failure become a growing problem. To guarantee fast recovery from link and node failure in networks, we propose a new recovery scheme called Multiple Routing Configuration (MRC). Our proposed scheme guarantees recovery in all single failure scenarios, using a single mechanism tohandle both link and node failures, and without knowing the root cause of the failure. MRC is strictlyconnectionless, and assumes only destination based hop-by-hop forwarding. MRC is based on keepingadditional routing information in the routers, and allows packet forwarding to continue on an alternative outputlink immediately after the detection of a failure. It can be implemented with only minor changes to existingsolutions. In thispaper we present MRC, and analyze its performance with respect to scalability, backup path lengths, and loaddistribution after a failure. We also show how an estimate of the traffic demands in the network can be used toimprove the distribution of the recovered traffic, and thus reduce the chances of congestion when MRC is used.

2012

Now a days, Internet plays a major role in our day to day activities e.g., for online transactions, online shopping, and other network related applications. Internet suffers from slow convergence of routing protocols after a network failure which becomes a growing problem. Multiple Routing Configurations [MRC] recovers network from single node/link failures, but does not support network from multiple node/link failures. In this paper, we propose Enhanced MRC [EMRC], to support multiple node/link failures during data transmission in IP networks without frequent global re-convergence. By recovering these failures, data transmission in network will become fast.

International Journal of Engineering Research and Technology (IJERT), 2014

https://www.ijert.org/ip-network-recovery-scheme-by-multiple-routing-configurations-mrc https://www.ijert.org/research/ip-network-recovery-scheme-by-multiple-routing-configurations-mrc-IJERTV3IS20840.pdf Internet plays a vital role in our communications infrastructure, due to slow convergence of routing protocols after network failure become a growing problem. To guarantee fast recovery from link and node failure in networks, we propose a new recovery scheme called Multiple Routing Configuration (MRC). Our proposed scheme guarantees recovery in all single failure scenarios, using a single mechanism tohandle both link and node failures, and without knowing the root cause of the failure. MRC is strictlyconnectionless, and assumes only destination based hop-by-hop forwarding. MRC is based on keepingadditional routing information in the routers, and allows packet forwarding to continue on an alternative outputlink immediately after the detection of a failure. It can be implemented with only minor changes to existingsolutions. In thispaper we present MRC, and analyze its performance with respect to scalability, backup path lengths, and loaddistribution after a failure. We also show how an estimate of the traffic demands in the network can be used toimprove the distribution of the recovered traffic, and thus reduce the chances of congestion when MRC is used.

— Wireless sensor networks (WSNs) are important for monitoring most of the distributed remote environments. Nodes fault detection is one of the key technologies involved in WSNs, is indispensable in most WSN applications. The distributed fault detection scheme checks out the failed nodes by exchanging data and mutually testing among neighbor nodes in this network The fault detection accuracy of a scheme would decrease rapidly when the number of neighbor nodes to be diagnosed is small and the node's failure ratio is high. An improved scheme is proposed by defining new detection criteria. Simulation process demonstrate that the improved scheme performs well in the above situation and the fault detection accuracy can be increased greatly. wireless sensor-actor networks, sensors probe their surroundings and forward their data to actor nodes. The Actors respond collaboratively to achieve predefined application mission. Since the actors have to coordinate their operation, a strongly connected network topology is necessary to maintain at all times. Also, the length of the inter-actor communication paths maybe constrained to meet latency requirement. Cost-Aware SEcure Routing (CASER) is a protocol to address these two conflicting issues through two adjustable parameters: energy balance control (EBC) and probabilistic-based random walking. CASER has an excellent routing performance in terms of energy balance and routing path distribution for routing path security. A non-uniform energy deployment scheme is also proposed to maximize the sensor network lifetime. Our analysis and simulation will show that we can increase the lifetime and the number of messages that can be delivered under them on-uniform energy deployment by more than four times. CASER has flexibility to support multiple routing. The main objective to have a network which gives assurance of packet delivery and give the node time to regain is that it will be able to carry further load Packets on the network. This can be done by using shortest path. Multi-hop-based schemes often impose high node repositioning overhead and the repaired inter-actor topology using two-hop schemes may differ significantly from its prefailure status.

IEEE Transactions on Computers, 2003

Link-state routing protocols, such as OSPF and IS-IS, are widely used in the Internet today. In link-state routing protocols, global network topology information is first collected at each node. A shortest path tree (SPT) is then constructed by applying Dijkstra's shortest path algorithm at each node. Link-state protocols usually require the flooding of new information to the entire (sub)network after changes in any link state (including link faults). Narvaez et al. proposed a fault-tolerant link-state routing protocol without flooding. The idea is to construct a shortest restoration path for each unidirectional link fault. Faulty link information is distributed only to the nodes in the restoration path and only one restoration path is constructed. It is shown that this approach is loop-free. However, the Narvaez et al. approach is inefficient when a link failure is bidirectional because a restoration path is unidirectional and routing tables of nodes in the path are partially updated. In addition, two restoration paths may be generated for each bidirectional link fault. In this paper, we extend the Narvaez et al. protocol to efficiently handle a bidirectional link fault by making the restoration path bidirectional. Several desirable properties of the proposed extended routing protocol are also explored. A simulation study is conducted to compare the traditional link-state protocol, the source-tree protocol, the Narvaez et al. unidirectional restoration path protocol, and the proposed bidirectional restoration path protocol.

IEEE/ACM Transactions on Networking, 2000

As the Internet takes an increasingly central role in our communications infrastructure, the slow convergence of routing protocols after a network failure becomes a growing problem. To assure fast recovery from link and node failures in IP networks, we present a new recovery scheme called Multiple Routing Configurations (MRC). Our proposed scheme guarantees recovery in all single failure scenarios, using a single mechanism to handle both link and node failures, and without knowing the root cause of the failure. MRC is strictly connectionless, and assumes only destination based hop-by-hop forwarding. MRC is based on keeping additional routing information in the routers, and allows packet forwarding to continue on an alternative output link immediately after the detection of a failure. It can be implemented with only minor changes to existing solutions. In this paper we present MRC, and analyze its performance with respect to scalability, backup path lengths, and load distribution after a failure. We also show how an estimate of the traffic demands in the network can be used to improve the distribution of the recovered traffic, and thus reduce the chances of congestion when MRC is used.

2015

An Internet plays very important role in day to day life; the slow convergence of routing protocols after a network failure becomes a big problem. Internet performing an essential function in the living activities such as online transaction, online marketing, online business and some other type of communications infrastructure; due to slow convergence of routing protocols after network failure becomes the massive problem for communication network. A recovery technique name Multiple Routing Configurations (MRC) is used to guarantee fast recovery from link and node failure in networks. In the communication network if the communication is done from the different nodes to transfer the data from source node to destination node, if the nodes who communicate with each other are broken or the communication link is failed due to some interference, then network stop and data may lost in this process. So recovery of the data from the network and keep the network functional even if the nodes in...

2011

To assure fast recovery from link and node failures in IP networks, we present JAVA based recovery scheme called Multiple Routing Configurations (MRC). This proposed scheme guarantees recovery in all single failure scenarios, using a single mechanism to handle both link and node failures, and without knowing the root cause of the failure. MRC is based on keeping additional routing information in the routers, and allows packet forwarding to continue on an alternative output link immediately after the detection of a failure.