Distributed Route Computation and Provisioning in Shared Mesh Optical Networks

Wavelength Division Multiplexed (WDM) networks that route optical connections using intelligent optical cross-connects (OXCs) is firmly established as the core constituent of next generation networks. Rapid failure recovery is fundamental to building reliable transport networks. Mesh restoration promises cost effective failure recovery compared with legacy ring networks, and is now seeing large-scale deployment. Many carriers are migrating away from SONET ring restoration for their core transport networks and replacing it with mesh restoration through “intelligent” O-E-O cross-connects (XC). The mesh restoration is typically provided via two fiber-disjoint paths: a service path and a restoration path. this scheme can restore any single link failure or node failure. And by used shared mesh restoration, although every service route is assigned a restoration route, no dedicated capacity needs to be reserved for the restoration route, resulting in capacity savings. The restoration approach we propose is Centralized Pre-computing, Local Distributed Optimization, and Shared Disjoint-backup Path. This approach combines the merits of centralized and distributed solutions. It avoids the scalability issues of centralized solutions by using a distributed control plane for disjoint service path computation and restoration path provisioning. Moreover, if the service routes of two demands are disjoint, no single failure will affect both demands simultaneously. This means that the restoration routes of these two demands can share link capacities, because these two routes will not be activated at the same time. So we can say, this restoration capacity sharing approach achieves low restoration capacity and fast restoration speed, while requiring few control plane changes.

Recently, the Internet relies on a core suite of IP routing protocols. This paper examines the characteristics of important routing protocols in a performance network. Any router in the network needs help with routing protocols. Those deferred types of routing protocols used in networks such as Interior Gateway Routing Protocol (IGRP), Open Shortest Path First (OSPF), Enhanced Interior Gateway Routing Protocol (EIGRP), and Routing Information Protocol (RIP). All transmitted data through the internet between the source and the destination need to be routed using one of the routing protocols. Choosing the appropriate routing protocol by scanning protocols depends on the type of network applications and a number of parameters (i.e. traffic sent and traffic received). In addition, this paper presents advances in routing technology that highlight the difference between RIP, OSPF, IGRP and EIGRP in terms of metrics and other technical aspects. In this survey, networks rely on different types of routing protocols and studies the packets end to end delay, convergence time on flapping links and the average point to point throughput (bit/sec).

With the advent of optical mesh networks, certain new protection schemes have been defined. This encompasses both local span and end-to-end path protection. But the implementations of these protection schemes have so far been based on proprietary mechanisms developed by each vendor. This has made it virtually impractical to construct a heterogeneous network with interoperable mesh protection schemes. Also, while the notion of a standard IP-centric control plane for optical networks based on Generalized Multi-Protocol Label Switching (GMPLS) has gained wide acceptance, the work in this area has so far focused exclusively on connection provisioning rather than restoration. This paper defines standard, IP-based signaling protocols for restoration in optical mesh networks. These protocols focus on a new local span protection mode and end-to-end shared protection. The main requirements on these protocols are simplicity and speed. The signaling mechanisms described in this paper are complimentary to the GMPLS provisioning mechanisms.

OSPF (Open Shortest Path First) and EIGRP (Enhanced Interior Gateway Protocol) are routing protocol which is a member of IGP (Interior Gateway Protocol). OSPF and EIGRP will distribute routing information between routers in the same autonomous system. This research will find how routing protocol works and compare those dynamic routing protocols in IPv4 and IPv6 network. This research will simulate some network topology and shows that EIGRP are much better than OSPF in many different topology.

The Open Shortest Path First (OSPF) routing protocol for IP networks performs inefficiently when operated over multihop, broadcast-based radio channels such as IEEE 802.11 in IBSS mode. These types of networks are known more generally as mobile ad-hoc networks (MANET). The Internet Engineering Task Force (IETF) OSPF working group has been considering extensions to OSPF to enhance performance over such channels, and multiple OSPF MANET proposed extensions are advancing to experimental status. Although OSPF MANET performs more efficiently within the MANET itself, it has the side effect of propagating large numbers of routing updates throughout the rest of the OSPF flooding domain. In this paper, we examine OSPF MANET's interaction with attached non-MANET networks, and explore various techniques for reducing the overhead, such as static and dynamic route summarization, route redistribution, cross-layer abstraction techniques, and tunneling approaches between MANET Border Routers (MBR)s. We use a hybrid testbed/emulated network to quantitatively explore the tradeoffs between different approaches.

