A method for communicating in real-time to users of a provider of Internet access service, without requiring any installation or set-up by the user, that utilizes the unique identification information automatically provided by the user during communications for identifying the user to provide a fixed identifier which is then communicated to a redirecting device. Messages may then be selectively transmitted to the user. The system is normally transparent to the user, with no modification of its content along the path. Content then may be modified or replaced along the path to the user. For the purposes of establishing a reliable delivery of bulletin messages from providers to their users, the system forces the delivery of specially-composed World Wide Web browser pages to the user, although it is not limited to that type of data.

A novel design of a gateway that handles traffic in and out of a network by using a datapath pipeline is provided. The datapath pipeline includes multiple stages for performing various data-plane packet-processing operations at the edge of the network. The processing stages include centralized routing stages and distributed routing stages. The processing stages can include service-providing stages such as NAT and firewall. The gateway caches the result previous packet operations and reapplies the result to subsequent packets that meet certain criteria. For packets that do not have applicable or valid result from previous packet processing operations, the gateway datapath daemon executes the pipelined packet processing stages and records a set of data from each stage of the pipeline and synthesizes those data into a cache entry for subsequent packets.

Some embodiments provide a method for handling failure at one of several peer centralized components of a logical router. At a first one of the peer centralized components of the logical router, the method detects that a second one of the peer centralized components has failed. In response to the detection, the method automatically identifies a network layer address of the failed second peer. The method assumes responsibility for data traffic to the failed peer by broadcasting a message on a logical switch that connects all of the peer centralized components and a distributed component of the logical router. The message instructs recipients to associate the identified network layer address with a data link layer address of the first peer centralized component.

A method of routing a packet in a network is described. The network includes a plurality of nodes implementing Information Centric Networking (ICN) routing or content centric networking and routing. The method includes receiving the packet at a node implementing ICN routing, the packet comprising an Internet Protocol (IP) header and a packet payload, wherein the packet comprises a request packet for requesting content from the network. The method further includes extracting from the packet payload a content identifier for the requested content and forwarding the packet to a next hop node in the network based on the content identifier extracted from the packet payload.

A method is implemented by a network device to optimize the operation of a virtual private network (VPN) route refresh for border gateway protocol (BGP). The method reduces a span of VPN databases to be traversed to perform a route target constraint (RTC) update at the network device. The method includes receiving an RTC add or delete from a BGP peer, looking up each route target (RT) in a route target-route distinguisher (RT-RD) map to get a set of route distinguishers (RDs), and generating a VPN update for each VPN Address Family (AF) and each RD in the RD cache and sending the VPN update to a respective BGP peer.

A multicast data packet processing method performed by an intermediate node of a multicast tree includes: receiving a first Bit Index Explicit Replication (BIER) packet including a first label; obtaining, according to the first label, a second label corresponding to a multicast tree including the intermediate node; and obtaining a second BIER packet according to the second label and the first BIER packet, and sending the second BIER packet which includes the second label.

A method and a traffic processing unit (200) for handling traffic in a communication network when the traffic is distributed across a set of traffic processing units. When receiving a packet of a traffic flow distributed to said traffic processing unit, the traffic processing unit (200) assigns a packet class to the received packet, which class can be active or inactive in the traffic processing unit. The traffic processing unit obtains state information of the assigned packet class. If the packet class is detected as active the state information is retrieved from a local storage (200C) in the traffic processing unit, and if the packet class is detected as inactive the state information is fetched from a central storage (204). The traffic processing unit then performs stateful packet processing of the received packet based on the obtained state information.

Systems and techniques for information centric network (ICN) approximate computation caching are described herein. For example, an interest packet that includes a feature set of input data may be received. A node may then perform a search of a local data store using the feature set to determine an approximate computation result cached in the local data store. Here, the approximate computation result may be based on input data that differs from the input data named in the interest packet. The node may then return the approximate computation result to an author of the interest packet in response to the search.

An example cache-coherent packetized network system includes: a home agent; a snooped agent; and a request agent configured to send, to the home agent, a request message for a first address, the request message having a first transaction identifier of the request agent; where the home agent is configured to send, to the snooped agent, a snoop request message for the first address, the snoop request message having a second transaction identifier of the home agent; and where the snooped agent is configured to send a data message to the request agent, the data message including a first compressed tag generated using a function based on the first address.

Described are programmable IO devices configured to perform operations. These operations comprise: determining a set of range-based elements for a network; sorting the set of range-based elements according to a global order among the range-based elements; generating an interval table from the sorted range-based elements; generating an interval binary search tree from the interval table; propagating data stored in subtrees of interior stages of the interval binary search tree to subtrees of a last stage of the interval binary search tree such that the interior stages do not comprise data; converting the interval binary search tree to a Pensando Tree; compressing multiple levels of the Pensando Tree into cache-lines; and assembling the cache-lines in the memory unit such that each stage can compute an address of a next-cache line to be fetched by a next stage.