Abstract: A mechanism includes receiving, at a local node, a Hello message including an application identifier (AppId) and a target link between a target port for a local node and target port for a neighbor node. The local node determines the AppId is associated with an application for performing database synchronization. The local node sets up a local database in memory at the local node as part of a database pair for use by the application, the database pair including a neighbor database at the neighbor node. The local node associates the database pair with the target link. The local node controls synchronization of the local database with the neighbor database via the target link.

Abstract: A mechanism includes receiving, at a local node, a Hello message including an application identifier (AppId) and a target link between a target port for a local node and target port for a neighbor node. The local node determines the AppId is associated with an application for performing database synchronization. The local node sets up a local database in memory at the local node as part of a database pair for use by the application, the database pair including a neighbor database at the neighbor node. The local node associates the database pair with the target link. The local node controls synchronization of the local database with the neighbor database via the target link.

Abstract: A network device receives an Ethernet frame, checks a destination media access control (MAC) address based on a first cyclic redundancy check (CRC) code, to determine whether an error occurs in the destination MAC address. If the network device determines that no error occurs in the destination MAC address, the network device forwards the Ethernet frame based on the destination MAC address. The Ethernet frame includes the destination MAC address, the first CRC code, and a payload, a parameter of the first CRC code includes the destination MAC address, and the parameter of the first CRC code does not include the payload.

Abstract: A method for communicating time sensitive data streams in a network. The method includes synchronizing queuing and transmission of data in a set of output buffers for buffering streams associated with a certain class of service. The method includes processing data packets of a stream using a cyclic flow meter, wherein the cyclic flow meter limits transfer of the data packets of the stream to the set of output buffers of the network node according to a predetermined amount per cycle based on an output frequency. The method includes transmitting, according to the output frequency, the data packets of the stream from a non-empty output buffer of the set of output buffers, and transferring the data packets of the stream from the cyclic flow meter to an empty output buffer of the set of output buffers.

Abstract: A packet forwarding method includes receiving N Time-Sensitive Networking (TSN) packet flows, where each of the N TSN packet flows corresponds to a constraint condition that defines duration of a cycle, a maximum quantity of packets that are allowed to be transmitted in the cycle, and a maximum length of a single packet, and forwarding the N TSN packet flows based on a new constraint condition, where the new constraint condition is based on the constraint condition corresponding to each of the N TSN packet flows and defines duration of a new cycle, a new maximum quantity of new packets that are allowed to be transmitted in the new cycle, and a new maximum length of a new packet, where each of the N TSN packet flows is forwarded in a case in which a corresponding constraint condition is complied with.

Abstract: A packet forwarding method includes receiving N Time-Sensitive Networking (TSN) packet flows, where each of the N TSN packet flows corresponds to a constraint condition that defines duration of a cycle, a maximum quantity of packets that are allowed to be transmitted in the cycle, and a maximum length of a single packet, and forwarding the N TSN packet flows based on a new constraint condition, where the new constraint condition is based on the constraint condition corresponding to each of the N TSN packet flows and defines duration of a new cycle, a new maximum quantity of new packets that are allowed to be transmitted in the new cycle, and a new maximum length of a new packet, where each of the N TSN packet flows is forwarded in a case in which a corresponding constraint condition is complied with.

Abstract: A packet forwarding method includes receiving N Time-Sensitive Networking (TSN) packet flows, where each of the N TSN packet flows corresponds to a constraint condition that defines duration of a cycle, a maximum quantity of packets that are allowed to be transmitted in the cycle, and a maximum length of a single packet, and forwarding the N TSN packet flows based on a new constraint condition, where the new constraint condition is based on the constraint condition corresponding to each of the N TSN packet flows and defines duration of a new cycle, a new maximum quantity of new packets that are allowed to be transmitted in the new cycle, and a new maximum length of a new packet, where each of the N TSN packet flows is forwarded in a case in which a corresponding constraint condition is complied with.

Abstract: A network device receives an Ethernet frame, checks a destination media access control (MAC) address based on a first cyclic redundancy check (CRC) code, to determine whether an error occurs in the destination MAC address. If the network device determines that no error occurs in the destination MAC address, the network device forwards the Ethernet frame based on the destination MAC address. The Ethernet frame includes the destination MAC address, the first CRC code, and a payload, a parameter of the first CRC code includes the destination MAC address, and the parameter of the first CRC code does not include the payload.

Abstract: The present disclosure is directed to a multi-level resource reservation system that obviates one or more of the problems due to limitations and disadvantages of the related art. The multi-level resource reservation system creates, or modifies existing, peer-to-peer protocol(s) to complete a continuous chain of configured ports to support QoS feature(s), e.g., bound latency and guaranteed jitter, for a data flow that traverses an arbitrary sequence of bridges, routers, and virtual links.

Abstract: A mechanism includes receiving, at a local node, a Hello message including an application identifier (AppId) and a target link between a target port for a local node and target port for a neighbor node. The local node determines the AppId is associated with an application for performing database synchronization. The local node sets up a local database in memory at the local node as part of a database pair for use by the application, the database pair including a neighbor database at the neighbor node. The local node associates the database pair with the target link. The local node controls synchronization of the local database with the neighbor database via the target link.

