Patent classifications
H04L45/021
Controlling routing behavior during router table-memory exhaustion events
Systems and methods include obtaining a table having a plurality of addresses each having a plurality of attributes and classifications; responsive to a requirement to reduce a size of the table, reducing a number of the plurality of addresses based on one or more reduction approaches that use any of the plurality of attributes and classifications; and obtaining an output table having some or all of the plurality of addresses for a table receiver. The table can be obtained via control plane components including one or more of Interior Gateway Protocol (IGP) and Border Gateway Protocol (BGP). The requirement to reduce the size is based on a size of the table and a size of memory associated with the table receiver.
METHOD FOR IMPLEMENTING MANY-TO-ONE CONCURRENT TRANSMISSION MEDIUM ACCESS CONTROL (MAC) PROTOCOL FOR UNDERWATER ACOUSTIC NETWORKS
A method for implementing a many-to-one concurrent transmission medium access control (MAC) protocol for underwater acoustic networks, including: initializing a network; setting a timer; initiating, by a receiving node, a control frame to perform handshakes with multiple nodes; exchange ID, level and location of the receiving node and a sending node, and counting the number of nodes that generate a sending notification (SN) message before timeout; and planning, by the receiving node, a receiving scheduling time of data from different nodes according to the number of successful handshake nodes, distance from each sending node to the receiving node, and data packet size; and performing data transmission.
METHOD FOR IMPLEMENTING MANY-TO-ONE CONCURRENT TRANSMISSION MEDIUM ACCESS CONTROL (MAC) PROTOCOL FOR UNDERWATER ACOUSTIC NETWORKS
A method for implementing a many-to-one concurrent transmission medium access control (MAC) protocol for underwater acoustic networks, including: initializing a network; setting a timer; initiating, by a receiving node, a control frame to perform handshakes with multiple nodes; exchange ID, level and location of the receiving node and a sending node, and counting the number of nodes that generate a sending notification (SN) message before timeout; and planning, by the receiving node, a receiving scheduling time of data from different nodes according to the number of successful handshake nodes, distance from each sending node to the receiving node, and data packet size; and performing data transmission.
Explicit backups and fast re-route mechanisms for preferred path routes in a network
A method implemented by a network element (NE) in a network, comprising receiving, by the NE, an advertisement comprising preferred path route (PPR) information and backup PPR information, the PPR information describing a PPR between a source and a destination in the network, the backup PPR information describing a backup PPR between the source and the destination, the PPR information comprising a PPR identifier (PPR-ID) and a plurality of PPR description elements (PPR-PDEs) each representing an element on the PPR, updating, by the NE, a local forwarding database to include the PPR information and the backup PPR information in association with a destination address of the destination, and transmitting, by the NE, a data packet based on the backup PPR information instead of the PPR information in response to an element on the PPR being unavailable due to a failure of an element along the PPR.
Explicit backups and fast re-route mechanisms for preferred path routes in a network
A method implemented by a network element (NE) in a network, comprising receiving, by the NE, an advertisement comprising preferred path route (PPR) information and backup PPR information, the PPR information describing a PPR between a source and a destination in the network, the backup PPR information describing a backup PPR between the source and the destination, the PPR information comprising a PPR identifier (PPR-ID) and a plurality of PPR description elements (PPR-PDEs) each representing an element on the PPR, updating, by the NE, a local forwarding database to include the PPR information and the backup PPR information in association with a destination address of the destination, and transmitting, by the NE, a data packet based on the backup PPR information instead of the PPR information in response to an element on the PPR being unavailable due to a failure of an element along the PPR.
METHOD AND SYSTEM FOR FACILITATING LOSSY DROPPING AND ECN MARKING
Methods and systems are provided for performing lossy dropping and ECN marking in a flow-based network. The system can maintain state information of individual packet flows, which can be set up or released dynamically based on injected data. Each flow can be provided with a flow-specific input queue upon arriving at a switch. Packets of a respective flow are acknowledged after reaching the egress point of the network, and the acknowledgement packets are sent back to the ingress point of the flow along the same data path. As a result, each switch can obtain state information of each flow and perform per-flow packet dropping and ECN marking.
Distributed neighbor state management for networked aggregate peers
Methods for performing neighbor state management between peers of a Multi-Chassis Link Aggregation Group (MCLAG) are provided. In one method, a first peer of a Multi-Chassis Link Aggregation Group (MCLAG) performs state management for each neighbor entry in a first set of neighbor entries. Similarly, a second peer of the MCLAG connected in parallel with the first peer performs state management for each neighbor entry in a second set of neighbor entries, the second set of neighbor entries containing contain at least one neighbor entry absent from the first set of neighbor entries.
Distributed neighbor state management for networked aggregate peers
Methods for performing neighbor state management between peers of a Multi-Chassis Link Aggregation Group (MCLAG) are provided. In one method, a first peer of a Multi-Chassis Link Aggregation Group (MCLAG) performs state management for each neighbor entry in a first set of neighbor entries. Similarly, a second peer of the MCLAG connected in parallel with the first peer performs state management for each neighbor entry in a second set of neighbor entries, the second set of neighbor entries containing contain at least one neighbor entry absent from the first set of neighbor entries.
CLOUD ROUTER PLATFORM FOR SDN NETWORKS
A system is described whereby a cloud router may allow routing as a service in a cloud-like manner. In an example, an apparatus may include a processor and a memory coupled with the processor that effectuates operations. The operations may include receiving first routing information associated with a first customer edge device; adding the first routing information to network routing information of the apparatus, wherein the network routing information comprises a network routing table with routes for a plurality of networks; and propagating the network routing information to a software defined network (SDN) controller, wherein, based on the network routing information, the SDN controller sends a forwarding information base (FIB) to a provider edge device connected with the first customer edge device.
Systems and Methods for Preemptive Detection and Correction of Network Issues Based on Control Plane Messaging
Provided is a Routing Early Warning System (“REWS”) that preemptively detects and corrects network issues based on control plane messaging. REWS receives control plane messages for network paths to a source node, groups the control plane messages to different bins based on time, detects an anomaly based on a number of a first set of control plane messages grouped to a particular bin differing, by a threshold amount, from a steady state number of control plane messages grouped to at least one other bin, and isolates a cause of the anomaly based on a number of updated paths and addressing of one or more nodes specified in the first set of control plane messages. REWS modifies routing of the source node data plane traffic before the anomaly significant impacts the data plane in response to detecting the anomaly and isolating the anomaly cause using the control plane messages.