Longest-prefix matching dynamic allocation in communications network
AssigneeMicrosoft Technology Licensing, LLC
InventorColin Tregenza Dancer
Life of this patent
Estimating the term…
Abstract
A method performed by a node of a communications network such as a virtual routing function or policy enforcement node comprises receiving at least one packet, such as an internet protocol packet having an associated address and obtaining one or more metrics. The method involves dynamically configuring a longest-prefix match process on the basis of at least the metric(s). The dynamically configured longest-prefix match process is used with the associated address to identify an action and the identified action is applied to the packet.
Claims20
A method for internet protocol address matching performed by a node of a communications network, the node implemented on a computing device comprising a processor and memory, the method comprising:
- obtaining one or more metrics associated with the node or communications network;
- configuring a longest-prefix match process based on the one or more metrics;
- processing a first packet having an associated internet protocol address, the processing comprising:
- executing the longest-prefix match process on the associated internet protocol address;
- identifying one of a plurality of actions based on the execution of the longest-prefix match process;
- and
- applying the identified action of the plurality of actions to the first packet;
- dynamically reconfiguring the longest-prefix match process based on updates to the one or more metrics;
- wherein:
- the dynamically reconfiguring comprises updating a data structure storing prefixes for the longest-prefix match process;
- and
- the data structure is updated atomically;
- and
- processing a second packet using the dynamically reconfigured longest-prefix match process.
A communications network node comprising:
- one or more processors;
- and
- a memory in communication with the one or more processors, the memory having computer-readable instructions stored thereupon that, when executed by the one or more processors, cause the communications network node to perform operations comprising:
- processing a first packet having an associated internet protocol address, the processing comprising:
- using a first longest-prefix match process and the associated internet protocol address to identify an action of a plurality of actions;
- applying the action to the first packet;
- dynamically reconfiguring the first longest-prefix match process on the basis of one or more metrics, wherein:
- the dynamically reconfiguring comprises updating a data structure storing prefixes for the first longest-prefix match process and the plurality of actions;
- and
- the data structure is updated atomically.
A communications network comprising:
- a management node and a plurality of communications network nodes;
- the management node and communications network nodes comprising:
- a processor and a memory storing instructions which when executed by at least the processor, cause the communications network to perform operations comprising:
- executing a first process and a second process, the first process being carried out at a faster rate than the second process, wherein the first process comprises:
- receiving at least one packet having an associated address;
- using a longest-prefix match process and the associated address to identify an action;
- and
- applying the action to the packet;
- and wherein the second process comprises:
- obtaining one or more metrics;
- and
- dynamically configuring the longest-prefix match process on the basis of at least the obtained metrics;
- and
- sending instructions to the communications network nodes according to an overall dynamic configuration of the longest-prefix match process;
- wherein:
- the dynamically configuring comprises updating a data structure storing prefixes for the longest-prefix match process;
- and
- the data structure is updated atomically.
Dependencies are inferred from the claim text.