International Journal of Computational Intelligence and Information Security, August 2011 Vol. 2, No.

Analysis & Study of Fast Recovery IP Packets Using Multiple Routing Configuration
Name: L.Haritha Qualification: M.Tech College: SKTRMCE Email ID: saiharitha@gmail.com
Name: S. Masthan Valli Designation:Assoc Prof

Name:N.Vikram Qualification: M.Tech College: Shadan college of Engineering Email ID: viki_ap@yahoo.com
Name: Dr.MD .ATEEQ-UR-RAHMAN Designation: Professor

College: SKTRMCE

College: Shadan college of Engineering

Abstract
Internet takes an increasingly vital 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, analyzed a technique routing and how the IP network works on different routings. We proposed a novel 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. MRC is best efficient to existing one our proposed system analyzes fast recovery flow of data in IP networks

Keywords Routing, Networks, IP packet, MRC

INTRODUCTION I Networking is high dynamic traffic demand, time variant, flash crowd resources which add and drop. Topology operates on network operator, inter/intra domains, the network traffic engineering performs beyond the security, reliability, resilience also the minimize network cost given resources and maximum traffic demand given resource with efficient use of network resource Routing mechanisms with in an IP network may induce some restrictions on the path choice related to the path selection algorithm. The problem occurs more specifically in the case of a IP networks running an IGP (Interior Gateway Protocol) routing protocol. In this case, the routes derive from very simple routing algorithms (shortest path calculations) which offer only limited control over the routing paths. This often leads to a sub-optimal utilization of the network resources. Today several new mechanisms are proposed to increase the routing control and to optimize the network performance, and among them MPLS. However such mechanisms also introduce some complexity in the network management. We try to analyze the compromise between routing performance and complexity. We propose two off-line Traffic Engineering methodologies: the first one is based on an IGP/MPLS architecture; the second one is based only on the IGP routing using an optimized load balancing scheme. Goal of routing protocol determines sequence of routers through network packet from source to destination, the graph abstraction for routing algorithms are 1) graph nodes are routers 2) graph edges are physical links example for good path routing is shown below.

14

International Journal of Computational Intelligence and Information Security, August 2011 Vol. 2, No. 8

