81 results about "Priority queuing" patented technology

In a complete network-in-a-box system acting as an enterprise network demarcation point, packets such as voice, video and data packets, are routed over common network connections, such as LAN and WAN. The packets are mapped from a public address field (such as an IP address) and port number to a private address field and port number, the mapping process typically being handled by a NAT (Network Address Translation). The packets are also prioritized, by marking the packets for priority queuing and routing, and configuring the bandwidths of the WAN traffic and the voice traffic to predetermined quantities and configuring the address fields of the voice devices. Simultaneous transmission of the various packets can be limited to predetermined quantities, typically by utilizing a CAC (Client Access Control). Secure firewalls are also included as well as a performance test client application that provides a defined workload generated across the WAN interface for capacity planning measurements and allows remote monitoring of the QoS (Quality of Service) data, such as latency, jitter, lost packets and MOS scores. Optionally, a simple, common remote management interface is included, allowing service providers to configure, upgrade and manage the system. Additionally, address fields can be provided to voice, video or data devices attached to a LAN port. VPN authentication and encrypted sessions can be tunneled through the firewall for access to an internal network by using a VPN terminator. For power outages and other emergency purposes, additional ports that connect to PSTN (Public Switched Telephone Network) analog telephone lines as well as other analog telephones or devices, can be provided. Another advantageous element is that most of the above components or features may be enabled or disabled.

In a telecommunications system (100), a method and apparatus for priority queuing of callers requesting an opportunity to speak during a push-to-talk call is disclosed. The method includes defining a group for a call in response to a user input (210, 410), assigning a priority level designation to the at least one participant (220, 420), and granting access to transmit speech in a push-to-talk call based on the priority level (270, 280, 290, 300). The apparatus includes a first server (150) and a second server (140) communicatively coupled to the first server. The second server is programmed to implement the steps given above.

The invention provides a multidimensional resource scheduling system and method for a cloud environment data center, belonging to the field of cloud computing. The system provided by the invention comprises a user application request submitting module, a resource status acquiring module, a resource scheduling module, an application request priority queuing module and a virtualized physical resource pool. The method provided by the invention comprises the following steps of: firstly detecting the status information of multidimensional resources in the virtualized physical resource pool and a current application request set in the user application request submitting module, which are acquired by the resource status acquiring module; then defining an application request priority queue which is suitable for the status balanced consumption of the current multidimensional resources in the virtualized physical resource pool by using a multiple-attribute-decision-making application priority scheduling algorithm; and finally submitting the application request which has the highest priority and meets resource constraints to the cloud environment data center for execution.

In certain, currently available data-storage systems, incoming commands from remote host computers are subject to several levels of command-queue-depth-fairness-related throttles to ensure that all host computers accessing the data-storage systems receive a reasonable fraction of data-storage-system command-processing bandwidth to avoid starvation of one or more host computers. Recently, certain host-computer-to-data-storage-system communication protocols have been enhanced to provide for association of priorities with commands. However, these new command-associated priorities may lead to starvation of priority levels and to a risk of deadlock due to priority-level starvation and priority inversion. In various embodiments of the present invention, at least one additional level of command-queue-depth-fairness-related throttling is introduced in order to avoid starvation of one or more priority levels, thereby eliminating or minimizing the risk of priority-level starvation and priority-related deadlock.

In one embodiment, an audio-visual content delivery system, such as a set-top box / personal video recorder system, is configured to interface with a local area network (LAN). A packet processing circuit comprised in the system may be configured to filter and route Ethernet packet data received from the LAN to specific ports and / or queues without host processor intervention. The packet processing circuit may utilize a set of filter and routing mechanisms configurable in hardware to interpret various Internet Engineering Task Force (IETF) networking transport protocols, and may transfer the packet data in a format recognized by a variety of consumer subsystems, each of which may be coupled to the decoder. The packet processing circuit may be implemented as a semiconductor device, and may allow encapsulated application data, (encapsulated using standardized encapsulation techniques), to be routed to a plurality of different types of application sinks or processors, forming a point-to-point or multi-point serial or parallel data stream over a standard transport covering numerous levels of the ISO data communications stack.

A replication priority queuing system prioritizes replication requests in accordance with a predetermined scheme. An exemplary system includes a Replication Priority Queue Manager that receives update requests and assigns a priority based upon business rules and stores the requests in associated storage means. A Replication Decision Engine retrieves the requests from storage and determines a destination for the update based upon predetermined replication rules, and sends the update to the destination.

