Abstract: An enterprise email management system is disclosed. The enterprise mail system is designed to handle large volumes of email quickly and efficiently, responding through enterprise email system users or automated means. The enterprise email system processes incoming email using a set of configurable rules that examine each message for a specific attribute state condition and invoke a configurable action when the attribute satisfies the condition. A number of actions may be invoked such as routing a message to a specific mail queue. The enterprise email system assigns a mail queue timer when a message is moved into a mail queue. Each mail queue has a different mail queue timeout value that specifies the maximum amount of time that a message may sit idle within a mail queue. The enterprise email system may automatically move a message from a mail queue into a mailbox of an enterprise email system user that subscribed to the mail queue. A mailbox timer then set for the message and the mailbox timer is compared with a mailbox timeout value that specifies the amount of time that message may sit idle within a mail queue. If the mail queue timer expires, the message is returned to the mail queue from where it came. If the mail queue timer expires, then the message is routed to another mail queue or enterprise email user.

Abstract: An apparatus for routing a transaction message, such as for example a telephone call, e-mail, web chat request, video conferencing session, or non-call event, includes a queue engine and a transaction message router. The queue engine provides an integrated mechanism for queuing transaction messages of varying transaction types within a number of queues according to transaction type. Each queue within the queue engine may be dedicated to queuing transaction messages of a specific transaction type. The transaction message router functions to identify a queue within the queue engine within which a transaction message is to be stored. The identification of a queue by the router may be performed with reference to the transaction type of a transaction message, and with reference to context or addressing information associated with a transaction message. Transaction messages of all transaction types are serviced by a single resource allocator that distributes transaction messages from the queues of the queue engine 44 to a resource, such as an agent.

Abstract: Apparatus for routing packets in a communication network comprises a plurality of per-connection queues, each queue established for receiving packets from a respective source and temporarily storing received packets before routing to a particular destination; a weighted fair-queuing scheduler for servicing packets from each of the plurality of per-connection queues at guaranteed pre-allocated rates; a sensing device for sensing a presence or absence of packets in queues, the absence of packets in queues indicating availability of excess bandwidth; and, a state dependent scheduler for redistributing excess bandwidth upon sensing of queues absent packets, the state dependent scheduler servicing those queues in accordance with a state variable corresponding to a performance property of the queues, wherein delay and isolation properties for routing packets of respective queues in weighted fair-queuing is preserved.

Abstract: Methods, systems, and devices are provided for delegating security rights to Java servlets and other executable tasks by using secure operating system queues In particular embodiments, the invention allows secure loading of Java servlets on a Novell NetWare server The invention allows users to run servlets from various locations with the same rights, namely, the user's rights The servlet submitted by a given user runs in the context of that user's rights A system according to the invention verifies that the user has the right to submit the task to a given task queue; the queue is managed by the system, and the user is authenticated to the system Queue servers which receive tasks from the queue and service them by executing the tasks are likewise authenticated by the system When a queue server attempts to service a task in a queue, the system verifies that the queue server has rights to service that queue and that job This two way verification—that a user has rights to submit the task, and that the queue server has rights to service the task—allows the user and the queue server to establish a trusted relationship using the operating system's trusted queues Moreover, existing user rights databases and access control systems can be used to determine and enforce rights and trust levels

Abstract: A method and arrangement for queuing data in a prioritized manner have a queue with a single queue write side in which data entries are input to the queue. The queue also has a plurality of queue read sides, with each read side having a different priority level. An entry exiting from the queue write side is examined to determine the priority level of the entry, and then placed into the queue read side with the matching priority level as the entry. The queue read sides form the output of the queue, and are polled and emptied so that the higher priority queues are emptied completely before emptying lower priority queues.

Abstract: A method is provided for a multifunctional printing system in which a plurality of jobs are placed in a queue in anticipation of processing the same. The queue, over time, receives jobs of at least a first user type and a second user type. In operation, first and second jobs of the first user type are placed in the queue. When a third job is ready for placement into the queue, a determination as to whether the third job is of the first user type or the second user type is made. If the third job is of the first user type, then it is processed subsequent to the processing of both the first and second jobs; however, if the third job is of the second user type, then the third job is processed ahead of at least the second job.

