Showing papers on "Equal-cost multi-path routing published in 2019"

Segment Routing with the MPLS Data Plane

Abstract: Segment Routing (SR) leverages the source routing paradigm. A node steers a packet through a controlled set of instructions, called segments, by prepending the packet with an SR header. In the MPLS dataplane, the SR header is instantiated through a label stack. This document specifies the forwarding behavior to allow instantiating SR over the MPLS dataplane.

OSPF Extensions for Segment Routing

Abstract: Segment Routing (SR) allows a flexible definition of end-to-end paths within IGP topologies by encoding paths as sequences of topological sub-paths, called "segments". These segments are advertised by the link-state routing protocols (IS-IS and OSPF). This draft describes the OSPFv3 extensions required for Segment Routing with MPLS data plane.

IS-IS Extensions for Segment Routing

Abstract: Segment Routing (SR) allows for a flexible definition of end-to-end paths within IGP topologies by encoding paths as sequences of topological sub-paths, called "segments". These segments are advertised by the link-state routing protocols (IS-IS and OSPF). This draft describes the necessary IS-IS extensions that need to be introduced for Segment Routing operating on an MPLS data-plane.

Load balancing routing with queue overflow prediction for WSNs

Abstract: The ease of deployment of Wireless Sensor Networks (WSNs) makes them very popular and useful for data collection applications. Nodes often use multihop communication to transmit data to a collector node. The next hop selection in order to reach the final destination is done following a routing policy based on a routing metric. The routing metric value is exchanged via control messages. Control messages transmission frequency can reduce the network bandwidth and affect data transmission. Some approaches like trickle algorithm have been proposed to optimize the network control messages transmission. In this paper, we propose a collaborative load balancing algorithm (CoLBA) with a prediction approach to reduce network overhead. CoLBA is a queuing delay based routing protocol that avoids packet queue overflow and uses a prediction approach to optimize control messages transmission. Simulation results on Cooja simulator show that CoLBA outperforms other existing protocols in terms of delivery ratio and queue overflow while maintaining a similar end-to-end delay.

BGP-LS extensions for Segment Routing BGP Egress Peer Engineering

Abstract: Segment Routing (SR) leverages source routing A node steers a packet through a controlled set of instructions, called segments, by prepending the packet with an SR header A segment can represent any instruction, topological or service-based SR segments allow steering a flow through any topological path and service chain while maintaining per-flow state only at the ingress node of the SR domain This document describes an extension to BGP Link-State (BGP-LS) for advertisement of BGP Peering Segments along with their BGP peering node information so that efficient BGP Egress Peer Engineering (EPE) policies and strategies can be computed based on Segment Routing

OSPFv3 Extensions for SRv6

Abstract: Segment Routing (SR) allows for a flexible definition of end-to-end paths by encoding paths as sequences of topological sub-paths, called "segments". Segment routing architecture can be implemented over an MPLS data plane as well as an IPv6 data plane. This draft describes the OSPFv3 extensions required to support Segment Routing over an IPv6 data plane (SRv6).

Packet-Optical Integration in Segment Routing

Abstract: This document illustrates a way to integrate a new class of nodes and links in segment routing to represent transport/optical networks in an opaque way into the segment routing domain. An instance of this class would be optical networks that are typically transport centric by having very few devices with the capability to process packets. In the IP centric network, this will help in defining a common control protocol for packet optical integration that will include optical paths as 'transport segments' or sub-paths as an augmentation to packet paths. The transport segment option also defines a general mechanism to allow for future extensibility of segment routing into non-packet domains.

Novel routing protocol scheme for real-time applications in mobile Ad Hoc networks

Abstract: In mobile Ad Hoc networks (MANETs), flooding-based route discovery is usually preferred in order to set up the route with reliability between transmission pair. However, this approach may cause a serious contention in transmission between adjacent nodes and a considerable amount of control packets. In addition, most of Ad Hoc routing protocols establish the route with minimum hop count. Consequently, the performance of Ad Hoc routing protocol is considerably affected by link (or route) duration since the network comprises the nodes with unrestricted mobility and constrained range in transmission. This paper proposes novel routing protocol that aims to (1) minimize routing overhead in route discovery procedure, and (2) guarantee a reliable and fast packet delivery between source and destination, especially in providing real-time applications over MANETs. To achieve this objective, we introduce relay region (RR) within the transmission range of nodes in order to select optimal next relaying nodes for supporting specific application requirements in route discovery procedure. The RR is defined by the limited distance progress in transmission to next relaying node in order to maintain the established route for an arbitrary length of time (i.e., route duration) while meeting packet delivery reliability and delay constraints. In performance evaluation, the simulation results showed that the proposed scheme can significantly improve the performance in comparison with the previous routing algorithms in terms of packet delivery ratio and packet delivery latency, reducing transmission redundancy in route discovery procedure.

PCEP Extensions for Segment Routing leveraging the IPv6 data plane

Abstract: The Source Packet Routing in Networking (SPRING) architecture describes how Segment Routing (SR) can be used to steer packets through an IPv6 or MPLS network using the source routing paradigm. Segment Routing (SR) enables any head-end node to select any path without relying on a hop-by-hop signaling technique (e.g., LDP or RSVP-TE). It depends only on "segments" that are advertised by Link- State IGPs. A Segment Routed Path can be derived from a variety of mechanisms, including an IGP Shortest Path Tree (SPT), explicit configuration, or a Path Computation Element (PCE). Since, Segment Routing can be applied to both MPLS and IPv6 forwarding plane, a PCE should be able to compute SR-Path for both MPLS and IPv6 forwarding plane. This draft describes the extensions required for Segment Routing support for IPv6 data plane in Path Computation Element communication Protocol (PCEP).

Path Table based Routing Mechanism in Software-Defined Optical Transport Networks (SD-OTN)

Abstract: The dynamic establishment and removal of an end-to-end light-path consume a lot of time which are also the main burden of control plane in optical transport networks. With the frequent arrival and departure of services, the control plane needs to handle a large number of control and management messages to conduct path computation, resource reservation and cross connection configuration. This draft proposes a novel routing mechanism based on Path Table for software-defined optical transport networks (SD-OTN). The Path Table reserves partial activated established light-paths that can be directly used by subsequent requests for subsequent services. This new routing mechanism can reduce the network load and save routing time for some services.

Calculation of routing value in MPLS network according to traffic fractal properties

Abstract: Method for calculating routing cost of MPLS network is presented in the work. This method allows to minimize routing cost, taking into account traffic fractal properties, choice of traffic transmission path and quality of service requirements. The method uses values of the Hurst parameter and value of normalized spread of traffic values, which makes it possible to apply it to self-similar and multifractal data streams.

Method and system having weighted equal-cost multi-path routing

Abstract: This invention provides a method and a system having weighted equal-cost multi-path routing, which entrains path congestion information in the general traffic based on P4 INT (Programming Protocol-Independent Packet Processors Inband Network Telemetry) in order to collect the network usage rate. Each leaf switch uses the network usage rate to weight paths to the other leaf switches, and chooses a path probabilistically according to the weight value to avoid fixed selection of the least congested path, so that each path has a chance to be selected, thus achieving load balancing.