A packet processing method includes a first network device receiving a first packet, where the first packet includes a plurality of segment identifier (SID) lists, the plurality of SID lists include a primary SID list and at least one secondary SID list. The at least one secondary SID list includes a first secondary SID list, and the first secondary SID list is a backup of the primary SID list. The first network device processes the first packet based on the primary SID list. When a forwarding path indicated by a segment identifier list is faulty, data packet forwarding processing can still be implemented in the segment routing network.

A packet processing method includes a first network device receiving a first packet, where the first packet includes a plurality of segment identifier (SID) lists, the plurality of SID lists include a primary SID list and at least one secondary SID list. The at least one secondary SID list includes a first secondary SID list, and the first secondary SID list is a backup of the primary SID list. The first network device processes the first packet based on the primary SID list. When a forwarding path indicated by a segment identifier list is faulty, data packet forwarding processing can still be implemented in the segment routing network.

A reception unit (210) receives an addition requesting frame for requesting addition of a new flow. A first search unit (241) performs, using a network-information database (280), a first search for searching for a schedule and a path assignable to the new flow without the schedule and the path of each existing flow being changed, when the addition requesting frame is received. A second search unit (242) performs a second search for changing the schedule and the path of each existing flow and searching for the schedule and the path assignable to the new flow, using the network-information database, when the schedule and the path assignable to the new flow have not been found by the first search. A response unit (260) transmits an addition responding frame.

A reception unit (210) receives an addition requesting frame for requesting addition of a new flow. A first search unit (241) performs, using a network-information database (280), a first search for searching for a schedule and a path assignable to the new flow without the schedule and the path of each existing flow being changed, when the addition requesting frame is received. A second search unit (242) performs a second search for changing the schedule and the path of each existing flow and searching for the schedule and the path assignable to the new flow, using the network-information database, when the schedule and the path assignable to the new flow have not been found by the first search. A response unit (260) transmits an addition responding frame.

This disclosure describes techniques for implementing centralized path computation for routing in hybrid information-centric networking protocols implemented as a virtual network overlay. A method includes receiving an interest packet header from a forwarding router node of a network overlay. The method further includes determining an interest path of the interest packet and one or more destination router nodes of the network overlay. The method further includes computing one or more paths over the network overlay. The method further includes determining an addressing method for the one or more computed paths over the network overlay. The method further includes performing at least one of encoding each computed path in a data packet header, and encoding each computed path as state entries of each router node of the network overlay on each respective path. The method further includes returning the computed path information to the forwarding router node.

This disclosure describes techniques for implementing centralized path computation for routing in hybrid information-centric networking protocols implemented as a virtual network overlay. A method includes receiving an interest packet header from a forwarding router node of a network overlay. The method further includes determining an interest path of the interest packet and one or more destination router nodes of the network overlay. The method further includes computing one or more paths over the network overlay. The method further includes determining an addressing method for the one or more computed paths over the network overlay. The method further includes performing at least one of encoding each computed path in a data packet header, and encoding each computed path as state entries of each router node of the network overlay on each respective path. The method further includes returning the computed path information to the forwarding router node.

Methods, systems, and apparatus, for automatically changing a network system. A method includes receiving a set of first intents that describe a state of a first switch fabric; receiving a set of second intents that describe a state of a second switch fabric; computing a set of network operations to perform on the first switch fabric to achieve the second switch fabric, the set of operations also defining an order in which the operations are to be executed, and the set of operations determined based on the set of first intents, the set of second intents, and migration logic that defines a ruleset for selecting the operations based on the set of first intents and the second intents; and executing the set of network operations according to the order, to apply changes to elements within the first switch fabric to achieve the state of the second switch fabric.

Techniques are disclosed for session-based routing within Open Systems Interconnection (OSI) Model Layer-2 (L2) networks extended over Layer-3 (L3) networks. In one example, L2 networks connect a first client device to a first router and a second client device to a second router. An L3 network connects the first and second routers. The first router receives, from the first client device, an L2 frame destined for the second client device. The first router generates an L3 packet comprising an L3 header specifying L3 addresses of the first and second routers, a first portion of metadata comprising L2 addresses for the first and second client devices, and a second portion of metadata comprising L3 addresses for the first and second client devices, and forwards the L3 packet to the second router. The second router recovers the L2 frame from the metadata and forwards the L2 frame to the second client device.

Techniques are disclosed for session-based routing within Open Systems Interconnection (OSI) Model Layer-2 (L2) networks extended over Layer-3 (L3) networks. In one example, L2 networks connect a first client device to a first router and a second client device to a second router. An L3 network connects the first and second routers. The first router receives, from the first client device, an L2 frame destined for the second client device. The first router generates an L3 packet comprising an L3 header specifying L3 addresses of the first and second routers, a first portion of metadata comprising L2 addresses for the first and second client devices, and a second portion of metadata comprising L3 addresses for the first and second client devices, and forwards the L3 packet to the second router. The second router recovers the L2 frame from the metadata and forwards the L2 frame to the second client device.

In a 6G network, microservices can be utilized in the absence of a core network. For example, after a mobile device has authenticated, through its carrier network, with a transport service layer, microservices can be allocated to the mobile device without having to be transmitted via the core network. Thus, removing the core network from the process can generate a direct line of microservices from the transport layer to the end-user. Furthermore, additional microservices and/or resources can be access through a microservices library. Consequently, packets can be securely transmitted be a wireless network facilitating sending packet profile data from one to many node devices in anticipation of the packet traversing the various node devices.