H04L12/743

SELECTIVE DISTRIBUTION OF ROUTING INFORMATION

A distributed system for collecting and processing packet routing information is provided. A service provider, such as a content delivery network service provider, can maintain multiple Points of Presence (“POPs”). Routing computing devices associated with each POP can forward information about the packet routing information to a packet routing management component. The packet routing component can process the information provided by the various POPs. The packet routing component can then update, or otherwise modify, packet routing information used by one or more of the POPs. Accordingly, the packet routing management component can then selectively distribute the updated or modified packet routing information, including the distribution to all POPs, the targeted distribution to specific POPs and the creation of centrally accessible routing information.

MULTI-DOMAIN CENTRALIZED CONTENT-CENTRIC NETWORKING
20170230290 · 2017-08-10 ·

A multi-domain centralized content-centric networking (MCCN), including: a management layer; a control layer; and a data layer. The management layer communicates with the data layer through the control layer. The management layer is configured to acquire application transmission requests, network resource allocation, and network running status, and give network operating commands to a control plane according to reconfiguration of management strategies. The control layer is configured to carry out routing establishment, maintain network topology of domains, inform the management layer of network status, and execute commands of the management layer. The data layer is configured to process data packet according to commands of the control layer. The task of the data layer is completed by a router and link of the bottom layer.

METHOD FOR MONITORING ELEMENTS OF A DISTRIBUTED COMPUTING SYSTEM
20170230449 · 2017-08-10 ·

In an embodiment, a method for monitoring elements of a distributed computing system is disclosed. In the embodiment, the method involves evaluating a metric event from a monitored element based on at least one of tags and conditions of the monitored element by applying declared group functions corresponding to declared groups over the metric event and at least one of admitting the monitored element into membership of a declared group, evicting the monitored element from membership of a declared group, and maintaining membership of the monitored element in a declared group based on the evaluation of the metric event.

Method and system for fast and large-scale longest prefix matching
09729669 · 2017-08-08 · ·

Various exemplary embodiments relate to a method and related network node including one or more of the following: receiving, at the first network device, a message to be forwarded; determining a destination address for the message; determining whether the destination address is assigned to the first network device; if the destination address is not assigned to the first network device, querying a second network device for a next hop of the destination address; receiving, in response to the query, an indication of the next hop for the destination address; and forwarding, by the first network device in response to the indication of the next hop, the message to the next hop.

High speed packet processing using a distributed hash table
09729444 · 2017-08-08 · ·

In one embodiment, forwarding information with respect to a particular data packet is requested from a distributed hash table (DHT) that stores key-network flow information pairs. A plurality of nodes in a network participate in the DHT, each node locally stores network flow information as dictated by a hashing function of the DHT, and the network flow information can be used to process data packets in the network. Then, forwarding information is received from the DHT indicating a destination node of the plurality of nodes to which the particular data packet should be forwarded according to the hashing function of the DHT. The destination node stores network flow information that corresponds to the particular data packet. Finally, the particular data packet is forwarded toward the destination node in order for the particular data packet to be processed using the network flow information stored at the destination node.

Communication device and communication control method
09729445 · 2017-08-08 · ·

A collision detection unit detects whether a first entry that is associated with a value obtained by hashing a first MAC address is present in each area in a MAC address table and detects whether a second entry that is associated with a value obtained by hashing a second MAC address is present in each area in the MAC address table. If the first entry is present in each of the areas, a collision avoidance control unit acquires the second MAC address stored in the first entry that is present in one of the areas and inputs the second MAC address in the collision detection unit. If the second entry is not present in any of the areas in the MAC address table, a registration unit stores the second MAC address in the second entry and stores the first MAC address in the first entry.

SYSTEM AND METHOD FOR ALLOWING MULTIPLE GLOBAL IDENTIFIER (GID) SUBNET PREFIX VALUES CONCURRENTLY FOR INCOMING PACKET PROCESSING IN A HIGH PERFORMANCE COMPUTING ENVIRONMENT
20170223153 · 2017-08-03 ·

System and method for using multiple global identification subnet prefix values in a network switch environment in a high performance computing environment. A packet is received from a network fabric by a first Host Channel Adapter (HCA). The packet has a header portion including a destination subnet prefix identifying a destination subnet of the network fabric. The network HCA is allowed to receive the first packet from a port of the network HCA by selectively determining a logical state of a flag and, selectively in accordance with a predetermined logical state of the flag, ignoring the destination subnet prefix identifying the destination subnet of the network fabric.

Hash-based forwarding in content centric networks

A method implemented by a network element (NE), comprising obtaining a first mapping between a first content name identifying a content data in a content centric network (CCN) and a first hash value of at least a portion of the first content name, wherein the first content name comprises a character string in a hierarchical namespace, receiving, via a receiver of the NE, an initial packet comprising an initial hash value from the CCN, determining, via a processor the NE, that the initial hash value in the received initial packet matches the first hash value in the obtained first mapping, replacing, via the processor, the initial hash value in the received initial packet with the first content name in the matched first mapping to produce a translated initial packet, and forwarding, via a transmitter of the NE, the translated initial packet comprising the first content name to a connected end host.

Information processing system, information processing apparatus and control method of information processing system
09774532 · 2017-09-26 · ·

In an information processing system including a plurality of information processing apparatuses, a first information processing apparatus includes a first memory to store a first destination information table in which destination information and specific destination information are associated, and a first processing circuit to calculate a hash value based on destination information included in a first packet, to search the first destination information table, to select a second information processing apparatus based on the hash value, to generate a second packet by adding the hash value and specifying information, to transmit the second packet to the second information processing apparatus. The second information processing apparatus includes a second memory to store a second destination information table and a second processing circuit to receive the second packet, and to transmit to a destination represented by the specific destination information a third packet converted the second packet.

Efficient longest prefix matching techniques for network devices

A network address associated with a packet is obtained at a search engine of a network device. The search engine includes a plurality of Bloom filters that represent prefixes of respective lengths in the routing table. Respective Bloom filters are applied to respective prefixes of the network address to determine a set of one or more prefixes for which a match potentially exists in the routing table. A number of accesses to the memory are performed using prefixes in set of prefixes, beginning with a longest prefix and continuing in decreasing order of prefix lengths until a matching entry is found in the routing table, and routing information for the packet is retrieved. If the number of performed memory accesses exceeds a threshold, the routing table is adapted to reduce a number of memory accesses to be performed for subsequent packets associated with the network address.