98 results about "Queue management system" patented technology

A method optimizes performance in a data network including a plurality of ingress ports and output queues. Ingress rates of a plurality of flows are monitored, where each flow includes a sequence of packets passing from an ingress port to an output queue and each flow has a profile related to flow characteristics. Each packet is marked with a marking based on criteria including the ingress flow rate and the flow profile. A drop probability of each packet is adjusted at an output queue according to a value of a drop function taken as a function of a queue size. The drop function is selected according to the marking on the packet. The drop functions are zero for queue sizes less than a lower threshold range and positive for queue sizes greater than the lower threshold range. By selecting drop functions according to ingress flow rate measurements and flow profiles, the data network can be optimized for overall system performance.

There is disclosed method of management of electric vehicle charging station (EVCS) queues and an EVCS queue management system. The method includes limiting access to the EVCS to an individual at the top of an EVCS queue during a changeover time. The changeover time may be predetermined or may be generated based upon data pertaining to the management of the queue and / or to the vehicle of the user at the top of the queue. If the user at the top of the queue fails to activate the EVCS during the changeover time, the next in line in the queue will be given a changeover time in which to reach the EVCS. If the queue is otherwise empty, the user at the top of the queue will be notified that the EVCS is no longer reserved, and that anyone may use the EVCS.

The invention provides a queue management system and method for controlling the movement of a group of one or more people through a virtual queue line for a service. The system comprises registration means (50) for registering the group, the registration means comprising an information carrier (52) bearing a registration code and at least one ID tag (54) including ID details for the member(s) of the group. The registration means associates the registration code with an indication of group size and uniquely with the ID details. The system further comprises interface means (48) for enabling communications to and from the group, and a processor (32, 34) associated with the interface means and responsive to a communication from the group including a communicator address and the registration code for generating a registration record for the group representing the group size, the ID details and the communicator address. The processor is arranged to receive a communication from the group requesting access to the virtual queue and to monitor the place of the group in the queue line and then trigger a summons signal when the group approaches or reaches the head of the queue line. The interface means is responsive to the summons signal for initiating a communication to the communicator address for summoning the group to the service. Access control apparatus (22) at the service reads the at least one ID tag and compares the ID details with the registration record in order to evaluate whether access to the service should be permitted or prevented.

This disclosure relates to methods and systems for queuing traffic in packet-switched networks. In one of many possible embodiments, a queue management system includes a plurality of queues and a priority module configured to assign incoming packets to the queues based on priorities associated with the incoming packets. The priority module is further configured to drop at least one of the packets already contained in the queues. The priority module is configured to operate across multiple queues when determining which of the packets contained in the queues to drop. Some embodiments provide for hybrid queue management that considers both classes and priorities of packets.

Methods and apparatus providing, controlling and managing a dynamically sized, highly scalable and available server farm are disclosed. A Virtual Server Farm (VSF) is created out of a wide scale computing fabric (“Computing Grid”) which is physically constructed once and then logically divided up into VSFs for various organizations on demand. Each organization retains independent administrative control of a VSF. A VSF is dynamically firewalled within the Computing Grid. Allocation and control of the elements in the VSF is performed by a control plane connected to all computing, networking, and storage elements in the computing grid through special control ports. The internal topology of each VSF is under control of the control plane. A request queue architecture is also provided for processing work requests that allows selected requests to be blocked until required human intervention is satisfied.

A method, system, and program for expert hold queue management are provided. A call is received at a call center. The call is placed on hold in a hold queue until a representative of the call center is available to answer the call. While on hold in the hold queue, the call is transferred to an expert. In particular, the call may be transferred to a second hold queue within the first hold queue if the expert is not immediately available. Experts may include freelance experts, query based experts, and emergency response experts. Then, responsive to detecting the call at the top of the call queue, the caller is notified of an availability of a representative. The caller may select to remain with the expert or transfer to the representative.

