Abstract: A packet forwarding method and apparatus are provided, and pertain to the field of communications technologies. The method includes: determining, by a first node, information about a loop-free path from the first node to a second node, where the first node and the second node are a pair of nodes having an anycast route; and when the first node receives a packet to be sent to a third node, if a link from the first node to the third node is faulty, forwarding, by the first node, the packet to the second node based on the information about the loop-free path, so as to forward the packet to the third node through the second node. According to this application, a success rate of packet sending can be improved.

Abstract: An example first network device includes a control unit configured to execute at least one application and a forwarding unit. The forwarding unit includes an interface configured to receive packets, at least one packet processor operably coupled to a memory, and a forwarding path, wherein at least a portion of the forwarding path is stored in the memory and is executable by the at least one packet processor. The forwarding unit is configured to receive an advertisement originated by a second network device in a network, wherein the advertisement specifies a second micro segment identifier (SID), and store, in a destination lookup table, a route entry comprising a first micro SID associated with the first network device and the second micro SID.

Abstract: A router is configured for deployment in a network. The router includes a memory configured to store a first identifier that uniquely identifies the router in the network. The router also includes a processor configured to push the first identifier onto a first labeled data packet prior to transmission of the first labeled data packet. In response to detecting the first identifier in a second labeled data packet received from the network, the processor is configured to drop the second labeled data packet.

Abstract: Techniques and apparatus for providing payment-based transmission processes are described. In one embodiment, for example, a network node may include a storage device, and logic, at least a portion of the logic implemented in circuitry coupled to the storage device. The logic may operate to provide a routing query to transmit information over a network, the routing query comprising at least one destination node for the information and a transmission value, receive at least one bid from at least one bidding node in response to the routing query, determine a path through the network to transmit the information anonymously based on the at least one bid that corresponds to the transmission value, and transmit the information at least partially anonymously via the path within a network packet encrypted in a number of layers of encryption corresponding to a number of intermediary nodes in the path. Other embodiments are described.

Abstract: A network device (PE), a network control method and program which can reduce a BUM traffic packet loss even when a time is taken for route recalculation according to a routing protocol due to a malfunction in a network infrastructure are provided. A network device according to the present invention requests each PE connected to the same ES as that of the network device to perform DF reelection on the basis of a redundant PE list from which the network device has been deleted when cease of a BGP session is detected. In addition, the PE requested to perform the DF reelection executes the DF reelection based on the redundant PE list from which the aforementioned PE has been deleted. In the present invention, BUM traffic can be immediately forwarded from a PE that has become a new DF even when a time is taken for route recalculation according to the routing protocol because another PE connected to the same ES is caused to serve as a DF when the BGP session is ceased.

Abstract: A computing system is provided, including a processor configured to receive a directed acyclic graph (DAG) template specifying a data pipeline of a plurality of processing stages. For each processing stage, the processor may be further configured to select a respective processing device of a plurality of communicatively linked processing devices. The processor may be further configured to determine a routing sequence between the plurality of processing devices according to the DAG template. The processor may be further configured to transmit a plurality of input packets encoding the plurality of processing stages to the respective processing devices selected for the processing stages as specified by the routing sequence. In response to transmitting the plurality of input packets, the processor may be further configured to receive, from a processing device of the plurality of processing devices, one or more output packets encoding a processing result of the data pipeline.

Abstract: The disclosure describes processing packets in connection with a traceroute session in an overlay network that includes detecting traceroute probes using static and dynamic rules and using the time to live (TTL) value in a received traceroute probe to compute an outer TTL value. The TTL value (inner TTL) of the received probe is updated based on the number of underlay routers (hops) comprising the underlay network that are detected during the traceroute session. The received probe with its updated TTL value is encapsulated in an outer frame that includes the computed outer TTL value. The number of hops is updated each time an underlay router sends an ICMP time exceeded message.

Abstract: Disclosed is a simulation design method for bay layer devices of a smart substation. Application layer modules of two network structures store identity tags of each other's application layer modules respectively, so that a simulation model of the bay layer devices has ports of both network structures and can realize data sharing. The simulation model of the bay layer devices can process SV messages, GOOSE messages and MMS messages simultaneously. An interface layer is additionally configured between an application layer and a data link layer to allow data to be directly mapped to the data link layer from the application layer, so that received or transmitted messages contain actual electrical quantity information. The invention provides model establishment methods of two network structures, thus not only suitable for simulation of the bay layer devices, but also suitable for simulation of station control layer devices and process layer devices.

Abstract: The present disclosure relates to forwarding of network traffic. In one of its aspects, the technology presented herein concerns a method for forwarding network traffic from multiple sources to multiple destinations on maximally disjoint paths by maximally redundant trees, MRTs. The method is implemented in a network element implementing multipoint-to-multipoint functionalities in a path computation element, PCE, of a network, wherein the network includes a plurality of network elements. According to the method, an almost directed acyclic graph, ADAG, is computed for the network. Next hops along MRTs are computed by using the ADAG. One or more valid path pair(s) of the computed MRTs that is/are disjoint is/are determined and then, the network traffic is forwarded by using the valid path pair(s) of the MRT(s).

Abstract: This application provides a secure route identification method and an apparatus. A first AS node receives a first message. The first message is used to indicate a target path for reaching a first route prefix, and the target path is used to indicate a first neighboring relationship between AS nodes on the target path. Then, the first AS node determines, based on the first neighboring relationship and neighbor information of an AS node on the target path that is stored in a blockchain, whether a security threat exists on the target path. The neighbor information of the AS node on the target path includes a second neighboring relationship between the AS node on the target path and another AS node.