Abstract: A per-flow queuing method and apparatus for IP networks carrying traffic from feedback controlled TCP connections enables flow of information packets from one or more sources to a destination through a link and comprises a buffer of predetermined size partitioned into a plurality of queues, each queue being allocated an occupancy bi for receiving and temporarily storing packets of information; a scheduler for removing packets from each buffer according to a predetermined rate and transmitting the packets over a network; and a control device for determining availablilty of queues in the buffer capable of receiving the packet and inputting the packet into a queue if the queue is available, the control device further selecting a queue and releasing a packet from the selected queue to accommodate input of the received packet when the queue is not available. Increased fairness and packet throughput through the link is achieved when the queue for dropping a packet is selected in accordance with a longest queue first or random drop scheme and, when a drop from front strategy for ACK packets is employed.

Abstract: An appatatus for enhancing transport packet demultiplexing and distribution in a digital transport demultiplexing system that inputs a stream of digital multimedia transport packets is provided. The demultiplexing apparatus performs the demultiplexing operation by transferring data packets into and out of circular data queues. These circular queues comprise a contiguous block of memory which are defined by a queue starting address, a queue size, a read pointer, and a write pointer. When data packets are written to and read from a circular queue, the sequential addressing of the queue will automatically rollover from the highest memory location within the queue to the lowest memory location when the sequential addresses move through the circular queue. The addressing of the various queues and sharing of a transport stream bus is handled by a memory arbiter and queue manager.

Abstract: A queuing system (230) stores a package (246) derived from an ATM cell, the package including an internal interface header (IIH) and either an ATM cell payload or an AAL2 packet. The queuing system comprises a queue (312, 320) for storing the package, as well as a processor which executes plural functions. A time stamping function applies a time stamp upon storage of the package in the queue. The time stamping function can apply the time stamp to a package as replacement of the internal interface header. A time stamp checking function uses the time stamp to make a determination whether the tenure of the package in the queue is longer than permissible. The time stamp checking function can make the tenure determination in conjuction with a potential readout of the package from the queue. Alternatively, time stamp checking function can make the tenure determination when invoked by a queue monitoring function which monitors a fill level of the queue (e.g., when a queue fill level exceeds a threshold). A discard function is provided for discarding the package if the tenure of the package in the queue is longer than permissible.

Abstract: The RAM complexity of deterministic linear space sorting of integers in words is improved from O(n p logn) to O(n(log logn) 2 ). No better bounds are known for polynomial space. In fact, the techniques give a deterministic linear space priority queue supporting insert and delete in O((log logn) 2 ) amortized time and nd-min in constant time. The priority queue can be implemented using addition, shift, and bit-wise boolean operations.

Abstract: A circular queue is asynchronously accessed and managed by two separate processing elements. Each data element is added to the queue together with a zero data element that both marks the tail of the queue and signifies that the queue is empty. Data elements are removed from the queue in the order in which they were stored (first-in-first-out) and a manner that allows multiple, concurrent access to the queue. When the queue is accessed to remove a data element the element is first tested. If it is non-zero, the removal process continues; if zero, the queue is considered empty. The management of the queue permits dynamic re-sizing (i.e., making the queue larger or smaller) while data elements are being added and/or removed.

Abstract: A queue data structure is stored on a computer-readable medium to represent a queue or list. The data structure includes a head pointer that points to the last or most recent list element to have been removed from the queue, and a tail pointer that points to the most recently added list element in the queue. The head pointer and tail pointer may be implemented as separate objects. The queue data structure is applicable to computer arts such as transactional database management. The queue data structure can prevent concurrency conflicts that could otherwise occur when an object modified in one transaction (e.g. by one user) is modified by another concurrent transaction (e.g. by another user).

Abstract: The Internet research community is promoting active queue management in routers as a proactive means of addressing congestion in the Internet. Active queue management mechanisms such as Random Early Detection (RED) work well for TCP flows but can fail in the presence of unresponsive UDP flows. Recent proposals extend RED to strongly favor TCP and TCP-like flows and to actively penalize `misbehaving' flows. This is problematic for multimedia flows that, although potentially well-behaved, do not, or can not, satisfy the definition of a TCP-like flow. In this paper we investigate an extension to RED active queue management called Class-Based Thresholds (CBT). The goal of CBT is to reduce congestion in routers and to protect TCP from all UDP flows while also ensuring acceptable throughput and latency for well-behaved UDP flows. CBT attempts to realize a `better than best effort' service for well-behaved multimedia flows that is comparable to that achieved by a packet or link scheduling discipline, however, CBT does this by queue management rather than by scheduling. We present results of experiments comparing our mechanisms to plain RED and to FRED, a variant of RED designed to ensure fair allocation of bandwidth amongst flows. We also compare CBT to a packet scheduling scheme. The experiments show that CBT (1) realizes protection for TCP, and (2) provides throughput and end-to-end latency for tagged UDP flows, that is better than that under FRED and RED and comparable to that achieved by packet scheduling. Moreover CBT is a lighter-weight mechanism than FRED in terms of its state requirements and implementation complexity.

