Intra-domain Routing Protocol Research Articles

A Comparative Study of Routing Protocols for Minimum Path Cost Matric in MANETS

The Routing is the process of transmitting data packets from one node to another another node from source to destination The Mobile Adhoc Networks (MANETs ) doesn't have any fixed network structure or any centralized process to administer. The selection of the route is important for performance of packet transfer from source to destination. These routing protocol are classified as inter domain routing and Intra domain routing protocol. The routing protocols have been classified into Non Reactive , Reactive and Hybrid protocols. In the present paper we proposes to compare reactive routing protocols videlicet Ad hoc On Demand Distance Vector (AODV), Dynamic Source Routing (DSR) protocols, Temporarily Ordered Routing Algorithm (TORA) and Associativity Grounded Routing (ABR) protocol.The Routing in MANETs is a one of the robustly and demanding task and has entered a great quantum of mindfulness from experimenters around the globe. To overcome this problem, a colorful number of routing classes have been introduced and the number is still rising day by day fastly. It's relatively hard to decide which protocols or routing classes may do well under an quantum of different network scripts similar as network volume and network topology etc. The study and performance of the above mentioned protocol has also been tabulated in the present two tables . The protocols are based on minimum power and temporary configuration of topology. The table 1 gives comparison of the main characteristics of routing protocols and Table2. provide comparison of various reactive routing protocol.

Efficient Routing Protection Algorithm Based on Optimized Network Topology

Network failures are unavoidable and occur frequently. When the network fails, intra-domain routing protocols deploying on the Internet need to undergo a long convergence process. During this period, a large number of messages are discarded, which results in a decline in the user experience and severely affects the quality of service of Internet Service Providers (ISP). Therefore, improving the availability of intra-domain routing is a trending research question to be solved. Industry usually employs routing protection algorithms to improve intra-domain routing availability. However, existing routing protection schemes compute as many backup paths as possible to reduce message loss due to network failures, which increases the cost of the network and impedes the methods deployed in practice. To address the issues, this study proposes an efficient routing protection algorithm based on optimized network topology (ERPBONT). ERPBONT adopts the optimized network topology to calculate a backup path with the minimum path coincidence degree with the shortest path for all source purposes. Firstly, the backup path with the minimum path coincidence with the shortest path is described as an integer programming problem. Then the simulated annealing algorithm ERPBONT is used to find the optimal solution. Finally, the algorithm is tested on the simulated topology and the real topology. The experimental results show that ERPBONT effectively reduces the path coincidence between the shortest path and the backup path, and significantly improves the routing availability.

A hybrid link protection scheme for ensuring network service availability in link-state routing networks

The internet is playing an increasingly crucial role in both personal and business activities. In addition, with the emergence of real-time, delay sensitive and mission-critical applications, stringent network availability requirement is put forward for internet service providers (ISPs). However, commonly deployed intradomain link-state routing protocols react to link failures by globally exchanging link state advertisements and recalculating routing table, inevitably causing significant forwarding discontinuity after a failure. Therefore, the loop-free criterion (LFC) approach has been widely deployed by many ISPs for coping with the single network component failure scenario in large internet backbones. The success of LFC lies in its inherent simplicity, but this comes at the expense of letting certain failure scenarios go unprotected. To achieve full failure coverage with LFC without incurring significant extra overhead, we propose a novel link protection scheme, hybrid link protection (HLP), to achieve failure resilient routing. Compared to previous schemes, HLP ensures high network availability in a more efficient way. HLP is implemented in two stages. Stage one provides an efficient LFC based method (MNP-e). The complexity of the algorithm is less than that of Dijkstra's algorithm and can provide the similar network availability with LFC. Stage two provides backup path protection (BPP) based on MNP-e, where only a minimum number of links need to be protected, using special paths and packet headers, to meet the network availability requirement. We evaluate these algorithms in a wide spread of relevant topologies, both real and synthetic, and the results reveal that HLP can achieve high network availability without introducing conspicuous overhead. HLP not only needs around 10% time of that of full protection, but also provides full protection capabilities that full protection provide.

Identifying OSPF LSA falsification attacks through non-linear analysis

Open Shortest Path First (OSPF) is one of the most widely used intra-domain routing protocols. Unfortunately, it has many serious security issues. Falsification over OSPF is one of the most critical vulnerabilities that can cause routing loops and a black hole. In this paper, we introduce a novel approach by using a technique from non-linear statistical analysis to identify OSPF attacks. Firstly, we evaluate the capability of the non-linear technique to identify OSPF attacks using a controlled testbed where we introduce different types of LSA falsifications. Secondly, we evaluate our approach to detect different types of OSPF attacks using OSPF traffic associated with a single OSPF router and OSPF traffic associated with a set of OSPF routers. In both cases, our approach can detect anomalous behaviour quickly. Finally, we use various successful machine learning classifiers to analyze the outputs obtained from the non-linear analysis and calibrate their suitability in discovering such anomalies.

