Multiple parallel packet routing lookup

Information

  • Patent Grant
  • 6212183
  • Patent Number
    6,212,183
  • Date Filed
    Friday, August 22, 1997
    27 years ago
  • Date Issued
    Tuesday, April 3, 2001
    23 years ago
Abstract
The invention provides a method and system for routing information lookup for packets using a routing protocol such as IP. Routing information which has been determined responsive to the packet header, which includes a destination address, a source address, and an input interface for the packet. Routing lookup is performed in response to at least one set of selected routing information, using a lookup table which includes tags both for the routing information and for a bitmask length (thus indicating the generality or scope of the routing information for the routing lookup). The lookup table is structured so that addresses having the most common bitmask length are addressed first, but that more specific addresses are still considered when they are present. It has been discovered that most internet addresses can be found by reference to 24-bit or 21-bit IP addresses, after which 16-bit, 12-bit, and finally 32-bit IP addresses are considered. Lookup flags indicate when a relatively uncommon but more specific 32-bit IP address match is available. A memory controller pipelines the lookup requests to a hash table memory, flushes superfluous requests when a lookup result is found, and handles cases relating to 32-bit IP address matches.
Description




BACKGROUND OF THE INVENTION




1. Field of the Invention




The invention relates to packet switching.




2. Related Art




In a packet-switched network, a “router” is a device which receives packets on one or more input interfaces and which outputs those packets on one of a plurality of output interfaces, so as to move those packets within the network from a source device to a destination device. Each packet includes header information which indicates the destination device (and other information), and the router includes routing information which associates an output interface with information about the destination device (possibly with other information). The router can also perform other operations on packets, such as rewriting the packets according to their routing protocol or to reencapsulate the packets from a first routing protocol to a second routing protocol. It is advantageous for routers to operate as quickly as possible, so that as many packets as possible can be switched in a unit time.




One operation performed by routers is routing lookup, that is, accessing routing information in response to the header information from the packet. For example, the router can determine an output interface on which to output the packet in response to a destination address specified by the packet header. In some routing protocols such as IP, an entire set of destination addresses can be associated with a single output interface, so that the operation of routing lookup can be responsive to routing information of differing lengths.




A first problem which has arisen in the art is that storing and retrieving routing information can be both complex and slow, due to the number of differing ways in which the destination address or other packet header information can be associated with that routing information. For example, methods by which the router might perform routing lookup for longer sets of routing lookup information can be inefficient for shorter sets of routing lookup information, and methods by which the router might perform routing lookup for shorter sets of routing lookup information can be inefficient for longer sets of routing lookup information.




A second problem which has arisen in the art is that header information associated with routing lookup has been seen to follow identifiable patterns, particularly for IP addresses used in the internet. Among those identifiable patterns are that 21-bit and 24-bit destination address headers are relatively common, while 32-bit destination addresses and 8-bit destination address headers are relatively rare. Thus, methods by which the router might perform routing lookup should be efficient for lookup of middle-length destination addresses without being inefficient for lookup of relatively longer or shorter destination addresses.




Some known routers, such as those described in U.S. application Ser. No. 08/655,429, “Network Flow Switching and Flow Data Export”, filed May 28, 1996, in the name of inventors Darren Kerr and Barry Bruins, and assigned to Cisco Systems, Inc., and U.S. application Ser. No. 08/771,438, having the same title, filed Dec. 20, 1996, in the name of the same inventors, assigned to the same assignee, can perform routing lookup for differing length destination addresses, by successively performing routing lookup for successive bytes of the destination address. Thus, each byte of the destination address provides further information from which specific information for routing the packet can be addressed. While this method achieves the goal of being relatively flexible with regard to the length of the destination address required for routing lookup, it can take many clock cycles to perform routing lookup, and is therefore not as relatively quick as desired. Moreover, while this method is relatively efficient for relatively shorter length destination addresses, it becomes increasingly inefficient as the lengths of destination addresses become relatively longer.




