A method of aggregating a plurality of packet based communication channels is provided by the system. The communication channels connect two common endpoints, and aggregation devices are present at each endpoint to implement an aggregation policy. The system provides a dynamic aggregation system where m aggregation policy is employed on a per packet flow basis. Packet flows can be classified by application type, so that an appropriate aggregation policy can be used for packets belonging to the flow. The selected aggregation policy is used for each flow within the aggregation devices at each endpoint.

An apparatus for controlling network traffic is provided. The apparatus includes: a data object service providing module generating a data check service frame; a message service providing module generating a data transmission service frame; a frame delay module adjusting a generation period of the data check service frame generated by the data object service providing module; a traffic analysis module comparing a data transmission amount of the data transmission service frame generated by the message service providing module with a reference data transmission amount, wherein the traffic analysis module determines a generation period of the data check service frame according to a comparison result, and controls the operation of the frame delay module according to a determined generation period; and a transmit queue transmitting a service frame transmitted from the traffic analysis module to a control area network open (CANopen) network.

A frame collision rate calculation method for a frame on a CAN bus, and a CAN bus resource minimization method are provided. The CAN bus resource minimization method includes: S1, setting an initial CAN bus communication rate; S2, according to the preset rate in step S1 and an Erlang B formula in the queuing theory, calculating a frame collision rate of each priority; S3, determining whether the frame collision rate of each priority calculated in step S2 exceeds an allowable frame collision rate upper limit; if so, increasing the CAN bus communication rate, and returning to step S2; and if not, decreasing the CAN bus communication rate, and returning to step S2; and S4, outputting a minimum communication rate corresponding to the frame collision rate of a frame of each priority that does not exceed the allowable frame collision rate upper limit.

There is provided a frame transfer apparatus, which includes: a storage unit configured to store an address and a port in association with the address; a receiving unit configured to receive a frame; a switch unit configured to determine an output port based on a destination address of a received frame; and a transmitting unit configured to transmit the received frame, from the output port determined by the switch unit, wherein the switch unit includes a copying unit configured to copy the received frame when the destination address of the received frame has not been stored in the storage unit, and a rate control unit configured to control an output rate of a frame to be copied.

Technologies are generally described to assignment of communication devices heuristically to green relays in a wireless network. According to some examples, a first device pair that includes a source device and a destination device assigned to a green relay among multiple green relays may be detected. A second device pair that includes another source device and destination device assigned to the green relay may also be detected. Data rates of the first device pair and the second device pair may be compared to select one of the first or second device pairs as a low traffic pair with a minimum data rate. A search among the green relays may then be executed to locate another green relay to assign the low traffic pair. The low traffic pair may be assigned to the other green relay in order to reduce an average traffic load of the original green relay.

A method for data communication between a first node and a second node over a number of data paths coupling the first node and the second node includes transmitting messages between the first node and the second node over the number of data paths including transmitting a first subset of the messages over a first data path of the number of data paths, and transmitting a second subset of the messages over a second data path of the number of data paths. The first data path has a first latency and the second data path has a second latency substantially larger than the first latency, and messages of the first subset of the messages are chosen to have first message characteristics and messages of the second subset are chosen to have second message characteristics, different from the first message characteristics.

A method for data communication between a first node and a second node over a data paths coupling the first node and the second node includes transmitting messages between the first node and the second node over the data paths including transmitting at least some of the messages over a first data path using a first communication protocol, and transmitting at least some of the messages over a second data path using a second communication protocol and determining that the first data path is altering a flow of messages over the first data path due to the messages being transmitted using the first communication protocol, and in response to the determining, adjusting a number of messages sent over the data paths including decreasing a number of the messages transmitted over the first data path and increasing a number of messages transmitted over the second data path.

A method for data communication from a first node to a second node over a data channel coupling the first node and the second node includes receiving data messages at the second node, the messages belonging to a set of data messages transmitted in a sequential order from the first node, sending feedback messages from the second node to the first node, the feedback messages characterizing a delivery status of the set of data messages at the second node, including maintaining a set of one or more timers according to occurrences of a number of delivery order events, the maintaining including modifying a status of one or more timers of the set of timers based on occurrences of the number of delivery order events, and deferring sending of said feedback messages until expiry of one or more of the set of one or more timers.

A method for modifying redundancy information associated with encoded data passing from a first node to a second node over data paths includes receiving first encoded data including first redundancy information at an intermediate node from the first node via a first channel connecting the first node and the intermediate node, the first channel having first channel characteristics and transmitting second encoded data including second redundancy information from the intermediate node to the second node via a second channel connecting the intermediate node and the second node, the second channel having second channel characteristics. A degree of redundancy associated with the second redundancy information is determined by modifying the first redundancy information based on one or both of the first channel characteristics and the second channel characteristics without decoding the first encoded data.

A method for data communication between a first node and a second node over a data path coupling the first node and the second node includes transmitting a segment of data from the first node to the second node over the data path as a number of messages, the number of messages being transmitted according to a transmission order. A degree of redundancy associated with each message of the number of messages is determined based on a position of said message in the transmission order.