Figure 1. example of good routing path Static routing manually change the route slowly which is stable, reach ability is independent of network condition. Dynamic routing learn to route the data via routing protocols which changes the configuration directly might not oscillate. In routing we have two types of algorithms Global or link state algorithm use global knowledge about the network topology and cost and Decentralized or distance vector algorithm use only the knowledge of attached links and neighbors which is iterative SECTION II 2. Routing is the process of selecting the paths in a graph (network) along which the data is sending from source to destination. Routing is performed in many kinds of networks, including the telephone network, electronic data networks (Internet) and transportation networks. Routing in electronic data networks using packet switching technology, routing directs packet forwarding the transit of logically addressed packets from their source towards their ultimate destination through intermediate nodes, typically hardware devices called routers, bridges, gateways, firewalls. General-Puporse computers can also forward packets and perform routing, though they are not specialized hardware and may suffer from limited performance. 2.1. Routing Algorithms: Traveling of packet from source to destination it has to pass through single or multiple paths. When a packet finds multiple paths to reach the destination, it has no judging methods available to find a right path. A router with the help of certain algorithms calculates the best path for the packet to reach the destination called routing algorithms. We have two types of routing algorithms 1)distance-vector routing 2)link state routing 2.1.1. Distance-vector algorithm: It uses the distance and direction to find the best path to reach the destination. Here the distance means number of hops a packet crosses to reach the destination, each hop refers to a router across the path. The word vector refers to the direction of the packet to reach the destination, has less convergence time and knowledge about the network when compared to link state routing algorithm. 1. In this algorithm, the information about every router connected directly and routing updates will be gathered by every single router. This information is about the whole network will be sent periodically to all the neighboring routers connected to it, this is the process of updates the information in its routing table. 2. All the information collected by a single router about the whole network will be sent only to its neighbors and not to all other routers in the routing table. If there is any change in the hop count or disabled paths it will updated only to its neighbors which in turn after a period passes to its neighbors. 3. This information will take place in a period of 30seconds. If there is a change in the network like if a network fails or additionally a router is added to the network, the changed information will be updated only after that time period. 2.1.2. Link State Routing Algorithm: This is the most popular routing algorithm used in the real time networks, uses three tables to calculate the routing table entries. It is also called as shortest path first algorithm some of them includes its faster convergence time, ability to handle very large networks, reliable path prediction. It uses link state advertisements to find the information about the router. Working steps for link algorithms can be analyzed. Routing protocol ospf uses this routing algorithm 1.shortest path first algorithm it uses several calculation to find the shortest path to reach the destination. This algorithm uses link state packets or advertisements to collect the information about the neighboring routers. Only links that are connected directly are considered as neighbors. 2.In this algorithm instead of sending the routing table information only to the neighbors it sends to all the routers in the network. In this algorithm totally three tables are maintained. One is for collecting information about neighbors, one has information about the entire topology, final one is the actual routing table. 3.In this algorithm there is no periodic updates involved. A router in the network will send updates to all the routers and only if there is a change in the network. That is why it is called as event triggered updates. This event triggered updates will help the router to find its path immediately without any errors. 2.2. Routing Protocols: The purpose of routing protocols is to learn of available routes that exist on the enterprise network, build routing tables and make routing decisions. Commonly used routing protocols include RIP, IGRP, EIGRP, OSPF,Is-IS and BGP. Distance vector protocols advertise their routing table to all directly connected neighbors at regular frequent intervals using a lot of bandwidth and are slow to converge. When a route becomes unavailable, all router tables must be updated with that new information. The problem is with each router having to advertise that new information to its neighbors, it takes a long time for all routers to have a current accurate view of the network. Distance vector protocols use fixed length subnet masks which aren't scalable. Link state protocols advertise routing updates only when they occur which uses bandwidth more effectively. Routers don't advertise the routing table which makes convergence faster. The routing protocol will flood the network with link state

15

International Journal of Computational Intelligence and Information Security, August 2011 Vol. 2, No. 8