Abstract: Queue processing mechanism in which queued messages are processed based on combination of queue delay and queue priority. A scheduler dequeues the highest priority non-empty Microcode Input Queue (MIQ) to serve the queued messages. If there is no critical queue, meaning that the maximum aging of one or more queues has not been reached, the critical state is not entered. A static weight for each queue is then tested to determine if there is still a message to be processed from the corresponding MIQ. Messages are dequeued from the same MIQ until the static weight is reached. The next MIQ is then served etc., until the queue of the lowest priority level is served. If the critical phase is entered, the status of the normal state is stored for later return and the MIQs in critical state are dequeued according to their critical weights. If other MIQs appear to be critical, they are served in the order of their critical priorities (or weights). The critical queues are dequeued sequentially according to their critical weight. If no critical MIQ is left, the scheduler exits from this critical state and loops back to the normal state that it previously exited. Normal state processing continues until the next critical state occurs.

Abstract: A queue management system for managing a queue in a printing system is provided. The printing system is provided with a first set of resources for processing jobs and a job including a second set of resources required to process the job is introduced to the printing system. Additionally, a policy indicating how resource deficient jobs are to be handled by the queue management system is provided. For the situation in which the first set of resources does not correspond with the second set of resources, so that a resource mismatch exists between the first and second resource sets, the policy is used for causing the job to be either held until a preselected condition is met or discarded.

Abstract: A multicast queue for controlling cell traffic to individual output queues in a multicast group in accordance with the backpressure information generated by each output queue. One or more destinations asserting the backpressure signal are identified and, in response, the corresponding one or more destinations are removed from the ‘distribution list’ in the routing tag associated with the connection. In this fashion, a cell that originated at a multicast source queue can be transmitted to the remaining destination queues that are not in a congested state. Cell traffic will cease only to those destination queues that generated the backpressure signal indicating that they are full. If the congestion at an output port is removed, the corresponding backpressure bit is reset and cell traffic resumes to that particular output port.

Abstract: of EP0859492Apparatus for routing packets in a communication network comprises a plurality (100) of per-connection queues (20a--20i), each queue established for receiving packets from a respective source and temporarily storing received packets before routing to a particular destination; a weighted fair-queuing scheduler (40) for servicing packets from each of the plurality of per-connection queues at guaranteed pre-allocated rates; a sensing device for sensing a presence or absence of packets in queues, the absence of packets in queues indicating availability of excess bandwidth; and, a state dependent scheduler (200) for redistributing excess bandwidth upon sensing of queues absent packets, the state dependent scheduler (200) servicing those queues in accordance with a state variable corresponding to a performance property of the queues, wherein delay and isolation properties for routing packets of respective queues in weighted fair-queuing is preserved.

Abstract: A queue management system for selectively transmitting cells received from a plurality of sources, comprises: a multiplexer for multiplexing the cells from the plurality of sources into one output line; a cell pool for storing the cells received from the multiplexer; an idle-address FIFO for storing addresses of empty sectors of the cell pool; a sequencer, having a plurality of modules therein, each module for determining the cells' sequence of transmission, for storing information including a cell's priority field and its corresponding address in the cell pool, comparing the stored information with information of a new entry cell, and queuing the information on the basis of the priority field, wherein the priority field is composed of a deadline time and an eligible time, the deadline time being defined as a maximum allowable delay bound at a node and the eligible time, referring to a delay bound in which a cell is supposed to be transmitted from the node; and a write controller and a read controller for generating signals for accessing to the multiplexer, the cell pool and the sequencer.

Abstract: In a system for executing database queries, a directed graph of logically interconnected tasks represents an execution plan for executing a specified database query. A pair of queues are stored in a computer memory for each pair of interconnected tasks in the directed graph. One of the queues in each pair is a down queue for sending requests from a parent task to a child task, and the other is an up queue for sending replies from the child task to the parent task. Each queue is a circular buffer and includes a head pointer that points to a next location in the queue to be read, and a tail pointer that points to a next location in the queue in which data can be written. Each task checks that a queue is not full before writing data into that queue, and checks that the sibling queue is not empty before reading data from the sibling queue. In addition, a task updates the tail pointer for a queue only after it has written data into the location in the queue to which the tail pointer is updated, to ensure that the other task does not attempt to read that queue location until the new data has been written into it. This queue protocol is sufficient, by itself, to ensure that tasks do not make conflicting use of the queues, despite the fact that the queues are in shared memory and are not protected by a synchronization mechanism.

