Multiplex communications – Network configuration determination
Reexamination Certificate
2004-12-17
2008-12-16
Chan, Wing F (Department: 2619)
Multiplex communications
Network configuration determination
Reexamination Certificate
active
07466662
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: 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: 6542513 (2003-04-01), Franke
patent: 6775703 (2004-08-01), Burns et al.
patent: 6850987 (2005-02-01), McCanne
patent: 6909721 (2005-06-01), Ekberg
patent: 6917985 (2005-07-01), Madruga
patent: 6947963 (2005-09-01), Agarwal et al.
patent: 6988173 (2006-01-01), Blake et al.
patent: 7043550 (2006-05-01), Knop et al.
patent: 2002/0059425 (2002-05-01), Belfiore
patent: 2002/0150145 (2002-10-01), Alriksson
patent: 2002/0184357 (2002-12-01), Traversat
patent: 2003/0145086 (2003-07-01), O'Reilly
patent: 2003/0165140 (2003-09-01), Tang
patent: 2003/0182444 (2003-09-01), Pedone
patent: 2004/0066741 (2004-04-01), Dinker
patent: 2004/0103282 (2004-05-01), Meier et al.
patent: 2004/0139150 (2004-07-01), McCanne
patent: 2004/0218536 (2004-11-01), Yasukawa
patent: 2005/0021725 (2005-01-01), Lobbert
patent: 2005/0031119 (2005-02-01), Ding
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
patent: 2005/0152318 (2005-07-01), Elbatt
patent: 2005/0187946 (2005-08-01), Zhang
patent: 2005/0220106 (2005-10-01), Raverdy
patent: 2006/0087990 (2006-04-01), Kakivaya
patent: 2006/0088015 (2006-04-01), Kakivaya et al.
patent: 2006/0088039 (2006-04-01), Kakivaya
patent: 2006/0092940 (2006-05-01), Ansari et al.
patent: 2006/0155781 (2006-07-01), MacCormick et al.
patent: 2006/0282505 (2006-12-01), Hasha et al.
patent: 2006/0282547 (2006-12-01), Hasha et al.
patent: 2007/0002774 (2007-01-01), Hasha et al.
patent: 2007/0183460 (2007-08-01), Enders
patent: 2007/0280169 (2007-12-01), Cam Winget
patent: 2008/0005624 (2008-01-01), Kakivaya et al.
patent: 2008/0031246 (2008-02-01), Hasha et al.
U.S. Appl. No. 11/549,332, filed Oct. 13, 2006, Kakivaya.
U.S. Appl. No. 11/752,198, filed May 22, 2007, Hasha.
Seshadri, Mukund, “A Scalable Architecture for Broadcast Federation”, http://www.cs.berkeley.edu/˜mukunds/ms/citris/ms-report.pdf ; Dec. 2002.
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.
Berger Stefan, et al., “Towards Pluggable Discovery Frameworks for Mobile and Pervasive Applications”, 12 pages 2004 IEEE.
Pertselakis, M., et al., “An Intelligent Agent based approach for Service Discovery in Wireless AD hoc Networks” ; Mar. 2002.
Gandhi, Rajiv, et al., “Minimizing Broadcast Latency and Redundancy in Ad Hoc Networks”, 2003, pp. 222-232.
Li, Ning, et al., “BLMST: A Scalable, Power-Efficient Broadcast Algorithm for Wireless Networks”, IEEE Computer Society ; May 2004.
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, pp. 1897-1902.
Notice of Allowance mailed Sep. 25, 2007 cited in related case U.S. Appl. No. 11/016,446.
Chord: A scalable Peer-to-peer Lookup Protocol for Internet Applications Ion Stoica, Robert Morris, David Liben-Nowell, David R. Karger, M. Frans Kaashoek, Frank Dabek, Harris Balakrishnan.
Pastry: Scalable, decentralized object location and routing for large-scale peer-to-peer systems Anthony Rowstron and Peter Druschel.
Kademlia: A Peer-to-peer Information System Based on the XOR Metric Peter Maymounkov and David Mazieres p. 1-6.
Exploiting network proximity in peer-to-peer overlay networks Miguel Castro, Peter Druschel, Y. Charlie Hu, Anthony Rowstron p. 1-15.
A. Scalable Content-Addressable Network Sylvia Ratnasamy, Paul Francis, Mark Handley, Richard Karp, Scott Shenker p. 1-17 Written by Vladimir Eske, Saarland University, Department of Computer Science.
A Scalable Content-Addressable Network Sylvia Ratnasamy, Paul Francis, Mark Handley, Richard Karp, Scott Shenker Copyright 2001, Aug. 27-31, 2001, San Diego CA p. 161-172.
Tapestry: An Infrastructure for Fault-tolerant Wide-area Location and Routing Ben Y. Zhao, John Kubiatowicz, and Anthony D. Joseph Computer Science Division p. 1-27.
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.
Chen et al., “Enforcing Routing Consistency in Structured Peer to Peer Overlays: Should We and Could We?”, 6 pages ; Feb. 2006. 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 ; Mar. 2000. 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.
Hasha Richard L.
Kakivaya Gopala Krishna R.
Rodeheffer Thomas Lee
Chan Wing F
Jones Prenell P
Microsoft Corporation
Workman Nydegger
LandOfFree
Discovering liveness information within a federation... does not yet have a rating. At this time, there are no reviews or comments for this patent.
If you have personal experience with Discovering liveness information within a federation..., we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Discovering liveness information within a federation... will most certainly appreciate the feedback.
Profile ID: LFUS-PAI-O-4025017