A replication priority queuing system prioritizes replication requests in accordance with a predetermined scheme. An exemplary system includes a Replication Priority Queue Manager that receives update requests and assigns a priority based upon business rules and stores the requests in associated storage means. A Replication Decision Engine retrieves the requests from storage and determines a destination for the update based upon predetermined replication rules, and sends the update to the destination.

A method for calculating a channel access time necessary for ensuring a desired throughput for a wireless transceiver for performing channel access using priority queuing system, the method comprising: calculating a channel access time necessary for accomplishing a desired throughput with respect to the or each one of a plurality of data flows stored in a buffer corresponding to apriority queue; and setting as a common channel access time for transmitting the data flow associated with the priority queue the largest value of the calculated channel access times.

The invention discloses a packet scheduling method in high speed downlink packet access HSDPA network. The method includes: A. according to channel quality indication CQI information of priority queuing which is reported by presidial user equipment UE in current transmission time interval TTI, downlink average speed of PQ packet data transmitted to UE, data bulk of PQ packet data cache stored in RNC and scheduling priority index for PQ which is arranged by RNC, a Node B obtains PQ priority; B. the PQ priority sequence is different UE distribution radio resource, the Node B transmites packet data to UE through distributed radio resource. The method not only guaranteens system throughput and UE impartiality, but also guaranteens packet data QoS level and UE priority.

A system and method are provided for prioritizing network processor information flow in a channel service manager (CSM). The method receives a plurality of information streams on a plurality of input channels, and selectively links input channels to CSM channels. The information streams are stored, and the stored the information streams are mapped to a processor queue in a group of processor queues. Information streams are supplied from the group of processor queues to a network processor in an order responsive to a ranking of the processor queues inside the group. More explicitly, selectively linking input channels to CSM channels includes creating a fixed linkage between each input port and an arbiter in a group of arbiters, and scheduling information streams in response to the ranking of the arbiter inside the group. Finally, a CSM channel is selected for each information stream scheduled by an arbiter.

A deficit fair priority queue scheduling technique includes arranging connections in a waiting queue according to a plurality of priority classes including a first class having a higher priority than a second class. Each time a scheduler visits a queue having waiting connections, a deficit value for each priority class is initialized and used to determine how many bandwidth request packets for that class will be serviced in a round. The highest priority packets will be serviced until the deficit value for that class falls below a selected threshold or there are no remaining waiting packets of that class. Within the same round, the scheduler can service lower priority connections until the deficit value for that service class is below the threshold or there are no remaining packets of that class. Because the lower class packets have a chance of being serviced before all higher priority class packets have been serviced, the disclosed example is a deficit fair priority queuing technique.

A congestion control access gateway and a congestion control method for the same are provided. The congestion control access gateway interfaces between a broadband convergence network and a ubiquitous sensor network including sensors and terminals. The congestion control access gateway receives data from the ubiquitous sensor network. When a congestion situation has occurred, the congestion control access gateway detects the congestion situation based on data received in the congestion situation and broadcasts congestion notification and control messages in response to the congestion situation detection. The congestion control access gateway generates a congestion situation detection profile as a result of the congestion situation detection and performs priority queuing of the received data based on the congestion situation detection profile and service classes. The congestion control access gateway determines destination of the queued data using the congestion situation detection profile and routes the data to a corresponding service.

The invention discloses a physical examination control system and control method. The physical examination control system comprises an information system, a physical examination batch appointment module, a queuing module and multiple department examination modules, wherein the information system is used for storing all information of a physical examinee and allowing the information of the physical examinee to be retrieved, inquired and updated; the physical examination batch appointment module is used for making appointments on client information, physical examination dates and physical examination batches and informing the information system of the appointment information; the queuing module with dispatching priority is used for conducing automatic queuing and simultaneously receiving priority queuing information of the information system; the department examination modules are connected with corresponding examination devices in departments and used for conducting examination according to clients allocated by the queuing module, inputting results and centralizing the results into the information system for united sorting. Through the physical examination control system, automatic queuing integrating batch register and green channels can be achieved, and the physical examination control system can conduct continuous follow-up health management on the clients.

A congestion control access gateway and a congestion control method for the same are provided. The congestion control access gateway interfaces between a broadband convergence network and a ubiquitous sensor network including sensors and terminals. The congestion control access gateway receives data from the ubiquitous sensor network. When a congestion situation has occurred, the congestion control access gateway detects the congestion situation based on data received in the congestion situation and broadcasts congestion notification and control messages in response to the congestion situation detection. The congestion control access gateway generates a congestion situation detection profile as a result of the congestion situation detection and performs priority queuing of the received data based on the congestion situation detection profile and service classes. The congestion control access gateway determines destination of the queued data using the congestion situation detection profile and routes the data to a corresponding service.