Routing is an important process in computer networks, which involves selecting a path for packet data. The routing mechanism is governed by protocols at layer three of the OSI model or layer two of the TCP/IP model. Routing can be static or dynamic, with dynamic routing algorithms automatically determining the best path in the network. One commonly used dynamic routing protocol is Open Shortest Path First (OSPF), which automatically selects the optimal route for data packets based on received network topology information. The need for more advanced and scalable routing solutions led to the development of Multi-Protocol Label Switching (MPLS), introducing the concept of label switching for faster and more efficient data forwarding. This research aims to analyze the performance of OSPF and OSPF MPLS routing scenarios regarding TCP and UDP services. Through evaluation of Quality of Service (QoS) parameters, including throughput, packet loss, delay, and jitter. This study simulates the network using GNS3 software, with TCP and UDP services transmitted for durations of 15, 30, and 60 seconds. The results showed performance for both scenarios with an average index value of 3.75, indicating "good" network performance according to TIPHON standards across all measurement sessions. Although MPLS OSPF showed slightly lower throughput compared to non-MPLS OSPF, both scenarios showed very low packet loss, low delay, and stable jitter. The evaluation also highlights that the use of OSPF MPLS for UDP services reduces the time delay. Both non-MPLS OSPF and MPLS OSPF effectively support TCP and UDP services, with MPLS OSPF showing advantages in certain QoS parameters, especially for UDP services.

Enhanced Adaptive SLA-aware Algorithms for Provisioning Shared Mesh Optical Networks

CHAPTER 5 - Routing Protocols: RIP, RIPv2, IGRP, EIGRP, OSPF

UNUD GDLN building located in UNUD Sudirman campus acts as an information and communication technology service center as an internet access service provider, radio broadcast and online learning. The UNUD Campus network currently uses a static hybrid routing protocol, where the static routing protocol has the disadvantage that the network administrator must always reconfigure the network if there is a topology change. The Open Shortest Path First (OSPF) dynamic routing protocol can be used as a solution to overcome the weaknesses of static routing protocols because it is more suitable for larger networks and has the advantage of automatically determining the best route. This research aims to analyze the application of OSPF routing protocol in UNUD Denpasar Campus with GNS3 simulation. This research uses Quality of Service (QoS) parameters to analyze network performance, and test scenarios by PING with large data transmission that imitates YouTube video streaming. The results showed that OSPF dynamic routing protocol has better performance and has met the TIPHON standard with very good results for packet loss, throughput, and delay parameters and good results for jitter parameters. Tests on static routing protocol simulations and OSPF routing protocols are carried out by comparing the transmission process based on the resolution on YouTube video streaming imitation, starting with 360p, 480p, 720p and 1080p resolutions. Based on the results of the study, it can be concluded that OSPF routing is more suitable and produces better parameter values when transmitting streaming video with a resolution of 480p, 720p and 1080p, while the transmission of streaming video with a resolution of 360p is more suitable for static routing which is more suitable for transmission with lower resolutions.

Dynamic adaptive routing is required to improve the survivability of a packet radio network. A protocol called Open Shortest Path First (OSPF) Version 2 has been selected to meet the requirement. The network connectivity status, which often changes rapidly in a highly mobile tactical environment (due to jamming and station outages/additions), must be updated dynamically and automatically by the protocol to maintain reliable network service. With fast updates, the topology database will be more up-to-date and routing decisions will be more optimum. However high update rate will consume more channel bandwidth and will have adverse impact on user traffic. The objective is to optimize the OSPF protocol such that the system will maintain acceptable performance under anticipated traffic loading and network scenarios. The timing parameters associated with the update process will be varied to determine the optimum settings. The updates are transmitted in OSPF packets called link state updates (LSUs). The LSU packets will compete with user traffic on channel utilization. To reduce the impact on user traffic, the OSPF protocol parameters will be optimized to reduce the overhead traffic. A detailed simulation model has been developed for this effort. We describe the use of the robust design method in conjunction with the simulation model to optimize the protocol for dynamic routing. The main advantage of the robust design method is to provide a disciplined approach for experimentation (i.e., with no need to run all possible combinations of the experiment) that is needed to determine the most influential control factors.

