Link State Advertisements Research Articles

Performance Analysis on Destination Driven Multicast Routing Algorithm

The internet’s architecture today has a problem in routing information depending on what the receiver is interested in without knowing the sender and receiver addresses. As a result, the Publish-Subscribe paradigm was developed. In this network, we build and use in the design, implementation, and evaluation of Publish-Subscribe network via destination driven multicast routing algorithm for selecting the shortest path in the network. Basically, the networks have Router to perform routing mechanism, the publisher is the producer of information, and the subscriber is the consumer of information with their own deferent type of module for facilitating their function. Every connection in the network is bidirectional way of communication (an undirected graph) with random seed available in the network. Each Router has topology management module for creating a picture of the networks and computing the available path. It informs to the forwarder in order to send the information of network for intended receiver. Record table module used for recording of the network information comes from the subscriber or the publisher via link state advertisement then it informs to the topology manager. In this network, the receiver and sender don’t expect to be active at the same time, don’t know each other’s addresses, and don’t use any blocking mechanisms or client send requests and server replay responses. The Publish-Subscribe network is first developed and designed enough, after which it is implemented and evaluated using the destination driven multicast routing algorithm (DDMC) to pick the shortest path in the network and active match published information. The proposed work evaluated via total bit (produced 1,000,000 bit per second), and throughput was 83.33%.

Modeling and verifying NLSR protocol of NDN for CPS using UPPAAL

AbstractNamed Data Networking (NDN) is a new promising architecture of information‐centric networking, which supports multicast of data and adopts the publish/subscribe model in the network. The features of NDN, including name‐based data and in‐network caching, make it a promising Internet architecture for cyber‐physical systems (CPSs). Named‐Data Link State Routing (NLSR) protocol is the routing protocol for NDN, which is designed to disseminate link state advertisements (LSAs) to both build a network topology and distribute all the name prefixes to every node in the network. In this paper, we make the very first attempt to formally model and verify some fundamental properties of the NLSR protocol using model checker UPPAAL. We validate the NLSR protocol modeled into timed automata with simulator in UPPAAL. We verify our model with four fundamental properties (termination, reachability of Sync Interest, reachability of Sync Data, and digest synchronization). The first synchronization problem is found in a scenario with two nodes topology. We give the improved model that owns a valid result in digest synchronization verification. To capture more problems, we make the model to support the simulation of temporary network crash. The second synchronization problem is also exposed in two comparative scenarios. We also propose a mechanism implemented in our model, which has a valid result in digest synchronization verification. We hope that our study and preliminary results would help enhancing the adaptability and robustness of NLSR protocol.

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.

A Fast Failure Recovery Scheme for Fibbing Networks

Fibbing is a network technology that can provide flexible routing in IP networks. In a Fibbing network, the network controller cleverly broadcasts link state advertisements (LSAs) of the open shortest path first (OSPF) protocol to generate fake nodes. These fake nodes enlarge the physical topology and turn the network into a virtual network. Although the routers still follow the shortest path routing in the virtual network, the flows are steered along the desired paths in the physical network. Even though a Fibbing network is capable of flexible routing, methods to achieve fast failure recovery have not been well studied. Conventionally, an IP network running the OSPF protocol takes a long time to converge after a failure occurs. The IETF proposed loop-free alternate (LFA) IP fast reroute technology to speed up failovers. However, we discovered that LFA technology is incompatible with Fibbing. The direct application of LFA technology in a Fibbing network will generate traffic loops. In this work, we propose a novel monitoring-cycle-based approach for fast failure recovery. By examining the liveness of the monitoring cycles, the system controller can promptly identify a failed link or a failed node and then perform traffic rerouting. Due to the properties of IP packet forwarding, a monitoring cycle in an IP network must be a simple cycle. We prove that any network that is both 2-vertex- and 3-edge-connected (2V3E) possesses a set of monitoring cycles that can be used to detect and identify any single link failure. In conjunction with the status pattern provided by the monitoring cycles, any single node failure can be detected by introducing an additional probe message. We propose an algorithm to obtain these monitoring cycles and design and implement a Fibbing controller for the network. To evaluate the performance of the proposed approach, we construct a physical testbed and an emulation network. The experimental results show that the proposed system works stably and can achieve a fast failover within a short period of time.

Proactive multipath routing with a predictive mechanism in software‐defined networks

