Patent classifications
H04L45/122
Self-Organizing Hyper Sync Network
A self-organizing mesh network system is disclosed, comprising: at least one master node generating a timing reference signal; a plurality of regular nodes deriving time synchronization from the timing reference signal; and a wireless medium for communicating location and timestamp information among the plurality of regular nodes, The plurality of regular nodes may be configured to each use communicated location and timestamp information of nearby nodes to independently generate a location map of the nearby nodes. The plurality of regular nodes may be configured to accept an additional regular node. The plurality of regular nodes may be configured to allow a node of the plurality of regular nodes to exit the plurality of regular nodes. The plurality of regular nodes may each use communicated location and timestamp information of the plurality of regular nodes to independently generate a location map of each of the plurality of regular nodes.
Self-Organizing Hyper Sync Network
A self-organizing mesh network system is disclosed, comprising: at least one master node generating a timing reference signal; a plurality of regular nodes deriving time synchronization from the timing reference signal; and a wireless medium for communicating location and timestamp information among the plurality of regular nodes, The plurality of regular nodes may be configured to each use communicated location and timestamp information of nearby nodes to independently generate a location map of the nearby nodes. The plurality of regular nodes may be configured to accept an additional regular node. The plurality of regular nodes may be configured to allow a node of the plurality of regular nodes to exit the plurality of regular nodes. The plurality of regular nodes may each use communicated location and timestamp information of the plurality of regular nodes to independently generate a location map of each of the plurality of regular nodes.
TECHNIQUES FOR SAFE ACYCLIC ROUTING IN A COMMUNICATIONS NETWORK
Safe, fast, acyclic routing in a communications network includes receiving at a local router, from a first router, a request packet that indicates a first destination value. In response to the request, it is determined whether a first entry in a routing table data structure at the local router indicates the first destination value in a destination field and a valid value in a voucher field. The local router sends to the first router a response packet with a first distance value from a distance field of the first entry only when the voucher field holds a valid value. The local router forwards the request packet to a different second router when the voucher field holds an invalid value.
TECHNIQUES FOR SAFE ACYCLIC ROUTING IN A COMMUNICATIONS NETWORK
Safe, fast, acyclic routing in a communications network includes receiving at a local router, from a first router, a request packet that indicates a first destination value. In response to the request, it is determined whether a first entry in a routing table data structure at the local router indicates the first destination value in a destination field and a valid value in a voucher field. The local router sends to the first router a response packet with a first distance value from a distance field of the first entry only when the voucher field holds a valid value. The local router forwards the request packet to a different second router when the voucher field holds an invalid value.
Network interconnect as a switch
An interconnect as a switch module (“ICAS” module) comprising n port groups, each port group comprising n−1 interfaces, and an interconnecting network implementing a full mesh topology where each port group comprising a plurality of interfaces each connects an interface of one of the other port groups, respectively. The ICAS module may be optically or electrically implemented. According to the embodiments, the ICAS module may be used to construct a stackable switching device and a multi-unit switching device, to replace a data center fabric switch, and to build a new, high-efficient, and cost-effective data center.
Network interconnect as a switch
An interconnect as a switch module (“ICAS” module) comprising n port groups, each port group comprising n−1 interfaces, and an interconnecting network implementing a full mesh topology where each port group comprising a plurality of interfaces each connects an interface of one of the other port groups, respectively. The ICAS module may be optically or electrically implemented. According to the embodiments, the ICAS module may be used to construct a stackable switching device and a multi-unit switching device, to replace a data center fabric switch, and to build a new, high-efficient, and cost-effective data center.
COMPUTING SYSTEM, COMPUTING PROCESSOR AND DATA PROCESSING METHOD
The present disclosure provides a computing system, a computing processor and a data processing method for the computing processor. The computing system includes: multiple computing clusters, each computing cluster includes multiple computing nodes, and each computing node includes multiple computing processors. At least some computing clusters among the computing clusters, at least some computing nodes in each computing cluster and at least some computing processors of each computing node are connected through direct links. Each computing processor of at least some computing processors of the computing node is configured with a local routing table, which is configured for the computing processor to determine, based on the local routing table, the next direct link through which a data packet performs routing from a data source to a data destination, and the computing processor forwards the data packet through the next direct link.
COMPUTING SYSTEM, COMPUTING PROCESSOR AND DATA PROCESSING METHOD
The present disclosure provides a computing system, a computing processor and a data processing method for the computing processor. The computing system includes: multiple computing clusters, each computing cluster includes multiple computing nodes, and each computing node includes multiple computing processors. At least some computing clusters among the computing clusters, at least some computing nodes in each computing cluster and at least some computing processors of each computing node are connected through direct links. Each computing processor of at least some computing processors of the computing node is configured with a local routing table, which is configured for the computing processor to determine, based on the local routing table, the next direct link through which a data packet performs routing from a data source to a data destination, and the computing processor forwards the data packet through the next direct link.
Flow-based load balancing
Methods and apparatuses are described for virtualizing routing of network traffic by offloading routing decisions to a controller in communication with a plurality of network devices. For load balancing applications, the controller may make up-front decisions as to both destination and route, rather than wait until traffic has been routed to a load balancing point before determining the destination.
Flow-based load balancing
Methods and apparatuses are described for virtualizing routing of network traffic by offloading routing decisions to a controller in communication with a plurality of network devices. For load balancing applications, the controller may make up-front decisions as to both destination and route, rather than wait until traffic has been routed to a load balancing point before determining the destination.