Electrical computers and digital processing systems: multicomput – Computer-to-computer data routing – Decentralized controlling
Reexamination Certificate
2011-06-07
2011-06-07
Vaughn, Jr., William C (Department: 2444)
Electrical computers and digital processing systems: multicomput
Computer-to-computer data routing
Decentralized controlling
C709S225000, C709S238000, C370S390000
Reexamination Certificate
active
07958262
ABSTRACT:
The present invention extends to methods, systems, and computer program products for allocating and reclaiming resources within a rendezvous federation. Embodiments of the invention include formulating and routing messages in accordance with cached two-way agreements between adjacent nodes on a ring of nodes. Cached two-way agreements divide responsibility for at least unoccupied identifiers between the adjacent nodes on a ring. When a message is received at a node, the node can refer to a cached two-way agreement to determine if it or an adjacent node is responsible for the message. The node then sends the message to the next appropriate component in accordance with the cached two-way agreement.
REFERENCES:
patent: 5689701 (1997-11-01), Ault et al.
patent: 5745683 (1998-04-01), Lee et al.
patent: 5831975 (1998-11-01), Chen
patent: 6115804 (2000-09-01), Carpenter et al.
patent: 6243814 (2001-06-01), Matena
patent: 6253292 (2001-06-01), Jhang et al.
patent: 6279034 (2001-08-01), Jarriel et al.
patent: 6304556 (2001-10-01), Haas
patent: 6411967 (2002-06-01), Van Renesse
patent: 6449641 (2002-09-01), Moiin et al.
patent: 6480473 (2002-11-01), Chambers
patent: 6542513 (2003-04-01), Franke et al.
patent: 6546415 (2003-04-01), Park
patent: 6553377 (2003-04-01), Eschelbeck et al.
patent: 6615362 (2003-09-01), Daruwalla
patent: 6708198 (2004-03-01), Simmons
patent: 6775703 (2004-08-01), Burns et al.
patent: 6836756 (2004-12-01), Gruber
patent: 6850987 (2005-02-01), McCanne et al.
patent: 6909721 (2005-06-01), Ekberg et al.
patent: 6917985 (2005-07-01), Madruga et al.
patent: 6928578 (2005-08-01), Archibald
patent: 6947963 (2005-09-01), Agarwal et al.
patent: 6983397 (2006-01-01), Fairhurst
patent: 6988173 (2006-01-01), Blake et al.
patent: 7043550 (2006-05-01), Knop et al.
patent: 7085825 (2006-08-01), Pishevar
patent: 7120824 (2006-10-01), Burton
patent: 7139930 (2006-11-01), Mashayekhi
patent: 7181547 (2007-02-01), Millet
patent: 7231463 (2007-06-01), Nagendra
patent: 7324440 (2008-01-01), Takagi
patent: 7334062 (2008-02-01), Agarwal et al.
patent: 7362718 (2008-04-01), Kakivaya
patent: 7373468 (2008-05-01), Gupta
patent: 7404006 (2008-07-01), Slaughter
patent: 7453884 (2008-11-01), Ma
patent: 7512649 (2009-03-01), Faybishenko
patent: 2002/0059425 (2002-05-01), Belfiore
patent: 2002/0128995 (2002-09-01), Muntz et al.
patent: 2002/0129086 (2002-09-01), Garcia-Luna-Aceves
patent: 2002/0150094 (2002-10-01), Cheng
patent: 2002/0150145 (2002-10-01), Alriksson et al.
patent: 2002/0184357 (2002-12-01), Traversat et al.
patent: 2003/0009754 (2003-01-01), Rowley et al.
patent: 2003/0055892 (2003-03-01), Huitema
patent: 2003/0067871 (2003-04-01), Busi
patent: 2003/0110408 (2003-06-01), Wells
patent: 2003/0145086 (2003-07-01), O'Reilly
patent: 2003/0152098 (2003-08-01), Zhu
patent: 2003/0165140 (2003-09-01), Tang et al.
patent: 2003/0182444 (2003-09-01), Pedone
patent: 2003/0220993 (2003-11-01), Blizniak et al.
patent: 2004/0054807 (2004-03-01), Harvey
patent: 2004/0064511 (2004-04-01), Abdel-Aziz
patent: 2004/0064548 (2004-04-01), Adams et al.
patent: 2004/0066741 (2004-04-01), Dinker
patent: 2004/0111651 (2004-06-01), Mukherjee
patent: 2004/0122927 (2004-06-01), Muehl
patent: 2004/0139150 (2004-07-01), McCanne et al.
patent: 2004/0215795 (2004-10-01), Poyhonen
patent: 2004/0218536 (2004-11-01), Yasukawa et al.
patent: 2005/0021725 (2005-01-01), Lobbert
patent: 2005/0031119 (2005-02-01), Ding
patent: 2005/0050320 (2005-03-01), Wassmann et al.
patent: 2005/0091399 (2005-04-01), Candan
patent: 2005/0100036 (2005-05-01), Davis
patent: 2005/0108481 (2005-05-01), Iyengar
patent: 2005/0111352 (2005-05-01), Ho
patent: 2005/0114291 (2005-05-01), Becker-Szendy et al.
patent: 2005/0138173 (2005-06-01), Ha et al.
patent: 2005/0152318 (2005-07-01), Elbatt et al.
patent: 2005/0187946 (2005-08-01), Zhang et al.
patent: 2005/0220106 (2005-10-01), Raverdy et al.
patent: 2005/0276216 (2005-12-01), Vasseur
patent: 2006/0015507 (2006-01-01), Butterworth
patent: 2006/0039371 (2006-02-01), Castro
patent: 2006/0087985 (2006-04-01), Kakivaya
patent: 2006/0087990 (2006-04-01), Kakivaya
patent: 2006/0088039 (2006-04-01), Kakivaya
patent: 2006/0106940 (2006-05-01), Jagannathan
patent: 2006/0155781 (2006-07-01), MacCormick et al.
patent: 2006/0282505 (2006-12-01), Hasha
patent: 2006/0282547 (2006-12-01), Hasha
patent: 2007/0002774 (2007-01-01), Hasha
patent: 2007/0016663 (2007-01-01), Weis
patent: 2007/0053285 (2007-03-01), Beer
patent: 2007/0183460 (2007-08-01), Enders
patent: 2007/0204061 (2007-08-01), Chen
patent: 2007/0214194 (2007-09-01), Reuter
patent: 2010/0046399 (2010-02-01), Kakivaya
patent: 1139602 (2001-10-01), None
patent: 1398924 (2004-03-01), None
patent: 2004-266796 (2004-09-01), None
patent: 2005-323346 (2005-11-01), None
Stoica et al., Chord: A Scalable Peer-to-Peer Lookup Service for Internet Applications, SIGCOMM'01, Aug. 2001, San Diego, California.
Ratnasamy et al., A Scalable Content-Addressable Network, SIGCOMM'01, Aug. 2001, San Diego, California.
Office Action dated Feb. 5, 2009 cited in U.S. Appl. No. 11/015,460.
Notice of Allowance dated Nov. 14, 2007 cited in U.S. Appl. No.11/016,446.
Notice of Allowance dated Oct. 1, 2008 cited in U.S. Appl. No. 11/016,422.
Office Action dated Feb. 6, 2009 cited in U.S. Appl. No. 11/428,133.
Chen et al., “Enforcing Routing Consistency in Structured Peer to Peer Overlays: Should We and Could We?”, 6 pages http://citeseer.ist.psu.edu/cache/papers/cs2/568/http:zSzzSziptps06.cs.ucsb.eduzSzpaperszSzChen-Cons06.pdf/chen06enforcing.pdf.
Gupta, Manish, “TPC-W E-Commerce Benchmark Using Javlin/ObjectStore”, 6 pages http://www.acm.org/sigs/sigmod/disc/dics01/out.websites/deb—march/odi.pdf.
Mendonga et al., “The Hierarchical Ring Protocol: An Efficient Scheme for Reading Replicated Data”, Date: 1993, 33 pages http://citeseer.ist.psu.edu/cache/papers/cs/813/http:zSzzSzwww.dcc.unicamp.brzSzic-tr-ftpzSz1993zSz93-02.pdf/the-hierarchical-ring-protocol.pdf.
Naef et al., “The blue-c Distributed Scene Graph”, dated: 2003, http://graphics.ethz.ch/Downloads/Publications/Papers/2003
ae03/p—Nae03/pdf.
Conti, Marco, et al. “Towards Scalable P2P Computing for Mobile Ad Hoc Networks” Pervasive Computing and Communications Workshops, 2004. Proceedings of the Second IEEE Annual Conference on, Piscataway, NJ, Mar. 14, 2002, pp. 109-113.
Ganesan, Prasanna, et al. Canon in G Major: Designing DHT's with Hierarchical Structure, Distributed Computing Systems, 2004 Proceedings, 24thInternational Conference on Hachioji, Tokyo, Japan, Mar. 24, 2004, pp. 263-272.
Cai, Min, et al. “MAAN: A Multi-Attributed Addressable Network for Grid Information Services” Grid Computing, 2003, Proceedings, Fourth International Workshop on Nov. 17, 2003, Piscataway, NJ, pp. 184-191.
Liu, Huaiyu, et al. “Neighbor Table Construction and Update in a Dynamic Peer-to-Peer Network” Proceedings of the 23rdInternational Conference on Distributed Computing Systems, ICDCS 2003. Providence, RI, May 19-22, vol. Conf. 23, May 19, 2003, pp. 509-518.
Seshadri, Mukund, “A Scalable Architecture for Broadcast Federation”, http://www.cs.berkeley.edu/mukunds/ms/citris/ms-report.pdf.
Krumm, John et al., “The NearMe Wireless Proximity Server”, Ubi Comp 2004. The Sixth International Conference on Ubiquitous Computing, Sep. 7-10, 2004, Nottingham, England http://research.microsoft.com/users/jckrumm/Publications%202004
earme%20distribute.pdf.
Waldo, Jim, Sun Microsystems, Inc. “Constructing Ad Hoc Networks”, pp. 9-20 2001 IEEE http://ieeexplore.ieee.org/search/wrapper.jsp?arnumber=962511.
Berger Stefan, et al., “Towards Pluggable Discovery Frameworks for Mobile and Pervasive Applications”, 12 pages 2004 IEEE http://ieeexplore.ieee.org/search/wrapper.jsp?arnumber=1263081.
Pertselakis, M., et al., “An Intelligent Agent based approach for Service Discovery in Wireless AD hoc Networks” http://www.cslab.ece.ntua.gr/˜mper/papers/IASDWAN.pdf.
Gandhi, Raj
Hasha Richard L.
Kakivaya Gopala Krishna R.
Malkhi Dahlia
Xun Lu
Microsoft Corporation
Perez Toro Carlos R
Vaughn, Jr. William C
Workman Nydegger
LandOfFree
Allocating and reclaiming resources within a rendezvous... does not yet have a rating. At this time, there are no reviews or comments for this patent.
If you have personal experience with Allocating and reclaiming resources within a rendezvous..., we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Allocating and reclaiming resources within a rendezvous... will most certainly appreciate the feedback.
Profile ID: LFUS-PAI-O-2625106