A fine-grained multi-source measurement platform correlating routing transitions with packet losses

In this paper, we are interested in the relationship between packet losses and routing changes in an operational network. To do so we designed and deployed DCART, a monitoring platform over RENATER, the French research and education network. Our platform collects four data sources using both active and passive measurements in order to unveil their temporal correlations. Active probing allows especially for measuring packet losses on specifically crafted data flows. Those flows explore several load balanced paths and ease the revelation of forwarding loops. Passive monitoring is achieved by listening to all routing updates from IS-IS, the intra-domain routing protocol in use, and by retrieving tickets generated by the Network Operations Center (NOC).During our monitoring campaign, we observe that most of the series of loss were correlated to routing events either because routing changes lead to inconsistent state transitions, or because faulty – and so lossy – links trigger numerous periods of link flapping. In particular, we show that losses due to forwarding loops resulting from inconsistent routing states are quite common when links come back after an outage. We also show that link flapping sometimes induce very long lasting lossy periods frequently unnoticed by the NOC. A lightweight monitoring platform such as DCART could be used to better anticipate recurrent network outages and to improve the ticketing system.

An Approach to Discover the Stable Routes in BGP Confederations

This article describes how the current internet is a network of interconnected autonomous systems which is susceptible to route instability when transferring data. The BGP confederation is the essential intra-domain routing protocol that may cause instability on the Internet. So far, route instability has been widely studied for internal BGP. However, the existing routing policies such as APMS and H-SSPP are not adequate for the route stability of BGP confederations. In fact, these routing policies may degrade the network performance parameters in terms of the packet delivery ratio, convergence time, average throughput and the average end to end delay. Therefore, this article proposes the Flexible BGP Confederation Policy Management (FBCPM) to reduce the anomalies. The proposed approach detects the route instability in the networks and provides a policy to construct a stable network. The routing policy shrinks the route oscillations and forwarding loops. Furthermore, the simulation results confirm that the authors' proposed approach has improved network performance parameters compared to other existing approaches.

Intra-domain routing protocol OSPF+ for integrated terrestrial and space networks

Intra-domain routing protocol OSPF+ for integrated terrestrial and space networks

Reducing the power consumption of hose‐model networks with bundled links

Given the exponential growth in telecommunication networks, more and more attention is being paid to their share in the global energy consumption. Reducing networks’ power consumption has become a major concern. However, the often over-provisioned wired core network is still overlooked. In core networks, pairs of routers are typically connected by multiple physical cables that form one logical bundled link participating in the intra-domain routing protocol. To reduce the energy consumption of core networks with bundled cables, the authors propose a scheme to deactivate the maximum possible number of cables, and associated equipment, while considering hose-model traffic. A similar approach has been presented for the pipe model, where the exact traffic matrix is assumed to be known. Owing to traffic uncertainty, however, it is difficult for network operators to have exact knowledge of the traffic matrix. This traffic uncertainty can be avoided by using the hose model, which specifies only the upper bounds of the egress/ingress traffic from/to a node. They introduce a mixed integer linear problem formulation that yields the optimal solution and a more practical and near optimal heuristic algorithm for large networks. The author's performance evaluation results show that it offers up to 50% power reduction.

Automated network management and configuration using Probabilistic Trans-Algorithmic Search

Online configuration of large-scale systems such as networks requires parameter optimization within a limited amount of time, especially when configuration is needed as a response to recover from a failure in the system. To quickly configure such systems in an online manner, we propose a Probabilistic Trans-Algorithmic Search (PTAS) framework which leverages multiple optimization search algorithms in an iterative manner. PTAS applies a search algorithm to determine how to best distribute available experiment budget among multiple optimization search algorithms. It allocates an experiment budget to each available search algorithm and observes its performance on the system-at-hand. PTAS then probabilistically reallocates the experiment budget for the next round proportional to each algorithm’s performance relative to the rest of the algorithms. This “roulette wheel” approach probabilistically favors the more successful algorithm in the next round. Following each round, the PTAS framework “transfers” the best result(s) among the individual algorithms, making our framework a trans-algorithmic one. PTAS thus aims to systematize how to “search for the best search” and hybridize a set of search algorithms to attain a better search. We use three individual search algorithms, i.e., Recursive Random Search (RRS) (Ye and Kalyanaraman, 2004), Simulated Annealing (SA) (Laarhoven and Aarts, 1987), and Genetic Algorithm (GA) (Goldberg, 1989), and compare PTAS against the performance of RRS, GA, and SA. We show the performance of PTAS on well-known benchmark objective functions including scenarios where the objective function changes in the middle of the optimization process. To illustrate applicability of our framework to automated network management, we apply PTAS on the problem of optimizing link weights of an intra-domain routing protocol on three different topologies obtained from the Rocketfuel dataset. We also apply PTAS on the problem of optimizing aggregate throughput of a wireless ad hoc network by tuning datarates of traffic sources. Our experiments show that PTAS successfully picks the best performing algorithm, RRS or GA, and allocates the time wisely. Further, our results show that PTAS’ performance is not transient and steadily improves as more time is available for search.