Open Shortest Path First (OSPF) is one of the most widely used intra-domain routing protocol. It is well known that OSPF protocol does not provide flexibility in terms of packet forwarding to achieve any network optimization objective. Because of the high cost of network assets and commercial and competitive nature of Internet service provisioning, service providers are interested in performance optimization of their networks. This helps in reducing congestion hotspots and improving resource utilization across the network, which, in turn, results in an increased revenue collection. One way of achieving this is through Traffic Engineering. Currently traffic engineering is mostly done by using MPLS. But legacy networks running OSPF would need to be upgraded to MPLS. To achieve better resource utilization without upgrading OSPF network to MPLS is a challenge. In this paper we present a simple but effective algorithm, called Smart OSPF (S-OSPF) to provide traffic engineering solution in an OSPF based best effort network. We formulate an optimization problem based on the traffic demand to minimize the maximum link utilization in the network. Routing of the traffic demand is achieved using OSPF. We have simulated S-OSPF on real networks of two service providers. Simulation results show that S- OSPF based traffic engineering solution performance very closely follows the optimal solution.

The routing protocol transport the best connection, creating during message in the network. The router can work with the help of routing protocols. The various routing protocols can be present, but the most famous routing protocols are Routing Information protocol (RIP) and the Open Shortest Path First (OSPF). Smart Open Shortest Path First (S-OSPF), which offers the extended representations for conventional OSPF gives less congestion ratio by allocating traffic. Multicast Open Shortest Path First (MOSPF), it offers the facility to forward multicast datagram from one network to another. In this paper, we are defining the two protocols and the related worked on them. In this each link provides the autonomous system to create the shortest path to makes and creates the destination tables. Both logical and hardware address play the important roles, responsible for getting packet and forward through a correct destination host.

The current standard for intra-domain network routing, Open Shortest Path First (OSPF), suffers from a number of problems-the tunable parameters (the weights) are hard to optimize, the chosen paths are not robust under changes in traffic or network state, and some network links are over-used at the expense of others. We present prototypical scenarios that illustrate these problems. Then we propose several variants of a protocol to eliminate or alleviate them and demonstrate the improvements in performance under those scenarios. We also prove that these protocols never perform significantly worse than OSPF and show that for at least a limited class of network topologies, it is possible to find efficiently the optimal weight settings. Some of the problems with OSPF are well known; indeed, there are several routing protocols that perform better than OSPF in routing quality (i.e., in terms of congestion, delay, etc.). OSPF’s popularity persists in part because of its efficiency with respect to several resource bounds. In contrast, many competing protocols that provide routing superior to OSPF are computationally prohibitive. Motivated by this consideration, we designed our protocols not only to achieve better routing quality than OSPF, but also to use resources in amount comparable with OSPF with respect to offline broadcast communication, size of and time to compute routing tables, packet delivery latency, and packet header structure and size.

OSPF (open shortest path first) is a widely used intra-domain routing protocol in IP networks. The performance of OSPF implementations is impacted by internal packet processing time. In this paper, we study OSPF scalability and propose an evaluation method based on white-box measurements. Compared with black-box OSPF measurement, our method can be used to design a network, because the implementation performance and scalability limitation can be calculated based on the parameters measured.

The Internet generation infrastructure is growing and moving towards a consistency model of high-speed nodes interconnected by optical core networks. Therefore, the interaction between IP and optical network layers, specifically, the routing and signalling aspects, are maturing and they can lead to enhance the services and network performance. At the same time, a consensus has emerged in the industry on utilizing IP-based protocols for the optical control plane. This paper defines a new technique for IP over Optical networks (interacting between bottom layers), considering both the IP-based control plane for optical networks as well as IP-optical network interactions (together referred to as “IP over optical networks”). In this paper, a new technique is proposed that reduces recovery time by making an interoperation between the data link layer (layer 2) with the network layer (layer 3). The proposed technique enables layer 2 with layer 3 to make a hybrid mechanism that improves the recovery time in the network through two cases (1st-Detection and 2nd-Rerouting). The technique involves detecting failure in less time through layer 2 and rerouting traffic through an alternative path between source and destination by using a new algorithm in layer 3 to deliver data packets without the need to wait for the routing protocol to update the network topology and compute the routing table. In case of the network recovery, layer 2 has demonstrated its capability to detect failure extremely quickly shown through the immediate detection of the loss of signals for the link or node. The recovery mechanism, i.e., the rerouting mechanism, which leads the node, switches the data packets through an adjacent node to its destination via the life node. The latter is created by the proposed mechanism before the occurrence of the failure. The aim of this mechanism is to avoid loss of packets, improve QoS and improve recovery time as we have shown in the results shown below.