Telephone call routing in a hunt group is based upon monitoring computer activities of the members (devices, people) of the hunt group. For example, a hunt group's member activity score may be based upon how many incoming hunt group calls that member handles. This high activity score is then used to control that member's place in the call routing order.

Telephone call routing in a hunt group is based upon monitoring computer activities of the members (devices, people) of the hunt group. For example, a hunt group's member activity score may be based upon how many incoming hunt group calls that member handles. This high activity score is then used to control that member's place in the call routing order.

A method and system is provided for the distribution of outbound telephone calls. This method and system includes dialing devices receiving call records and providing telephone calls to one or more agents. Interfaced with the dialing device is a distribution module including pools and queues. The distribution module places the call records into the pools and transfers less than all of the call records to the queues to allow for calling by the dialing devices at peak efficiency. The distribution module transfers the queues to the dialing devices so that the dialing device can place telephone calls. The distribution module monitors the queues to determine when to send additional call records to the queues. In addition, distribution module monitors the results of the call records and updates the call records in the pools so that call records with unsuccessful outcomes can be safely called again later in the day.

Telephone call routing in a hunt group is based upon monitoring computer activities of the members (devices, people) of the hunt group. For example, a hunt group's member activity score may be based upon how many incoming hunt group calls that member handles. This high activity score is then used to control that member's place in the call routing order.

Telephone call routing in a hunt group is based upon monitoring computer activities of the members (devices, people) of the hunt group. For example, a hunt group's member activity score may be based upon how many incoming hunt group calls that member handles. This high activity score is then used to control that member's place in the call routing order.

A system for optimizing response time to events or representations thereof waiting in a queue has a first server having access to the queue; a software application running on the first server; and a second server accessible from the first server, the second server containing rules governing the optimization. In a preferred embodiment, the software application at least periodically accesses the queue and parses certain ones of events or tokens in the queue and compares the parsed results against rules accessed from the second server in order to determine a measure of disposal time for each parsed event wherein if the determined measure is sufficiently low for one or more of the parsed events, those one or more events are modified to a reflect a higher priority state than originally assigned enabling faster treatment of those events resulting in relief from those events to the queue system load.

A system for optimizing response time to events or representations thereof waiting in a queue has a first server having access to the queue; a software application running on the first server; and a second server accessible from the first server, the second server containing rules governing the optimization. In a preferred embodiment, the software application at least periodically accesses the queue and parses certain ones of events or tokens in the queue and compares the parsed results against rules accessed from the second server in order to determine a measure of disposal time for each parsed event wherein if the determined measure is sufficiently low for one or more of the parsed events, those one or more events are modified to a reflect a higher priority state than originally assigned enabling faster treatment of those events resulting in relief from those events to the queue system load.

A network system for managing remote agents of a communication center includes a primary server connected to the network the primary server controlling at least one routing point; one or more secondary servers distributed on the network and accessible to the remote agents, the secondary server or servers having data access to agent computing platforms and communication peripherals; and, a software suite distributed in part to the secondary server or servers and distributed in part to one or more agents computing platforms and peripherals, the software suite including protocol for reporting agent status data. The system monitors agents computing platforms and peripherals for activity state through the one or more secondary servers whereupon the one or more secondary servers exchange control messaging and event related data using ISCC protocols with the primary server over the network for intelligent routing purposes.

A switch IHS stacking system includes a plurality of switch IHSs. A least one first switch IHS includes a first processing system and at least one second switch IHS includes a second processing system that is different from the first processing system. A stacking engine is located on each of the plurality of switch IHSs. Following the coupling of the plurality of switch IHSs into a stack and in response to the startup of the plurality of switch IHSs, the each of the stacking engines may exchange capability information with each of the plurality of switch IHSs and determine a control plane processing system affinity and a data plane processing system affinity for each of the plurality of switch IHSs. The stacking engines may then determine a master switch IHS for the stack that has the highest control plane processing system affinity and data plane processing system affinity.

A switch IHS stacking system includes a plurality of switch IHSs. A least one first switch IHS includes a first processing system and at least one second switch IHS includes a second processing system that is different from the first processing system. A stacking engine is located on each of the plurality of switch IHSs. Following the coupling of the plurality of switch IHSs into a stack and in response to the startup of the plurality of switch IHSs, the each of the stacking engines may exchange capability information with each of the plurality of switch IHSs and determine a control plane processing system affinity and a data plane processing system affinity for each of the plurality of switch IHSs. The stacking engines may then determine a master switch IHS for the stack that has the highest control plane processing system affinity and data plane processing system affinity.