A flexible Quagga-based virtual network with FIB aggregation

The rapid increase in routers forwarding table size is raising serious concerns for ISPs. In particular, it exhausts the routers forwarding hardware capacity, leading to more frequent upgrades and higher cost. In this article, we present the development of a virtual network framework based on open source software that demonstrates how solutions to this impending problem can be implemented and studied. The system is capable of emulating an operational network environment with intradomain and inter-domain routing protocols as well as real-world Internet routing traffic. By adding performance monitoring and FIB aggregation capabilities to this system, we are able to evaluate the performance of FIB aggregation algorithms in a realistic network environment.

Efficient Inference of AS-Level Paths in the Internet

Routing protocols maintain connectivity of Internet routers and hosts and determine the path that a packet traverses. Inferring Internet paths is critical for evaluating the performance of Internet ap plications and services, such as cloud services and content delivery. Unlike intra-domain routing protocols, which typically use the shortest paths , inte-domain routing protocol apply local policies for selecting routes/paths and propagating routing information. These routing policies are typically constrained by contractual commercial agreements between ASes. It is well-known that routing policies can impact the AS path that an AS may select for delivering a packet. Thus, the ability to infer the AS-level paths is critical to evaluate the imp act of routing policies on the performance of Internet applications and services. In addition, inferring AS-level paths is also imp ortant for content providers, such as Google and Amazon, to determine routing policies to ensure small latency in delivering content. However, inferring AS-level paths is challenging. Internet path selection largely depends on routing policies, which in turn are determin ed independently by network administrators and are considered as confidential information. In this paper, we present thre e common routing policies in the Internet and formulate the problem of inferring routing policy conforming AS-level paths. We present efficient algorithms for inferring the Internet AS-level paths. The algorithms are proved to be optimal in terms of the ability of derive the policy-conforming AS-level paths. We further quantify the efficiency of these algorithms.

Performance Analysis and Evaluation of Hybrid Network using different Integrated Routing Protocols

The increasing demand of computer communication networks are growing rapidly day by day. With the growing need to distribute applications across multiple networks and the availability of high capacity, high-performance intermediate switching nodes, and networks, an efficient routing mechanism has become the core requirement. This research primarily focuses on the design and performance of Hybrid Network incorporating different intra-domain routing algorithms. The performance evaluation of different routing algorithms for the transmission of video- and voice-data streams over Hybrid network is demonstrated in this work.. This allows multiple Ethernet point-to-point links to be bundled into one logical full-duplex channel for Fast Ethernet (10BaseT, 100BaseT, or 1000BaseX). These applications require some QoS support such as guaranteed bandwidth, less delay, less jittering effect and low error rate. The QoS relies on a number of factors along with a suite of robust routing protocols that help to accomplish the task of moving datagram from source to destination with high bandwidth and low delay rate. An effective intra-domain network routing protocol may make distributed applications more efficient across multiple networks with the availability of high capacity and high-performance. A variety of intra-domain routing protocols such as Routing Information Protocol (RIP) and Open Shortest First Protocol (OSPF), Interior Gateway Protocol (IGRP) and Enhanced Interior Gateway Protocol (EIGRP) are available and widely used in designing such high capacity and high performance networks with optimum QoS. We evaluate the performance of these intra-domain routing protocols with IS-IS to recommend the optimum routing protocol to use to provide optimum QoS by means of OPNET Simulator TM. In this thesis work, the following objectives are considered and demonstrated.

Secure protection scheme for hierarchical OSPF network

As the most widely used autonomous intra-domain routing protocol for large-scale network,the security of Open Shortest Path First(OSPF) is not only about the normal running of autonomous intra-domain,but also closely related to inter-domain even the whole network.Based on asymmetric encryption algorithm,the traditional digital signature solution can realize the security validation of end-to-end;however,it ignores the issue of point-to-point.Additionally,the problem of storage and extra overhead also needs to be solved urgently.On the basis of symmetrical encryption algorithm,a new solution named HS-OSPF was put forward.HS-OSPF extended the original two-level hierarchical structure as well as designed a reasonable,efficient key distribution and management scheme.The result shows that the shortcomings of traditional solution are overcome,key storage and system overhead are reduced and real-time of security communication is improved.

Intra-domain traffic engineering with shortest path routing protocols