Abstract: A method and system for detecting and controlling congestion in a multi-port shared memory switch in a communications network. The proposed congestion management scheme implements a local and a global congestion monitoring process. The local monitoring process monitors the queue depth. When the queue depth for any queue exceeds a queue length threshold a congestion control mechanism is implemented to limit incoming data traffic destined for that queue. Additionally, the global congestion monitoring process monitors the shared memory buffer and if the traffic thereto exceeds a shared memory buffer threshold a congestion control mechanism limits incoming traffic destined for any output queue which has been exceeding a fair share threshold value.

Abstract: We consider an open queueing network consisting of an arbitrary number of queues in series. We assume that the arrival process into the first queue and the service processes at the individual queues are jointly stationary and ergodic, and that the mean inter-arrival time exceeds the mean service time at each of the queues. Starting from Lindley's recursion for the waiting time, we obtain a simple expression for the total delay (sojourn time) in the system. Under some mild additional assumptions, which are satisfied by many commonly used models, we show that the delay distribution has an exponentially decaying tail and compute the exact decay rate. We also find the most likely path leading to the build-up of large delays. Such a result is of relevance to communication networks, where it is often necessary to guarantee bounds on the probability of large delays. Such bounds are part of the specification of the quality of service desired by the network user.

Abstract: A method for enhancing transport packet demultiplexing and distribution in a digital transport demultiplexing system that inputs a stream of digital multimedia transport packets is provided. Each of the transport packets includes a packet identifier (PID) to identify the digital program or elementary stream to which it corresponds. Local packet information is generated for each of the transport packets, which is used in identifying and distributing the transport packets. A local header is created that includes the generated local packet information, and the local header is linked to its corresponding transport packet to create a modified transport packet. In this manner, each of the modified transport packets represents a self-contained digital transport packet having local distribution information contained therein. The demulitplexing apparatus performs the demultiplexing operation by transferring data packets into and out of circular data queues. These circular queues comprise a contiguous block of memory which are defined by a queue starting address, a queue size, a read pointer, and a write pointer. When data packets are written to and read from a circular queue, the sequential addressing of the queue will automatically rollover from the highest memory location within the queue to the lowest memory location when the sequential addresses move through the circular queue.

Abstract: In this paper, we present a detailed analysis of a cyclic-service queueing system consisting of two parallel queues, and a single server. The server serves the two queues with a Bernoulli service schedule described as follows. At the beginning of each visit to a queue, the server always serves a customer. At each epoch of service completion in the ith queue at which the queue is not empty, the server makes a random decision: with probability p_{i}, it serves the next customers with probability 1-p_{i}, it switches to the other queue. The server takes switching times in its transition from one queue to the other. We derive the generating functions of the joint stationary queue-length distribution at service completion instants, by using the approach of the boundary value problem for complex variables. We also determine the Laplace–Stieltjes transforms of waiting time distributions for both queues, and obtain their mean waiting times.

Abstract: We analyse a single-server queue in which the server goes through alternating periods of vacation and work. In each work period, the server attends to the queue for no more than a fixed length of time, T. The system is a gated one in which the server, during any visit, does not attend to customers which were not in the system before its visit. As soon as all the customers within the gate have been served or the time limit has been reached (whichever occurs first) the server goes on a vacation. The server does not wait in the queue if the system is empty at its arrival for a visit. For this system the resulting Markov chain, of the queue length and some auxiliary variables, is level-dependent. We use special techniques to carry out the steady state analysis of the system and show that when the information regarding the number of customers in the gate is not critical we are able to reduce this problem to a level-independent Markov chain problem with large number of boundary states. For this modified system we use a hybrid method which combines matrix-geometric method for the level-independent part of the system with special solution method for the large complex boundary which is level-dependent.

Abstract: A method of scheduling data storage or retrieval jobs in a data storage and/or retrieval system in which stored data is distributed between multiple data storage volumes comprises: (i) maintaining a queue of data storage or retrieval jobs for execution; and (ii) adding a newly initiated job to the queue so that: (a) if the newly initiated job requires access to the same data storage volume as a further job already in the queue, the newly initiated job is added to the queue at an adjacent queue position to that further job; and (b) if the newly initiated job does not require access to the same data storage volume as any other job already in the queue, adding the newly initiated job to the queue at a queue position independent of the data storage volumes of other jobs in the queue.