Node matching in a dynamic, decentralized environment

Details Node matching in a dynamic, decentralized environment Node matching in a dynamic, decentralized environment

2004-03-12

2009-11-10

Chang, Jungwon (Department: 2454)

Electrical computers and digital processing systems: multicomput

Network computer configuring

Reconfiguring

C709S243000, C707S793000

Reexamination Certificate

active

07617300

ABSTRACT:
Computing entities in a dynamic, decentralized computing environment are treated as if these computing entities were nodes in a graph linked by edges so as to match these nodes until no further matches are possible. New nodes may dynamically be introduced into the decentralized computing environment and yet various embodiments of the present invention continue to match nodes while inhibiting deadlocks in the decentralized computing environment.

REFERENCES:
patent: 6628643 (2003-09-01), Park et al.
patent: 7039634 (2006-05-01), Xu et al.
patent: 7117201 (2006-10-01), Kuno et al.
patent: 7117264 (2006-10-01), Becker et al.
patent: 7240093 (2007-07-01), Danieli et al.
patent: 2002/0169846 (2002-11-01), Chen et al.
patent: 2002/0184310 (2002-12-01), Traversat et al.
patent: 2003/0126299 (2003-07-01), Shah-Heydari
patent: 2003/0131129 (2003-07-01), Becker et al.
patent: 2004/0024877 (2004-02-01), Celle
patent: 2004/0153520 (2004-08-01), Rune et al.
patent: 2004/0215667 (2004-10-01), Taylor et al.
patent: 2005/0025144 (2005-02-01), O'Mahony
patent: 2005/0080858 (2005-04-01), Pessach
Anderson, T.E., et al., “High-Speed Switch Scheduling For Local-Area Networks,”ACM Transactions on Computer Systems11(4):319-352, Nov. 1993.
Goldberg, A.V., et al., “Sublinear-Time Parallel Algorithms for Matching and Related Problems,” research paper, Computer Science Department, University of Illinois, Urbana, IL., 1993.
Hanckowiak, M., et al., “On the Distributed Complexity of Computing Maximal Matchings,” research paper, Adam Mickiewics University, Poland, 2001.
Mariani, R., “Face Learning Using a Sequence of Images,”International Journal of Pattern Recognition an Artificial Intelligence14(5):631-647, 2000.
Nestmann, U., “What is a ‘Good’ Encoding of Guarded Choice?”BRICS(Basic Research in Computer Science)Report Series, RS-97-45, Dec. 1997.
Peng, Y., “A Novel Adaptive Power-Aware Routing Protocol for the QoS-Based Multi-Traffic in Moblie Ad Hoc Networks,”Journal of Natural Science Hunan Normal University25(2):41-44 (abstract), Jun. 2002.
Shen, H.C., et al., “Resource Allocation in a Flexible Manufacturing System by Graph Matching,”Proceedings of the 1991 IEEE International Conference on Robotics and Automation, Sacramento, California, Apr. 1991, pp. 1315-1320.
Yeung, K.L., et al., “A Wavelength Concentrator for WDMA Networks,”IEEE, The University of Hong Kong, 1993.
Office Action from the Patent Office of the State Intellectual Property Office of the People's Republic of China, Application No. 200510055100.5 mailed on Apr. 24, 2009, 10 pages.

Affiliated with

Also associated with

Rating

Node matching in a dynamic, decentralized environment does not yet have a rating. At this time, there are no reviews or comments for this patent.

If you have personal experience with Node matching in a dynamic, decentralized environment, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Node matching in a dynamic, decentralized environment will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFUS-PAI-O-4084877