Nikolaos G Anerousis

6498797, Dec 24, 2002

Nov 12, 1998

09/190125

Nikolaos Anerousis - New York NY
Raman Gopalakrishnan - San Jose CA
Alan Edward Kaplan - Morris Township, Morris County NJ
William Todd Marshall - Chatham NJ
Partho Pratim Mishra - Cupertino CA
Peter Z Onufryk - Flanders NJ
Kadangode K. Ramakrishnan - Berkeley Heights NJ
Cormac John Sreenan - Waterfall, IE

ATT Corp. - New York NY

H04J 312

370522, 370252, 370259, 370285, 370401, 379229, 379245

A method for performing communications over a network comprises receiving a user record for a first user, receiving a query from a second user with regard to the first user, and sending, to the second user, as a response to the query, a call-handling profile.

6760775, Jul 6, 2004

Mar 6, 2000

09/519468

Nikolaos Anerousis - New York NY
Gisli Hjalmtysson - Gillette NJ

ATT Corp. - New York NY

G06F 15173

709238, 709229

A method and system that enables a network and components of the network to be aware of the services existing at the edges of the network and to route connection requests for these services to appropriate servers within the network based on a variety of criteria. By making the network and network components service-aware, routing functions can be implemented in a more scalable and efficient way.

7467225, Dec 16, 2008

May 11, 2004

10/842856

Nikolaos Anerousis - New York NY, US
Gisli Hjalmtysson - Chester County PA, US

AT&T Corp - New York NY

G06F 15/16
G06F 12/00

709238, 709239

A method and system that enables a network and components of the network to be aware of the services existing at the edges of the network and to route connection requests for these services to appropriate servers within the network based on a variety of criteria. By making the network and network components service-aware, routing functions can be implemented in a more scalable and efficient way.

7552215, Jun 23, 2009

Sep 29, 2004

10/953325

Nikolaos Anerousis - Chappaqua NY, US
Gennaro A. Cuomo - Cary NC, US
Erik A. Daughtrey - Durham NC, US
Brian K. Martin - Cary NC, US
Giovanni Pacifici - New York NY, US
Michael Spreitzer - Croton-On-Hudson NY, US
Malgorzata Steinder - Fort Lee NJ, US
Asser N. Tantawi - Somers NY, US

International Business Machines Corporation - Armonk NY

G06F 15/173

709225, 709202, 709205, 709223, 709226, 709229, 718102

The present invention provides a method, system, and computer program product for supporting a large number of intermittently used application clusters without consuming all the resources needed to run server processes for all the application clusters all the time. A method in accordance with the present invention comprises: holding an application request for a dormant application cluster in a holding zone; changing a status of the dormant application cluster to active; changing a status of an unused active application cluster to dormant; stopping server processes for the newly dormant application cluster; starting server processes for the newly active application cluster; and directing the application request held in the holding zone to the server processes for the newly active application cluster.

7937347, May 3, 2011

Jun 13, 2007

11/762229

Nikolaos Anerousis - Chappaqua NY, US
Hani T. Jamjoom - White Plains NY, US
Yun Mao - Edison NJ, US
Shu Tao - White Plains NY, US

International Business Machines Corporation - Armonk NY

G06N 5/00

706 45, 706 47, 706 62, 714100, 714 25, 714 26

A method (which can be computer implemented) for inferring component associations among a plurality of components in a distributed computing system includes the steps of obtaining status information for each pertinent component of the plurality of components, forming an N by D matrix, X, based on the status information, and factorizing the matrix X to obtain a first matrix indicative of the component associations to be inferred and a second matrix indicative of failure explanations for corresponding ones of the probe instances. N is a number of probe instances associated with a given time frame. D is a number of the plurality of components for which the associations are to be inferred. Techniques are also presented for forming a database with the status information.

8036865, Oct 11, 2011

Jul 14, 2008

12/172573

Nikolaos Anerousis - Chappaqua NY, US
Hani T. Jamjoom - White Plains NY, US
Debanjan Saha - Mohegan Lake NY, US
Ramendra K. Sahoo - Mohegan Lake NY, US

International Business Machines Corporation - Armonk NY

G06G 7/48

703 6

A plurality of equivalent representations of a process are identified. The process has a plurality of tasks. Each of the representations specifies a different order of the tasks. The plurality of equivalent representations are consolidated into a single representation. The single representation captures, in at least one flexible order grouping, at least two of the tasks that may be performed in more than one order. At least one constraint is specified for the at least one flexible order grouping. Techniques for merging two or more flexible representations are also provided.

8126753, Feb 28, 2012

Aug 6, 2007

11/834328

Nikolaos Anerousis - Chappaqua NY, US
Abhijit Bose - Paramus NJ, US
Genady Grabarnik - Scarsdale NY, US
Debanjan Saha - Mohegan Lake NY, US
Larisa Shwartz - Scarsdale NY, US
Shu Tao - White Plains NY, US

International Business Machines Corporation - Armonk NY

G06F 17/60

705 711

An exemplary method of responding to a request for a value of at least one metric associated with at least one process includes a step of determining whether responding to the request requires updating the value of the at least one metric. When responding to the request does not require updating the value of the at least one metric, a response is determined based at least in part on at least one stored value of the at least one metric. When responding to the request does require updating the value of the at least one metric, the value of the at least one metric is updated and a response is determined based at least in part on the at least one updated value of the at least one metric. Updating the value of the at least one metric, at least when responding to the request requires updating the value of the at least one metric, includes steps of determining at least one new value of the at least one metric based at least in part on at least one stored value of the at least one metric and storing the at least one new value of the at least one metric. The method also includes a step of responding to the request with the determined response.

8385534, Feb 26, 2013

Apr 16, 2008

12/103769

Nikolaos Anerousis - Chappaqua NY, US
Abhijit Bose - Paramus NJ, US
Aliza R. Heching - Bergenfield NJ, US
Milton H. Hernandez - Tenafly NJ, US
Hani T. Jamjoom - White Plains NY, US
Hoda Parvin - Ann Arbor MI, US
Sreeram Ramakrishnan - Yorktown Heights NY, US
Debanjan Saha - Mohegan Lake NY, US

International Business Machines Corporation - Armonk NY

H04M 3/00
H04M 5/00

37926511, 37926512, 37926513

Techniques for dispatching one or more services requests to one or more agents are provided. The techniques include obtaining one or more attributes of each service request, obtaining one or more attributes of each agent, obtaining feedback from each of one or more agent queues, and using the one or more attributes of each service request, the one or more attributes of each agent and the feedback from each of the one or more agent queues to determine one or more suitable agents to receive a dispatch for each of the one or more service requests. Techniques are also provided for generating a database of one or more attributes of one or more service requests and one or more attributes of one or more agents.