Systems, methods, and computer-readable media for scaling a source network. A system may be configured to receive a network configuration for a source network, wherein the source network comprising a plurality of nodes, receive and a scale target for a scaled network, and identify, based on the scale target, one or more selected nodes in the plurality of nodes in the source network for implementing in the scaled network. The system may further be configured to reconfigure data plane parameters and control plane parameters for each node in the one or more selected nodes.

One embodiment provides a system that facilitates dynamic adjustment of forwarding information in a CCN. During operation, the system receives, by forwarding circuitry, an interest with a name that is a hierarchically structured variable length identifier which comprises contiguous name components ordered from a most general level to a most specific level. The system identifies in a first data structure an entry for one or more name components of the name, wherein the entry includes a list of outgoing interfaces associated with the one or more name components. The system determines network properties in response to forwarding the interest to a first interface of the list. The system reorders the list in order of priority based on the network properties, thereby facilitating the forwarding circuitry to dynamically adjust a likelihood of using a respective interface for forwarding interests associated with the one or more name components.

An apparatus includes a memory storing a table including packet identification information and information indicating a process corresponding to the packet identification information, a unit to search for a process corresponding to packet identification information of a received packet from the table, a unit to acquire table candidates that have different types and in which all packets identified by new identification information for a packet and existing identification information for a packet are retrievable from the table candidates, based on the existing packet identification information and the new packet identification information when a addition request of a new entry including the new identification information for a packet is received, and a unit to select a table used for a search among the table candidates based on the number of packet identification information stored in each of the table candidates.

A lookup-table type TL-TCAM hardware search engine includes a SL decoder, a TL-TCAM array, and the data stored in the TL-TCAM hardware search engine is obtained by performing lookup table operation in the corresponding TCAM hardware search engine, the SL decoder is used to decode the search word and send it to the TL-TCAM hardware search engine array, and the decoding is to convert a search word SL corresponding to data in a TCAM hardware search engine table into a search word LSL corresponding to TL-TCAM hardware search engine table data, the effect is that TCAM adds a decoder, cooperates with the decoder and by lookup table method converts the TCAM table data to a new circuit unit that can be adapted to the added search line.

Disclosed are a method for message match table lookup, a system, a non-transitory computer-readable storage medium and a terminal. The method for message match table lookup includes: performing on-demand data bit width compression on information of a specified part of an input message; extracting N groups of data from compressed data, performing intra-group data comparison to obtain N groups of comparison results, and performing true value splicing on the N groups of comparison results, where N is an integer greater than 1; performing match searching of a ternary content addressable memory (TCAM) by using the true value splicing result as a keyword; and searching, according to a match hit result of the TCAM, for an Action Random Access Memory (Action RAM), and outputting, by the Action RAM, a table lookup request.

A method for use in a communication network is provided. The method comprises the steps of: (i) providing a plurality of network processing units (NPU's) comprised in the communication network; (ii) establishing a replication of at least one of the NPU's; (iii) virtually arranging the NPU's and the replication(s) in a ring configuration; (iv) associating a unique primary virtual identification and a corresponding unique backup virtual identification with each active and available entity selected from among the plurality of NPU's and replication(s); (v) establishing a list of hash values, each associated with the primary virtual identification or the backup virtual identification of a corresponding active and available entity; (vi) implementing a ring consistent hashing algorithm for carrying out a search resolution for a consistent hashing; and (vii) in a case of a change in an active and available entity having a certain primary virtual identification, using the corresponding backup virtual identification to maintain the ring continuity.

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.

This application provides a traffic classification method and apparatus. The method includes: determining, based on distribution characteristics of concerned bits of a plurality of rules in a first rule set, an effective bit corresponding to the first rule set; determining a hash key value of each rule based on a value of the effective bit of each rule in the first rule set, and storing each rule in the first rule set in at least one of S storage units based on the hash key value, where the first rule set is any one of N rule sets, the N rule sets are stored in the S storage units; and when traffic classification is performed, searching for a corresponding rule in each of the S storage units based on a hash key value of a search key.

A switch for transmitting digital data in the form of frames, each frame having an identification field and being of a first type conforming to an ARINC 664 P7 type protocol or of a second type conforming to an IEEE 802 type protocol. The switch comprising a plurality of input ports, a plurality of output ports, and a configuration table comprising for each identification value of the transmission parameters of the frames having this identification value.

The switch is able to switch each frame between an input port and at least one output port exclusively on the basis of the transmission parameters corresponding to the identification value of this frame in the configuration table, independently of the type of this frame.

Techniques to facilitate a hardware based table look of a table maintained in or more types of memories or memory domains include examples of receiving a search request forwarded from a queue management device. Examples also include implementing table lookups to obtain a result and sending the result to an output queue of the queue management device for the queue management device to forward the result to a requestor of the search request.