Accordingly, it would be desirable to provide a method and system for performing routing lookup, which is responsive to a plurality of different sets of routing lookup information. This advantage is achieved in an embodiment of the invention in which a plurality of sets of routing lookup information are queued for lookup in an external memory, particularly where a plurality of sets of routing lookup information are distinguished both by packet routing information and to the length of that header information.




SUMMARY OF THE INVENTION




The invention provides a method and system for routing information lookup for packets using a routing protocol such as IP. Routing information is determined responsive to the packet header, which in a preferred embodiment includes a destination address, a source address, and an input interface for the packet. Routing lookup is performed in response to at least one set of selected routing information, using a lookup table which includes tags both for the routing information and for a bitmask length (thus indicating the generality or scope of the routing information for the routing lookup).




In a preferred embodiment, the lookup table is structured so that addresses having the most common bitmask length are addressed first, but that more specific addresses are still considered when they are present. It has been discovered that most internet addresses can be found by reference to 24-bit or 21-bit IP addresses, after which 16-bit, 12-bit, and finally 32-bit IP addresses are considered. Lookup flags indicate when a relatively uncommon but more specific 32-bit IP address match is available. A memory controller pipelines the lookup requests to a hash table memory, flushes superfluous requests when a lookup result is found, and handles cases relating to 32-bit IP address matches.











BRIEF DESCRIPTION OF THE DRAWINGS





FIG. 1

shows a block diagram of a system for multiple parallel packet routing lookup.





FIG. 2

shows a process flow diagram of a method of operating a system for multiple parallel packet routing lookup.











DETAILED DESCRIPTION OF THE PREFERRED EMBODIMENT




In the following description, a preferred embodiment of the invention is described with regard to preferred process steps and data structures. Those skilled in the art would recognize after perusal of this application that embodiments of the invention can be implemented using general purpose processors or special purpose processors or other circuits adapted to particular process steps and data structures described herein, and that implementation of the process steps and data structures described herein would not require undue experimentation or further invention.




Inventions described herein can be used in conjunction with inventions described in the following applications:




application Ser. No. 08/918,505, filed the same day, Express Mail Mailing No. EM 337222825 US, in the name of the same inventor, titled “Multiprotocol Packet Recognition and Switching”, and




application Ser. No. 08/918,506, filed the same day, Express Mail Mailing No. EM 571204544 US, in the name of the same inventor, titled “Enhanced Internet Packet Routing Lookup”.




Each of these applications is hereby incorporated by reference as if fully set forth herein.




System for Enhanced Internet Packet Address Lookup





FIG. 1

shows a block diagram of a system for multiple parallel packet routing lookup.




A system


100


includes an input port


101


for receiving and distributing a plurality of m


1


words


102


of routing lookup information; in a preferred embodiment the routing lookup information comprises the plurality of m multiplexer output words


232


and the system


100


comprises the lookup memory element


131


, as shown by figures in the co-pending application “Multiprotocol Packet Recognition and Switching”, application Ser. No. 08/918,505.




In a preferred embodiment, the plurality of m


1


words


102


includes m


1


different sets of routing lookup information which include m


1


different ways in which routing results for an associated packet can be determined. For a first example, where the associated packet is transmitted using an IP multicast protocol such as IGMP, the m


1


words


102


can include both (s, g) and (*, g) lookup information for that packet. For a second example, where the associated packet is transmitted using an IP unicast protocol such as IGRP, the m


1


words


102


can include routing lookup information for that packet responsive to both the packet address and a network bitmask length, as described in further detail in the co-pending application “Enhanced Internet Packet Routing Lookup”, application Ser. No. 08/918,506.




In a preferred embodiment, m


1


is about ten, so as to accommodate about ten different ways in which routing results for an associated packet can be determined. Of these, in a preferred embodiment, five are used for IP version 4, two for IP multicast (IGMP), one for TAG switching, one for IPX, and one as a spare for expansion.




The plurality of m


1


words


102


are coupled to a lookup holding table


110


. The lookup holding table


110


includes a plurality of k


1


columns


111


and a plurality of m


2


rows


112


. An entry


113


is defined at the unique intersection of each column


111


and row


112


.




Each of the m


1


words


102


is coupled to a corresponding set of the m