Abstract: A packet forwarding method includes receiving N Time-Sensitive Networking (TSN) packet flows, where each of the N TSN packet flows corresponds to a constraint condition that defines duration of a cycle, a maximum quantity of packets that are allowed to be transmitted in the cycle, and a maximum length of a single packet, and forwarding the N TSN packet flows based on a new constraint condition, where the new constraint condition is based on the constraint condition corresponding to each of the N TSN packet flows and defines duration of a new cycle, a new maximum quantity of new packets that are allowed to be transmitted in the new cycle, and a new maximum length of a new packet, where each of the N TSN packet flows is forwarded in a case in which a corresponding constraint condition is complied with.

Abstract: The present disclosure is directed to a multi-level resource reservation system that obviates one or more of the problems due to limitations and disadvantages of the related art. The multi-level resource reservation system creates, or modifies existing, peer-to-peer protocol(s) to complete a continuous chain of configured ports to support QoS feature(s), e.g., bound latency and guaranteed jitter, for a data flow that traverses an arbitrary sequence of bridges, routers, and virtual links.

Abstract: The present disclosure is directed to a multi-level resource reservation system that obviates one or more of the problems due to limitations and disadvantages of the related art. The multi-level resource reservation system creates, or modifies existing, peer-to-peer protocol(s) to complete a continuous chain of configured ports to support QoS feature(s), e.g., bound latency and guaranteed jitter, for a data flow that traverses an arbitrary sequence of bridges, routers, and virtual links.

Abstract: The present disclosure is directed to a multi-level resource reservation system that obviates one or more of the problems due to limitations and disadvantages of the related art. The multi-level resource reservation system creates, or modifies existing, peer-to-peer protocol(s) to complete a continuous chain of configured ports to support QoS feature(s), e.g., bound latency and guaranteed jitter, for a data flow that traverses an arbitrary sequence of bridges, routers, and virtual links.

Abstract: In one embodiment, a method includes detecting a change in network topology and broadcasting a transient unconditional unpruning message to multiple nodes in the network. The message is configured to instruct each of the nodes receiving the message to start a phase timer in response to the broadcast message; unprune its operational ports; and, upon expiration of the phase timer, prune its ports in accordance with the results of a pruning protocol.

Abstract: Devices and methods for policing traffic flows in a network are described herein. For example, a network device can include a processing unit and a memory operably coupled to the processing unit. The network device can be configured to provide an input port and an output port, the input and output ports being configured to process a traffic flow received at the network device. The network device can also be configured to queue the traffic flow using a plurality of buffers associated with the output port, cyclically direct the traffic flow from the input port to each of the plurality of buffers according to a queuing schedule, and enforce a policer policy synchronized to the queuing schedule. The policer policy can ensure that the traffic flow does not exceed a predetermined bandwidth.

Abstract: Devices and methods for policing traffic flows in a network are described herein. For example, a network device can include a processing unit and a memory operably coupled to the processing unit. The network device can be configured to provide an input port and an output port, the input and output ports being configured to process a traffic flow received at the network device. The network device can also be configured to queue the traffic flow using a plurality of buffers associated with the output port, cyclically direct the traffic flow from the input port to each of the plurality of buffers according to a queuing schedule, and enforce a policer policy synchronized to the queuing schedule. The policer policy can ensure that the traffic flow does not exceed a predetermined bandwidth.

Abstract: In particular embodiments, a first switch implementing a first virtual local area network (VLAN) registration protocol and connected to a first end of the trunk detects whether a second switch connected to a second end of the trunk implements the first VLAN registration protocol. In an embodiment, the second switch may send an unsolicited message to the first switch indicating the VLAN registration protocol implemented by the second switch. The first switch may then determine the VLAN registration protocol implemented by the second switch. Alternatively, the first switch may send a solicited message to the second switch. By receiving a response to the solicited message, the first switch can determine that the second switch implements the first VLAN registration protocol. In response to determining that the second switch implements the first VLAN registration protocol, the first switch may enable a pruning technique in accordance with the first VLAN registration protocol.

Abstract: A user application may provide a hint which may be used by a compute device to select a tag to be inserted into the packets generated by the user application. Upon some event, the application transmits a hint associated with a network flow generated by the user application to a stack associated with the computing device. One of the layers of the stack—e.g., the operating system in the computing device—may include a hint database that contains rules for selecting tags using a received hint as input. The layer may then insert the tag into one or more packets of the network flow. When processing the packet, network devices in the SDN enabled network recognize the tag and perform an action corresponding to the tag.

Abstract: A technique is provided for mitigating loops in Ethernet networks. A first port in an Ethernet device receives an Ethernet frame. The frame includes a source identifier, a destination identifier, and a Virtual Local Area Network Identifier (VLAN ID). According to various embodiments, the VLAN ID (VID) has the encoding of both a community group as well as a source bridge ID. A VID database is accessed using the destination identifier and the VID to determine whether the first port has ingress enabled. A filtering database is accessed to determine an egress port for forwarding the Ethernet frame.