Electrical computers and digital processing systems: multicomput – Computer-to-computer data routing – Decentralized controlling
Reexamination Certificate
2004-12-17
2009-11-24
Vaughn, Jr., William C (Department: 2444)
Electrical computers and digital processing systems: multicomput
Computer-to-computer data routing
Decentralized controlling
C709S238000, C709S230000, C709S237000
Reexamination Certificate
active
07624194
ABSTRACT:
The present invention extends to methods, systems, and computer program products for establishing and maintaining membership within a federation infrastructure. A joining node submits a join message to an existing federation infrastructure. The federation infrastructure routes the join message to a processing node. The processing node facilitates identification of predecessor, successor, neighborhood, and routing nodes (for the joining node) within a ring of nodes. The joining node exchanges messages with identified nodes to obtain state information for the identified nodes and other nodes within the ring. Nodes periodically exchange state information, including state information for other nodes, such that state information for the ring is efficiently propagated to all nodes in the ring even when communication between some nodes is lost. Instance IDs, phase values, and freshness values are used to determine when state information is stale and/or is to be updated.
REFERENCES:
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: 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: 6615362 (2003-09-01), Daruwalla
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: 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: 7139930 (2006-11-01), Mashayekhi
patent: 7181547 (2007-02-01), Millet
patent: 7231463 (2007-06-01), Nagendra
patent: 7324440 (2008-01-01), Takagi
patent: 7404006 (2008-07-01), Slaughter
patent: 7453884 (2008-11-01), Ma
patent: 2002/0059425 (2002-05-01), Belfiore
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/0055892 (2003-03-01), Huitema et al.
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: 2004/0054807 (2004-03-01), Harvey
patent: 2004/0064511 (2004-04-01), Abdel-Aziz
patent: 2004/0066741 (2004-04-01), Dinker
patent: 2004/0111651 (2004-06-01), Mukherjee
patent: 2004/0139150 (2004-07-01), McCanne et al.
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/0091399 (2005-04-01), Candan et al.
patent: 2005/0100036 (2005-05-01), Davis
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/0087985 (2006-04-01), Kakivaya
patent: 2006/0087990 (2006-04-01), Kakivaya
patent: 2006/0088039 (2006-04-01), Kakivaya
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/0053285 (2007-03-01), Beer
patent: 2007/0183460 (2007-08-01), Enders
patent: 1139602 (2001-10-01), None
Miguel Castro, Peter Druschel, Y. Charlie Hu, and Antony Rowstron. Exploiting network proximity in peer-to-peer overlay networks. Technical report MSR-TR-2002-82, 2002.
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 Go 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 (PDF Attachment Article 1).
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 (PDF Attachment Article 2).
Waldo, Jim, Sun Microsystems, Inc. “Constructing Ad Hoc Networks”, pp. 9-20 2001 IEEE http://ieeexplore.ieee.org/search/wrapper.jsp?arnumber=962511 (PDF Attachment Article 3).
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 (PDF Attachment Article 4).
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 (PDF Attachment Article 5).
Gandhi, Rajiv, et al., “Minimizing Broadcast Latency and Redundancy in Ad Hoc Networks”, 2003, pp. 222-232 http://www.sigmobile.org/mobihoc/2003/papers/p222-gandhi.pdf (PDF Attachment Article 6).
Li, Ning, et al., “BLMST: A Scalable, Power-Efficient Broadcast Algorithm for Wireless Networks”, IEEE Computer Society, http://csdl2.computer.org/persagen/DLAbsToc.jsp?resourcePath=/dl/proceedings/&toc=comp/proceedings/qshine/2004/2233/00/2233toc.xml&DOI=10.1109/QSHINE.2004.13 (PDF Attachment Article 7).
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/disc01/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.
U.S. Appl. No. 11/549,332, filed Oct. 13, 2006, Kakivaya.
U.S. Appl. No. 11/752,198, filed May 22, 2007, Hasha.
Wepiwe, Giscard, et al., A concentric Multi-ring Overlay for Highly Reliable P2P Networks, Proceedings of the 2005 Fourth IEEE International Symposium on Network Computing and Applications (NCA'05), 8 pages.
Cohen, Reuven, et al., “A New Protocol for Route Discovery In Multiple-Ring Networks: Part II—Multicast, Recovery and High-Speed Processing”, IEEE Transactions on Communications, vol. 42, No. 2/3/4, Feb./Mar./Apr. 1994, pp. 1112-1119.
Wang, Guojun, et al., “A Proxy-based Mobile Group Membership Protocol for Large Scale and Highly Dynamic Groups”, 2006 IEEE,
Hasha Richard L.
Kakivaya Gopala Krishna R.
Rodeheffer Thomas Lee
Microsoft Corporation
Perez Toro Carlos R
Vaughn, Jr. William C
Workman Nydegger
LandOfFree
Establishing membership within a federation infrastructure does not yet have a rating. At this time, there are no reviews or comments for this patent.
If you have personal experience with Establishing membership within a federation infrastructure, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Establishing membership within a federation infrastructure will most certainly appreciate the feedback.
Profile ID: LFUS-PAI-O-4058159