advertisements to all neighbor routers per area in an attempt to converge the network with new route information. The incremental change is all that is advertised to all routers as a multicast LSA update. They use variable length subnet masks, which are scalable and use addressing more efficiently. 2.2.1 Interior Gateway Routing Protocol (IGRP) Interior Gateway Routing Protocol is a distance vector routing protocol developed by Cisco systems for routing multiple protocols across small and medium sized Cisco networks. It is proprietary which requires that you use Cisco routers. This contrasts with IP RIP and IPX RIP, which are designed for multi-vendor networks. IGRP will route IP, IPX, Decnet and AppleTalk which makes it very versatile for clients running many different protocols. It is somewhat more scalable than RIP since it supports a hop count of 100, only advertises every 90 seconds and uses a composite of five different metrics to select a best path destination. Note that since IGRP advertises less frequently, it uses less bandwidth than RIP but converges much slower since it is 90 seconds before IGRP routers are aware of network topology changes. IGRP does recognize assignment of different autonomous systems and automatically summarizes at network class boundaries. As well there is the option to load balance traffic across equal or unequal metric cost paths. 2.2.2. Enhanced Interior Gateway Routing Protocol (EIGRP) Enhanced Interior Gateway Routing Protocol is a hybrid routing protocol developed by Cisco systems for routing many protocols across an enterprise Cisco network. It has characteristics of both distance vector routing protocols and link state routing protocols. It is proprietary which requires that you use Cisco routers. EIGRP will route the same protocols that IGRP routes (IP, IPX, Decnet and Appletalk) and use the same composite metrics as IGRP to select a best path destination. As well there is the option to load balance traffic across equal or unequal metric cost paths. Summarization is automatic at a network class address however it can be configured to summarize at subnet boundaries as well. Redistribution between IGRP and EIGRP is automatic as well. There is support for a hop count of 255 and variable length subnet masks. 2.2.3. Open Shortest Path First (OSPF) Open Shortest Path First is a true link state protocol developed as an open standard for routing IP across large multi-vendor networks. A link state protocol will send link state advertisements to all connected neighbors of the same area to communicate route information. Each OSPF enabled router, when started, will send hello packets to all directly connected OSPF routers. The hello packets contain information such as router timers, router ID and subnet mask. If the routers agree on the information they become OSPF neighbors. Once routers become neighbors they establish adjacencies by exchanging link state databases. Routers on point-to-point and point-to-multipoint links (as specified with the OSPF interface type setting) automatically establish adjacencies. Routers with OSPF interfaces configured as broadcast (Ethernet) and NBMA (Frame Relay) will use a designated router that establishes those adjacencies. 2.2.4. Integrated IS-IS Integrated Intermediate System - Intermediate System routing protocol is a link state protocol similar to OSPF that is used with large enterprise and ISP customers. An intermediate system is a router and IS-IS is the routing protocol that routes packets between intermediate systems. IS-IS utilizes a link state database and runs the SPF Dijkstra algorithm to select shortest paths routes. Neighbor routers on point to point and point to multipoint links establish adjacencies by sending hello packets and exchanging link state databases. IS-IS routers on broadcast and NBMA networks select a designated router that establishes adjacencies with all neighbor routers on that network. The designated router and each neighbor router will establish an adjacency with all neighbor routers by multicasting link state advertisements to the network itself. That is different from OSPF, which establishes adjacencies between the DR and each neighbor router only. IS-IS uses a hierarchical area structure with level 1 and level 2 router types. Level 1 routers are similar to OSPF intra-area routers, which have no direct connections outside of its area. Level 2 routers comprise the backbone area which connects different areas similar to OSPF area 0. With IS-IS a router can be an L1/L2 router which is like an OSPF area border router (ABR) which has connections with its area and the backbone area. The difference with IS-IS is that the links between routers comprise the area borders and not the router. Each IS-IS router must have an assigned address that is unique for that routing domain. An address format is used which is comprised of an area ID and a system ID. The area ID is the assigned area number and the system ID is a MAC address from one of the router interfaces. There is support for variable length subnet masks, which is standard with all link state protocols. Note that IS-IS assigns the routing process to an interface instead of a network. 2.2.5. Border Gateway Protocol (BGP) Border Gateway Protocol is an exterior gateway protocol, which is different from the interior gateway protocols discussed so far. The distinction is important since the term autonomous system is used somewhat differently with protocols such as EIGRP than it is with BGP. Exterior gateway protocols such as BGP route between autonomous systems, which are assigned a particular as number. As numbers can be assigned to an office with one or several BGP routers. The BGP routing table is comprised of destination IP addresses, an associated AS-Path to reach that destination and a next hop router address. The AS-Path is a collection of AS numbers that represent each office involved with routing packets. Contrast that with EIGRP, which uses autonomous systems as well. The difference is their autonomous systems refer to a logical grouping of routers within the same administrative system. An EIGRP network can configure many autonomous systems. They are all managed by the company for

16

International Journal of Computational Intelligence and Information Security, August 2011 Vol. 2, No. 8

