Patent classifications
H04L45/36
Inband group-based network policy using SRV6
The present technology pertains to a group-based network policy using Segment Routing over an IPv6 dataplane (SRv6). After a source application sends a packet, an ingress node can receive the packet, and if the source node is capable, it can identify an application policy and apply it. The ingress node indicates that the policy has been applied by including policy bits in the packet encapsulation. When the packet is received by the egress node, it can determine whether the policy was already applied, and if so, the packet is forward to the destination application. If the egress node determines that the policy has not be applied the destination application can apply the policy. Both the ingress node and egress nodes can learn of source application groups, destination application groups, and applicable policies through communication with aspects of the segment routing fabric.
Distributed anticipatory bidirectional packet steering for software network functions
A method for anticipatory bidirectional packet steering involves receiving, by a first packet steering module of a network, a first encapsulated packet traveling in a forward traffic direction. The first encapsulated packet includes a first encapsulating data structure. The network includes two or more packet steering modules and two or more network nodes. Each of the packet steering modules includes a packet classifier module, a return path learning module, a flow policy table, and a replicated data structure (RDS). The return path learning module of the first packet steering module generates return traffic path information associated with the first encapsulated packet and based on the first encapsulating data structure. The first packet steering module updates the RDS using the return traffic path information and transmits the return traffic path information to one or more other packet steering modules.
Data processing method and apparatus
Embodiments of this application provide a data processing method and apparatus. The method includes: parsing, by a user plane data processing network element, a received packet and determining first service type information of a data flow to which the packet belongs; obtaining, by the user plane data processing network element, second service type information of the data flow from a data analysis network element; and processing, by the user plane data processing network element, the data flow based on the first service type information and the second service type information. With the data processing method and apparatus disclosed herein, accuracy in identifying a service type of transmitted data can be improved.
PACKET SENDING METHOD AND APPARATUS, AND STORAGE MEDIUM
A first network device of a plurality of network devices is provided. The first network device is configured to receive a first data packet from a second site; search a flow table stored in the first network device for a target flow entry whose flow identifier is of a first data flow, each entry comprises a flow identifier and a corresponding outbound interface identifier, the target flow entry is created when the first site sends a second data flow to the second site, a source address of the second data flow is a destination address of the first data flow, and a destination address of the second data flow is a source address of the first data flow; and if the target flow entry is found, send the first data packet through an interface corresponding to an outbound interface identifier in the target flow entry.
INBAND GROUP-BASED NETWORK POLICY USING SRV6
The present technology pertains to a group-based network policy using Segment Routing over an IPv6 dataplane (SRv6). After a source application sends a packet, an ingress node can receive the packet, and if the source node is capable, it can identify an application policy and apply it. The ingress node indicates that the policy has been applied by including policy bits in the packet encapsulation. When the packet is received by the egress node, it can determine whether the policy was already applied, and if so, the packet is forward to the destination application. If the egress node determines that the policy has not be applied the destination application can apply the policy. Both the ingress node and egress nodes can learn of source application groups, destination application groups, and applicable policies through communication with aspects of the segment routing fabric.
Reverse Forwarding Information Base Enforcement
In exemplary embodiments of the present invention, a router determines whether or not to establish a stateful routing session based on the suitability of one or more candidate return path interfaces. This determination is typically made at the time a first packet for a new session arrives at the router on a given ingress interface. In some cases, the router may be configured to require that the ingress interface be used for the return path of the session, in which case the router may evaluate whether the ingress interface is suitable for the return path and may drop the session if the ingress interface is deemed by the router to be unsuitable for the return path. In other cases, the router may be configured to not require that the ingress interface be used for the return path, in which case the router may evaluate whether at least one interface is suitable for the return path and drop the session if no interface is deemed by the router to be suitable for the return path.
GENERATING PACKETS IN A REVERSE DIRECTION OF A SERVICE FUNCTION CHAIN
Embodiments are directed to receiving an original packet at a service function; determining, for a reverse packet, a reverse service path identifier for a previous hop on a service function chain; determining, for the reverse packet, a service index for the reverse service path identifier; and transmitting the reverse packet to the previous hop on the service function chain.
SYSTEMS AND METHODS FOR PROVIDING A TOPOLOGY OF A WIRELESS NETWORK
A distribution of a content selection being distributed throughout a wireless mesh network may be tracked. A wireless device in the wireless mesh network enables the content selection to be exchanged. Wireless devices then exchange the content, and a network topology is recorded in response. Finally, the network topology is reported to a reporting agent.
CHAINING OF NETWORK SERVICE FUNCTIONS IN A COMMUNICATION NETWORK
In an apparatus of a communication network first packets of a data flow in a first direction are acquired, each having a first service chain identifier identifying a first chain of services which have been applied to the first packets in the first direction of the data flow. The first service chain identifier represents a classification result of classification functions used for selecting the first chain of services. Based on the first service chain identifier, a packet filter is calculated, which is associated with a second chain of services to be applied to second packets of the data flow in a second direction of the data flow when the second packets enter the communication network in the second direction.
Route optimization for on-demand routing protocols for mesh networks
Various embodiments implement a set of low overhead mechanisms to enable on-demand routing protocols. The on-demand protocols use route accumulation during discovery floods to discover when better paths have become available even if the paths that the protocols are currently using are not broken. In other words, the mechanisms (or “Route Optimizations”) enable improvements to routes even while functioning routes are available. The Route Optimization mechanisms enable nodes in the network that passively learn routing information to notify nodes that need to know of changes in the routing information when the changes are important. Learning routing information on up-to-date paths and determining nodes that would benefit from the information is performed, in some embodiments, without any explicit control packet exchange. One of the Route Optimization mechanisms includes communicating information describing an improved route from a node where the improved route diverges from a less nearly optimal route.