This invention discloses one multi-load wave communication system channel priority lining method, which comprises the following steps: a, when user sends signal channel requirement, the system gets the user resource demands from the said demands; b, the system finds out the load wave to satisfy the user demands as prepare load wave and selects load wave with maximum priority from the prepare ones; c, selecting the time gap with maximum priority from the load wave and redispatching relative codes materials according code dispatching principle to determine the business signal value.

The invention discloses an active queue scheduling method based on QoS (Quality of Service) in a differentiated service network, comprising the following steps of: classifying businesses of a coming business grouping by a classifier according to a DSCP (Differentiated Services Code Point) domain thereof, partitioning all classified business kinds to be a real-time business kind aggregate and a non-real-time business kind aggregate; grouping and scheduling the business kind grouping of the non-real-time business kind aggregate and the real-time business kind aggregate through a self-adapting weighting polling scheduler respectively; and scheduling the scheduling groupings output by the two schedulers through a strict PQ (Priority Queuing) scheduler. The invention can not only provide dynamic band width distribution according to the practical load situation of nodes, but also efficiently ensures the time delay requirements on a real-time business.

The invention provides a method that is used for realizing a quality of service (QoS) of global key distribution in a quantum key distribution network based on trust relay. The method comprises: a service classification model of a quantum key distribution network is brought forward; and according to different requirements on global key distribution time delay by service application, the model is divided into three service types: a key-guaranteed service, a key-prioritized service and a key-best-effort service. On the basis of the service classification model, the invention provides a mechanism supporting the QoS of the quantum key distribution network; and according to the mechanism, a quantum key preengagement method is employed for the key-guaranteed service; and a hop-by-hop queuing mode is used for the key-prioritized service and the key-best-effort service as well as a priority queuing algorithm is introduced into the queue.

A method for realizing virtual network mapping comprises the steps as follows: (1) executing the priority queuing of virtual networks requiring network mapping according to the service cycles thereof, namely a virtual network with a longer service cycle has higher priority, and is queued in a front position of the queueing, and preferentially executes the network mapping; (2) sequentially extracting virtual networks with higher priority from the queueing to complete the network mapping according to a set mapping cycle; if one virtual network fails in the network mapping in own mapping cycle, the virtual network returns to the queueing and waits for a next mapping cycle to complete the network mapping; and if one virtual network fails in the network mapping in the set mapping time, and the virtual network is abandoned. The method provided by the invention achieves the efficient mapping of the virtual networks and the effective utilization of network physical resources.

A node (401) responsive to a TDMA protocol is provided. The node (401) can include a transceiver (403) and one or more processors (407) cooperatively operable with the transceiver (403). The processor (407) can be configured to facilitate receiving (413) one or more frames to be transmitted in a communication over the transceiver (403). The frame(s) can indicate a priority relative to other frames. The processor (407) can queue (415) the frame(s) in one of several queues in response to the priority. Each of the queues can correspond to a different priority. The queues are serviced (417), including processing the frame(s) in the queue(s).

In certain, currently available data-storage systems, incoming commands from remote host computers are subject to several levels of command-queue-depth-fairness-related throttles to ensure that all host computers accessing the data-storage systems receive a reasonable fraction of data-storage-system command-processing bandwidth to avoid starvation of one or more host computers. Recently, certain host-computer-to-data-storage-system communication protocols have been enhanced to provide for association of priorities with commands. However, these new command-associated priorities may lead to starvation of priority levels and to a risk of deadlock due to priority-level starvation and priority inversion. In various embodiments of the present invention, at least one additional level of command-queue-depth-fairness-related throttling is introduced in order to avoid starvation of one or more priority levels, thereby eliminating or minimizing the risk of priority-level starvation and priority-related deadlock.

The purpose of the present invention is to overcome the deficiencies of the prior art, and propose a method for digital home VOD client buffer proxy server design. Through the replacement algorithm based on weighted popularity, an effective technical means and solution are proposed to solve the network congestion and broadcast quality degradation caused by on-demand storms. Compared with other methods of the same type, the present invention mainly lies in the design of the streaming media proxy caching strategy of the home VOD client proxy caching server, and proposes a streaming media proxy caching strategy based on weighted popularity. According to the level of the weighted popularity Pi of the present invention, we can know the current popularity of a certain streaming media more accurately, and can adjust the queuing priority of the streaming media in a more timely manner, which overcomes the problem of responding to explosive requests. The network congestion caused by sluggishness increases the hit rate of the response in the cached media and increases the total time required for the user to send a request to receive the response information.