SummaryWith the growth of network traffic volume, link congestion cannot be avoided efficiently with conventional routing protocols. By utilizing the single shortest‐path routing algorithm from link state advertisement information, standard routing protocols lack of global awareness and are difficult to be modified in a traditional network environment. Recently, software‐defined network (SDN) provided innovative architecture for researchers to program their own network protocols. With SDN, we can divert heavy traffic to multiple paths in order to resolve link congestion. Furthermore, certain network traffics come in periodic fashion such as peak hours at working days so that we can leverage forecasting for resource management to improve its performance. In this paper, we propose a proactive multipath routing with a predictive mechanism (PMRP) to achieve high‐performance congestion resolution. PMRP has two main concepts: (a) a proactive mechanism where PMRP deploys M/M/1 queue and traffic statistics to simulate weighted delay for possible combinations of multipaths placement of all subnet pairs, and leverage genetic algorithm for accelerating selection of optimized solution, and (b) a predictive mechanism whereby PMRP uses exponential smoothing for demand traffic volumes and variance predictions. Experimental results show a 49% reduction in average delay as compared with single shortest routing, and a 16% reduction in average delay compared with utilization & topology‐aware multipath routing (UTAMP). With the predictive mechanism, PMRP can decrease an additional 20% average delay. Furthermore, PMRP reduces 93% of flow table usage on average as compared with UTAMP.

Study on OSPF Algebraic Formal Modelling Using ACP

OSPF is a commonly used link state routing protocol in order to interconnect network devices inside an Autonomous System. This paper focuses on achieving a detailed modelling for OSPF by performing manual algebraic derivations according to Algebra of Communicating Processes (ACP) axioms. The aim of this detailed model is to get a realistic approach of OSPF dynamics by applying the timers involved and by describing the full Link State Advertisement (LSA) exchange process.DOI: http://dx.doi.org/10.5755/j01.eie.24.4.21484

Passive Incidental Alertness—Based Link Visualization for Secure Data Transmission in Manet

ABSTRACTConnectivity visualization plays the major role in the transmission of status information of network parameters to the control center in order to assure security. The high mobility of nodes and the topological changes in Mobile Ad-hoc Network (MANET) breaks the connection between the nodes. The random movement of the nodes and the generation of active/passive attacks interrupts the communication link adversely that leads to the data loss, confidentiality, and integrity. This article focuses on the effective link preservation by using the periodical update information about the node's position, location, energy, velocity, and the range. This article investigates the status of connection based on the generation of Passive Incidental Alertness (PIA) to the systems. The transmission of Incidental Alertness (IA) report among the nodes through the Link State Advertisement (LSA) mechanism provide the abnormal distance and energy level information to stop the data transmission. The instant alertness report regarding the energy degradation of nodes prevents the unnecessary message transfer between them that leads to less memory/time consumption. Besides, the Elliptic Curve Cryptography (ECC) application to the MANET environment based on the region and the random number of key generation improves the data confidentiality and authentication level. The comparative analysis of proposed Passive Incidental Alertness Secure Data (PIASD) transmission model with the existing link state networks regarding memory, time and energy assure the reliable delivery of information with preserved links.

A Distributed Green Networking Approach for Data Center Networks

Green networking for data center network is becoming a critical issue due to the rapid growth of energy consumption. Most of existing green networking approaches are in a centralized-control manner, which have a scalability issue. Existing distributed approaches are scalable, but consume too much network resource, including computing and network bandwidth. In this letter, we propose a distributed green networking approach for data center network, called distributed green networking approach (DGNA). In our approach, we propose an energy-efficient flow scheduling mechanism, which requires less computing and much less network bandwidth compared with traditional approaches. In DGNA, two shut-off algorithms are proposed to shut-off links with different efficiency and complexity. Simulation shows that DGNA sends less than 0.9% of link state advertisements compared with a traditional approach.

Greenness Link State Advertisement Extension for WDM Networks

This paper introduces a new Link State Advertisement (LSA) for a new link characteristic to be used with Constrained Open Shortest Path (CSPF) routing mechanism. The new LSA is to be exploited for building a topology database based on realistic energy and Co2 emission data about each link and the sections of the network. The energy-aware CSPF mechanism can use this topology database to incorporate energy and emission information in routing data traffic form greener sections of network.

Energy-Efficient Transmissions for Remote Wireless Sensor Networks: An Integrated HAP/Satellite Architecture for Emergency Scenarios.