defining route summarization, redistribution and filtering. BGP is utilized a lot by Internet Service Providers (ISP) and large enterprise companies that have dual homed internet connections with single or dual routers homed to the same or different Internet Service Providers. BGP will route packets across an ISP network, which is a separate routing domain that is managed by them. The ISP has its own assigned AS number, which is assigned by Inter NIC. New customers can either request an AS assignment for their office from the ISP or Inter NIC. A unique AS number assignment is required for customers when they connect using BGP. There are 10 defined attributes that have a particular order or sequence, which BGP utilizes as metrics to determine the best path to a destination. Companies with only one circuit connection to an ISP will implement a default route at their router, which forwards any packets that are destined for an external network. BGP routers will redistribute routing information (peering) with all IGP routers on the network (EIGRP, RIP, OSPF etc) which involve exchange of full routing tables. Once that is finished, incremental updates are sent with topology changes. Each BGP router can be configured to filter routing broadcasts with route maps instead of sending/receiving the entire internet routing table. SECTION III 3. what is an IP Network: Network provides Communication between computing devices. To communicate properly, all computer hosts on a network need to use the same communication protocols. An internet protocol network is a network of computer using internet protocol for their communication protocol. All computer within an IP network must have an IP address that uniquely identifies that individual host. An Internet protocol-based network an IP network group of hosts that share a common physical connection and that use internet protocol for network layer communication. 3.1. Types of Address in an IP Network Host Address: A host IP address is the address of a specific host on an IP network. All hosts on a network must have a unique IP address, this IP address is usually not the first or the last IP address in the range of network IP addresses as the first IP address and last IP address in the range of IP addresses are reserved for special function. The host IP address are all the addresses in the IP network range of IP addresses except the first and last IP addresses. Host IP addresses allow network hosts to establish oneone direct communication referred to as uni-cast communication. Host IP addresses can be split into a network part and a host part. The network part of the IP addresses identifies the IP network the host is a member, uniquely identifies an individual host. A. Network Address: Network address is the first IP address in the range of IP addresses, to be more precise the network address is the IP address in which all binary bits in the host portion of the IP address are set to zero, the purpose of the network address is to allow hosts that provide special network services to communicate. B. Broadcast Address: The broadcast IP address is the last IP address in the range of IP addresses, the broadcast address is the IP address in which all binary bits in the host portion of the IP address are set one. The broadcast address is reserved and allows a single host to make an announcement to all hosts on the network, this us called broadcast communication C. How an IP network works: Computer uses a mask in its network connection that allows it to determine whether the computer it wants to talk to over the local network is actually on the local 3.2. Working method of IP packet Computer uses a mask in its network connection that allows it to determine whether the computer it wants to talk to over the local network is actually on the local network or on a network outside the local network. If it is a computer that is local, it will use a local protocol to find the other computer hardware address. If the other computer is not local is called outside the local network, then it will send the data to the local gateway usually default gateway. Our computer will try to determine the hardware address of the local default gateway and will use the hardware address in the Ethernet header or FDDI header or token ring header etc. The Ethernet frame will contain a payload which will be filled with IP data. The IP address of the remote computer will be in this payload as part of the IP header. Since the IP address in the IP datagram is the remote computer, but the Ethernet frame is addressed to the local default gateway, the default gateway will accept the Ethernet frame, read the IP data verify the IP address is indeed outside the local network and then forward the IP datagram over whatever other network connections the computer has that will allow it to reach all other outside networks. Thats how internet protocol makes routing work in a network with a default gateway. 4. Problem definition: Sending the data from sender system to receiver system, the process is done by using the IP network in internet, client/server or any device. The flow of data may be jammed in the router or link.

Figure 2 shows the example of our problem

17

International Journal of Computational Intelligence and Information Security, August 2011 Vol. 2, No. 8

Here the data sending from sender to receiver, the red node represent failure of router and link. Blue color nodes or links information is processed from sender to receiver. If any node or link fails, the MRC routing will selects the other router or link Our proposed scheme guarantees to 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 4.1. MRC Configuration: MRC is defined by the network topology, which is the same in all configurations and associated link weights which differ among configurations. Formally represents the network topology as a graph G=(N,A), with a set of nodes N and a set of unidirectional links A1. In order to guarantee single-fault tolerance, the topology graph G must be bi-connected.

