Patent classifications
H04L45/122
File control for data packet routers using consensus and inter-planetary file system (IPFS)
Packet routers route data packets based on existing topology files. The packet routers hash the existing topology files into content-addressed objects and exchange the content-addressed objects. One of the routers modifies its topology file into a new topology file, hashes the new topology file into a new content-addressed object, and transfers the new content-addressed object to the other packet routers. The packet routers exchange the content-addressed objects, and in response, exchange the topology files. The routers establish a consensus on the new topology file based on the existing topology files. The one packet router routes additional data packets based on the new topology file in response to the consensus. In some examples, the content-addressed objects comprise Inter-Planetary File System (IPFS) objects.
HIGHLY RELIABLE PATH ACCOMMODATION DESIGN APPARATUS AND METHOD
Accommodation design for wavelength and sub-λ paths in a communication network is performed. If sub-λ path accommodation is possible according to search for a wavelength path present in a single-hop logical route, the accommodation in the wavelength path is executed. If sub-λ path accommodation is possible according to search for a wavelength path present in a multi-hop logical route, a logical route is selected based on the wavelength path and the sub-λ path is accommodated in the wavelength path. Additionally, each physical route suitable for the sub-λ path accommodation is searched for. If the route can accommodate a wavelength path set in a single-hop logical route by available wavelength allocation, the sub-λ path is accommodated in the wavelength path. Furthermore, routes in consideration of overlapping of nodes, pipelines, and links and operation rate are selected based on information about the start and end nodes of each of redundant routes.
DATA CENTER RESELECTION
An initial data center is selected to host the online conference. This data center can be selected based on the locations of the participants, a weighting (or ‘priority’) of the participants, or a combination of the two (e.g., locations that are weighted by the participant's priority.) Typically, the data center closest to the centroid (i.e., geometric center, or ‘center of mass’) of the participants is selected. In anticipation that participants will join and/or leaver the conference, a list is calculated that each possible change to a respective data center that will be selected if that change occurs. This list may be distributed to the data centers that, if selected, would host the online conference.
Pre-filtering of traffic subject to service insertion
The disclosure provides an approach for pre-filtering traffic in a logical network. One method includes receiving, by a hypervisor, a packet from a virtual computing instance (VCI) and determining a service path for the packet based on a service table. The method further includes setting, by the hypervisor, a pre-filter component as a next hop for the packet based on the service path. The method further includes receiving, by the pre-filter component, the packet. The method further includes making a determination, by the pre-filter component, of whether the packet requires processing by the security component. The method further includes performing, by the pre-filter component, based on the determination, one of: forwarding the packet to its destination and bypassing the security component; or forwarding the packet to the security component.
Pre-filtering of traffic subject to service insertion
The disclosure provides an approach for pre-filtering traffic in a logical network. One method includes receiving, by a hypervisor, a packet from a virtual computing instance (VCI) and determining a service path for the packet based on a service table. The method further includes setting, by the hypervisor, a pre-filter component as a next hop for the packet based on the service path. The method further includes receiving, by the pre-filter component, the packet. The method further includes making a determination, by the pre-filter component, of whether the packet requires processing by the security component. The method further includes performing, by the pre-filter component, based on the determination, one of: forwarding the packet to its destination and bypassing the security component; or forwarding the packet to the security component.
Automatic clustering for self-organizing grids
A cluster of nodes, comprising: a plurality of nodes, each having a security policy, and being associated task processing resources; a registration agent configured to register a node and issue a node certificate to the respective node; a communication network configured to communicate certificates to authorize access to computing resources, in accordance with the respective security policy; and a processor configured to automatically dynamically partition the plurality of nodes into subnets, based on at least a distance function of at least one node characteristic, each subnet designating a communication node for communicating control information and task data with other communication nodes, and to communicate control information between each node within the subnet and the communication node of the other subnets.
Electronic device and control method thereof
An electronic device and a control method thereof are provided. The electronic device includes an Internet protocol (IP) address corresponding to a domain name of a web page when a user command inputting the domain name is received, identifies a number of hops included in a network path connecting a server corresponding to the obtained IP address and the electronic device to each other, and determines that a man-in-the-middle attack exists in a network when a communication connection with the server is established on the basis of a smaller number of hops than the identified number of hops.
SYSTEM AND METHOD FOR DETERMINING THE SHORTEST DATA TRANSFER PATH IN DATA COMMUNICATION
A system accesses a set of devices transferring a data element from a source device to a destination device. The system determines a transformation type implemented on the data element at each device. The system generates an array that uniquely defines the data element at each device. The array comprises the transformation type and an identifier of the device. The system generates a transformation dependency map that represents a set of transformation types implemented on the data element at different devices. The system determines a set of data transfer paths for the data element from the source device to the destination device based on the transformation dependency map. The system selects the shortest data transfer path for the data element that corresponds to the least number of hops between devices. The system communicates the data element from the source device to the destination device using the shortest data transfer path.
SYSTEM AND METHOD FOR DETERMINING THE SHORTEST DATA TRANSFER PATH IN DATA COMMUNICATION
A system accesses a set of devices transferring a data element from a source device to a destination device. The system determines a transformation type implemented on the data element at each device. The system generates an array that uniquely defines the data element at each device. The array comprises the transformation type and an identifier of the device. The system generates a transformation dependency map that represents a set of transformation types implemented on the data element at different devices. The system determines a set of data transfer paths for the data element from the source device to the destination device based on the transformation dependency map. The system selects the shortest data transfer path for the data element that corresponds to the least number of hops between devices. The system communicates the data element from the source device to the destination device using the shortest data transfer path.
Datapath for multiple tenants
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.