Dynamically allocating server resources to competing classes...

Telephonic communications – Centralized switching system – Call distribution to operator

Reexamination Certificate

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

C379S265120, C379S265130

Reexamination Certificate

active

09247893

ABSTRACT:
A facility for adjusting a number of servers assigned to server pools for performing certain work types on the basis of unmet service needs in a work processing facility. Servers may include service agents, both human and robotic. A server assignor and corresponding server assignment method may each be employed in a work distributor or an automatic call distributor (“ACD”) to conditionally adjust server availability in server pools. The server assignor compares a composite preference value for a work type against each server's threshold value for the work type. When the server assignor determines that the composite preference value is greater than or equal to a server's threshold value, then the server assignor indicates that the server may be included in the server pool for that work type. Each server has preference values and threshold values for different kinds of work. The magnitude of a preference value represents an affinity for the work type. The server's threshold value represents a reluctance to perform work having that work type. The server does not normally receive work for which the preference value is less than the threshold value, unless the server assignor determines that the composite preference value exceeds the server's threshold value for that work type. The server assignor and corresponding server assignment method may compute the composite preference value from a number of user-selectable inputs and utilize a number of user-selectable functions.

REFERENCES:
patent: 4163124 (1979-07-01), Jolissaint
patent: 4737983 (1988-04-01), Frauenthal et al.
patent: 4797911 (1989-01-01), Szlam et al.
patent: 4894857 (1990-01-01), Szlam et al.
patent: 5001710 (1991-03-01), Gawrys et al.
patent: 5097528 (1992-03-01), Gursahaney et al.
patent: 5101425 (1992-03-01), Darland
patent: 5164983 (1992-11-01), Brown et al.
patent: 5210789 (1993-05-01), Jeffus et al.
patent: 5274700 (1993-12-01), Gechter et al.
patent: 5278898 (1994-01-01), Cambray et al.
patent: 5335268 (1994-08-01), Kelly, Jr. et al.
patent: 5390243 (1995-02-01), Casselman et al.
patent: 5436965 (1995-07-01), Grossman et al.
patent: 5444774 (1995-08-01), Friedes
patent: 5469503 (1995-11-01), Butensky et al.
patent: 5469504 (1995-11-01), Blaha
patent: 5473773 (1995-12-01), Aman et al.
patent: 5479497 (1995-12-01), Kovarik
patent: 5500795 (1996-03-01), Powers et al.
patent: 5504894 (1996-04-01), Ferguson et al.
patent: 5530744 (1996-06-01), Charalambous et al.
patent: 5537542 (1996-07-01), Eilert et al.
patent: 5544232 (1996-08-01), Baker et al.
patent: 5546452 (1996-08-01), Andrews et al.
patent: 5592542 (1997-01-01), Honda et al.
patent: 5611076 (1997-03-01), Durflinger et al.
patent: 5642515 (1997-06-01), Jones et al.
patent: 5684964 (1997-11-01), Powers et al.
patent: 5689698 (1997-11-01), Jones et al.
patent: 5703943 (1997-12-01), Otto
patent: 5713014 (1998-01-01), Durflinger et al.
patent: 5742675 (1998-04-01), Kilander et al.
patent: 5748468 (1998-05-01), Notenboom et al.
patent: 5749079 (1998-05-01), Yong et al.
patent: 5752027 (1998-05-01), Familiar
patent: 5754639 (1998-05-01), Flockhart et al.
patent: 5754841 (1998-05-01), Carino, Jr.
patent: 5757904 (1998-05-01), Anderson
patent: 5794250 (1998-08-01), Carino, Jr. et al.
patent: 5796393 (1998-08-01), MacNaughton et al.
patent: 5825869 (1998-10-01), Brooks et al.
patent: 5838968 (1998-11-01), Culbert
patent: 5881238 (1999-03-01), Aman et al.
patent: 5889956 (1999-03-01), Hauser et al.
patent: 5903641 (1999-05-01), Tonisson
patent: 5915012 (1999-06-01), Miloslavsky
patent: 5926538 (1999-07-01), Deryugin et al.
patent: 5930786 (1999-07-01), Carino, Jr. et al.
patent: 5937051 (1999-08-01), Hurd et al.
patent: 5937402 (1999-08-01), Pandit
patent: 5940496 (1999-08-01), Gisby et al.
patent: 5948065 (1999-09-01), Eilert et al.
patent: 5960073 (1999-09-01), Kikinis et al.
patent: 5963635 (1999-10-01), Szlam et al.
patent: 5970132 (1999-10-01), Brady
patent: 5974135 (1999-10-01), Breneman et al.
patent: 5974462 (1999-10-01), Aman et al.
patent: 5987117 (1999-11-01), McNeil et al.
patent: 5991392 (1999-11-01), Miloslavsky
patent: 5996013 (1999-11-01), Delp et al.
patent: 5999963 (1999-12-01), Bruno et al.
patent: 6011844 (2000-01-01), Uppaluru et al.
patent: 6038293 (2000-03-01), McNerney et al.
patent: 6044144 (2000-03-01), Becker et al.
patent: 6044355 (2000-03-01), Crockett et al.
patent: 6052723 (2000-04-01), Ginn
patent: 6055308 (2000-04-01), Miloslavsky et al.
patent: 6115462 (2000-09-01), Servi et al.
patent: 6154769 (2000-11-01), Cherkasova et al.
patent: 6175564 (2001-01-01), Miloslavsky et al.
patent: 6178441 (2001-01-01), Elnozahy
patent: 6185292 (2001-02-01), Miloslavsky
patent: 6215865 (2001-04-01), McCalmont
patent: 6226377 (2001-05-01), Donaghue, Jr.
patent: 6229819 (2001-05-01), Darland et al.
patent: 6230183 (2001-05-01), Yocom et al.
patent: 6233333 (2001-05-01), Dezonmo
patent: 6240417 (2001-05-01), Eastwick
patent: 6263359 (2001-07-01), Fong et al.
patent: 6272544 (2001-08-01), Mullen
patent: 6278777 (2001-08-01), Morley
patent: 6356632 (2002-03-01), Foster et al.
patent: 6424709 (2002-07-01), Doyle et al.
patent: 6426950 (2002-07-01), Mistry
patent: 6434230 (2002-08-01), Gabriel
patent: 6490350 (2002-12-01), McDuff et al.
patent: 6560649 (2003-05-01), Mullen et al.
patent: 6650748 (2003-11-01), Edwards et al.
patent: 2143198 (1995-01-01), None
patent: 2174762 (1995-06-01), None
patent: 0 501 189 (1992-09-01), None
patent: 0 740 450 (1996-10-01), None
patent: 0 772 335 (1997-05-01), None
patent: 0 855 826 (1998-07-01), None
patent: 0 863 651 (1998-09-01), None
patent: 2 273 418 (1994-06-01), None
patent: 2 290 192 (1995-12-01), None
patent: WO 96/07141 (1996-03-01), None
U.S. Appl. No. 09/235,065, Denton et al., Jan. 21, 1999.
U.S. Appl. No. 09/264,497, Edwards, Mar. 8, 1999.
“Product Features,”Guide to Call Center Automation, Brock Control Systems, Inc., Activity Managers Series™ , Section 5—Company B120, p. 59, 1992.
“Product Features,”Guide to Call Center Automation, CRC Information Systems, Inc., Tel-ATHENA, Section 5, Company C520, p. 95, 1992.
Dawson, “NPRI's Powerguide, Software Overview”Call Center Magazine(Jun. 1993), p. 85.
“Applications, NPRI's Predictive Dialing Package,”Computer Technology(Fall 1993), p. 86.
“VAST™, Voicelink Application Software for Teleservicing®,”System Manager User's Guide, Digital Systems (1994), pp. ii, vii-ix, 1-2, 2-41 through 2-77.
GEOTEL Communications Corporation Web site printout entitled “Intelligent CallRouter Call Flow”, 1998.
GEOTEL Communications Corporation Web site Printout entitled “The Intelligent CallRouter Product Overview”, Jul. 3, 1997.
GEOTEL Communications Corporation Web site printout entitled “Intelligent CallRouter Product Architecture” Jul. 3, 1997.
Communication dated Dec. 30, 2005 transmitting the European Search Report for counterpart Application No. 00301027.90-2211, 3 pages.
E. Gamma et al., “Design Patterns: Elements of reusable object-oriented software”, Addison-Wesley, Reading Massachusetts, 1995.
Examiner's Refusal Decision for Japanese Patent Application No. 2000-34267 dated Mar. 9, 2005, with translation, 4 pages.

LandOfFree

Say what you really think

Search LandOfFree.com for the USA inventors and patents. Rate them and share your experience with other people.

Rating

Dynamically allocating server resources to competing classes... does not yet have a rating. At this time, there are no reviews or comments for this patent.

If you have personal experience with Dynamically allocating server resources to competing classes..., we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Dynamically allocating server resources to competing classes... will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFUS-PAI-O-3721743

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.