Electrical computers and digital processing systems: support – Multiple computer communication using cryptography – Having particular address related cryptography
Reexamination Certificate
2003-07-22
2008-09-02
Barron, Jr., Gilberto (Department: 2132)
Electrical computers and digital processing systems: support
Multiple computer communication using cryptography
Having particular address related cryptography
C370S254000, C709S201000
Reexamination Certificate
active
07421578
ABSTRACT:
A method performed by a first computer node for selecting a leader node to provide service to a plurality of other nodes in a multicast group, wherein each of the nodes communicates using multicast messages, comprises issuing a first election call message; receiving candidacy announcement messages from one or more leader candidate nodes in a specified time period; selecting a victor from among all leader candidate nodes from which candidacy announcement messages are received; receiving one or more victor announcement messages from one or more leader victor nodes for a second specified time period; resolving zero or more collisions among the victor announcement messages to result in selecting the leader node. One embodiment provides a dynamic secure protocol for electing a key server, such as a key server that is suited for use with a group key exchange protocol such as the Group Domain of Interpretation (GDOI). Public key signatures may be used to secure message exchanges and to provide for authentication of network nodes in a multicast group.
REFERENCES:
patent: 5634011 (1997-05-01), Auerbach et al.
patent: 6256309 (2001-07-01), Daley et al.
patent: 6529498 (2003-03-01), Cheng
patent: 6563798 (2003-05-01), Cheng
patent: 6600724 (2003-07-01), Cheng
patent: 6718394 (2004-04-01), Cain
patent: 6732189 (2004-05-01), Novaes
patent: 6748447 (2004-06-01), Basani et al.
patent: 6993587 (2006-01-01), Basani et al.
Jonathan K. Millen and Grit Denker, CAPSL and MuCAPSL, Journal of Telecommunications and Information Technology, Apr. 2002, http://www.itl.waw.pl/czasopisma/JTIT/2002/4/16.pdf and retrieved date Dec. 25, 2006.
D. Maughan, et al., “Internet Security Association and Key Management Protocol (ISAKMP),” Nov. 1998, Network Working Group, Request for Comments: 2408, http://www.ietf.org/rfc/rfc2408.txt?number=2408, printed Dec. 5, 2003, pp. 1-81.
M. Baugher, et al., The Group Domain of Interpretation, Jul. 2003, Network Working Group, Request for Comments: 3547, http://www.ietf.org/rfc/rfc3547.txt?number=3547, printed Dec. 5, 2003, pp. 1-45.
S. Kent, et al., “Security Architecture for the Internet Protocol,” Nov. 1998, Network Working Group, Request for Comments: 2401, http://www.ietf.org/rfc/rfc2401.txt?number=2401, printed Dec. 5, 2003, pp. 1-62.
D. Eastlake, et al., “US Secure Hash Algorithm 1 (SHA1),” Sep. 2001, Network Working Group, Request for Comments: 3174, http://www.ietf.org/rfc/rfc3174.txt?number=3174, printed Dec. 5, 2003, pp. 1-21.
E. Rescorla, “Diffie-Hellman Key Agreement Method,” Jun. 1999, Network Working Group, Request for Comments: 2631, http://www.ietf.org/rfc2631.txt?number=2631, printed Dec. 5, 2003, pp. 1-13.
D. Harkins, et al., “The Internet Key Exchange (IKE),” Nov. 1998, Network Working Group, Request for Comments: 2409, http://www.ietf.org/rfc/rfc2409.txt?number=2409, pp. 1-39.
R. L. Rivest, et al., “A Method for Obtaining Digital Signatures and Public-Key Cryptosystems,”Communications of the ACM, vol. 21, No. 2, Feb. 1978, pp. 120-126.
Yih Huang, et al., “Group Leader Election under Link-State Routing,” Proceedings of International Conference on Network Protocols, 1997, IEEE, pp. 95-104.
Indranil Gupta, et al., “A Probabilistically Correct Leader Election Protocol for Large Groups,” International Symposium on Distributed Computing, 2000, 15 pages.
Michael J. Fischer, et al., “Impossibility of Distributed Consensus with One Faulty Process,” Journal of the Association for Computing Machinery, vol. 32, No. 2, Apr. 1985, pp. 374-382.
Thomas Kostas, et al., “Key Management for Secure Multicast Group Communication in Mobile Networks,” DARPA, undated, pp. 1-3.
Thomas Kostas, et al., “A Hierarchical Key Management System for Secure Multicast Group Communications in JTRS,” DARPA, PTN#869, undated, pp. 1-15.
Sundarshan Vasudevan, et al., “Secure Leader Election Wireless Ad Hoc Networks,” Umass Computer Science Technical Report 01-50, undated, published 2001, pp. 1-31.
Cisco Systems, Inc., “PNNI Migration Examples,” Oct. 30, 2002, pp. 1-18.
Cisco Systems, Inc., “Cisco MGX 8800 Series Switches,” Sep. 7, 2003, pp. 1-76.
Cisco Systems, Inc., “Configure PNNI Port Control Virtual Channel—PXM45, PXM1E,” Part No. 78-14789-01 Rev. CO, Sep. 2003, pp. 2-261-2-304.
Cisco Systems, Inc., “ATM Routing,” Release 1, Part No. 78-12275-02 Rev. AO, Mar. 2001, pp. 2-1-2-26.
Cisco Systems, Inc., “Configuring ATM SVCs, PNNI Routing, and SPVCs,” Release 1, Part No. 78-6123-05 Rev. AO, Mar. 2001, pp. 5-1-5-50.
Huang Geoffrey
Weis Brian
Barron Jr. Gilberto
Cisco Technology Inc.
Lemma Samson
LandOfFree
Method and apparatus for electing a leader node in a... does not yet have a rating. At this time, there are no reviews or comments for this patent.
If you have personal experience with Method and apparatus for electing a leader node in a..., we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Method and apparatus for electing a leader node in a... will most certainly appreciate the feedback.
Profile ID: LFUS-PAI-O-3984483