Electrical computers and digital processing systems: multicomput – Computer network managing
Reexamination Certificate
2007-01-16
2007-01-16
Dharia, Rupal (Department: 2141)
Electrical computers and digital processing systems: multicomput
Computer network managing
C709S203000, C709S219000, C709S225000, C709S226000
Reexamination Certificate
active
10180734
ABSTRACT:
A method of finding an optimal match between clients and servers under given matching constraints utilizes a bipartite diagram in which the clients are presented as vertices on one side, the servers as vertices on the other side, and each possible client-server pairing allowed under the matching constraints as an edge connecting the vertices representing the client and the server. After an initial round of assignments is performed, the assignments are optimized by an optimization operation that iteratively applies a reassignment process. The reassignment process searches for a chain of servers starting with a server having a highest number of clients and ends with another server with a client number less than that of the first server by at least two, with each server in the chain except the end server having a client reassignable to the next server in the chain. Those reassignable clients are then reassigned along the chain such that the first server's client number is reduced by one and the end server's client number is reduced by one. The reassignment process is repeated until an optimal match is reached.
REFERENCES:
patent: 5761507 (1998-06-01), Govett
patent: 5878212 (1999-03-01), Civanlar et al.
patent: 6078943 (2000-06-01), Yu
patent: 6092178 (2000-07-01), Jindal et al.
patent: 6195680 (2001-02-01), Goldszmidt et al.
patent: 6259705 (2001-07-01), Takahashi et al.
patent: 6330602 (2001-12-01), Law et al.
patent: 6343313 (2002-01-01), Salesky et al.
patent: 6601101 (2003-07-01), Lee et al.
patent: 6671259 (2003-12-01), He et al.
patent: 6801949 (2004-10-01), Bruck et al.
patent: 6804709 (2004-10-01), Manjure et al.
patent: 6877035 (2005-04-01), Shahabuddin et al.
patent: 6941341 (2005-09-01), Logston et al.
patent: 6970913 (2005-11-01), Albert et al.
patent: 7062556 (2006-06-01), Chen et al.
patent: 2002/0042721 (2002-04-01), Tillmanns
patent: 2003/0009558 (2003-01-01), Ben-Yehezkel
patent: 2003/0161302 (2003-08-01), Zimmermann et al.
patent: 2003/0191838 (2003-10-01), Tsao
patent: 2004/0054984 (2004-03-01), Chong et al.
patent: 2004/0147267 (2004-07-01), Hill et al.
Sussman, “Instructor's Manual to ‘Accompany Introduction to Algorithms,’” the MIT Press, © 1991.
Horn, “Minimizing Average Flow Time with Parallel Machines,” Technical Notes, National Bureau of Standards, Dec. 9, 1971, pp. 846-847.
Bruno et al., “Scheduling Independent Tasks To Reduce Mean Finishing Time,”Communications of the ACM,Jul. 1974, vol. 17, NO. 7, pp. 382-387.
Graham et al., “Optimization And Approximation In Deterministic Sequencing And Scheduling: A Survey,”Annals of Discrete Mathematics5, 1979, pp. 287-326.
Harvey Nicholas J.
Lovasz Laszlo
Dharia Rupal
Microsoft Corporation
Shingles Kristie D.
Workman Nydegger
LandOfFree
Method and system for matching network clients and servers... does not yet have a rating. At this time, there are no reviews or comments for this patent.
If you have personal experience with Method and system for matching network clients and servers..., we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Method and system for matching network clients and servers... will most certainly appreciate the feedback.
Profile ID: LFUS-PAI-O-3733217