Throughout the last decade, extensive deployment of popular intra-domain routing protocols such as open shortest path first (OSPF) and intermediate system–intermediate system (IS-IS), has drawn an ever increasing attention to internet traffic engineering. This paper reviews optimization techniques that have been deployed for managing intra-domain routing in networks operated with shortest path routing protocols, and the state-of-the-art research that has been carried out in this direction.

BIGP- A New Single Protocol that can work as an IGP (Interior Gateway Protocol) as well as EGP (Exterior Gateway Protocol)

EGP and IGP are the key components of the present internet infrastructure. Routers in a domain forward IP packet within and between domains. Each domain uses an intra-domain routing protocol known as Interior Gateway Protocol (IGP) like IS-IS, OSPF, RIP etc to populate the routing tables of its routers. Routing information must also be exchanged between domains to ensure that a host in one domain can reach another host in remote domain. This role is performed by inter-domain routing protocol called Exterior Gateway Protocol (EGP). Basically EGP used these days is Border Gateway Protocol (BGP). Basic difference between the both is that BGP has smaller convergence as compared to the IGP’s. And IGP’s on the other hand have lesser scalability as compared to the BGP. So in this paper a proposal to create a new protocol is given which can act as an IGP when we consider inter-domain transfer of traffic and acts as BGP when we consider intra-domain transfer of traffic..

Performance Analysis of IEEE 802. 3 using IGRP and EIGRP Routing Protocols

With the growing need to distribute applications across multiple networks and the availability of high capacity, highperformance intermediate switching nodes and networks, an efficient routing mechanism has become the core requirement. This paper compares the performance of intra-domain routing protocols such as Enhanced Interior Gateway Protocol (EIGRP) and Interior Gateway Protocol (IGRP) of IEEE 802.3 LAN by evaluating various parameters including Network convergence time, End to End Delay, Delay Variation, Throughput, Utilization, Queuing Delay and IP Processing Delay. In addition to these metrics, we also compared the performance of video- and voice-data on the entire network under various constraints managed by routing protocols. Our simulation has been performed using the wellknown simulator OPNET.

Maximum Load Balancing with Optimized Link Metrics

Traffic engineering helps to use network resources more efficiently. Network operators use TE to obtain different objectives such as load balancing, congestion avoidance and average delay reduction. Plane IP routing protocols such as OSPF, a popular intradomain routing protocol, are believed to be insufficient for TE. OSPF is based on the shortest path algorithm in which link weights are usually static value without considering network load. They can be set using the inverse proportional bandwidth capacity or certain value. However, Optimization theory helps network researchers and operators to analyze the network behavior more precisely. It is not a practical approach can be implemented in traditional protocol .This paper proposes that to address the feasibility requirements, a weight set can be extracted from optimization problem use as a link metric in OSPF. We show the routes that selected in OSPF with these metric distribute the traffic more close to optimal situation than routes from OSPF with default metric.

Multicast Routing Modeling and Simulation Research on Multimedia Services

Multicast routing technology with its advantage of saving bandwidth, has received a great deal interest in QoS of multimedia network. PIM-SM is currently the preferred intra-domain multicast routing protocol. Based on OPNET simulation environment, the models of Real-time and Non-real-time multimedia services are respectively established with PIM-SM in wire network and in wireless network. By comparing unicast routing with PIM-SM on delay, jitter and loss ratio, the results show the advantage of multicast routing on improving the different multimedia services.

Self-healing routing: failure, modeling and analysis

Network failures occur frequently, and self-healing ability of existing routing protocols cannot guarantee fast route convergence under these failures without impacting packet forwarding. During routing convergence, network routes may be incorrect and even routing black holes and loops occur, which will result in extensive packet loss and thus influence network performance. To solve this problem, several improved routing solutions have been proposed. In this paper, we propose the concept and model of self-healing routing and analyze the key problems in current intra-domain and inter-domain self-healing routing protocols after briefly reviewing the characteristics of network failures. We classify the different self-healing solutions into two categories based on their design principles: routing restoration and routing protection, and systematically analyze these different typical solutions. Finally, we discuss several key issues in self-healing routing and propose a hybrid protection and restoration based routing scheme.

Applications of meta-heuristics to traffic engineering in IP networks

Intra-domain routing protocols are based on shortest path first (SPF) routing, where shortest paths are calculated between each pair of nodes (routers) using pre-assigned link weights, also referred to as link metric. These link weights can be modified by network administrators in accordance with the routing policies of the network operator. The operator's objective is usually to minimize traffic congestion or minimize total routing cost subject to the traffic demands and the protocol constraints. However, determining a link weights combination that best suits the network operator's requirements is a difficult task. This paper provides a survey of meta-heuristic approaches to traffic engineering, focusing on local search approaches and extensions to the basic problem taking into account changing demands and robustness issues with respect to network failures.