Multiplex communications – Network configuration determination – Using a particular learning algorithm or technique
Reexamination Certificate
2006-05-02
2006-05-02
Hsu, Alpus H. (Department: 2665)
Multiplex communications
Network configuration determination
Using a particular learning algorithm or technique
C370S392000, C370S395320, C707S793000, C709S238000, C711S216000, C711S221000
Reexamination Certificate
active
07039018
ABSTRACT:
A method and apparatus to search for routing information is described. According to an embodiment, a technique is described to search for routing information that uses a first technique on at least a portion of a first section of an address and a second technique on at least a portion of a second section of an address. In one embodiment, a best-match technique, such as a Longest Prefix Match technique, is used on at least a portion of a topology section of an address, and an exact-match technique is used on a portion of an interface ID of the address.
REFERENCES:
patent: 5524254 (1996-06-01), Morgan et al.
patent: 5583996 (1996-12-01), Tsuchiya
patent: 5761440 (1998-06-01), De Marco et al.
patent: 5825768 (1998-10-01), Kimbrow et al.
patent: 5884297 (1999-03-01), Noven
patent: 5940396 (1999-08-01), Rochberger
patent: 6011795 (2000-01-01), Varghese et al.
patent: 6018524 (2000-01-01), Turner et al.
patent: 6052683 (2000-04-01), Irwin
patent: 6061712 (2000-05-01), Tzeng
patent: 6115615 (2000-09-01), Ota et al.
patent: 6212184 (2001-04-01), Venkatachary et al.
patent: 6359879 (2002-03-01), Carvey et al.
patent: 6389024 (2002-05-01), Ghai et al.
patent: 6396842 (2002-05-01), Rochberger
patent: 6430527 (2002-08-01), Waters et al.
patent: 6449256 (2002-09-01), Varghese et al.
patent: 6522632 (2003-02-01), Waters et al.
patent: 6567380 (2003-05-01), Chen
patent: 6581106 (2003-06-01), Crescenzi et al.
patent: 6594268 (2003-07-01), Aukia et al.
patent: 6636498 (2003-10-01), Leung
patent: 6650642 (2003-11-01), Sugai et al.
patent: 6665297 (2003-12-01), Hariguchi et al.
patent: 6678678 (2004-01-01), Lee et al.
patent: 6691171 (2004-02-01), Liao
patent: 6731643 (2004-05-01), Cucchi et al.
patent: 6765896 (2004-07-01), Ahmed et al.
patent: 6775737 (2004-08-01), Warkhede et al.
patent: 6778530 (2004-08-01), Greene
patent: 6792423 (2004-09-01), Jeffries et al.
patent: 6798777 (2004-09-01), Ferguson et al.
patent: 6845091 (2005-01-01), Ogier et al.
patent: 6880064 (2005-04-01), Brown
patent: 2001/0040895 (2001-11-01), Templin
patent: 2002/0080798 (2002-06-01), Hariguchi
patent: 2002/0103631 (2002-08-01), Feldmann et al.
patent: 2002/0172203 (2002-11-01), Ji et al.
patent: 2003/0005146 (2003-01-01), Miller et al.
patent: 2003/0037042 (2003-02-01), Kametani
patent: 2003/0220987 (2003-11-01), Pearson
patent: 2004/0008634 (2004-01-01), Rangarajan et al.
patent: 2004/0013113 (2004-01-01), Singh et al.
patent: 2 350 534 (2000-11-01), None
patent: WO 01/05116 (2001-01-01), None
Newton, Harry, “Newton's Telecom Dictionary”, Telecom Books, 16th Edition, pp. 68 and 456.
Sklower, Keith; “A Tree-Based Packet Routing Table for Berkeley Unit,” Computer System Research Group, University of California, 1990, pp. 1-14, Berkeley, California, USA.
R.C. Chang et al., “Efficient IP Routing Table Lookup Scheme,” IEEE Proc. Commun., vol. 149, No. 2, Apr. 2002, pp. 77-82, USA.
Butler Lampson et al., “IP Lookups Using Multiway and Multicolumn Search,” IEEE/ACM Transactions on Networking, vol. 7, No. 3, Jun. 1999, pp. 324-334, USA.
A. Acharya et al., “Adaptive Algorithms for Cache-Efficient Trie Search”, ALENEX'99, <cs.ucsb.edu/˜acha/publications/soda98-submitted.html>.
M.J. Freedman and R. Vingralek, “Efficient Peer-To-Peer Lookup Based on a Distributed Trie”, pp. 1-6, <cs.rice.edu/Conferences/IPTPS02/167.pdf>.
D. Raskovic et al., “An Implementation of Hash Based ATM Router Chip”, Proceedings of the 28th Annual Hawaii International Conference on System Sciences, 1995, pp. 32-40, <ece.uah.edu/˜raskovd/pdf/hicss95.pdf>.
G. Parulkar et al., “An Architecture for Monitoring, Visualization and Control of Gigabit Networks”, Aug. 8, 1997, pp. 1-21, <siesta.cs.wustl.edu/˜schmidt/PDF/NMVC.pdf>.
K. Mai, “IP Packet Forwarding Lookups: An Introduction and Some Hardware Solutions”, Apr. 5, 2000, pp. 1-22, <velox.stanford.edu/papers/km-grpmtg-00.pdf>.
S. Nilsson and G. Karlsson, “Fast Address Lookup for Internet Routers”, Proceedings of Algorithms and Experiments (ALEX98), Feb. 9-11, 1998, pp. 9-18, <rtm.science.unitn.it/alex98/book/fast-lookup.ps.gz>.
J. Cleary and W.J. Teahan, “Unbounded Length Contexts for PPM”, The Computer Journal, 1993, pp. 1-9, vol. 36, No. 5, <cs.waikato.ac.nz/˜wjt/papers/CJ97.ps.gz>.
B. Lampson et al., “IP Lookups Using Multiway and Multicolumn Search”, May 11, 1998, pp. 1-26, <cs.ucsd.edu/˜varghese/PAPERS/ToN99.pdf>.
A. Belenkiy, “Deterministic IP Table Lookup at Wire Speed”, INET99, pp. 1-19, <isoc.org/inet99/proceedings/4j/4j-2.htm>.
H. Michael JI, “Fast Packet Forwarding with Configurable Processor”, pp. 1-7, <caip.rutgers.edu/∞hji/ip-forward-comm-des-conf.pdf>.
V. Srinivasan and G. Varghese, “Fast Address Lookups Using Controlled Prefix Expansion”, ACM Transactions on Computer Systems, Feb. 1999, pp. 1-40, vol. 17, No. 1, <cs.ucsd.edu/˜varghese/PAPERS/TOCS99.pdf>.
A. Donnelly and T. Deegan, “IP Route Lookups as String Matching”, 2000, pp. 1-7, <cl.cam.ac.uk/˜and1000/papers/lcn2000-route-lookups-as-string-matching.ps.gz>.
Huston Larry B.
Singh Ranjeeta
Hsu Alpus H.
Intel Corporation
Kacvinsky LLC
LandOfFree
Technique to improve network routing using best-match and... does not yet have a rating. At this time, there are no reviews or comments for this patent.
If you have personal experience with Technique to improve network routing using best-match and..., we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Technique to improve network routing using best-match and... will most certainly appreciate the feedback.
Profile ID: LFUS-PAI-O-3625421