A method for programming route hardware in network devices. The method includes: receiving, by a network device, route updates, selecting from the route updates, a set of selected routes to be used for routing, assigning multiple timestamps to the set of selected routes, programming the set of selected routes into a software-implemented forwarding information base (FIB), segmenting the set of selected routes in the software-implemented FIB into at least a first batch of routes and a second batch of routes, programming the first batch of routes into a hardware-implemented FIB, after the programming, determining a last timestamp, where the last time stamp is the oldest timestamp of the timestamps where all routes associated with the last timestamp have been successfully programmed into the hardware-implemented FIB, and advertising all routes of the first batch that are associated with a timestamp that is no older than the last timestamp.

An object of the disclosed invention is to provide a polling-based multihop communication system capable of achieving robust communication. Solving means thereof is a (multihop communication) wireless transmission system including, as wireless stations, a base station, a plurality of relay stations connected at multiple stages by using the base station as a root, and a plurality of terminals connected to the relay stations, in which the base station and the relay stations perform communication using polling in one or more service periods which have been allocated to each of the base and relay stations in time division in advance in a system cycle.

A packet processing method and a related apparatus are provided. The method includes: obtaining a first packet including first indication information, wherein the first indication information is used to indicate a data flow corresponding to the first packet; determining a target flow entry in an integrated flow table based on the first indication information, wherein the integrated flow table includes at least one flow entry, each flow entry includes a unified match entry and a comprehensive behavior entry, the unified match entry uniquely identifies a data flow, a unified match entry of the target flow entry identifies the same data flow as indicated by the first indication information; and performing an operation on the first packet based on a comprehensive behavior entry included in the target flow entry.

Example embodiments relate to a method of, and device for facilitating, resilient peer-to-peer application message routing. The method comprises storing a network routing table comprising destination addresses of applications hosted on peer nodes of a network, and providing the peer nodes with a copy of the routing table via which routing table an application message from any one of the peer nodes is routed to a destination address designating a destination application hosted by a destination peer node. Further, the method comprises providing, when the destination application hosted by the destination peer node is inactivated, all peer nodes with a copy of an updated routing table taking into account the inactivation of said application, wherein a further application message addressed from any one of the peer nodes to the destination address associated with the inactivated application is routed via the updated routing table, to an alternative destination application having the same destination address as the inactivated application.

Exemplary methods include generating a first fast reroute (FRR) next hop (NH) comprising of a first primary next hop (PNH), a first secondary next hop (SNH), and a first attribute, wherein the first PNH and first SNH include forwarding information that causes traffic to be forwarded towards a second and third network device, respectively. The methods include sending a first request to a forwarding plane to generate a second FRR NH comprising of a second PNH, a second SNH, and a second attribute. The methods include updating contents of the first FRR NH, and sending a second request to the forwarding plane to update the second FRR NH, wherein the second request causes the forwarding plane to determine whether to revert back to using the second PNH based on whether the first attribute included in the second request is different from the second attribute of the second FRR NH.

A forwarding path link table packet is generated, the forwarding path link table packet comprises forwarding information of each SDN switch on a forwarding path; and the forwarding path link table packet is delivered to any one of SDN switches on the forwarding path, to enable the forwarding path link table packet to be delivered among SDN switches on the forwarding path, so as to cause each SDN switch that receives the forwarding path link table packet to generate a forwarding flow table entry of the SDN switch according to the forwarding information of the SDN switch in the forwarding path link table packet, and forward the forwarding path link table packet on the forwarding path.

Synchronization between a data plane of a router in a network and a control plane of the router is performed by a processor of the router. Route information associated with at least one network node in the network is learned using a routing protocol. The route information includes a plurality of subsets and is stored in a routing information base (RIB) of the router. A first subset of the plurality of subsets of the route information is copied from the RIB to a forwarding information base (FIB) of the router. After the first subset has been copied to the FIB, synchronization data in the router associated with the first subset is modified. The modification indicates that the first subset has been copied to the FIB.

A method supporting a distributed resilient network interconnect (DRNI) in a link aggregation group at a network device is disclosed. The method starts with receiving a distributed relay control protocol data unit (DRCPDU), where the DRCPDU includes neighbor network device's state information and configuration information, wherein the configuration information includes its operational aggregation key, gateway digest, port digest. The method continue with determine whether or not the received configuration information is different from the one of the network device and how, and causing the next DRCPDU to be transmitted to the neighbor network device to include or not include certain information accordingly.

A packet according to a secure protocol over a high-speed protocol has a small size header. A reception system estimates a packet number which is used in processing of a packet having a small size header on the basis of information indicating a packet number of a received packet. The header of each of one or more packets among N packets (where N is an integer of two or more) is a small size header, which is either a first header having one part of the packet number of the packet or a second header without the packet number of the packet. When the small size header is the first header, the header of each of the N packets is the first header. When the small size header is the second header, the header of each of the packets other than one packet among the N packets is the second header.

A method, implemented in a packet switch system, for fast interlayer forwarding includes constructing a master Forwarding Information Base (FIB) which associates each of a plurality of packet source addresses with a corresponding member port among a plurality of member ports interconnected by a fabric; and distributing the master FIB to the member ports interconnected by the fabric and to at least one alternate logical port that is not connected to the fabric, wherein the at least one alternate logical port is configured to protect one of the member ports interconnected by the fabric.