Disclosed are a queue management system and a method of managing a queue. This system and method are for use with a parallel processing system including a plurality of clients and a plurality of processors. The clients receive messages and transmit the messages to a shared queue for storage, and the processors retrieve messages from the shared queue and process said messages. The queue management system includes a mirror queue for maintaining a copy of each message transmitted to the shared queue by one of the clients; and the queue management system stores to the mirror queue, a copy of each message transmitted to the shared queue by that one of the clients. The mirror queue provides the system with continuity in case of an outage of the shared queue. In the event of such an outage, each instance of an application can simply discontinue using the shared queue and process requests from the mirror queue. The mirror queue is used until the shared queue is once again available. Preferably, the copy of each message transmitted to the mirror queue is provided with a reference, such as a poiner, to the location of the message on the shared queue.

An ATM switch supporting multicast transmissions and efficient transmission of frames. A cell is received on a multicast connection and transmitted on several branches / ports. Instead of copying a multicast cell several times for each output branch, only one copy of each multicast cell is maintained. The cell order and the stored cell data form a physical queue. Several logical queues are maintained, one for each output branch. In one embodiment, linked lists are used to maintain the queues. A cell in the physical queue is deleted after all logical queues traverse that cell. A shared tail pointer is used for all the logical queues to minimize additional processing and memory requirements due to the usage of logical queues. The queues enable cells forming a frame to be buffered until the end of frame cell is received, which provides for efficient handling of frames.

In a packet-queue management system, a bandwidth allocation approach fairly addresses each of n flows that share the outgoing link of an otherwise congested router. According to an example embodiment of the invention, a buffer at the outgoing link is a simple FIFO, shared by packets belonging to the n flows. A packet priority-reduction (e.g., packet dropping) process is used to discriminate against the flows that submit more packets / sec than is allowed by their fair share. This packet management process therefore attempts to approximate a fair queuing policy. The embodiment is advantageously easy to implement and can control unresponsive or misbehaving flows with a minimum overhead.

The disclosed embodiments of the invention relate to a method and system of communication for a confined area of a facility. Personal identification information is received in at least one of a set of stations distributed throughout the confined area. Attraction reservation information is received relating to at least one attraction to request at least one reservation for a guest. The reservation information is stored.

The present disclosure describes a method for managing theme park ride lines by providing an identifying device to a guest, the device configured to uniquely identify the guest, using the identifying device to ascertain an amount of time a guest spends at a predetermined location and reducing the amount of time a guest spends in a line queue for a predetermined ride by the amount of time the guest spends at the predetermined location. A system for managing theme park ride lines is also provided.

An arbiter (7) is provided for a QMS having multiple queue users (5A to 5D), each having real time requirements for mastership of a bus (31). The arbiter (7) is arranged so that the amount of time that each queue user (5A to 5D) can gain bus access is a percentage of the total bus time.

Some embodiments provide a queue management system that efficiently and dynamically manages multiple queues that process traffic to and from multiple virtual machines (VMs) executing on a host. This system manages the queues by (1) breaking up the queues into different priority pools with the higher priority pools reserved for particular types of traffic or VM (e.g., traffic for VMs that need low latency), (2) dynamically adjusting the number of queues in each pool (i.e., dynamically adjusting the size of the pools), (3) dynamically reassigning a VM to a new queue based on one or more optimization criteria (e.g., criteria relating to the underutilization or overutilization of the queue).

Methods, wireless communication terminals, and queue management system are disclosed that operate electronically accessible queues, such as customer service queues. A wireless communications terminal is used to obtain a queue ticket from a ticket machine. The queue ticket indicates that a ticket client has been entered a queue associated with the ticket machine. The queue ticket is stored in the wireless terminal. The queue ticket in the wireless terminal is validated via a near-field communications protocol wireless interface between the wireless terminal and the ticket machine. Service for the ticket client is authorized in response to validation of the queue ticket and movement of the ticket client to a threshold level within the queue.

