H04L12/743

MAPPING BETWEEN CLASSICAL URLs AND ICN NETWORKS
20170302576 · 2017-10-19 ·

A method for routing a request for content from a content provider through an IPv6 network is described, the IPv6 network being an information centric network (ICN) in which content is directly addressed using at least a portion of an IPv6 address. The method includes receiving, at an IPv6 network, a request for content, determining that the request does not comprise an ICN address. The method further includes intercepting the request, and translating the request into an IPv6 address in which at least a portion of the address is directed to or associated with the piece of content. Systems and methods described herein address problems arising from the interaction between IP and ICN networking models.

FORWARDING PORT ASSIGNMENT FOR DATA PACKET
20170302577 · 2017-10-19 ·

In some examples, a method includes determining a hash value for a received data packet, determining whether the determined hash value matches a hash value for an entry in a hash-to-port mapping table, determining whether a port mapping age associated with the matched entry satisfies an age criteria, and assigning a forwarding port for the received data packet based on the determination of whether the port mapping age associated with the matched entry satisfies the age criteria.

CHANNEL BONDING TECHNIQUES IN A NETWORK
20170302379 · 2017-10-19 ·

A method of virtually bonding together at least two physical channels in an optical network terminal (ONT) of a passive optical network (PON) can include receiving, via the ONT, a plurality of frames from a network device, classifying, using a processor of the ONT, the plurality of frames into one of a plurality of services, assigning the service to the at least two physical channels of the ONT, wherein each of the at least two physical channels is associated with a respective laser of the ONT to transmit at a respective wavelength, and transmitting, toward an optical line terminal, the plurality of frames of the service using at least one of the at least two physical channels during an assigned time slot.

EARLY FREEING OF A SNOOP MACHINE OF A DATA PROCESSING SYSTEM PRIOR TO COMPLETION OF SNOOP PROCESSING FOR AN INTERCONNECT OPERATION
20170293559 · 2017-10-12 ·

In at least one embodiment, a multiprocessor data processing system includes multiple vertical cache hierarchies supporting a plurality of processor cores, a system memory, and an interconnect fabric. In response to a first cache memory snooping on the interconnect fabric a request of an interconnect operation of a second cache memory, the first cache memory allocates a snoop machine to service the request. Responsive to the snoop machine completing its processing of the request and prior to the first cache memory receiving a systemwide coherence response of the interconnect operation, the first cache memory allocates an entry in a data structure to handle completion of processing for the interconnection operation and deallocates the snoop machine. The entry of the data structure protects transfer of coherence ownership of a target cache line from the first cache memory to the second cache memory during a protection window extending at least until the systemwide coherence response is received.

Distributed storage system, control apparatus, client terminal, load balancing method and program
09787585 · 2017-10-10 · ·

A distributed storage system includes: a plurality of servers that store data that is associated with key information, respectively; a packet forwarding apparatus that, on receipt of a new packet that contains the key information and is addressed to one of the plurality of servers, requests a control apparatus to decide a forwarding destination from among the plurality of servers; and the control apparatus. The control apparatus includes: a forwarding destination selection section that decides a forwarding destination of the packet based on key information in a header part of the packet; and an entry setting section that sets, in a packet forwarding apparatus(es) on a path to the forwarding destination, a flow entry for forwarding a subsequent packet(s) with same key information to the forwarding destination. The packet forwarding apparatus(es) forwards a packet(s) with the same key information to the forwarding destination using the set flow entry.

Location-based network routing
09787586 · 2017-10-10 · ·

Apparatus and method for routing packets in a computer network. A network switch for routing packets in a computer network includes a plurality of ports for communicative connection of computing devices to the switch, and routing logic. The routing logic is configured to extract, from a packet received via a first of the ports, a destination address that identifies a destination device to which the packet is directed; to extract from the destination address a switch ID value and a port ID value; to compare the switch ID value extracted from the destination address to a switch ID value identifying the network switch; and to transmit the packet via a second of the ports of the network switch corresponding to the port ID value based on the switch ID value extracted from the destination address being equal to the switch ID value identifying the network switch.

Methods and systems for transmitting packets through an aggregated connection

The present invention discloses methods and systems for transmitting a received packet at a first network node through an aggregated connection. The first network node determines session information of the received packet and determines whether a new tunnel needs to be selected for transmitting the received packet. When a new tunnel needs to be selected, a hash result is determined. The hash result is substantially based on the session information and the number of available tunnels. A first tunnel is determined for transmitting the received packet according to the hash result. The session information and tunnel ID of the first tunnel is then stored in a first database. The received packet is transmitted through the first tunnel. When a new tunnel need not be selected, a lookup is performed to determine a tunnel ID substantially based on the session information. The received packet is transmitted through the determined tunnel.

TECHNOLOGIES FOR NETWORK I/O ACCESS
20170289036 · 2017-10-05 ·

Technologies for accelerating non-uniform network input/output accesses include a multi-home network interface controller (NIC) of a network computing device communicatively coupled to a plurality of non-uniform memory access (NUMA) nodes, each of which include an allocated number of processor cores of a physical processor package and an allocated portion of a main memory directly linked to the physical processor package. The multi-home NIC includes a logical switch communicatively coupled to a plurality of logical NICs, each of which is communicatively coupled to a corresponding NUMA node. The multi-home NIC is configured to facilitate the ingress and egress of network packets by determining a logical path for each network packet received at the multi-home NIC based on a relationship between one of the NUMA nodes and/or a logical NIC (e.g., to forward the network packet from the multi-home NIC) coupled to the one of the NUMA nodes. Other embodiments are described herein.

METHOD, SYSTEM, AND APPARATUS FOR FORWARDING NETWORK TRAFFIC USING MINIMAL FORWARDING INFORMATION BASES

The disclosed computer-implemented method for forwarding network traffic using minimal Forwarding Information Bases (FIBS) may include (1) identifying a Routing Information Base (RIB) that includes a set of routes that define paths to destinations both inside and outside a network and then (2) creating a FIB that includes a subset of active routes whose size is below a size threshold by (A) importing, from the set of routes within the RIB, (I) internal routes that define paths to destinations inside the network, (II) high-traffic external routes that define paths to destinations outside the network, and (III) a default route that defines a path to a default node that facilitates resolution of traffic that does not match any of the internal or high-traffic external routes and (B) excluding, from the FIB, low-traffic external routes that define paths to destinations outside the network. Various other methods, systems, and apparatuses are also disclosed.

Protocol-independent receive-side scaling
09755972 · 2017-09-05 · ·

A system and method for protocol independent receive side scaling (RSS) includes storing a plurality of RSS hash M-tuple definitions, each definition corresponding to one of a set of possible protocol header combinations for routing an incoming packet, the set of possible protocol header combinations being modifiable to include later-developed protocols. Based on initial bytes of the incoming packet, a pattern of protocol headers is detected, and used to select one of the plurality of RSS hash M-tuple definitions. The selected RSS hash M-tuple definition is applied as a protocol-independent arbitrary set of bits to the headers of the incoming packet to form a RSS hash M-tuple vector, which is used to compute a RSS hash. Based on the RSS hash, a particular queue is selected from a set of destination queues identified for the packet, and the packet is delivered to the selected particular queue.