Figure 3 flow of packet processing When a packet reaches a point of failure, the node adjacent to the failure, called the detecting node, is responsible for finding a backup configuration where the failed component is isolated. The detecting node marks the packet as belonging to this configuration, and forwards the packet. From the packet marking, all transit routers identify the packet with the selected backup configuration, and forward it to the egress node avoiding the failed component. Consider a situation where a packet arrives at node u, and cannot be forwarded to its normal next-hop v because of a component failure. The detecting node must find the correct backup configuration without knowing the root cause of failure, i.e., whether the next-hop node v or link (u, v) has failed, since this information is generally unavailable. CONCLUSION V We have presented Routing as an approach to achieve fast recovery in IP networks, we analyzed routing algorithms, protocols, IP network and how the IP network works in the internet. The solution for our proposed is MRC is based on providing the routers with additional routing configurations, allowing them to forward packets along routes that avoid a failed component. MRC guarantees recovery from any single node or link failure in an arbitrary bi-connected network. By calculating backup configurations in advance, and operating based on locally available information only, MRC can act promptly after failure discovery. MRC operates without knowing the root cause of failure, i.e., whether the forwarding disruption is caused by a node or link failure. This is achieved by using careful link weight assignment according to the rules we have described. The link weight assignment rules also provide basis for the specification of a forwarding procedure that successful, MRC thus achieves fast recovery with a very limited performance penalty. Reference [1] Shaun Hummel is the author of Network Planning and Design Guide and has a web site focused on information technology job search solutions and certifications. [2]David G. Cantor and Mario Gerla, Optimal routing in a packet-switched computer network, IEEE Transactions on Computer, vol. C-23, no. 10, pp. 1062-1069, 1974. [3] Robert G. Gallager, A minimum delay routing algorithm using distributed computation, in IEEE Transaction on Communications, January 1977, pp. 73-85 [4]A. Basu and J. G. Riecke, Stability issues in OSPF routing, in Proceedings of SIGCOMM, San Diego, California, USA, Aug. 2001, pp. 225236.

18

International Journal of Computational Intelligence and Information Security, August 2011 Vol. 2, No. 8

[5] C. Labovitz, A. Ahuja, A. Bose, and F. Jahanian, Delayed Internet Routing Convergence, IEEE/ACM Transactions on Networking, vol. 9, no. 3, pp. 293306, June 2001. [6] C. Boutremans, G. Iannaccone, and C. Diot, Impact of link failures on VoIP performance, in Proceedings of International Workshop on Network and Operating System Support for Digital Audio and Video, 2002, pp. 6371. [7] D. Watson, F. Jahanian, and C. Labovitz, Experiences with monitoring OSPF on a regional service provider network, in ICDCS 03: Proceedings of the 23rd International Conference on Distributed Computing Systems. Washington, DC, USA: IEEE Computer Society, 2003, pp. 204213. [8] P. Francois, C. Filsfils, J. Evans, and O. Bonaventure, Achieving sub-second IGP convergence in large IP networks, ACM SIGCOMM Computer Communication Review, vol. 35, no. 2, pp. 35 44, July 2005. [9] A. Markopoulou, G. Iannaccone, S. Bhattacharyya, C.-N. Chuah, and C. Diot, Characterization of failures in an IP backbone network, in Proceedings INFOCOM, Mar. 2004. [10] S. Nelakuditi, S. Lee, Y. Yu, Z.-L. Zhang, , and C.-N. Chuah, Fast local rerouting for handling transient link failures, IEEE/ACM Transactions on Networking, vol. 15, no. 2, pp. 359372, apr 2007

L.Haritha Pursuing M.Tech From Sri Kottam Tulasi Reddy Memorial college of Engineering(JNTUH), B.Tech from Nagarjuna Institute of Technology (JNTUH). Her areas of interest include Wireless networks, Information Security currently focusing on IP Networks

N.Vikram Pursuing M.Tech From Shadan college of Engineering(JNTUH), B.Tech from SriDatta Institute of Engineering & Technology (JNTUH). His areas of interest include Wireless networks, Information Security currently focusing on networks

S. Masthan Valli Assoc Prof from Sri Kottam Tulasi Reddy Memorial College of Engineering(JNTUH) Kondair, His areas of interest include Data Mining, Information Security

19

International Journal of Computational Intelligence and Information Security, August 2011 Vol. 2, No. 8

Prof.MD .ATEEQ-UR-RAHMAN Ph.D from JNTU, B.E from Gulbarga University, M.Tech from Vishveshwara Technological University. Currently he is the Head of department at Shadan college of Engineering & Technology. He had guided many UG & PG Students areas of interest include Information Security, Wireless Networks

20