Juniper Networks, Inc.

Vishnu Pavan Kumar Beeram

Raveendra Torvi

Tarek Saad

Jonathan C Barth

Chandrasekar Ramachandran

Yakov Rekhter

John E Drake

Harish Sitaraman

Ravi I Singh

Yimin Shen

Srihari Ramachandra Sangli

Dmitry A Shokarev

Manikandan Musuvathi Poornachary

Minjie Dai

Shivam Vaid

Venkata Naga Chaitanya Munukutla

The techniques describe network slicing in computer networks. For example, a node receives a slice policy definition. The slice policy definition comprising a slice selector to identify packets belonging to one or more network slices, referred to as a 'slice aggregate,' and one or more network resource requirements for the slice aggregate to meet one or more Service Level Objectives (SLOs). The node configures, based on the slice policy definition, a path for the slice aggregate that complies with the one or more network resource requirements. In response to receiving a packet, the node determines whether the packet is associated with the slice aggregate and, in response to determining that the packet is associated with the slice aggregate, forwards the packet along the path for the slice aggregate.

Network slicing including modeling, distribution, traffic engineering and maintenance

An example network element includes one or more interfaces and a control unit, the control unit includes one or more processors configured to determine an egress network domain identifier (ID) and determine an abstracted interdomain network topology. The one or more processors are also configured to determine one or more interdomain paths from an abstracted ingress domain node to an abstracted egress domain node and determine whether an abstracted domain node is on the one or more interdomain paths. The one or more processors are configured to, based on the abstracted domain node being on the one or more interdomain paths, include one or more resources within a network domain in a filtered traffic engineering database (TED) and compute a path from an ingress node within the ingress network domain to an egress node within the egress network domain based on the filtered TED.

Filtering topologies for path computation in massively scaled networks

In general, techniques are described for signaling IP path tunnels for traffic engineering using constraints in an IP network. For example, network devices, e.g., routers, of an IP network may compute an IP path using constraint information and establish the IP path using, for example, Resource Reservation Protocol, to signal the IP path without using MPLS. As one example, the egress router generates a path reservation signaling message that includes an egress IP address that is assigned for use by the routers on the IP path to send traffic of the data flow by encapsulating the traffic with the egress IP address and forwarding toward the egress router. As each router in the IP path receives the path reservation signaling message, the router configures a forwarding state to forward traffic encapsulated with the egress IP address to a next hop along the IP path toward the egress router.

Signaling IP path tunnels for traffic engineering

In general, this disclosure describes a network device to determine a cause of packets being dropped within a network. An example method includes generating, by a traffic monitor operating on a network device, an exception packet that includes a unique exception code that identifies a cause for a component in the network device to discard a transit packet, and a nexthop index identifying a forwarding path being taken by the transit packet experiencing the exception. The method also includes forwarding the exception packet to a collector to be processed.

Dropped packet detection and classification for networked devices

In general, techniques are described for a path computation delay timer for multi-protocol label switched networks. As an example, an ingress network device configured to act as an ingress for a label switched path (LSP) may perform the techniques. The ingress network device comprises an interface and a processor. The interface may receive a message indicating an error along the LSP. The processor may delay an operation performed to configure a replacement LSP to be used in place of the LSP in order to provide time during which a cause of the error along the LSP is able to be determined. When the cause of the error is determined to be a failure of a network device supporting operation of the LSP, the processor may further perform the operation to configure the replacement LSP with the ingress network device such that the replacement LSP avoids the failed network device.

Path computation delay timer in multi-protocol label switched networks

Growing community of inventors

Ashburn, VA, United States of America

Vishnu Pavan Kumar Beeram