A typical application scenario of remote wireless sensor networks (WSNs) is identified as an emergency scenario. One of the greatest design challenges for communications in emergency scenarios is energy-efficient transmission, due to scarce electrical energy in large-scale natural and man-made disasters. Integrated high altitude platform (HAP)/satellite networks are expected to optimally meet emergency communication requirements. In this paper, a novel integrated HAP/satellite (IHS) architecture is proposed, and three segments of the architecture are investigated in detail. The concept of link-state advertisement (LSA) is designed in a slow flat Rician fading channel. The LSA is received and processed by the terminal to estimate the link state information, which can significantly reduce the energy consumption at the terminal end. Furthermore, the transmission power requirements of the HAPs and terminals are derived using the gradient descent and differential equation methods. The energy consumption is modeled at both the source and system level. An innovative and adaptive algorithm is given for the energy-efficient path selection. The simulation results validate the effectiveness of the proposed adaptive algorithm. It is shown that the proposed adaptive algorithm can significantly improve energy efficiency when combined with the LSA and the energy consumption estimation.

Real Time Traffic Splitting and Efficient Flooding Mechanism in LSRP

From last many years traffic in internet is increasing very rapidly. But as internet in growing up we required to maintain quality and have to increase the efficiency of network. Also we should concentrate on efficient mechanism of flooding, load balancing & resource utilization. In today’s internet world mostly Link state routing protocols like 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 we introduce a new method called Real time traffic splitting & efficient flooding mechanism in network with the help of OSPF. We will reduce the time required to compute the weight on link and find the best links to forward the packet within short time. The concept is to first minimize link state advertisement packets & 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. We can increase the performance of network & achieve optimal traffic engineering. As compare with the OSPF packet forwarding mechanism is same which is destination based & hop by hop forwarding just difference is in splitting mechanism.

An IPv6 Based QoS Unicast Routing Mechanism

IPv6 is the core protocol of Future Internet. Thus, IPv6 based QoS (Quality of Service) routing mechanisms need to be developed to support diverse QoS requirements of new network applications. In this paper, an IPv6 based QoS unicast routing mechanism is proposed based on OSPFv3 and BGP4 +. By introducing QoS state message and extending the link state database and link state advertisement, the collection, storage and release of intra-domain QoS information are realized. By introducing NLRI (Network Layer Reachability Information) which supports QoS, the release and revocation of inter-domain QoS routing information are realized. The mechanism not only provides QoS support, but also is compatible with the existing routing protocols. It can be quickly and effectively deployed in networks. A prototype implementation of the proposed mechanism is completed, which is tested under a video conference application over the CERNET2 topology. The results indicate that it is feasible and effective with good performance.

링크상태 라우팅 프로토콜의 효율적인 플러딩

본 논문에서는 링크상태 라우팅 프로토콜을 위한효율적인 LSA(Link State Advertisements) 플러딩(flooding) 방식을 제안한다. 링크상태(Link State) 라우팅 프로토콜은 유선 환경에서 널리 사용되고 있는 프로토콜로서, 노드의 링크 상태가 변경이 된 경우에 네트워크의 모든 이웃 노드에게 LSA를 플러딩 한다. 유선 환경과 다르게 무선 환경에서는 링크의 상태 변화가 빈번하게 발생되기 때문에 LSA의 오버헤드가 문제로 발생하게 된다. 본 논문에서는 무선 환경에서 사용 가능한 효율적인 LSA 플러딩 방식을 제안한다. In this paper we propose an efficient algorithm for LSA(Link State Advertisements) flooding. Link state routing protocols have been widely adopted in wired networks. When link state change occurs, a LSA is flooded into the whole network. The overhead of LSA flooding may be a big problem in wireless networks because their link states can be changed frequently. We propose an efficient flooding method that optimizes the flooding processes in wireless networks.

Design of IP tunneling for OSPF network to reduce advertising delay

Abstract: An IP tunneling design scheme to reduce advertising delay inopen shortest path first (OSPF) networks, in which the link load is requiredfor traffic maintenance, is proposed. A controller and nodes are consisted in anetwork. A node sends an OSPF traffic engineering (OSPF-TE) advertise-ment when either link load or topology is changed. The controller determinesand adjusts the routes in the network to avoid traffic congestion. Thecontroller may experience delay in receiving advertisements due to OSPFforwarding delay. Therefore, route adjustment may be delayed. In theproposed scheme, an IP tunneling technique is used instead of the OSPFmechanism.Keywords: network management, IP networks, open shortest path firsttraffic engineer (OSPF-TE), IP tunnelingClassification: Network Management/OperationReferences [1] E. Oki and A. Iwaki, “Load-balanced IP routing scheme based on shortest paths inhose model,” IEEE Trans. Commun., vol. 58, no. 7, pp. 2088–2096, Jul. 2010.DOI:10.1109/TCOMM.2010.07.090219[2] D. Katz et al., “Traffic Engineering (TE) Extensions to OSPF Version 2,” RFC3630, Sep. 2003.[3] H. M. Alnuweiri, L. Y. K. Wong, and T. Al-Khasib, “Performance of new link stateadvertisement mechanisms in routing protocols with traffic engineering exten-sions,” IEEE Commun. Mag., vol. 42, no. 5, pp. 151–162, 2004. DOI:10.1109/MCOM.2004.1299361[4] Y. Koizumi, T. Miyamura, S. Arakawa, E. Oki, K. Shiomoto, and M. Murata,“Adaptive virtual network topology control based on attractor selection,” IEEE/OSA J. Light. Tech., vol. 28, no. 11, pp. 1720–1731, Jun. 2010. DOI:10.1109/JLT.2010.2048412[5] Y. Lee et al., “Path Computation Element Communication Protocol (PCEP)requirements and protocol extensions in support of global concurrent optimization,”RFC 5557, Jul. 2009.[6] C. Perkins, “IP encapsulation within IP,” RFC 2003, Oct. 1996.[7] “What is propagation delay? (Ethernet Physical Layer)”, Ethernet FAQ, http://stason.org/TULARC/networking/lans-ethernet/3-11-What-is-propagation-delay-Ethernet-Physical-Layer.html, Oct. 21. 2010.

