Disclosed are a packet sending method, a packet receiving method, an electronic device, a packet sending and receiving system, and a storage medium. The packet sending method may include: acquiring a current sequence number of a current link-state packet; generating a link-state packet with a transition sequence number according to the current sequence number, the link-state packet with the transition sequence number is newer than a link-state packet with a maximum sequence number and older than a link-state packet with an initial sequence number; and sending the link-state packet with the transition sequence number.

Provided are an interior gateway protocol flooding optimization method and device, and a storage medium. The method for optimizing flooding of an internal gateway protocol comprises: flooding, by a first node, a first packet carrying link state data and first record information to at least one neighboring node, wherein the first record information comprises indication information of nodes that the link state data has passed through. In this embodiment, by carrying indication information of a node that link state data passes through, it is convenient for the node to reduce redundant sending of link state information according to the information, thereby accelerating convergence speed.

Provided are an interior gateway protocol flooding optimization method and device, and a storage medium. The method for optimizing flooding of an internal gateway protocol comprises: flooding, by a first node, a first packet carrying link state data and first record information to at least one neighboring node, wherein the first record information comprises indication information of nodes that the link state data has passed through. In this embodiment, by carrying indication information of a node that link state data passes through, it is convenient for the node to reduce redundant sending of link state information according to the information, thereby accelerating convergence speed.

The present invention discloses a sleeping link waking method and apparatus, and relates to the field of communications network technologies, which can automatically wake a sleeping link in a timely manner according to an actual load condition of a network, and reduce labor maintenance costs. According to embodiments of the present invention, a first router receives a first LSP packet sent by a management router, where the first LSP packet includes a first TLV, and the first TLV is used to determine a sleeping link to be woken; the first router determines, according to the first TLV, the sleeping link to be woken; and the first router wakes the sleeping link. The solutions provided by the embodiments of the present invention are suitable to be used to wake a sleeping link.

A method, apparatus and computer program product for providing quick designated router transitions in broadcast networks is presented. An Alternate Designated Router (ADR) in a network detects node failure of a Designated Router (DR) prior to other nodes of the network detecting the failure of the DR. In response to the detecting node failure of the DR, the ADR floods the network with a link state packet of a pseudonode within the network. At least one other node of the network detects failure of the DR. The at least one other node computes routes to take into account the failure of the DR by the at least one other node of the network, wherein there is minimal traffic loss since the pseudonodes link state packet is already present before the computing routes takes place.

Disclosed are a method, device, and computer storage medium for implementing IP address advertisement. An advertisement for controlling LSA11 and an advertisement control switch for flooding are added into a router. The router performs, according to a state indicated by the advertisement control switch, IP address advertisement or flooding for LSA11 encapsulated with an IP address.

Systems and methods provide congruent bidirectional Segment Routing (SR) tunnels, namely congruent and fate-shared traffic forwarding for bidirectional SR tunnels. A bidirectional SR tunnel, as described herein, includes two unidirectional SR tunnels where the forward and reverse traffic directions follow the same path through the network when forwarded based on prefix and adjacency Segment Identifiers (SIDs). The term “congruent” is used herein to refer to the fact that the two unidirectional SR tunnels, i.e., the forward and reverse traffic directions, follow the same path through the network but in opposite directions. The guarantee of congruency is based on modification of the Segment Identifier (SID) configuration at the source nodes of each tunnel. Accordingly, the present disclosure maintains compatibility with existing Segment Routing configurations with the modifications solely at the source nodes.

Disclosed is a mechanism for implementing link state flooding reduction (LSFR) in an Interior Gateway Protocol (IGP) network. The mechanism includes receiving data indicating connectivity of a plurality of nodes in the network. A flooding topology is built based on the connectivity. This includes selecting one of the nodes as a root node, and building a tree of links connecting the root node to the nodes in the network. The flooding topology is stored in a memory. The flooding topology may not be to the remaining nodes in the network. Link state messages may then be flooded over the flooding topology.

A network node has a graceful restart mode in which the node: sends a graceful restart notification to one or more neighbouring nodes; attempts to re-establish an adjacency with the neighbouring node(s); receives link state data from at least one of the neighbouring node(s), the received data being sent in response to said attempt; derives pre-restart link data from the received data, the derived data identifying formerly active links, including the node, for routing traffic before the restart; routes network traffic in accordance with routing information stored in the router; detects one or more links, of the formerly active links, which are currently inactive; continues with graceful restart after said detection; determines one or more links, of the formerly active links, which are currently active; and exits the graceful restart mode in response to successful re-establishment of adjacencies with a respective neighbouring node for each of the currently active link(s).

Systems and methods provide for provisioning a dynamic intent-based firewall. A network controller can generate a master route table for network segments reachable from edge network devices managed by the controller. The controller can receive zone definition information mapping the network segments into zones and Zone-based Firewall (ZFW) policies to apply to traffic between a source and destination zone specified by each ZFW policy. The controller can evaluate a ZFW policy to determine first edge network devices that can reach first network segments mapped to the source zone specified by the ZFW policy, second edge network devices that can reach second network segments mapped to the destination zone specified by the ZFW policy, and routing information (from the route table) between the first network segments, the first and second edge network devices, and the second network segments. The controller can transmit the routing information to the edge network devices.