A data packet transmission method and a border routing bridge device, where the method includes receiving, by a first border routing bridge device of a first area, a first data packet sent by a border routing bridge device of a second area to the first area, determining, a device identifier group of the second area according to the first data packet, determining, from the device identifier group of the second area, according to the first data packet, a device identifier of a border routing bridge device used to forward a return data packet sent by the target device to the source device, and sending, by the first border routing bridge device, a second data packet carrying the determined device identifier to the target device, where the determined device identifier is used as a source routing bridge device identifier of the second data packet.

In general, techniques are described for reducing or otherwise preventing micro-loops in network using Source Packet Routing in Networking (SPRING). In some examples, a method includes detecting a failure of a communication by a network device that implements a Source Packet Routing in Networking (SPRING) protocol to forward network packets using node labels according to an initial network topology. Responsive to detecting the failure of the communication link, the network device may apply, for a defined time duration, one or more adjacency labels to network packets to define a set of one-hop tunnels corresponding to a backup sub-path that circumvents the failed communication link. Upon expiration of the defined time duration, the network device may forward, according to a new network topology that is not based on applying the one or more adjacency labels that define the set of one-hop tunnels, network packets destined for the destination network device.

A network monitoring method executed by a plurality of relay devices within a network includes stopping, by a first relay device, transfer of a data frame received via a port at which a loop in the network is detected when the loop is detected; transmitting a first search frame configured to identify one or more relay devices included in a path in which the loop has occurred; receiving, by a second relay device, the first search frame; transmitting a second search frame obtained by storing identifying information identifying the second relay device in a data region of the first search frame; and identifying, by the first relay device, the one or more relay devices included in the loop using information included in the data region of a third search frame generated from the second frame by passing through one or more relay devices, when the third search frame is received.

In one embodiment, a device in a channel hopping, communication network independently maintains a slot counter, and computes a channel identification (ID) based on a function having inputs of a unique feature of the device, ii) a current slot of the slot counter, and iii) a set of possible channel IDs. Accordingly, the device configures its radio to receive on the computed channel ID for the respective current slot. In another embodiment, the device may determine, for a neighbor device, a current neighbor slot and unique neighbor feature, and correspondingly computes a neighbor channel ID based on the function using the unique neighbor feature, the current neighbor slot, and the set of a possible channel IDs. As such, the device configures its radio to transmit on the computed neighbor channel ID for the respective current neighbor slot.

In one embodiment, a method comprises creating, in a computing network, a loop-free routing topology comprising a plurality of routing arcs for reaching a destination network node, each routing arc comprising a first network node as a first end of the routing arc, a second network node as a second end of the routing arc, and at least a third network node configured for routing any network traffic along the routing arc toward the destination node via any one of the first or second ends of the routing arc, the loop-free routing topology providing first and second non-congruent paths; and forwarding bicasting data, comprising a data packet in a first direction from a network node and a bicasted copy of the data packet in a second direction from the network node, concurrently to the destination node respectively via the first and second non-congruent paths.

Systems and methods for automatically building a deadlock free inter-communication network in a multi-core system are described. The example implementations described herein involve automatically generating internal dependency specification of a system component based on dependencies between incoming/input and outgoing/output interface channels of the component. Dependencies between incoming and outgoing interface channels of the component can be determined by blocking one or more outgoing interface channels and evaluating impact of the blocked outgoing channels on the incoming interface channels. Another implementation described herein involves determining inter-component communication dependencies by measuring impact of a deadlock on the blocked incoming interface channels of one or more components to identify whether a dependency cycle is formed by blocked incoming interface channels.

Various systems and methods for preventing loops. For example, one method involves receiving a multicast data packet at a node. The node is coupled to a local area network (LAN). An internet protocol (IP) prefix is assigned to the LAN. The method involves determining whether a source address included in the packet is covered by the IP prefix. Depending on the direction of travel of the multicast data packet and whether or not the source address is covered by the IP prefix, the node determines whether a loop exists.

Systems and methods for providing a data service through a packet-optical switch in a network include, subsequent to defining a loop-free forwarding topology for the data service in the network, if the packet-optical switch is a degree 2 site for the data service, providing the data service through the packet-optical switch at a Layer 1 protocol bypassing a partitioned packet fabric of the packet-optical switch; and if the packet-optical switch is a degree 3 or more site for the data service with multi-point connectivity, providing the data service through the packet-optical switch at the Layer 1 protocol and at a packet level using the partitioned packet fabric to provide the data service between the multi-point connectivity and to associated OTN connections for each degree of the degree 3 or more site.

Disclosed embodiments include a method of operation of a distributed network system. The method includes nodes of the network system that send messages over a protocol-independent message bus, and other nodes that receive the messages. Content from the received messages can be stored in a database distributed among nodes of the network system. At least some of the content stored in the database is published. The published content can be accessed by one or more applications to perform one or more functions.

In one embodiment, a method comprises creating, in a computing network, a loop-free routing topology comprising a plurality of routing arcs for reaching a destination device, each routing arc comprising a first network device as a first end of the routing arc, a second network device as a second end of the routing arc, and at least a third network device configured for routing any network traffic along the routing arc toward the destination device via any one of the first or second ends of the routing arc; and causing the network traffic to be forwarded along at least one of the routing arcs to the destination device.