2


rows


112


of the lookup holding table


110


. The correspondence between the m


1


words


102


and the m


2


rows


112


is not one-to-one; there are a greater number of the m


1


words


102


than the m


2


rows


112


. Thus, a first one of the m


2


rows


112


is coupled to all of the m


1


words


102


, a second one of the m


2


rows


112


is coupled to some of the m


1


words


102


, and a last one of the m


2


rows


112


is coupled to at least one of the m


1


words


102


.




In a preferred embodiment, m


2


is about five, so as to accommodate about five simultaneous matches for a selected protocol. Since the m


1


words


102


include five sets of lookup information for IP version 4, five is the expected maximum number of simultaneous matches.




Each entry


113


includes one word


102


of routing lookup information and a valid bit


114


indicating whether the word


102


in the entry


113


is meaningful. In a preferred embodiment where those words


102


can be of variable length, each entry


113


is sufficiently large to hold a largest possible word


102


of routing lookup information, with unused parts of the entry


113


being preferably set to zero.




Each entry


113


is coupled to a succeeding entry


113


in the same column


111


but in the next row


112


. A bottom entry


113


in each column


111


in the last row


112


is coupled to a hashing element


120


, which determines a hash value in response thereto.




The hashing element


120


is coupled to an external memory


130


, which associates the hash value with a corresponding set of routing results. The information in the memory is responsive to the length field for the header information. The memory preferably includes a plurality of entries matching the header information and differing with regard to he length field. The length field preferably indicates a longest match for a destination address included in the header information. In a preferred embodiment, the external memory


130


includes a hash table with a set of entries associated with each hash value. For example, the external memory


130


can include an ordered list of entries associated with each hash value. Hash tables are known in the art of computer science.




In a preferred embodiment, hash values which are coupled to the external memory


130


are pipelined. When the external memory


130


is responding to a first hash value, the time delay is used to supply further hash values to the external memory


130


so as to take advantage of the intervening time between requesting data from the external memory


130


and receiving the requested data in response. After each entry


113


is coupled to the hashing element


120


, a next entry


113


is coupled to the hashing element


120


in succession, so that a plurality of k


2


entries


113


are pipelined and a similar plurality of k


2


hash values are supplied in parallel to the external memory


130


and are in various stages of response.




In a preferred embodiment, k


2


is at least five, so as to accommodate at least five lookup operations in parallel. It is expected that the external memory


130


takes at least about five times as long to respond to a lookup request as it takes for a single entry


113


to be processed. A leading parallel pointer


141


references a particular column


111


which has been earliest coupled to the external memory


130


for lookup. Similarly, a trailing parallel pointer


142


references a particular column


111


which has been latest coupled to the external memory


130


for lookup. The leading parallel pointer


141


and the trailing parallel pointer


142


are maintained k


2


columns


111


apart.




In a preferred embodiment, k


1


(the number of columns


111


) is about eleven, at least k


2


(five) columns


111


so as to be able to perform at least k


2


lookup operations can proceed in parallel, plus one additional column


111


so as to provide time for clearing one of the columns


111


after routing lookup is complete, plus about five additional columns


111


so as to provide room for inserting new sets of routing information.




An output of the external memory


130


is coupled to a comparison element


150


, which compares a result of the lookup of the hash value in the external memory


130


with the associated routing lookup information. The result of the lookup includes both a routing result and the associated routing lookup information. If the external memory


130


has more than one set of routing lookup information and routing results associated with a particular hash value, and responds with an incorrect association from the hash table, the comparison element


150


can note the difference and signal the external memory


130


to respond with a further association from the hash table.




Method of Operation





FIG. 2

shows a process flow diagram of a method of operating a system for multiple parallel packet routing lookup.




A method


200


of operating the system


100


is controlled by a memory controller


160


, which controls the hashing element


120


, the external memory


130


, the leading parallel pointer


141


, the trailing parallel pointer


142


, and the comparison element


150


, and other elements described herein, and includes flow points and process steps as described herein.




At a flow point


210


, one or more words


102


of routing lookup information have arrived at the input port


101