The invention provides a data visualisation system comprising a data value memory in which is maintained a finite set of data values obtained from monitoring apparatus and a display configured to display a representation of each data value centered on respective data points. The invention also provides a contour generator which in one form is configured to generate and display a contoured representation around each data point such that each data point is displayed as a local maximum and in another form is configured to generate and display one or more contour lines around each data point, each contour line representing data values which are less than the data value of the data point around which the contour line is displayed. The invention also provides related methods and computer programs.

A system and method for integrated queue management are provided. The method may include receiving, from a user, a request for a connection to one of a plurality of agents. The request for a connection may be queued if the plurality of agents are unavailable. A request to delay the connection with the one of the plurality of agents may be received, from the user. In accordance with a particular embodiment of the present invention, the connection with the one of the plurality of agents is delayed. A request to continue in the queue may be received from the user. Finally, the user may be connected with one of the plurality of agents.

A method, apparatus, and computer program product for determining a drop probability for use in a congestion control module located in a node in a network is disclosed. A weight value for determining a weighted moving average of a queue in a node is first systematically calculated. The weighted moving average is calculating and an average queue size for the node is determined based upon the weighted moving average. A control function associated with the congestion control module is evaluated using the average queue size to determine the drop probability. In a further embodiment, the control function is calculated based upon a queue function where the queue function is calculated based upon predetermined system parameters. Thus, when the congestion control module drops packets based upon the drop probability determined by the control function the queue will not oscillate.

An improved hardware independent, open-architecture queue management system (QMS) for management of users in a queue, the system including at least one Web-based server for an organization containing the logic and central systems functions. The system also includes a Web client application allowing interaction between the users and the Web Web-based server and accessible through a browser on client workstations and a database installed on a Structured Query Language (SQL) server for record maintenance and interactions with the Web-based server and the client application. The system further includes an announcer server for activating a radio frequency identification (RFID) transmitter carried by each of the users, a survey station kiosk having an RFID receiver, displays to provide queue and marketing information to users and speakers to announce information to the users and an automated an receptionist for issuing tickets to the users.

A method of providing one or more service types to customers at least one work station in an orderly fashion by means of a queue management system. According to the invention customers are biometrically scanned to thereby establish a matching or not in a database which comprises information on customers. If there is a match in the database, the information in the database can forward at least an identity to an appropriate work station when a customer in question is summoned to that work station. It is also possible to connect a biometric scan that does not match any entries in the database with a person that does business at a work station where the person in question identifies herself or is identified, and thus make an entry in the database.

Disclosed are methods and devices for queue management that allow a person waiting in the queue to choose to receive at least one warning communication, for example on a wireless communication device such as a cellular telephone. In some embodiments, the person agrees to “buy” the warnings and concomitant free time by agreeing to pay for at least one warning communication and / or by agreeing to accept advertisements.

In a passive optical network, dynamic bandwidth allocation and queue management methods and algorithms, designed to avoid fragmentation loss, guarantee that a length of a grant issued by an OLT will match precisely the count for bytes to be transmitted to an ONU. The methods include determining an ONU uplink transmission egress based on a three-stage test, and various embodiments of methods for ONU report 700 threshold setting

The invention provides a data visualisation system comprising a data value memory in which is maintained a finite set of data values obtained from monitoring apparatus and a display configured to display a representation of each data value centered on respective data points. The invention also provides a contour generator which in one form is configured to generate and display a contoured representation around each data point such that each data point is displayed as a local maximum and in another form is configured to generate and display one or more contour lines around each data point, each contour line representing data values which are less than the data value of the data point around which the contour line is displayed. The invention also provides related methods and computer programs.

Some embodiments provide a queue management system that efficiently and dynamically manages multiple queues that process traffic to and from multiple virtual machines (VMs) executing on a host. This system manages the queues by (1) breaking up the queues into different priority pools with the higher priority pools reserved for particular types of traffic or VM (e.g., traffic for VMs that need low latency), (2) dynamically adjusting the number of queues in each pool (i.e., dynamically adjusting the size of the pools), (3) dynamically reassigning a VM to a new queue based on one or more optimization criteria (e.g., criteria relating to the underutilization or overutilization of the queue).

