Patent classifications
H04L47/6215
SYSTEM AND METHOD FOR CONGESTION CONTROL USING A FLOW LEVEL TRANSMIT MECHANISM
A system for congestion control using a flow level transmit mechanism is disclosed. In some embodiments, the system comprises a source SFA and a receive SFA. The source SFA is configured to detect and classify a congestion notification packet (CNP) generated based on congestion in a network; select a receive block from a plurality of receive blocks based on the CNP; forward the CNP to a dedicated congestion notification queue of the receive block; identify a transmit queue from a plurality of transmit blocks based on processing the congestion notification queue, wherein the transmit queue originated a particular transmit flow causing the congestion; and stop the transmit queue.
QoS management for multi-user and single user EDCA transmission mode in wireless networks
A communication method in a communication network comprising a plurality of nodes, at least one node comprising a plurality of traffic queues for serving data traffic at different priorities, each traffic queue being associated with a respective queue backoff value computed from respective queue contention parameters having first and second values in, respectively, a first and a second contention modes, obtaining quality of service requirements of data stored in a traffic queue of the node; checking whether the quality of service requirements can be fulfilled when accessing the communication channel using the second contention mode; if the requirements cannot be fulfilled as the result of the checking, disabling access to resource units provided by the other node within one or more transmission opportunities granted to the other node on the communication channel; and transmitting data stored in the traffic queue using the first contention mode.
ADVERTISING NETWORK LAYER REACHABILITY INFORMATION SPECIFYING A QUALITY OF SERVICE FOR AN IDENTIFIED NETWORK FLOW
Methods, apparatus and articles of manufacture for advertising network layer reachability information specifying a quality of service for an identified network flow are disclosed. Example methods disclosed herein to specify quality of service for network flows include receiving network layer reachability information including a first quality of service class specified for a first network flow, the network layer reachability information having been advertised by a first network element that is to receive the first network flow. Such example methods can also include updating an incoming packet determined to belong to the first network flow to indicate that the incoming packet belongs to the first quality of service class, the incoming packet being received from a second network element. Such example methods can further include, after updating the incoming packet, routing the incoming packet towards the first network element.
COMMUNICATION CONTROL DEVICE AND METHOD FOR CONTROLLING COMMUNICATION CONTROL DEVICE
A communication control device stores reception data received from a network in any one of a plurality of reception queues to which different priorities have been given in advance to transfer the reception data to a main memory. The communication control device includes a reference table and a selection unit. In the reference table, at least one of a source address, a destination address, and an Ethernet frame type of the reception data to be stored is defined for at least one of the plurality of reception queues. The selection unit selects a reception queue in which the reception data is to be stored with reference to the reference table using at least one of the source address, the destination address, and the Ethernet frame type of the reception data.
Dynamic resource allocation aided by reinforcement learning
A communication system in which DRA control is aided by RL. An example embodiment may control one or more buffer queues populated by downstream and/or upstream data streams. The egress rates of the buffer queues can be dynamically controlled using an RL technique, according to which a learning agent can adaptively change the state-to-action mapping function of the DRA controller while circumventing the RL exploration phase and relying on extrapolation of the already taken actions instead. This feature may result in at least two benefits: (i) cancellation of a performance penalty typically associated with RL exploration; and (ii) faster learning of the environment, as the learning agent can determine the performance metrics of many actions per state in a single occurrence of the state. In an example embodiment, the communication system may be a DSL system, a PON system, or a wireless communication system.
LOW COMPLEXITY ETHERNET NODE (LEN) ONE PORT
A network interface module for coupling a host device to a switched network as a network node is described. The network interface module comprises a single half-duplex port for communicatively coupling to a shared bus of the switched network, at least one frame queue sized to store one multicast read frame received via the shared bus, and logic circuitry. The logic circuitry is configured to decode a read command for the interface module included in a payload of the multicast read frame that includes multiple read commands for other network nodes of the switched network, and transmit a response frame including read data on the shared bus when detecting the shared bus is available for transmitting.
Forwarding Information Obtaining Method and Apparatus
A forwarding information obtaining device and method, the method including obtaining, by a first device in response to congestion in a first queue, a service parameter identifier of a first packet buffered in the first queue, where the service parameter identifier indicates a parameter used to forward the first packet, and performing, by the first device, a first operation based on the service parameter identifier, where the first operation is performed to relieve the congestion of the first queue.
DATA TRANSMISSION CIRCUIT
A data transmission circuit includes a data sending module and a data receiving module. The data sending module includes a message identification unit, used for sending messages to corresponding encapsulation units according to a priority of message data to be sent; a low-priority message encapsulation unit, used for slicing low-priority messages, encapsulating message slices respectively to form low-priority message slice packets, and then sending the low-priority message slice packets to a low-priority sending queue; a high-priority message encapsulation unit, used for encapsulating high-priority messages to form high-priority message packets and then sending the high-priority message packets to a high-priority sending queue; and a message sending unit, used for sending message packets in the high-priority sending queue and the low-priority sending queue, and preferentially processing the high-priority sending queue. The data receiving module includes a message parsing and distributing unit, a low-priority message receiving unit, and a high-priority message receiving unit.
Slow eNodeB/HNB identification and impact mitigation
A method and computer readable medium for identifying slow base stations and providing impact mitigation are described. In one embodiment, the method includes detecting that a first base station, using a first queue, is slow, wherein a slow base station is a base station that that cannot keep up with the rate at which a core node is generating update messages over a prolonged period; providing a slow base station queue; and moving the first base station from the first queue to the slow base station queue.
Packet transfer apparatus, method, and program
A packet transfer apparatus is configured to perform packet exchange processing for exchanging multiple continuous packets with low delay while maintaining fairness between communication flows of the same priority level. The packet transfer apparatus includes: a packet classification unit; queues that holds the classified packets for each classification; and a dequeue processing unit that extracts packets from the queues. The dequeue processing unit includes a scheduling unit that controls the packet extraction amount extracted from the queue for a specific communication flow based on information on the amount of data that is requested by the communication flow and is to be continuously transmitted in packets.