Generally discussed herein are systems, devices, and methods for data management in a reverse content data network (rCDN). A component of the rCDN may include a memory to hold content received from a first sensor device of a plurality of sensor devices of the rCDN and first attributes that describe properties of the content. The component may include processing circuitry to receive second content from a second sensor device of the plurality of sensor devices, the second content including a plurality of second attributes that describe properties of the second content, and forward, in response to a determination, based on the first and second attributes, that there is insufficient space to store the second content on the memory, the second content to a node of the rCDN that is fewer hops away from a backend cloud than the component.

Provided is a machine-implemented method of operating a device, comprising entering the device into a membership relation with a first self-organizing subnet at a first rank in a hierarchy of subnets of the network; receiving at the device a message from a second device making known parameters of a second subnet at a second rank in the hierarchy of subnets of the network; and responsive to receipt of the message, sending a message from the first device making known parameters of the first subnet at the first rank to the second device to render the subnet at the second rank operable to merge with the subnet at the first rank.

The disclosed systems and methods provide hyperscalar packet processing. A method includes receiving a plurality of network packets from a plurality of data paths. The method also includes arbitrating, based at least in part on an arbitration policy, the plurality of network packets to a plurality of packet processing blocks comprising one or more full processing blocks and one or more limited processing blocks. The method also includes processing, in parallel, the plurality of network packets via the plurality of packet processing blocks, wherein each of the one or more full processing blocks processes a first quantity of network packets during a clock cycle, and wherein each of the one or more limited processing blocks processes a second quantity of network packets during the clock cycle that is greater than the first quantity of network packets. The method also includes sending the processed network packets through data buses.

A method for synchronizing topology information in a service function chain (SFC) network, where the SFC network includes at least one classifier (CF) and at least one service function forwarder (SFF). The method includes that a first network element in the at least two routing network elements establishes a Border Gateway Protocol (BGP) connection to at least one second network element other than the first network element in the at least two routing network elements, where the first network element is any one of the at least two routing network elements, and the first network element sends a first BGP update message to the at least one second network element, where the first BGP update message includes topology information of the first network element such that the at least one second network element obtains the topology information of the first network element.

An interconnection network for a processing unit having an array of cores. The interconnection network includes routers and adaptable links that selectively connect routers in the interconnection network. For example, each router may be electrically connected to one or more of the adaptable links via one or more multiplexers and a link controller may control the multiplexers to selectively connect routers via the adaptable links. In another example, adaptable links may be formed as part of an interposer and the link controller selectively connect routers via the adaptable links in the interposer using interposer switches. The adaptable links enable the interconnection network to be dynamically partitioned. Each of those partitions may be dynamically reconfigured to form a topology.

Aspects of the present disclosure relate to page locality based memory access request processing in a network-on-chip (NoC) architecture. In an example implementation, the proposed method includes determining, at an arbitrator, while selecting a NoC agent from a plurality of NoC agents for request processing for a forthcoming round, if current NoC agent of current round is processing a packet stream and if said packet stream is completely processed at the end of said current round, wherein processing of the packet stream enables cluster requests to be processed at same part of said memory and enhances page locality; and re-selecting, at said arbitrator, said current NoC agent as the NoC agent for the forthcoming round if said packet stream processing is not completed at the end of said current round, so as to enable said current NoC agent to complete processing of said packet stream in said forthcoming round.

In one aspect, a method of a multi-tenancy router to manage a wireless network comprising executing on a processor the following steps. With a port-based multi-tenancy router, assign a set of different behaviors to different ports for wireless network access management of a wireless network. With at least one computer processor, a set of behaviors related to a user of one or more wireless networks are determined. A list of the currently-available ports of the multi-tenancy router is generated. One or more behaviors of each port of the list of currently-available ports are assigned.

An example programmable integrated circuit (IC) includes a processor, a plurality of endpoint circuits, a network-on-chip (NoC) having NoC master units (NMUs), NoC slave units (NSUs), NoC programmable switches (NPSs), a plurality of registers, and a NoC programming interface (NPI). The processor is coupled to the NPI and is configured to program the NPSs by loading an image to the registers through the NPI for providing physical channels between NMUs to the NSUs and providing data paths between the plurality of endpoint circuits.

Techniques and mechanisms for interconnecting network circuitry of an integrated circuit (IC) die and physical layer (PHY) circuits of the same IC die. In an embodiment, nodes of the network circuitry include first routers and processor cores, where the first routers are coupled to one another in an array configuration which includes rows and columns. First interconnects each extend to couple both to a corresponding one of the PHY circuits and to a corresponding one of the first routers. For each of one or more of the first interconnects, a respective one or more rows (or one or more columns) of the array configuration extend between the corresponding PHY and the corresponding router. In another embodiment, the network circuitry comprises network clusters which each include a different respective row of the array configuration.

A method, an apparatus and a system for controlling routing information advertising are provided, which relate to the field of communications and are used for reducing the configuration complexity and reinforcing the operability. The method includes: receiving, by a control device, first routing information sent by a first forwarding device; wherein the first routing information includes an identifier of the first forwarding device; determining a first routing path according to the identifier of the first forwarding device, an identifier of a second forwarding device and a routing path group; and determining an advertising range of second routing information for the second forwarding device according to the first routing path; for enabling the second forwarding device to advertise the second routing information according to the advertising range of the second routing information.