An automated waiting line transaction management system that provides patrons / users the option of queuing up and waiting in the standard attraction line at a venue or obtaining an ID unit that can be used for purchasing a pass to bypass the normal line. The venue administrator sets pass prices for each attraction on a real time basis either manually or through a venue algorithm.

An electronic queue management system for implementation on a chip. The queue management system comprises a plurality of primitive queue elements each including a register for a next-pointer and a register for a queue number. The next-pointer values may be selected via a register input and can be fed out via a registered output. Such queue elements are associated with a respective entry in a central array which stores the data belonging to the actual request. The separation of the data array and queue elements facilitates queue management as the data amounts are quite large compared to the small amount of data being required for the pre logic of the queue management system. Multiple add requests and multiple remove requests operations for different queue elements may be concurrently achieved in a single cycle.

A virtual queuing system and method provides for dynamic control of queue data in accordance with queue control instructions provided by a separate queue control source. The virtual queuing system comprises an interface to a queuing system and an interface to the separate queue control source. The interface to the queuing system provides for obtaining queue data and controlling the queue data in accordance with the queue control instructions provided by a separate queue control source. The interface to the separate queue control source for: i) providing the queue data to the separate queue control source; and ii) obtaining the queue control instructions there from.

A queue management method and system that is designed to decrease queue times and to more efficiently allocate the queue-resource among queue-members, particularly in cases where multiple independent queue-members can effectively share resources that each member would otherwise consume independently. Users may be batched according to some complementary consumption-characteristic and a segmented queue may be utilized that contains a batched-queue that includes the batches of users and users that have not been assigned to a batch. Priority may be awarded to those in the batched-queues, which may decrease queue times and more efficiently allocate the queue-resource. The system for facilitating batched queue management may contain a series of terminals that acquire user characteristics, a server that batches users according to their characteristics and maintains a queue consisting of batched and non-batched queue-members, and terminals for broadcasting queue information to the users.

The invention provides a station taxi queuing management system and a method, and the station taxi queuing management system and the method are designed for the problems that a taxi waiting system in the prior art at a crowded area like an airport, a railway station and the like is incapable of scheduling and controlling vehicles effectively. The station taxi queuing management system comprises a drive module, a first sensor module, a second sensor module and a control module, wherein each enqueue brake and each dequeue brake are provided with the control module, and the control module is used for controlling the enqueue brakes and the dequeue brakes to be turned on or turned off. The first sensor module is respectively arranged on the enqueue brake and the dequeue brake to detect the state of the enqueue brake and the dequeue brake. The second sensor module is respectively arranged at the inlet and the outlet of each queuing queue for statistics of traffic flow. The control module is connected with each drive module, each first sensor module and each second sensor module to collect data, and controls switching-on and switching-off of the enqueue brake and the dequeue brake according to the data. The station taxi queuing management system and the method can be applied to the field of controlling taxes.

The invention relates to an automatic card sending queuing management system, which comprises an information input device, an automatic card sending device, an electronic flapper identifying module, electronic flappers, a queue system core control module, a wireless data transmission module, wireless data transmission equipment, an electronic display terminal, a window call terminal, a flapper recycling bin, a centralization setting module, a voice call module, a power amplifier system, a system database, a client query platform and a flapper loading sending box. In the automatic card sending queuing management system, the automatic card sending device is triggered by the information input device, and the electronic flappers are sent by the electronic flapper identifying module, so that queuing numbers which are printed and displayed on the electronic flappers regularly and received by queuers are incorporated into the queuing system for sorting. The automatic card sending queuing management system changes the conventional mode of queuing by using printing paper ticket numbers, and adopts the electronic flappers capable of being recycled completely, and meets the relevant requirements of energy conservation, environmental protection, low-carbon economy, emission reduction and the like which are advocated by the contemporary society.