Patent classifications
H04L47/626
DRAGONFLY ROUTING WITH INCOMPLETE GROUP CONNECTIVITY
Systems and methods are provided for managing a data communication within a multi-level network having a plurality of switches organized as groups, with each group coupled to all other groups via global links, including: at each switch within the network, maintaining a global fault table identifying the links which lead only to faulty global paths, and when the data communication is received at a port of a switch, determine a destination for the data communication and, route the communication across the network using the global fault table to avoid selecting a port within the switch that would result in the communication arriving at a point in the network where its only path forward is across a global link that is faulty; wherein the global fault table is used for both a global minimal routing methodology and a global non-minimal routing methodology.
Method For Transmitting a Data Element Between a First Control Unit of a Vehicle and a Second Control Unit of the Vehicle, Computer-Readable Medium, System and Vehicle
A method transmits a data element between control units of a vehicle that are coupled via at least two communication channels. The first control unit determines a communication channel indicator of a first channel that is representative of available transmission resources. The first control unit receives a data element from a data source. The priority of the data element is ascertained depending on an associated vehicle application. If the communication channel indicator indicates that the available transmission resources of the first channel are insufficient for transmission of the data element and the priority of the data element is less than a predefined priority threshold value, then storing the data element in a temporary memory of the first control unit for a predefined time interval. In a different case, the data element is transmitted from the first control unit to the second control unit via assigned communication channel(s)..
LINK-BASED AUTONOMOUS CELL SCHEDULING DEVICE AND METHOD FOR IMPROVED TRAFFIC THROUGHPUT IN TSCH PROTOCOL
Disclosed is a link-based autonomous cell scheduling device including: a routing information manager that records and manages information on a node's preferred parent node and child nodes in a routing information table; a slot frame manager that generates and modifies a number of slot frames by referring to routing information in the routing information table, packet queue information, and transmission/reception result information; a slot frame schedule determiner that integrates a number of slot frames to generate one integrated slot frame corresponding to a global slot frame size and record the same in an integrated slot frame table, by referring to a link unicast slot frame table, a broadcast slot frame table, and an EB slot frame table; and a TSCH MAC layer driver that operates after checking for a cell assigned to the integrated slot frame by referring to the integrated slot frame table at the TSCH MAC layer.
Method and apparatus for processing a received sequence of data packets by removing unsuitable error correction packets from the sequence
A method of transmitting data determines a measure of consecutive packet loss in a network; a ratio of a number of data packets and a number of error correction packets is selected in dependence on the measure. A stream of data packets is generated, and a stream of error correction packets is generated in dependence on the stream of data packets such that the proportion of error correction packets generated to the data packets generated is commensurate with the selected ratio.
PRK-based scheduling for predictable link reliability
A Distributed sensing and control network includes multiple sensing/control nodes, each of which includes a controller. Each sensing/control node determines signal transmission/receipt scheduling based on a physical-ratio-k-scheduling (PRKS) protocol stored within the controller.
System and method for facilitating efficient management of non-idempotent operations in a network interface controller (NIC)
A network interface controller (NIC) capable of efficient management of non-idempotent operations is provided. The NIC can be equipped with a network interface, storage management logic block, and an operation management logic block. During operation, the network interface can receive a request for an operation from a remote device. The storage management logic block can store, in a local data structure, outcome of operations executed by the NIC. The operation management logic block can determine whether the NIC has previously executed the operation. If the NIC has previously executed the operation, the operation management logic block can obtain an outcome of the operation from the data structure and generate a response comprising the obtained outcome for responding to the request.
Algorithms for use of load information from neighboring nodes in adaptive routing
Systems and methods are provided for passing data amongst a plurality of switches having a plurality of links attached between the plurality of switches. At a switch, a plurality of load signals are received from a plurality of neighboring switches. Each of the plurality of load signals are made up of a set of values indicative of a load at each of the plurality of neighboring switches providing the load signal. Each value within the set of values provides an indication for each link of the plurality of links attached thereto as to whether the link is busy or quiet. Based upon the plurality of load signals, an output link for routing a received packet is selected, and the received packet is routed via the selected output link.
DATA PROCESSING METHOD AND APPARATUSES, DEVICES, COMPUTER-READABLE STORAGE MEDIUM, AND COMPUTER PROGRAM PRODUCT
A data processing method is performed by a receiving device. The method includes: receiving, through at least two network channels, data elements transmitted by a transmitting device, the data elements comprising delivery serial numbers; obtaining subsequent data elements of the received n.sup.th data element on the basis of the delivery serial numbers; and determining, when the subsequent data elements comprise a target data element, that a delivery result of the n.sup.th data element is discarded, a state of the target data element being a complete state, the target data element having a same data type as the data type of the n.sup.th data element, the target data element being an independent data element, the data type being determined on the basis of an effect of the data element, and a dependence degree of the independent data element on other data elements during post-processing being less than a specified degree.
System and method for facilitating hybrid message matching in a network interface controller (NIC)
A network interface controller (NIC) capable of hybrid message matching is provided. The NIC can be equipped with a host interface, a hardware endpoint, and an endpoint management logic block. The host interface can couple the NIC to a host device. The hardware endpoint can facilitate a point of communication for an application running on the host device. The endpoint management logic block can maintain a list for storing a message associated with an endpoint represented by the hardware endpoint. The endpoint management logic block can then determine whether the utilization of the list is higher than a threshold. If the utilization is higher than the threshold, the endpoint management logic block can set a state of the endpoint to indicate that the endpoint is software managed. The NIC thus can transfer the control of the endpoint from the hardware endpoint to a software process of the host device.
System and method for facilitating data-driven intelligent network
Data-driven intelligent networking systems and methods are provided. The system can accommodate dynamic traffic with fast, effective congestion control. The system can maintain state information of individual packet flows, which can be set up or released dynamically based on injected data. Each flow can be provided with a flow-specific input queue upon arriving at a switch. Packets of a respective flow can be acknowledged after reaching the egress point of the network, and the acknowledgement packets can be sent back to the ingress point of the flow along the same data path. As a result, each switch can obtain state information of each flow and perform flow control on a per-flow basis.