The invention discloses an automatic call distribution method based on dynamic priority queuing, which is characterized in that customers with high values are preferentially served, the resource benefit of a customer service system is improved, the customers are also avoided from waiting for a long time, and the customer satisfaction is improved. The technical scheme is that category division is performed according to the contribution degree of the customers, then the customers are placed in an ordinary queue or a priority queue based on the customer category, different priorities are divided in the priority queue, customers with the highest priority are extracted from the priority queue and preferentially served, and the customers in the ordinary queue are served according to a sequence of the waiting time. In addition, the priority queue is implemented in the form of a stack data structure, and the stack data structure of the priority queue is organized again under the condition that a customer gets into the priority queue, is extracted from the priority queue and voluntarily leaves the priority queue so as to keep a big root stack structure. The invention further provides a time-out polling mechanism so as to ensure customers waiting in a timeout manner to receive timely services.

The invention discloses a taxi queuing management method and system, and a computer readable storage medium. The method is applied to a parking lot at a transportation junction. The method comprises the following steps of when a vehicle is monitored to arrive at a parking entrance, identifying the current vehicle and verifying a current driver identity; when the current vehicle is confirmed to bea taxi and the current driver identity passes verification, making the access management equipment of a parking lot release the current vehicle, and acquiring the entry time of the current vehicle; confirming the priority queuing qualification information of the current vehicle; and according to the entry time of the current vehicle and the priority queuing qualification information, generating the online queuing information of the current vehicle so that a taxi driver can inquire the online queuing information through a terminal, wherein the online queuing information includes the order and the pre-waiting time of the current vehicle in an online taxi queuing sequence. In the invention, the online queuing of the taxi is realized, parking lot management efficiency is increased, taxi cost can be saved and a parking lot environment is improved.

Methods, systems, and computer program products for optimization of query processing in a data federation system using priority queuing techniques are provided. Priority queuing techniques may include generating a query vector corresponding to a query, comparing the query vector to historical query vectors to determine similarity, determining an expected processing time for the query based on the determined similarity, and inserting the query into a priority ordered queue at a particular position based on the expected processing time.

This invention relates to an access priority queuing method of TDD system under multiple frequency conditions including: computing the load factors of each frequency point in a multiple frequency point area to carry out point access PRI queue in terms of the magnitude of each factor and the point with the minimum load factor is the highest point of the access PRI. In the queuing, the magnitude of each up time slot load factor is computed to each point to carry out the up time slot access PRI queue and the time slot with the minimum factor is that with the highest PRI, the magnitude of the down time slot load factor of each point is computed and the down time slot PRI queue is carried out and the time slot with the minimum load factor is that with the maximum PRI.

A scheduling system for IP routers is provided. A programmable scheduler for IP routers can support single stage and multistage scheduling. This allows flexible combinations of scheduling and widens dramatically the available QoS solutions to operators. With this kind of scheduling the router can be configured to support almost any known scheduling method or combination. Priority Queuing (PQ) and Deficit Round Robin (DRR) scheduling is scheduling is used according to one embodiment of the invention.

Apparatus and methods for efficient queuing and dequeuing using segmented output buffers comprising sub-buffers and priority queues. Output buffers are monitored for empty sub-buffers. When a newly empty sub-buffer is discovered, a refill request is enqueued in a ranked priority queue wherein the rank of the destination priority queue is based on the number of empty-sub-buffers in the requesting output buffer. All high priority refill requests are dequeued before lower priority refill requests, thereby reducing the possibility of starvation. Optionally, by using simple dequeuing criteria, such as a FIFO discipline, instead of complex algorithms designed to improve fairness, system resources may be conserved thereby improving system throughput.

Apparatus and methods for efficient queuing and dequeuing using segmented output buffers comprising sub-buffers and priority queues. Output buffers are monitored for empty sub-buffers. When a newly empty sub-buffer is discovered, a refill request is enqueued in a ranked priority queue wherein the rank of the destination priority queue is based on the number of empty-sub-buffers in the requesting output buffer. All high priority refill requests are dequeued before lower priority refill requests, thereby reducing the possibility of starvation. Optionally, by using simple dequeuing criteria, such as a FIFO discipline, instead of complex algorithms designed to improve fairness, system resources may be conserved thereby improving system throughput.

A scheduling system for IP routers is provided. A programmable scheduler for IP routers can support single stage and multistage scheduling. This allows flexible combinations of scheduling and widens dramatically the available QoS (Quality of Service) solutions to operators. With this kind of scheduling the router through a scheduling configuration interface (355) to support almost any known scheduling method or combination. Priority Queuing (PQ) and Deficit Round Robin (DRR) methods are used according to one embodiment.