Patent classifications
H04L47/621
METHOD AND SYSTEM FOR FACILITATING LOSSY DROPPING AND ECN MARKING
Methods and systems are provided for performing lossy dropping and ECN marking in a flow-based network. 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 are acknowledged after reaching the egress point of the network, and the acknowledgement packets are 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 per-flow packet dropping and ECN marking.
QUALITY OF SERVICE MANAGEMENT SYSTEM FOR A COMMUNICATION NETWORK
A quality of service management system includes a rules engine that receives information associated with a communication path having an assigned quality of service (QoS) to be provided for a customer communication device, and identifies one or more network elements assigned to provide the communication path. Each network element having a plurality of queues configured to provide varying QoS levels relative to one another. For each of the network elements, the rules engine determines at least one queue that is configured to provide the communication path at the assigned quality of service, and transmits queue information associated with the determined queue to its respective network element, the network element conveying the communication path through the determined queue.
THROTTLING QUEUE FOR A REQUEST SCHEDULING AND PROCESSING SYSTEM
Various methods and systems for implementing request scheduling and processing in a multi-tenant distributed computing environment are provided. Requests to utilize system resources in the distributed computing environment are stored in account queues corresponding to tenant accounts. If storing a request in an account queue would exceed a throttling threshold such as a limit on the number of requests stored per account, the request is dropped to a throttling queue. A scheduler prioritizes processing requests stored in the processing queue before processing requests stored in the account queues. The account queues can be drained using dominant resource scheduling. In some embodiments, a request is not picked up from an account queue if processing the request would exceed a predefined hard limit on system resource utilization for the corresponding tenant account. In some embodiments, the hard limit is defined as a percentage of threads the system has to process requests.
Medium access control circuit, data processing method, and related device
A medium access control circuit includes a processor, N hardware queues, and an interface circuit, where the N hardware queues are divided into a plurality of hardware queue groups. Where the first hardware queue group corresponds to a network property of the data frame based on a first mapping relationship, the first hardware queue corresponds to a service type of the data frame based on a second mapping relationship, the first mapping relationship includes mappings from network properties to hardware queue groups, and the second mapping relationship includes mappings from a plurality of service types to a plurality of hardware queues in the hardware queue group corresponding to the network property of the data frame; and then, the interface circuit sends the data frame from the N hardware queues through a radio channel.
Quality of service management system for a communication network
A quality of service management system includes a rules engine that receives information associated with a communication path having an assigned quality of service (QoS) to be provided for a customer communication device, and identifies one or more network elements assigned to provide the communication path. Each network element having a plurality of queues configured to provide varying QoS levels relative to one another. For each of the network elements, the rules engine determines at least one queue that is configured to provide the communication path at the assigned quality of service, and transmits queue information associated with the determined queue to its respective network element, the network element conveying the communication path through the determined queue.
Downstream frame transfer device, transfer method and transfer program
A transfer device includes: a frame information acquisition unit configured to monitor downstream frames between host devices and OLTs and calculate a statistical value of the downstream frames per a fixed cycle; a frame storage unit configured to store the downstream frames in a plurality of queues; a frame sorting unit configured to input the downstream frames to the queues; and a distribution control unit configured to determine the number of frames to be sequentially input to the queues and increase the number of distributed frames of at least one of the host devices input to an OLT, the OLT having a smaller value of a total number of frames input from all the host devices than a maximum number of rounded frames obtained by dividing a value of a total number of frames input until the frames of all the host devices take turns around the plurality of queues by the number of OLTs. As a result, a delay requirement can be satisfied while a memory size of the queue and power consumption required for the frame sorting process are reduced.
TAG-BASED DATA PACKET PRIORITIZATION IN DUAL CONNECTIVITY SYSTEMS
A component of a cellular communication system is configured to prioritize data packets based on packet tags that have been associated with the data packets. The packet tags may comprise an application identifier and a customer identifier, as examples. A Packet Data Convergence Protocol (PDCP) layer of a radio protocol stack receives a data packet and associated packet tags and assigns the data packet to a preferred transmission queue or a non-preferred transmission queue, based on the packet tags associated with the data packet. In order to manage queue overflows, data packets of the non-preferred transmission queue may be discarded when they have been queued for more than a predetermined length of time. Data packets of the preferred transmission queue, however, are retained regardless of how long they have been queued.
Convergence sublayer for use in a wireless broadcasting system
A method of encapsulating data and a single frequency network configured to perform the method are disclosed. A content stream of data packets is received, and the data packets in the content stream are formatted in accordance with a first protocol. Information identifying a container size established for the content stream is received. The data packets formatted in accordance with the first protocol are fragmented and packed to form data units formatted in accordance with a second protocol, and the data units are sized based on the container size. The data units formatted in accordance with the second protocol are encapsulated to form second protocol data packets. The second protocol data packets are provided to a transmitter that is synchronized to one or more transmitters in a single frequency network so that each transmitter in the single frequency network broadcasts a same signal that includes the second protocol data packets.
System and method of wireless communication using destination based queueing
A method and system for communication between devices includes connecting a plurality of communication devices through a communication system. At least one communication device acts as a source entity sending a plurality of data packets to an access point. A plurality of communication devices act as destination entities receiving the data packets. The data packets are distributed, by the access point, to the destination entities in such a way that the data packets are queued for receipt by each destination entity in a separate non-interdependent queue.
Source-based queue selection mechanism in the routing environment
The invention is directed to a method and system for selecting queues for source-based queuing in a packet router, requiring only one flow per destination route. The invention stores source interface information for each packet while it is being processed. The invention applies to packet routers including IP routers, Ethernet routers and Label Switched Routers (LSR).