Abstract:
Aspects of the embodiments are directed to systems, apparatuses and methods performed at a network element. Embodiments include receiving a packet; identifying a hop number for the network element; identifying a unique identifier for the network element; determining a path identifier based on the hop number and the unique identifier; augmenting the packet metadata with the path identifier; and transmitting the packet to a next network element.
Abstract:
Systems, methods, and instrumentalities are disclosed for mitigating CRC calculations in networks that utilize segment routing (SR). CRC calculations may be mitigated at some or all intermediate destinations in an SR path. A switch may receive a frame comprising a segment list comprising an address associated with a switch in a segment routing (SR) path. The switch may read a portion of the frame to determine if the segment list comprises an address associated with another switch in the SR path. If the segment list comprises an address associated with another switch in the SR path, the segment list may be modified. If not, the frame may be forwarded in a cut-through mode at least by forwarding the frame without recalculating a cyclic redundancy check (CRC) value.
Abstract:
Techniques for exposing maximum node and/or link segment identifier depth using IS-IS are described. A network element in a Segment Routing (SR) network transmits a Type Length Value (TLV) element including a Maximum Segment Identifier Depth (MSD) value. The MSD value identifies a maximum number of segment identifier (SID) labels that the network element is able to push into packet headers of received packets to enable forwarding of the received packets through the SR network. The network element receives, from a controller, data for a path to be utilized by the network element for forwarding the received packets through the SR network. The data includes one or more SID labels to be pushed into the received packets, and the SID labels include fewer than or equal to the MSD value. The controller and the network element do not utilize the Path Computation Element Protocol (PCEP) over a southbound interface.
Abstract:
A path of relay nodes is set up in a mesh network (100) between a source node (102) and a destination node (104). During a phase of handling path request, PREQ, messages a cluster table is maintained in a node (123) and during a phase of handling path reply, PREP, messages this cluster table is utilized to establish node clusters (120) that comprise nodes that can relay subsequent messages between the source node (102) and the destination node (104).
Abstract:
The present invention provides a method and apparatus to route data packets across a torus or higher radix topology that has low latency, increased throughput and traffic distribution to avoid hot spots development. Disclosed is a method of routing packets in a distributed direct interconnect network from a source node to a destination node comprising the steps of: discovering all nodes and associated ports; updating the database to include the nodes and ports in the network topology; calculating the shortest path from every output port on each node to every other node in the topology; segmenting each packet into flits at the output port of the source node; as the flits are segmented, distributing said flits along the shortest path from each output port on the source node to the destination node using wormhole switching, whereby the packets are distributed along alternate maximum disjoint routes in the network topology; and re-assembling and re-ordering the packets at the destination node so that the packets accord with their original order/form.
Abstract:
In one embodiment, a first node in a network receives one or more bitmaps from one or more child nodes of the first node according to a directed acyclic graph (DAG) as used by RPL, the IPv6 Routing Protocol for Low-power and lossy networks (LLNs). Each of the one or more child nodes is associated with a corresponding unique bit position in the one or more bitmaps. The first node stores, in a forwarding table, the one or more bitmaps received from the one or more child nodes of the first node. The first node receives a message that includes a destination bitmap that identifies one or more destinations of the message via one or more set bits at bit positions associated with the one or more child nodes. The first node forwards the message towards the identified one or more destinations based on the destination bitmap and the one or more bitmaps stored in the forwarding table of the first node. Aggregating node bitmaps by OR operation with the bitmaps of their children allows to spare resources in nodes of LLNs; forwarding to the destination can be easily performed via AND operation on bitmaps. Deciding unicast or broadcast forwarding based on the density of interested children saves energy by optimally avoiding awaking of nodes.
Abstract:
Various disclosed embodiments include methods, systems, and computer-readable media for named data network (NDN) inter/intra-domain mobility. A complete de-coupling of identity and addressing space is established. This provides separation of control and forwarding allowing rich policy based routing, using SDN principles, as well as policy based global resolution. In one embodiment, the de-coupling of identity from location is achieved by a changeable forwarding label field in a header that can have nodal/domain/global scope. This disclosure provides content routing/mobility to be handled with a high degree of flexibility. This disclosure also provides mobility as a service for a component of a name space.
Abstract:
According to one embodiment, Layer-3 (L3) distributed router functionality is provided to a switch cluster by receiving an address resolution protocol (ARP) request packet from a first host at an entry switch in a switch cluster, a switch controller being in communication with the entry switch, and the ARP request packet including a virtual router IP address of the switch controller as a target, forwarding the ARP request packet to the switch controller after adding a header that adheres to a communication protocol used by the switch controller, receiving an ARP response packet from the switch controller indicating: a source IP address corresponding to a virtual router of the switch controller and a SMAC corresponding to the switch controller, forwarding the ARP response packet to the first host after stripping the communication protocol header, and setting the virtual router as a default gateway for traffic received from the first host.
Abstract:
In one embodiment, a system includes a network fabric having a plurality of fabric switches interconnected in the network fabric and a switch controller having logic adapted to configure the network fabric, determine one or more paths through the network fabric between any two hosts connected thereto, and create a source-routing table to store the one or more paths through the network fabric between any two hosts connected thereto. In another embodiment, a method includes receiving or creating a packet using a NIC of a host connected to a network fabric having a plurality of fabric switches interconnected therein, determining a path through the network fabric by consulting a source-routing table stored to the host, storing source-routing information to a packet header for the packet, the source- routing information including the path, and sending the packet to a first device or hop indicated by the path in the source-routing information.