Multiplex communications – Pathfinding or routing – Combined circuit switching and packet switching
Reexamination Certificate
2005-10-21
2009-06-23
Kizou, Hassan (Department: 2419)
Multiplex communications
Pathfinding or routing
Combined circuit switching and packet switching
C370S393000, C370S395320, C370S408000
Reexamination Certificate
active
07551609
ABSTRACT:
Stored in the leaf nodes of a data structure that can be used for identifying the longest prefix matching an address are corresponding values from multiple forwarding information bases. A single common address lookup data structure (e.g., a tree, trie, etc.) can be used, and a leaf node can contain information from multiple forwarding information bases. If lookup operations are performed for a single address in multiple forwarding information bases, the single common address lookup data structure may only need to be traversed once. For example, the forwarding information for another forwarding information base may be stored in the same leaf, further down in the data structure requiring traversal from the current position, or above requiring traversal from the root of the lookup data structure. Information can be stored in the leaf node to indicate which traversal option is appropriate for a particular forwarding information base.
REFERENCES:
patent: 5781772 (1998-07-01), Wilkinson, III et al.
patent: 5787430 (1998-07-01), Doeringer et al.
patent: 5857196 (1999-01-01), Angle et al.
patent: 6014659 (2000-01-01), Wilkinson, III et al.
patent: 6192051 (2001-02-01), Lipman et al.
patent: 6266706 (2001-07-01), Brodnik et al.
patent: 6519248 (2003-02-01), Valko
patent: 6560610 (2003-05-01), Eatherton et al.
patent: 6697363 (2004-02-01), Carr
patent: 6859455 (2005-02-01), Yazdani et al.
patent: 6876655 (2005-04-01), Afek et al.
patent: 6891834 (2005-05-01), Dally et al.
patent: 6915291 (2005-07-01), Carlson et al.
patent: 7054315 (2006-05-01), Liao
patent: 7106732 (2006-09-01), Brown
patent: 2002/0143747 (2002-10-01), Tal et al.
patent: 2002/0147721 (2002-10-01), Gupta et al.
patent: 2002/0159466 (2002-10-01), Rhoades
patent: 2003/0108043 (2003-06-01), Liao
patent: 2003/0174717 (2003-09-01), Zabarski et al.
patent: 2004/0111402 (2004-06-01), Waters et al.
patent: 2004/0236720 (2004-11-01), Basso et al.
patent: 2004/0249803 (2004-12-01), Vankatachary et al.
patent: 2005/0083937 (2005-04-01), Lim
patent: 2005/0157712 (2005-07-01), Rangarajan et al.
patent: 2005/0171959 (2005-08-01), Deforche et al.
patent: 2005/0265328 (2005-12-01), Bettink
patent: 2007/0038626 (2007-02-01), Waters et al.
Bettink John H. W.
Maniyar Shyamsundar N.
Uberoy Pawan
Ward David Delano
Cisco Technology Inc.
Kavleski Ryan C.
Kizou Hassan
The Law Office of Kirk D. Williams
LandOfFree
Data structure for storing and accessing multiple... does not yet have a rating. At this time, there are no reviews or comments for this patent.
If you have personal experience with Data structure for storing and accessing multiple..., we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Data structure for storing and accessing multiple... will most certainly appreciate the feedback.
Profile ID: LFUS-PAI-O-4085979