, and are ready for lookup.




The step


221


is performed in parallel with the steps


231


and following, which are performed in parallel with the steps


241


and following, so as to continuously perform lookup operations in parallel with the arrival of routing lookup information.




At a step


221


, a column


111


of the lookup holding table


110


is selected, and the words


102


of routing lookup information are entered into the selected first column


111


of the lookup holding table


110


. The column


111


is selected so as not to be between the leading parallel pointer


141


and the trailing parallel pointer


142


.




In a preferred embodiment, addresses having the most common bitmask length are inserted into the lookup holding table


110


so as to be addressed first, but so that more specific addresses are still considered when they are present.




It has been discovered that most internet addresses can be found by reference to 24-bit or 21-bit IP addresses, after which 16-bit, 12-bit, and finally 32-bit IP addresses are considered. When an IP address is to be entered into the external memory


130


, it is appended so as to meet one or more of these specific lengths.




When an IP address is to be searched in the external memory


130


, entries having each of these specific lengths, in this specific order, are searched. Thus, a 24-bit search value is entered at the bottom entry


113


of the column


111


, followed by a 21-bit search value, followed by a 16-bit search value, a 12-bit search value, and finally a 32-bit search value. When a relatively uncommon but more specific 32-bit IP address match is available, the entries for shorter search values are tagged with a “more specific value” tag to so indicate.




At a step


231


, a bottom entry


113


in each column


111


between the leading parallel pointer


141


and the trailing parallel pointer


142


is coupled to the hashing element


120


. The hashing element


120


generates a hash key for indexing into lookup tables in the external memory


130


. The memory controller


160


transmits routing lookup information from the bottom entry


113


for each column


111


in turn to the hashing element


120


, which in response generates a hash key and transmits that hash key to the external memory


130


.




At a step


232


, the hashing element


120


generates a hash key in response to the routing lookup information at the bottom of the selected second column


111


, and transmits that hash key to the external memory


130


for the lookup operation.




At a step


241


, the external memory


130


performs the lookup operation with the hash key.




In a preferred embodiment, the external memory


130


takes several (about five) clock cycles to respond with stored routing results, so the memory controller


160


pipeline processes a similar number (about five) hash values to the external memory


130


so as to pipeline process memory lookup by the external memory


130


. Pipeline processing is known in the art of computer processing.




At a step


242


, the external memory


130


couples a result of the lookup operation to the comparison element


150


.




In the step


242


, if the “more specific value” tag is set for the result of the lookup operation, the memory controller


160


records the result of the first routing lookup, flushes the search values up to the row


112


having the 32-bit search value, and retries the lookup as if the lookup operation had failed in the step


243


. Thereafter, if the lookup for the 32-bit search value succeeds, the memory controller


160


uses the result of the 32-bit routing lookup; otherwise, if the lookup for the 32-bit search value fails, the memory controller


160


uses the recorded result of the first routing lookup.




At a step


243


, the comparison element


150


compares the original routing lookup information with the result of the lookup operation. If the two match, the lookup operation is deemed successful, and the result of the lookup operation is deemed to include routing information for properly routing the packet. The routing information is forwarded to other devices so as to route the packet, and the method


200


continues with the step


244


.




If the two do not match, the lookup operation is deemed unsuccessful so far. In a preferred embodiment, the hash table in the external memory


130


includes a set of secondary entries for the particular hash key, preferably disposed as disclosed herein in a ordered list. An address for the next entry in the list is transmitted to the external memory


130


and the method


200


repeats the lookup operation until either a successful lookup operation occurs, or there are no further secondary entries, in which case the lookup operation fails.




At a step


244


, the lookup operation succeeded, and the remaining ones of the multiple entries


113


are flushed from the lookup holding table. The column


111


in which those multiple entries


113


becomes free for another set of multiple entries


113


from a packet. The method


200


continues at the flow point


210


.




At a step


245


, the lookup operation failed, and the remaining ones of the multiple entries


113


are each moved down one position, so that the second entry


113


becomes the bottom entry


113


. If there are no further ones of the multiple entries


113