Abstract: Systems, methods, and computer-readable media for identifying bogon addresses. A system can obtain an indication of address spaces in a network. The indication can be based on route advertisements transmitted by routers associated with the network. The system can receive a report generated by a capturing agent deployed on a host. The report can identify a flow captured by the capturing agent at the host. The system can identify a network address associated with the flow and, based on the indication of address spaces, the system can determine whether the network address is within the address spaces in the network. When the network address is not within the address spaces in the network, the system can determine that the network address is a bogon address. When the network address is within the address spaces in the network, the system can determine that the network address is not a bogon address.

Abstract: Systems and methods are disclosed for using one or more gateway systems for integrating multiple load control systems running multiple versions of software such that the load control systems may appear to a user and be controlled by the user as a unified load control system. Gateways that manage or have managed the same resource may be organized into a Gateway Group. Gateway Groups names may be used for prefix attachment to facilitate routing. For example, a Composite Gateway may receive a request associated with a resource from a user. The Composite Gateway may determine which Gateway actively manages that resource and/or is the Gateway is a member of a Gateway Group. The composite Gateway may then apply one or more policies to facilitate the request. For example, if the Composite Gateway receives an information request, it may apply an authorization policy, a routing policy, and/or an aggregation policy.

Abstract: In a network device, a hash calculator generates a lookup hash value from data fields associated with a packet received by the network device. A compressed lookup key generator generates a compressed lookup key for the packet using the lookup hash value. A content addressable memory (CAM) stores compressed patterns corresponding to compressed lookup keys, uses the compressed lookup key received from the compressed lookup key generator to determine if the received compressed lookup key matches any stored compressed patterns, and outputs an index corresponding to a stored compressed pattern that matches the compressed lookup key. A memory stores uncompressed patterns corresponding to the compressed patterns stored in the CAM, and retrieves an uncompressed pattern using the index output by the CAM. A comparator generate a signal that indicates whether the uncompressed pattern retrieved from the memory matches the data fields associated with the packet.

Abstract: A system and method for automated data propagation and automated data processing within an integrated circuit includes an intelligence processing integrated circuit comprising at least one intelligence processing pipeline, wherein the at least one intelligence processing pipeline includes: a main data buffer that stores input data; a plurality of distinct intelligence processing tiles, wherein each distinct intelligence processing tile includes a computing circuit and a local data buffer; a token-based governance module, the token-based governance module implementing: a first token-based control data structure; a second token-based control data structure, wherein the first token-based control data structure and the second-token based control data operate in cooperation to control an automated flow of the input data and/or an automated processing of the input data through the at least one intelligence processing pipeline.

Abstract: A routing method and a device to provide a routing path that satisfies a quality of service (QoS) requirement, where the routing method includes performing QoS measurement on a path between the first routing node and a reachable adjacent routing node, to obtain a QoS parameter set of the path between every two adjacent routing nodes, reporting the QoS parameter set to the control node, receiving one or more routing tables of routing performed from the first routing node to the other routing node that are delivered by the control node, and receiving a packet, determining, from the one or more routing tables, a routing table corresponding to an identifier of the packet, and forwarding the received packet based on the routing table.

Abstract: The present disclosure provides a packet processing method, including: determining, by a first node, a first packet, where both a packet header and a segment routing header (SRH) of the first packet include a shared SID, the shared SID includes a first address identifier and a first function identifier, the first address identifier is used to identify address information of a terminating node, and the first function identifier is used to identify a same first function that needs to be performed by at least two nodes. If a plurality of nodes need to perform the same first function, the shared SID in the SRH can replace SIDs of all of the plurality of nodes. In this way, SID overheads can be reduced to save bandwidth resources, thereby helping improve system performance.

Abstract: Techniques are described for wireless communication. One method includes winning a contention for access to an unlicensed radio frequency spectrum band, transmitting a request message upon winning the contention for access to the unlicensed radio frequency spectrum band, and receiving a response message over the unlicensed radio frequency spectrum band. The request message is transmitted by a user equipment (UE) on an enhanced physical random access channel (ePRACH), to access a cell that operates in the unlicensed radio frequency spectrum band. The response message is received in response to transmitting the request message.

Abstract: A method is provided by which a network adapter device receives a packet sent over a network from a peer, the packet including an enqueue timestamp indicating when the packet has been enqueued at the network adapter device. The network adapter device parses a header of the packet to detect whether the header includes bits indicating that the peer device is experiencing congestion, and obtains packet metadata of the packet and the enqueue timestamp of the packet. The network adapter device compares the packet metadata with information in a flow table to identify an entry in the flow table corresponding to a flow to which the packet metadata matches. The network adapter device sets a timer associated with the flow, the timer for use in scheduling transmission of a next packet provided by the host to be sent to the peer.

Abstract: A method for packet transmission in a network includes receiving, by a first node, a second segment identifier sent by the third node, receiving, by the first node, a packet sent by the second node through the first path, determining, by the first node, that a next-hop node of the first node on the first path is faulty, and in response to the determining, by the first node, that a next-hop node of the first node on the first path is faulty, adding, by the first node, the second segment identifier to the packet, and sending the packet to the third node through a second path, where the second path is established by the first node based on the second segment identifier.

Abstract: One disclosure of this specification provides a method for receiving a synchronization signal block (SSB) by a user equipment (UE). The method may include: determining frequency locations of multiple SSBs; and receiving at least one SSB among the multiple SSBs. The multiple SSBs may be configured to be arranged spaced apart from each other by a predetermined offset. The at least one SSB may be located at an interval of 1.2 MHz on a frequency axis.