Multiplex communications – Pathfinding or routing – Switching a message which includes an address header
Reexamination Certificate
2011-03-29
2011-03-29
Trost, IV, William (Department: 2472)
Multiplex communications
Pathfinding or routing
Switching a message which includes an address header
C370S401000, C370S256000, C370S252000, C709S252000
Reexamination Certificate
active
07916741
ABSTRACT:
A system and method for preventing a count-to-infinity problem in a network using epochs of sequence numbers in protocol messages to eliminate stale protocol information in the network and to allow the forwarding topology to recover in merely one round trip time across the network.
REFERENCES:
patent: 6219739 (2001-04-01), Dutt et al.
patent: 6584109 (2003-06-01), Feuerstraeter et al.
patent: 6614764 (2003-09-01), Rodeheffer et al.
patent: 6721275 (2004-04-01), Rodeheffer et al.
patent: 6857059 (2005-02-01), Karpoff et al.
patent: 6898189 (2005-05-01), Di Benedetto et al.
patent: 7061858 (2006-06-01), Di Benedetto et al.
patent: 7061875 (2006-06-01), Portolani et al.
patent: 7102995 (2006-09-01), Gonda
patent: 7177946 (2007-02-01), Kaluve et al.
patent: 7558217 (2009-07-01), Rodeheffer et al.
patent: 7599284 (2009-10-01), Di Benedetto et al.
patent: 7653011 (2010-01-01), Rahman et al.
patent: 2004/0081171 (2004-04-01), Finn
patent: 2004/0179524 (2004-09-01), Sasagawa et al.
patent: 2005/0036500 (2005-02-01), Rodeheffer et al.
patent: 2005/0198232 (2005-09-01), Haalen et al.
patent: 2005/0207348 (2005-09-01), Tsurumi et al.
patent: 2006/0007865 (2006-01-01), White et al.
patent: 2006/0133286 (2006-06-01), Eli-Dit-Cosaque
patent: 2006/0198323 (2006-09-01), Finn
patent: 2006/0233186 (2006-10-01), Portolani et al.
patent: 2006/0253561 (2006-11-01), Holmeide et al.
patent: 2007/0008964 (2007-01-01), Rose et al.
patent: 2007/0025275 (2007-02-01), Tallet et al.
patent: 2007/0206513 (2007-09-01), Cho et al.
Counting to Infinity Janne Lindqvist Helsinki University of Technology Telecommunications Software and Multimedia Laboratory Sjökulla, Apr. 26/27, 2004.
K. Birman, A. Schiper, and P. Stephenson. Lightweight casual and atomic group multicast. ACM Transactions on Computer Systems, Aug. 1991, 272-314, 9(3).
Cisco Systems, Inc., Spanning Tree Protocol Problems and Related Design Considerations. At http://www.cisco.com/warp/public/473/146.html.
Cisco Systems, Inc., Understanding Rapid Spanning Tree Protocol (802.1). At http://www.cisco.com/warp/public/473/146.html.
C. E. Perkins and P. Bhagwat. Higly dynamic Destination-Sequenced Distance-Vector routing (DSDV) for mobile computers. ACM SIGCOMM, Aug. 1994, 234-244.
P. M. Merlin and A. Segall. A Failsafe Distributed Routing Protocol. IEEE/ACM Transactions on Networking. Sep. 1979, 1280-1287, 27(9).
J. J. Garcia-Lunes-Aceves. Loop-Free Routing Using Diffusing Computations. IEEE/ACM Transactions on Networking, Feb. 1993, 130-141, 1(1).
J. M. Jaffe and F. H. Moss. A Responsive Distributed Routing Algorithm for Computer Networks. IEEE Transactions on Communications, Jul. 1982, 1758-1762, 30.
R. Garcia, J. Duato, and F. Silla. “LSOM: A link state protocol over mac addresses for metropolitan backbones using optical ethernet switches” Second IEEE International Symposium on Network Computing and Applications, 2003.
A. Myers, T. S. E. Ng, and H. Zhang. Rethinking the Service Model: Scaling Ethernet to a Million Nodes. Third Workshop on Hot Topics in Networks (HotNets-III), Mar. 2004.
F. D. Pellegrini, D. Starobinski, M. G. Karpovsky, and L. B. Levitin. Scalable cycle-breaking algorithms for gigabit Ethernet backbones. IEEE Infocom 2004, Mar. 2004.
R. Perlman. Rbridges: Transparent routing. IEEE Infocom 2004, Mar. 2004.
T. L. Rodeheffer, C. A. Thekkath, and D. C. Anderson. Smartbridge: A scalable bridge architecture. ACM SIGCOMM 2000, Aug. 2000.
E. W. Dijkstra and C. S. Scholten. Termination detection for diffusing computations. Information Processing Letters, Aug. 1980, 14, 11(1).
S. Sharma, K. Gopalan, S. Nanda, and T. Chiueh. Viking: A multi-spanning-tree Ethernet achitecture for metropolitan area and cluster networks. IEEE Infocom 2004, Mar. 2004.
E. Elnozahy and W. Zwaenepoel, “Manetho:Transparent Rollback-Recovery with Low Overhead, Limited Rollback and Fast Output Commit,” IEEE Transactions on Computers, Special Issue on Fault-Tolerant Computing, pp. 526-531 (May 1992).
Cox Alan L.
Elmeleegy Khaled
Ng Tze Sing Eugene
24IP Law Group
DeWitt Timothy R.
Maglo Emmanuel
Trost, IV William
William Marsh Rice University
LandOfFree
System and method for preventing count-to-infinity problems... does not yet have a rating. At this time, there are no reviews or comments for this patent.
If you have personal experience with System and method for preventing count-to-infinity problems..., we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and System and method for preventing count-to-infinity problems... will most certainly appreciate the feedback.
Profile ID: LFUS-PAI-O-2758037