Electrical computers and digital processing systems: multicomput – Ring computer networking
Reexamination Certificate
2006-08-17
2010-06-01
Jagannathan, Melanie (Department: 2468)
Electrical computers and digital processing systems: multicomput
Ring computer networking
C709S207000, C709S238000, C709S243000, C370S254000, C370S258000, C370S338000, C370S390000, C370S400000
Reexamination Certificate
active
07730220
ABSTRACT:
The present invention extends to methods, systems, and computer program products for broadcasting communication within a rendezvous federation. Embodiments of the invention include inter-ring and intra-ring communication. Inter-ring communication includes sending a message to destination rings included in a node's Collateral Ring Set entry table. When a node identifies a destination ring that has not yet received a message, the node can send a ring notification message. The ring notification message propagates towards a publishing node until a responsible node in the message path to the publishing node is identified. The responsible node updates its entry table to include the ring and forwards the message to the destination ring. Intra-ring communication can include recursively partitioning ranges of nodes within a ring and forwarding the message to nodes included the partitioned ranges.
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 et al.
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
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 et al.
patent: 2004/0064511 (2004-04-01), Abdel-Aziz
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
patent: 2005/0100036 (2005-05-01), Davis
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/0088015 (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: 2007/0053285 (2007-03-01), Beer
patent: 1139602 (2001-10-01), None
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.
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.
Stoica, Ion, “Chord: A Scalable Peer-to-Peer Lookup Protocol for Internet Applications”, IEEE/ACM Transactions on Networking, vol. 11, No. 1, Feb. 2003, pp. 17-32.
Rowstron, Antony, et al., “Pastry: Scalable, decentralized object location and routing for large-scale peer-to-peer systems”.
Maymounkov, Petar, et al., “Kademlia: A Peer-to-peer Information System Based on XOR Metric”, pp. 1-6.
Castro, Miguel, et al., “Exploiting network proximity in peer-to-peer overlay networks”, pp. 1-15.
Ratnasamy, Sylvia, et al. “A Scalable Content-Addressable Network”, written by Vladimir Eske Saarland University, Department of Computer Science, pp. 1-17.
Ratnasamy, Sylvia, et al., “A Scalable Content-Addressable Network”, Copyright 2001, Aug. 27-31, 2001, San Diego, CA, p. 161-172.
Zhao, Ben Y. et al., “Tapestry: An Infrastructure for Fault-tolerant Wide-area Location and Routing”, Apr. 2001, pp. 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 G Major: Designing DHTs with Hierarchical Structure”, Proceedings of the 24thInternational Conference on Distributed Computing Systems, 2004.
Cai, Min, et al., “MANN: A Multi-Attribute Addressable Network for Grid Information Services”, Proceedings of the Fourth International Workshop on Grid Computing, 2003.
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, 2003.
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.
Li, Ning, et al., “BLMST: A Scalable, Power-Efficient Broadcast Algorithm for Wireless Networks”, IEEE Computer Society, http://csd-12.computer.org/persagen/DLAbsToc.jsp?resourcePath=/dl/proceedings/&toc=comp/proceedings/qshine/2004/2233/00/2233toc.xml&DOI=10.1109/QSHINE.2004.13.
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.
Chord: A scalable Peer-to-Peer Lookup Protocol
Hasha Richard L.
Kakivaya Gopala Krishna R.
Xun Lu
Chang Stephanie
Jagannathan Melanie
Microsoft Corporation
Workman Nydegger
LandOfFree
Broadcasting communication within a rendezvous 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 Broadcasting communication within a rendezvous federation, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Broadcasting communication within a rendezvous federation will most certainly appreciate the feedback.
Profile ID: LFUS-PAI-O-4238995