In general, techniques are described for steering data traffic for a subscriber session from a network interface of a wireless access gateway to an anchoring one of a plurality of forwarding units of the wireless access gateway using a layer 2 (L2) address of the data traffic. For example, a wireless access gateway for a wireless local area network (WLAN) access network is described as having a decentralized data plane that includes multiple forwarding units for implementing subscriber sessions. Each forwarding unit may present a network interface for sending and receiving network packets and includes packet processing capabilities to enable subscriber data packet processing to perform the functionality of the wireless access gateway. The techniques enable steering data traffic for a given subscriber session to a particular one of the forwarding units of the wireless access gateway using an L2 address of the data traffic.

The disclosed distributed task coordination ensures task execution while minimizing both the risk of duplicate execution and resources consumed for coordination. Execution is guaranteed, while only best efforts are used to avoid duplication. Example solutions include requesting, by a node, a first lease from a first set of nodes; based at least on obtaining at least one first lease, requesting, by the node, a second lease from a second set of nodes; based at least on the node obtaining at least one second lease, determining a majority holder of second leases; and based at least on obtaining the majority of second leases, executing, by the node, a task associated with the at least one second lease. In some examples, the nodes comprise online processing units (NPUs). In some examples, if a first node begins executing the task and fails, another node automatically takes over to ensure completion.

The present disclosure provides a global communication network system based on a micro base station and edge computing, including at least one micro base station. Each micro base station includes an edge computing center, a business network element and a micro base station access network. The comprehensive carrying capability of a wireless network, the regional resource sharing capability, the computing capability of an access terminal, the flexible application capability of the access terminal and user experience of extremely low delay are improved.

A data flow is received at a network processor that includes a plurality of frames. A first set of frames in the plurality of frames are passed from the network processor to a general processor for processing by the general processor. A flow acceleration request is received at the network processor from the general processor based at least in part on inspection of a first frame in the first set of frames. The flow acceleration request is received subsequent to passing at least two of the first set of frames to the general processor. A particular frame in the plurality of frames received subsequent to the first set of frames is processed by the network processor such that it is accelerated relative to processing of the first set of frames by the general processor and bypasses the general processor.

Exemplary methods for performing service chaining include generating a plurality of service chaining (SC) next hops (NHs) by, for each SC NH hop, generating a plurality of SC maps, each SC map identifying a chain of one or more service modules, wherein each service module is to apply a corresponding service on a packet. The methods further include generating a plurality of hosted NHs, each hosted NH including forwarding information that causes the packet to be forwarded to a corresponding service module. The methods further include in response to receiving a first packet, identifying a SC NH of the plurality of SC NHs based on an Internet Protocol (IP) address of the first packet, and forwarding the first packet to a service module based on the identified SC NH.

The disclosed distributed task coordination ensures task execution while minimizing both the risk of duplicate execution and resources consumed for coordination. Execution is guaranteed, while only best efforts are used to avoid duplication. Example solutions include requesting, by a node, a first lease from a first set of nodes; based at least on obtaining at least one first lease, requesting, by the node, a second lease from a second set of nodes; based at least on the node obtaining at least one second lease, determining a majority holder of second leases; and based at least on obtaining the majority of second leases, executing, by the node, a task associated with the at least one second lease. In some examples, the nodes comprise online processing units (NPUs). In some examples, if a first node begins executing the task and fails, another node automatically takes over to ensure completion.

The present disclosure provides a global communication network system based on a micro base station and edge computing, including at least one micro base station. Each micro base station includes an edge computing center, a business network element and a micro base station access network. The comprehensive carrying capability of a wireless network, the regional resource sharing capability, the computing capability of an access terminal, the flexible application capability of the access terminal and user experience of extremely low delay are improved.

The disclosed distributed task coordination ensures task execution while minimizing both the risk of duplicate execution and resources consumed for coordination. Execution is guaranteed, while only best efforts are used to avoid duplication. Example solutions include requesting, by a node, a first lease from a first set of nodes; based at least on obtaining at least one first lease, requesting, by the node, a second lease from a second set of nodes; based at least on the node obtaining at least one second lease, determining a majority holder of second leases; and based at least on obtaining the majority of second leases, executing, by the node, a task associated with the at least one second lease. In some examples, the nodes comprise online processing units (NPUs). In some examples, if a first node begins executing the task and fails, another node automatically takes over to ensure completion.

The disclosed distributed task coordination ensures task execution while minimizing both the risk of duplicate execution and resources consumed for coordination. Execution is guaranteed, while only best efforts are used to avoid duplication. Example solutions include requesting, by a node, a first lease from a first set of nodes; based at least on obtaining at least one first lease, requesting, by the node, a second lease from a second set of nodes; based at least on the node obtaining at least one second lease, determining a majority holder of second leases; and based at least on obtaining the majority of second leases, executing, by the node, a task associated with the at least one second lease. In some examples, the nodes comprise online processing units (NPUs). In some examples, if a first node begins executing the task and fails, another node automatically takes over to ensure completion.

The disclosed distributed task coordination ensures task execution while minimizing both the risk of duplicate execution and resources consumed for coordination. Execution is guaranteed, while only best efforts are used to avoid duplication. Example solutions include requesting, by a node, a first lease from a first set of nodes; based at least on obtaining at least one first lease, requesting, by the node, a second lease from a second set of nodes; based at least on the node obtaining at least one second lease, determining a majority holder of second leases; and based at least on obtaining the majority of second leases, executing, by the node, a task associated with the at least one second lease. In some examples, the nodes comprise online processing units (NPUs). In some examples, if a first node begins executing the task and fails, another node automatically takes over to ensure completion.