Multiplex communications – Pathfinding or routing – Switching a message which includes an address header
Reexamination Certificate
2006-12-13
2010-02-02
Ton, Dang T (Department: 2419)
Multiplex communications
Pathfinding or routing
Switching a message which includes an address header
Reexamination Certificate
active
07656881
ABSTRACT:
In one embodiment, a system comprises a plurality of nodes that are communicatively coupled to one another. Each of the plurality of nodes, in the absence of any faults, is communicatively coupled to at least a first neighbor node and a first neighbor's neighbor node and a second neighbor node and a second neighbor's neighbor node. When at least a first clique and a second clique exist within the plurality of nodes and a first node included in the first clique successfully receives a synchronization message associated with the second clique from the first neighbor node of the first node and the first neighbor's neighbor node of the first node, the first node does the following. The first node defects to the second clique and synchronizes to the synchronization message. The first node also communicates a join message to at least the second neighbor node of the first node and the second neighbor's neighbor node of the first node. The join message indicates that the second neighbor node and the second neighbor's neighbor node should defect to the second clique and listen for a subsequent synchronization message from the second clique to which the second neighbor node and the second neighbor's neighbor node should synchronize.
REFERENCES:
patent: 4417334 (1983-11-01), Gunderson et al.
patent: 4428046 (1984-01-01), Chari et al.
patent: 4630254 (1986-12-01), Tseng
patent: 4631718 (1986-12-01), Miyao
patent: 4733391 (1988-03-01), Godbold et al.
patent: 4740958 (1988-04-01), Duxbury et al.
patent: 4856023 (1989-08-01), Singh
patent: 4866606 (1989-09-01), Kopetz
patent: 4905230 (1990-02-01), Madge et al.
patent: 5132962 (1992-07-01), Hobgood et al.
patent: 5161153 (1992-11-01), Westmore
patent: 5235595 (1993-08-01), O'Dowd
patent: 5257266 (1993-10-01), Maki
patent: 5307409 (1994-04-01), Driscoll
patent: 5341232 (1994-08-01), Popp
patent: 5383191 (1995-01-01), Hobgood et al.
patent: 5386424 (1995-01-01), Driscoll et al.
patent: 5394401 (1995-02-01), Patrick et al.
patent: 5463634 (1995-10-01), Smith et al.
patent: 5557778 (1996-09-01), Vaillancourt
patent: 5687356 (1997-11-01), Basso et al.
patent: 5715391 (1998-02-01), Jackson et al.
patent: 5896508 (1999-04-01), Lee
patent: 5903565 (1999-05-01), Neuhaus et al.
patent: 5920267 (1999-07-01), Tattersall et al.
patent: 5937414 (1999-08-01), Souder et al.
patent: 5940367 (1999-08-01), Antonov
patent: 6052753 (2000-04-01), Doerenberg et al.
patent: 6172984 (2001-01-01), Beyda et al.
patent: 6175553 (2001-01-01), Luk et al.
patent: 6226676 (2001-05-01), Crump et al.
patent: 6374078 (2002-04-01), Williams et al.
patent: 6414953 (2002-07-01), Lamarche et al.
patent: 6513092 (2003-01-01), Gorshe
patent: 6594802 (2003-07-01), Ricchetti et al.
patent: 6618359 (2003-09-01), Chen et al.
patent: 6707913 (2004-03-01), Harrison et al.
patent: 6741559 (2004-05-01), Smeulderse et al.
patent: 6760768 (2004-07-01), Holden et al.
patent: 6765924 (2004-07-01), Wu et al.
patent: 6842617 (2005-01-01), Williams et al.
patent: 6925497 (2005-08-01), Vetrivelkumaran et al.
patent: 6956461 (2005-10-01), Yoon et al.
patent: 7035539 (2006-04-01), Gumaste
patent: 7050395 (2006-05-01), Chow et al.
patent: 7085560 (2006-08-01), Petermann
patent: 7088921 (2006-08-01), Wood
patent: 7269177 (2007-09-01), Baker
patent: 7349414 (2008-03-01), Sandstrom
patent: 7372859 (2008-05-01), Hall et al.
patent: 7457303 (2008-11-01), Blumrich et al.
patent: 7502334 (2009-03-01), Hall et al.
patent: 2002/0027877 (2002-03-01), Son et al.
patent: 2002/0087763 (2002-07-01), Wendorff
patent: 2002/0118636 (2002-08-01), Phelps et al.
patent: 2003/0067867 (2003-04-01), Weis
patent: 2003/0128984 (2003-07-01), Oberg et al.
patent: 2004/0073698 (2004-04-01), Harter et al.
patent: 2004/0223515 (2004-11-01), Rygielski et al.
patent: 2004/0258097 (2004-12-01), Arnold et al.
patent: 2005/0002332 (2005-01-01), Oh
patent: 2005/0132105 (2005-06-01), Hall et al.
patent: 2005/0135278 (2005-06-01), Hall et al.
patent: 2005/0152377 (2005-07-01), Hall et al.
patent: 2005/0169296 (2005-08-01), Katar et al.
patent: 2005/0198280 (2005-09-01), Hall et al.
patent: 2006/0077981 (2006-04-01), Rogers
patent: 2006/0203851 (2006-09-01), Eidson
patent: 2008/0010705 (2008-01-01), Quaid et al.
patent: 2008/0080551 (2008-04-01), Driscoll et al.
patent: 2008/0144668 (2008-06-01), Hall et al.
patent: 2009/0086653 (2009-04-01), Driscoll et al.
patent: 407582 (2001-04-01), None
patent: 3238692 (1984-04-01), None
patent: 19633744 (1998-02-01), None
patent: 20220280 (2003-11-01), None
patent: 0405706 (1990-02-01), None
patent: 1280024 (2003-01-01), None
patent: 1280312 (2003-01-01), None
patent: 1365543 (2003-11-01), None
patent: 1398710 (2004-03-01), None
patent: 1469627 (2004-10-01), None
patent: 2028062 (1980-02-01), None
patent: 1581803 (1980-12-01), None
patent: 2175775 (1986-12-01), None
patent: 0064122 (2000-10-01), None
Al-Rousan et al., “The Two-Processor Reliability of Hierarchical Larg-Scale Ring-Based Networks”, “Proceedings of the 29th Hawaii International Conference on System Sciences”, 1996, pp. 63-71.
“Backplane Data Bus ARINC Specification 659”, Dec. 1993, pp. 1-132, Publisher: ARINC.
Avizienis, “A Fault Tolerance Infrastructure for Dependable Computing With High-Performance Cots Componenets”, “Conference Proceedings on Dependable Systems and Networks”, Jun. 2000, pp. 492-500, Publisher: IEEE, Published in: New York, NY.
Bauer et al., “Assumption Coverage Under Different Failure Modes in the Time-Triggered Architecture”, “8th IEEE International Conference on Emerging Technologies and Factory Automation”, Oct. 2001, pp. 333-341, Publisher: IEEE.
Bauer et al., “Transparent Redundancy in the Time-Triggered Architecture”, “Proceedings of the Conference on Dependable Systems and Networks”, 2000, pp. 5-13, Publisher: IEEE.
Bauer et al., “The Central Guardian Approach to Enforce Fault Isolation in a Time-Triggered System”, “Proceedings of Symposium on Autonomous Decentralized Systems”, Apr. 2003, pp. 37-44, Publisher: IEEE.
Bosch, “Can Specification Version 2.0”, “SAE Handbook—Parts and Components”, 1998, pp. 1-72, vol. 2, Publisher: Society of Automotive Engineers.
D'Luna, “A Single-Chip Universal Cable Set-Top Box/Modern Transceiver”, “Journal of Sold-State Circuits”, Nov. 1998, pp. 1647-1660, vol. 34, No. 11, Publisher: IEEE.
Driscoll et al., “The Real Byzantine Generals”, “Proceedings of Digital Avionics System Conference”, Oct. 2004, pp. 6.D.4-1-6.D.4-11, Publisher: IEEE.
Brinkmeyer, “Flexray International Workshop Slides”, “www.flexray-group.com”, Apr. 2002, pp. 1-356, Publisher: Flexray.
“Flexray Communication System: Protocol Specification Version 2.1 Revision A”, “ www.flexray-group.com”, Mar. 2006, pp. 1-8, Publisher: Flexray Consortium.
“Preliminary Node-Local Bus Guardian Specification Version 2.0.9”, Dec. 2005, pp. 1-75, Publisher: Flexray Consortium.
“Preliminary Central Bus Guardian Specification Version 2.0.9”, Dec. 2005, pp. 1-38, Publisher: Flexray Consortium.
Grnarov et al., “A Highly Reliable Distributed Loop Network Architecture”, “Proceedings of Fault-Tolerant Computing Symposium”, Jun. 1980, pp. 319-324, Publisher: IEEE.
Gruenbacher, “Fault Injection for TTA”, 1999, Publisher: Information Society Technologies.
Hall et al., “Ringing Out Fault Tolerance a New Ring Network for Superior Low-Dost Dependabilitiy”, “International Conference on Dependable Systems and Networks (DSN'05)”, 2005, pp. 298-307.
Hammett et al., “Achieving 10-9 Dependability With Drive-by-Wire Systems”, “SAE World Congress” 2003, pp. 534-547, vol. 112, No. 7, Publisher: Society of Automotive Engineers.
Hopper et al., “Design and Use of an Integrated Cambridge Ring”, “Journal on Selected
Driscoll Kevin R.
Hall Brendan
Paulitsch Michael
Fogg & Powers LLC
Honeywell International , Inc.
Ott Frederick
Ton Dang T
LandOfFree
Methods for expedited start-up and clique aggregation using... does not yet have a rating. At this time, there are no reviews or comments for this patent.
If you have personal experience with Methods for expedited start-up and clique aggregation using..., we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Methods for expedited start-up and clique aggregation using... will most certainly appreciate the feedback.
Profile ID: LFUS-PAI-O-4177204