Achieving Reliability in Link State Protocol using Efficient Flooding and Traffic Splitting

To find out the shortest path from source to destination, Link State Routing Protocol (LSRP) uses the Open shortest path first algorithm, in OSPF if there is change in network topology, the LSRP generates the Link State Advertisement (LSA) packets. This LSA packet is send to every neighbor node except from which it accept. This mechanism is called the Flooding mechanism , due to this flooding mechanism all the node’s will have the same database. If there are N nodes in the network then there is N (N-1) LSA packets are required for database synchronization. In this proposed System, it just not tied to reduce the number of LSA packets flooded into the network by constructing the minimal spanning tree but also it uses the traffic splitting mechanism to send the data. Also to achieve the stability in network it add the extra flooding link at the node, who have the degree of one. So this proposed method , minimize the LSA Overhead.

LSC2: An extended link state protocol with centralized control

Current link state routing is based on routing decisions made through distributed interactions among routers. Link state is disseminated by means of flooding, which possesses a few limitations, such as excessive message overhead and network-wide computation. Thus, we propose LSC2, an extended link state routing protocol with centralized control, in this paper to address this problem. In LSC2, link state advertisements (LSAs) are communicated between a centralized element (CE) and a forwarding engine (FE) rather than traditional flooding. Multiple CEs form a separate control network as a representation of the control plane. Through this control network, LSAs are disseminated to FEs in a determinate manner. We also propose a signaling protocol for independent path convergence in the control network, as well as a routing control algorithm to prevent unnecessary routing updates in the forwarding network. We implement a prototype LSC2 and evaluate its performance. Our experiments show that with the use of real topologies, LSC2 can accelerate network convergence and reduce message overhead compared with OSPF. Moreover, LSC2 is robust because having multiple CEs can prevent the occurrence of a single point of failure. LSC2 also scales well with network size by adding additional CEs to share in the processing load.

Link-state Advertisement Based Source Routing Protocol for MANET with Unidirectional Links

Link-state Advertisement Based Source Routing Protocol for MANET with Unidirectional Links

Unidirectional link-state advertisement based on power control for MANET

Link states are studied in ad hoc network. The characters of unidirectional links are discussed. Unidirectional link-state advertisement based on power control mechanism (ULAPC) for mobile ad hoc networks (MANET) is designed. ULAPC is able to advertise unidirectional link-state to relational nodes. And it may offer help for process of routing discovery in ad hoc network. Based on ULAPC, the routing method solving the problem of unidirectional link is described in ad hoc network. Simulation results show the performance of ULAPC is better than the traditional routing protocols in many aspects.

OSPF failure reconvergence through SRG inference and prediction of link state advertisements

We demonstrate machine learning augmented Open Shortest Path First (OSPF) routing which infers Shared Risk Groups (SRG) from link failure history. For an initial link failure matching an SRG, it predicts subsequent link state advertisements corresponding with that SRG, improving convergence and recovery times during multiple network failures.

Intra-domain IP traceback using OSPF

Denial of service (DoS) attacks are a serious threat to the appropriate operation of services within network domains. In this paper, we propose a system called OsTraS (OSPF-based Traceback System) that helps network operators to deal with this threat by creating an overlay network for intra-domain IP traceback. The main contribution of our proposal with respect to previous work is its ability to provide partial and progressive deployment of the traceback system throughout a monitored network domain. The OsTraS system builds its overlay network using the OSPF routing protocol through the definition of an Opaque LSA (Link State Advertisement) specially conceived for this purpose. We investigate and evaluate the performance of partial and progressive deployment of the proposed system, showing its suitability even for large network domains.