for the particular packet, routing for the packet has failed and the packet is dropped. Whether or not the packet is dropped, the method


200


continues at the flow point


210


.




Alternative Embodiments




Although preferred embodiments are disclosed herein, many variations are possible which remain within the concept, scope, and spirit of the invention, and these variations would become clear to those skilled in the art after perusal of this application.



Claims
  • 1. A method, including the steps ofreceiving a packet header, said packet header including header information; determining a packet treatment identifier responsive to said header information, said packet treatment identifier including a destination address; and using said packet treatment identifier to access a memory having information regarding treatment of packets, said information being responsive to a length field for said header information, said memory including a plurality of entries matching said header information and differing with regard to said length field, said entries associated with packet routing information, and wherein said length field indicates a longest match for said destination address included in said header information.
  • 2. A method as in claim 1, wherein said destination address is a destination IP address.
  • 3. A method as in claim 1, wherein said packet treatment identifier includes a source IP address.
  • 4. A method as in claim 1, wherein said memory includes a plurality of entries matching said destination address and responsive to a multicast packet.
US Referenced Citations (204)
Number Name Date Kind
RE. 33900 Howson Apr 1992
4131767 Weinstein Dec 1978
4161719 Parikh et al. Jul 1979
4316284 Howson Feb 1982
4397020 Howson Aug 1983
4419728 Larson Dec 1983
4424565 Larson Jan 1984
4437087 Petr Mar 1984
4438511 Baran Mar 1984
4439763 Limb Mar 1984
4445213 Baugh et al. Apr 1984
4446555 Devault et al. May 1984
4456957 Schieltz Jun 1984
4464658 Thelen Aug 1984
4499576 Fraser Feb 1985
4506358 Montgomery Mar 1985
4507760 Fraser Mar 1985
4532626 Flores et al. Jul 1985
4644532 George et al. Feb 1987
4646287 Larson et al. Feb 1987
4677423 Benvenuto et al. Jun 1987
4679189 Olson et al. Jul 1987
4679227 Hughes-Hartogs Jul 1987
4723267 Jones et al. Feb 1988
4731816 Hughes-Hartogs Mar 1988
4750136 Arpin et al. Jun 1988
4757495 Decker et al. Jul 1988
4763191 Gordon et al. Aug 1988
4769810 Eckberg, Jr. et al. Sep 1988
4769811 Eckberg, Jr. et al. Sep 1988
4771425 Baran et al. Sep 1988
4819228 Baran et al. Apr 1989
4827411 Arrowood et al. May 1989
4833706 Hughes-Hartogs May 1989
4835737 Herrig et al. May 1989
4879551 Georgiou et al. Nov 1989
4893306 Chao et al. Jan 1990
4903261 Baran et al. Feb 1990
4922486 Lidinsky et al. May 1990
4933937 Konishi Jun 1990
4960310 Cushing Oct 1990
4962497 Ferenc et al. Oct 1990
4962532 Kasirai et al. Oct 1990
4965767 Kinoshita Oct 1990
4965772 Daniel et al. Oct 1990
4970678 Sladowski et al. Nov 1990
4979118 Kheradpir Dec 1990
4980897 Decker et al. Dec 1990
4991169 Davis et al. Feb 1991
5003595 Collins et al. Mar 1991
5016265 Hahne et al. May 1991
5020058 Holden et al. May 1991
5033076 Jones et al. Jul 1991
5034919 Sasai Jul 1991
5054034 Hughes-Hartogs Oct 1991
5059925 Weisbloom Oct 1991
5072449 Enns et al. Dec 1991
5088032 Bosack Feb 1992
5095480 Fenner Mar 1992
5115431 Williams et al. May 1992
5128945 Enns et al. Jul 1992
5136580 Videlock et al. Aug 1992
5166930 Braff et al. Nov 1992
5199049 Wilson Mar 1993
5206886 Bingham Apr 1993
5208811 Kashio et al. May 1993
5212686 Joy et al. May 1993
5224099 Corbalis et al. Jun 1993
5226120 Brown et al. Jul 1993
5228062 Bingham Jul 1993
5229994 Balzano et al. Jul 1993
5237564 Lespagnol et al. Aug 1993
5241682 Bryant et al. Aug 1993
5243342 Kattemalalavadi et al. Sep 1993
5243596 Port et al. Sep 1993
5247516 Bernstein et al. Sep 1993
5249178 Kurano et al. Sep 1993
5253251 Aramaki Oct 1993
5255291 Holden et al. Oct 1993
5260933 Rouse Nov 1993
5260978 Fleischer et al. Nov 1993
5268592 Bellamy et al. Dec 1993
5268900 Hluchyj et al. Dec 1993
5271004 Proctor et al. Dec 1993
5274631 Bhardwaj Dec 1993
5274635 Rahman et al. Dec 1993
5274643 Fisk Dec 1993
5280470 Buhrke et al. Jan 1994
5280480 Pitt et al. Jan 1994
5280500 Mazzola et al. Jan 1994
5283783 Nguyen et al. Feb 1994
5287103 Kasprzyk et al. Feb 1994
5287453 Roberts Feb 1994
5291482 McHarg et al. Mar 1994
5305311 Lyles Apr 1994
5307343 Bostica et al. Apr 1994
5309437 Perlman et al. May 1994
5311509 Heddes et al. May 1994
5313454 Bustini et al. May 1994
5313582 Hendel et al. May 1994
5317562 Nardin et al. May 1994
5319644 Liang Jun 1994
5327421 Hiller et al. Jul 1994
5331637 Francis et al. Jul 1994
5345445 Hiller et al. Sep 1994
5345446 Hiller et al. Sep 1994
5353283 Tsuchiya Oct 1994
5359592 Corbalis et al. Oct 1994
5361250 Nguyen et al. Nov 1994
5361256 Doeringer et al. Nov 1994
5361259 Hunt et al. Nov 1994
5365524 Hiller et al. Nov 1994
5367517 Cidon et al. Nov 1994
5371852 Attanasio et al. Dec 1994
5386567 Lien et al. Jan 1995
5390170 Sawant et al. Feb 1995
5390175 Hiller et al. Feb 1995
5394394 Crowther et al. Feb 1995
5394402 Ross Feb 1995
5400325 Chatwani et al. Mar 1995
5408469 Opher et al. Apr 1995
5416842 Aziz May 1995
5422880 Heitkamp et al. Jun 1995
5422882 Hillet et al. Jun 1995
5423002 Hart Jun 1995
5426636 Hiller et al. Jun 1995
5428607 Hiller et al. Jun 1995
5430715 Corbalis et al. Jul 1995
5430729 Rahnema Jul 1995
5442457 Najafi Aug 1995
5442630 Gagliardi et al. Aug 1995
5452297 Hiller et al. Sep 1995
5473599 Li et al. Dec 1995
5473607 Hausman et al. Dec 1995
5477541 White Dec 1995
5485455 Dobbins et al. Jan 1996
5490140 Abensour et al. Feb 1996
5490258 Fenner Feb 1996
5491687 Christensen et al. Feb 1996
5491804 Heath et al. Feb 1996
5497368 Reijnierse et al. Mar 1996
5504747 Sweasey Apr 1996
5509006 Wilford et al. Apr 1996
5517494 Green May 1996
5519704 Farinacci et al. May 1996
5526489 Nilakantan et al. Jun 1996
5530963 Moore et al. Jun 1996
5535195 Lee Jul 1996
5535338 Krause Jul 1996
5539734 Burwell et al. Jul 1996
5541911 Nilakantan et al. Jul 1996
5546370 Ishikawa Aug 1996
5555244 Gupta et al. Sep 1996
5561669 Lenney et al. Oct 1996
5566170 Bakke Oct 1996
5583862 Callon Dec 1996
5592470 Rudrapatna et al. Jan 1997
5596574 Perlman Jan 1997
5598581 Daines et al. Jan 1997
5600798 Chenrukuri et al. Feb 1997
5602770 Ohira Feb 1997
5604868 Komine et al. Feb 1997
5608726 Virgile Mar 1997
5617417 Sathe et al. Apr 1997
5617421 Chin et al. Apr 1997
5630125 Zellweger May 1997
5631908 Saxe May 1997
5632021 Jennings et al. May 1997
5634010 Ciscon et al. May 1997
5638359 Peltola et al. Jun 1997
5644718 Belove et al. Jul 1997
5651002 Van Seters Jul 1997
5659684 Giovannoni et al. Aug 1997
5666353 Klausmeier et al. Sep 1997
5673265 Gupta et al. Sep 1997
5678006 Valizadeh et al. Oct 1997
5680116 Hashimoto et al. Oct 1997
5684797 Aznar et al. Nov 1997
5684954 Kaiserwerth Nov 1997
5687324 Green et al. Nov 1997
5689506 Chiussi et al. Nov 1997
5694390 Yamato et al. Dec 1997
5724351 Chao et al. Mar 1998
5740097 Satoh Apr 1998
5748186 Raman May 1998
5748617 McLain, Jr. May 1998
5751971 Dobbins May 1998
5754547 Nakazawa May 1998
5802054 Bellenger Sep 1998
5802065 Ogawa Sep 1998
5835710 Nagami et al. Nov 1998
5841874 Kempke Nov 1998
5854903 Morrison et al. Dec 1998
5856981 Voelker Jan 1999
5872783 Chin Feb 1999
5892924 Lyon Apr 1999
5898686 Virgile Apr 1999
5903559 Acharya et al. May 1999
5909440 Ferguson Jun 1999
5909686 Muller Jun 1999
5917820 Rekhter Jun 1999
5920566 Hendel Jul 1999
5938736 Muller Aug 1999
5949786 Bellenger Sep 1999
Foreign Referenced Citations (10)
Number Date Country
0 384 758 A2 Aug 1990 EP
0 431 751 A1 Jun 1991 EP
0 567 217 A2 Oct 1993 EP
WO9307569 Apr 1993 WO
WO9307692 Apr 1993 WO
WO9401828 Jan 1994 WO
WO9520850 Aug 1995 WO
WO 9723508 Jul 1997 WO
WO 9803473 Jan 1998 WO
WO 9858950 Dec 1998 WO
Non-Patent Literature Citations (12)
Entry
William Stallings, Data and Computer Communications, pp. 329-333, Prentice Hall, Upper Saddle River, New Jersey 07458.
Allen, M., “Novell IPX Over Various WAN Media (IPXW AN),” Network Working Group, RFC 1551, Dec. 1993, pp. 1-22.
Becker, D., “3c589.c: A 3c589 EtherLink3 ethernet driver for linux,” becker@CESDIS.gsfc.nasa.gov, May 3, 1994, pp. 1-13.
Chowdhury, et al., “Alternative Bandwidth Allocation Algorithms for Packet Video in ATM Networks,” INFOCOM 1992, pp. 1061-1068.
Doeringer, W., “Routing on Longest-Matching Prefixes,” IEEE/ACM Transactions in Networking, vol. 4, No. 1, Feb. 1996, pp. 86-97.
Esaki, et al., “Datagram Delivery in an ATM-internet,”2334b IEICE Transactions on Communications, Mar. 1994, No. 3, Tokyo, Japan.
Pei, et al., “Putting Routing Tables in Silicon,” IEEE Network Magazine, Jan. 1992, pp. 42-50.
Perkins, D., “Requirements for an Internet Standard Point-to-Point Protocol,” Network Working Group, RFC 1547, Dec. 1993, pp. 1-19.
Simpson, W., “The Point-to-Point Protocol (PPP),” Network Working Group, RFC 1548, Dec. 1993, pp. 1-53.
Tsuchiya, P.F., “A Search Algorithm for Table Entries with Non-Contiguous Wildcarding,” Abstract, Bellcore.
Zhang, et al., “Rate-Controlled Static-Priority Queueing,” INFOCOM 1993, pp. 227-236.
IBM Corporation, “Method and Apparatus for the Statistical Multiplexing of Voice, Data and Image Signal,” IBM Technical Disclosure Bulletin, No. 6, Nov. 1992, pp. 409-411.