US 6,889,181 B2Grant
Network flow switching and flow data export
Issue Date:2005-05-03
•22 Claims
•4 Drawing Sheets
Abstract
The invention provides a method and system for switching in networks responsive to message flow patterns. A message “flow” is defined to comprise a set of packets to be transmitted between a particular source and a particular destination. When routers in a network identify a new message flow, they determine the proper processing for packets in that message flow and cache that information for that message flow. Thereafter, when routers in a network identify a packet which is part of that message flow, they process that packet according to the proper processing for packets in that message flow. The proper processing may include a determination of a destination port for routing those packets and a determination of whether access control permits routing those packets to their indicated destination.
Metadata
Assignee
- Cisco Technology, Inc.
Inventors
- Darren R. Kerr
- Barry L. Bruins
Application Information
Application Number:US 08/886,900
Filing Date:1997-07-02
Priority Date:1996-05-28
Art Unit:2123
Patent Drawings (4 sheets)
Description
CROSS-REFERENCE TO RELATED APPLICATIONS
[0001] This application is a continuation of the following applications:
-
- [0002] application Ser. No. 08/655,429, filed May 28, 1996, in the name of the same inventors and having the same assignee, titled “Network Flow Switching and Flow Data Export”; and
- [0003] application Ser. No. 08/771,438, filed Dec. 20, 1996, in the name of the same inventors and having the same assignee, titled “Network Flow Data Export”.
[0004] Both of these applications are hereby incorporated by reference as if fully set forth herein.
BACKGROUND OF THE INVENTION
[0005] 1. Field of the Invention
[0006] This invention relates to network switching and data export responsive to message flow patterns.
[0007] 2. Description of Related Art
[0008] In computer networks, it commonly occurs that message traffic between a particular source and a particular destination will continue for a time with unchanged routing or switching parameters. For example, when using the file-transfer protocol “FTP” there is substantial message traffic between the file's source location and the file's destination location, comprising the transfer of many packets which have similar headers, differing in the actual data which is transmitted. During the time when message traffic continues, routing and switching devices receiving packets comprising that message traffic must examine those packets and determine the processing thereof.
[0009] One problem which has arisen in the art is that processing demands on routing and switching devices continue to grow with increased network demand. It continues to be advantageous to provide techniques for processing packets more quickly. This problem has been exacerbated by addition of more complex forms of processing, such as the use of access control lists.
[0010] It would therefore be advantageous to provide techniques in which the amount of processing required for any individual packet could be reduced. With inventive techniques described herein, information about message flow patterns is used to identify packets for which processing has already been determined, and therefore to process those packets without having to re-determine the same processing. The amount of processing required for any individual packet is therefore reduced.
[0011] Information about message flow patterns would also be valuable for providing information about use of the network, and could be used for a variety of purposes by network administrators, routing devices, service providers, and users.
[0012] Accordingly, it would be advantageous to provide a technique for network switching and data export responsive to message flow patterns.
SUMMARY OF THE INVENTION
[0013] The invention provides a method and system for switching in networks responsive to message flow patterns. A message “flow” is defined to comprise a set of packets to be transmitted between a particular source and a particular destination. When routers in a network identify a new message flow, they determine the proper processing for packets in that message flow and cache that information for that message flow. Thereafter, when routers in a network identify a packet which is part of that message flow, they process that packet according to the proper processing for packets in that message flow. The proper processing may include a determination of a destination port for routing those packets and a determination of whether access control permits routing those packets to their indicated destination.
[0014] In another aspect of the invention, information about message flow patterns is collected, responsive to identified message flows and their packets. The collected information is reported to devices on the network. The collected information is used for a variety of purposes, including: to diagnose actual or potential network problems, to determine patterns of usage by date and time or by location, to determine which services and which users use a relatively larger or smaller amount of network resources, to determine which services are accessed by particular users, to determine which users access particular services, or to determine usage which falls within selected parameters (such as: access during particular dates or times, access to prohibited services, excessive access to particular services, excessive use of network resources, or lack of proper access).
BRIEF DESCRIPTION OF THE DRAWINGS
[0015] FIG. 1 shows a network in which routing responsive to message flow patterns is performed.
[0016] FIG. 2 shows a method for routing in networks responsive to message flow patterns.
[0017] FIG. 3 shows data structures for use with a method for routing in networks responsive to message flow patterns.
[0018] FIG. 4 shows an IP address cache for use with a method for routing in networks responsive to message flow patterns.
[0019] FIG. 5 shows a method for collecting and reporting information about message flow patterns.
DESCRIPTION OF THE PREFERRED EMBODIMENT
[0020] In the following description, a preferred embodiment of the invention is described with regard to preferred process steps and data structures. However, those skilled in the art would recognize, after perusal of this application, that embodiments of the invention may be implemented using a set of general purpose computers operating under program control, and that modification of a set of general purpose computers to implement the process steps and data structures described herein would not require undue invention.
Message Flows
[0021] FIG. 1 shows a network in which routing responsive to message flow patterns is performed.
[0022] A network 100 includes at least one communication link 110, at least one source device 120, at least one destination device 130, and at least one routing device 140. The routing device 140 is disposed for receiving a set of packets 150 from the source device 120 and routing them to the destination device 130.
[0023] The communication link 110 may comprise any form of physical media layer, such as ethernet, FDDI, or HDLC serial link.
[0024] The routing device 140 comprises a routing processor for performing the process steps described herein, and may include specific hardware constructed or programmed performing the process steps described herein, a general purpose processor operating under program control, or some combination thereof.
[0025] A message flow 160 consists of a unidirectional stream of packets 150 to be transmitted between particular pairs of transport service access points (thus, network-layer addresses and port numbers). In a broad sense, a message flow 160 thus refers to a communication “circuit” between communication endpoints. In a preferred embodiment, a message flow 160 is defined by a network-layer address for a particular source device 120, a particular port number at the source device 120, a network-layer address for a particular destination device 130, a particular port number at the destination device 130, and a particular transmission protocol type. For example, the transmission protocol type may identify a known transmission protocol, such as UDP, TCP, ICMP, or IGMP (internet group management protocol).
[0026] In a preferred embodiment for use with a network of networks (an “internet”), the particular source device 120 is identified by its IP (internet protocol) address. The particular port number at the source device 120 is identified by either a port number which is specific to a particular process, or by a standard port number for the particular transmission protocol type. For example, a standard port number for the TCP protocol type is 6 and a standard port number for the UDP protocol type is 17. Other protocols which may have standard port numbers include the FTP protocol, the TELNET protocol, an internet telephone protocol, or an internet video protocol such as the “CUSeeMe” protocol; these protocols are known in the art of networking. Similarly, the particular destination device 130 is identified by its IP (internet protocol) address; the particular port number at the destination device 130 is identified by either a port number which is specific to a particular process, or a standard port number for the particular transmission protocol type.
[0027] It will be clear to those skilled in the art, after perusing this application, that the concept of a message flow is quite broad, and encompasses a wide variety of possible alternatives within the scope and spirit of the invention. For example, in alternative embodiments, a message flow may be bi-directional instead of unidirectional, a message flow may be identified at a different protocol layer level than that of transport service access points, or a message flow may be identified responsive to other factors. These other factors may include one or more of the following: information in packet headers, packet length, time of packet transmission, or routing conditions on the network (such as relative network congestion or administrative policies with regard to routing and transmission).
Network Flow Switching
[0028] FIG. 2 shows a method for routing in networks responsive to message flow patterns.
[0029] In broad overview, the method for routing in networks responsive to message flow patterns comprises two parts. In a first part, the routing device 140 builds and uses a flow cache (described in further detail with regard to FIG. 3), in which routing information to be used for packets 150 in each particular message flow 160 is recorded and from which such routing information is retrieved for use. In a second part, the routing device 140 maintains the flow cache, such as by removing entries for message flows 160 which are no longer considered valid.
[0030] A method 200 for routing in networks responsive to message flow patterns is performed by the routing device 140.
[0031] At a flow point 210, the routing device 140 is disposed for building and using the flow cache.
[0032] At a step 221, the routing device 140 receives a packet 150.
[0033] At a step 222, the routing device 140 identifies a message flow 160 for the packet 150. In a preferred embodiment, the routing device 140 examines a header for the packet 150 and identifies the IP address for the source device 120, the IP address for the destination device 130, and the protocol type for the packet 150. The routing device 140 determines the port number for the source device 120 and the port number for the destination device 130 responsive to the protocol type. Responsive to this set of information, the routing device 140 determines a flow key 310 (described with reference to FIG. 3 ) for the message flow 160.
[0034] At a step 223, the routing device 140 performs a lookup in a flow cache for the identified message flow 160. If the lookup is unsuccessful, the identified message flow 160 is a “new” message flow 160, and the routing device 140 continues with the step 224. If the lookup is successful, the identified message flow 160 is an “old” message flow 160, and the routing device 140 continues with the step 225.
[0035] In a preferred embodiment, the routing device 140 determines a hash table key responsive to the flow key 310. This aspect of the step 223 is described in further detail with regard to FIG. 3.
[0036] At a step 224, the routing device 140 builds a new entry in the flow cache. The routing device 140 determines proper treatment of packets 150 in the message flow 160 and enters information regarding such proper treatment in a data structure pointed to by the new entry in the flow cache. In a preferred embodiment, the routing device 140 determines the proper treatment by performing a lookup in an IP address cache as shown in FIG. 4.
[0037] In a preferred embodiment, the proper treatment of packets 150 in the message flow 160 includes treatment with regard to switching (thus, the routing device 140 determines an output port for switching packets 150 in the message flow 160), with regard to access control (thus, the routing device 140 determines whether packets 150 in the message flow 160 meet the requirements of access control, as defined by access control lists in force at the routing device 140), with regard to accounting (thus, the routing device 140 creates an accounting record for the message flow 160), with regard to encryption (thus, the routing device 140 determines encryption treatment for packets 150 in the message flow 160), and any special treatment for packets 150 in the message flow 160.
[0038] In a preferred embodiment, the routing device 140 performs any special processing for new message flows 160 at this time. For example, in one preferred embodiment, the routing device 140 requires that the source device 120 or the destination device 130 must authenticate the message flow 160. In that case, the routing device 140 transmits one or more packets 150 to the source device 120 or the destination device 130 to request information (such as a user identifier and a password) to authenticate the new message flow 160, and receives one or more packets 150 comprising the authentication information. This technique could be useful for implementing security “firewalls” and other authentication systems.
[0039] Thereafter, the routing device 140 proceeds with the step 225, using the information from the new entry in the flow cache, just as if the identified message flow 160 were an “old” message flow 160 and the lookup in a flow cache had been successful.
[0040] At a step 225, the routing device 140 retrieves routing information from the entry in the flow cache for the identified message flow 160.
[0041] In a preferred embodiment, the entry in the flow cache includes a pointer to a rewrite function for at least part of a header for the packet 150. If this pointer is non-null, the routing device 140 invokes the rewrite function to alter the header for the packet 150.
[0042] At a step 226, the routing device 140 routes the packet 150 responsive to the routing information retrieved at the step 225.
[0043] Thus, in a preferred embodiment, the routing device 140 does not separately determine, for each packet 150 in the message flow 160, the information stored in the entry in the flow cache. Rather, when routing a packet 150 in the message flow 160, the routing device 140 reads the information from the entry in the flow cache and treats the packet 150 according to the information in the entry in the flow cache.
[0044] Thus, in a preferred embodiment, the routing device 140 routes the packet 150 to an output port, determines whether access is allowed for the packet 150, determines encryption treatment for the packet 150, and performs any special treatment for the packet 150, all responsive to information in the entry in the flow cache.
[0045] In a preferred embodiment, the routing device 140 also enters accounting information in the entry in the flow cache for the packet 150. When routing each packet 150 in the message flow 160, the routing device 140 records the cumulative number of packets 150 and the cumulative number of bytes for the message flow 160.
[0046] Because the routing device 140 processes each packet 150 in the message flow 160 responsive to the entry for the message flow 160 in the flow cache, the routing device 140 is able to implement administrative policies which are designated for each message flow 160 rather than for each packet 150. For example, the routing device 140 is able to reserve specific amounts of bandwidth for particular message flows 160 and to queue packets 150 for transmission responsive to the bandwidth reserved for their particular message flows 160.
[0047] Because the routing device 140 is able to associate each packet 150 with a particular message flow 160 and to associate each message flow 160 with particular network-layer source and destination addresses, the routing device 140 is able to associate network usage with particular workstations (and therefore with particular users) or with particular services available on the network. This can be used for accounting purposes, for enforcing administrative policies, or for providing usage information to interested parties.
[0048] For a first example, the routing device 140 is able to monitor and provide usage information regarding access using the HTTP protocol to world wide web pages at particular sites.
[0049] For a second example, the routing device 140 is able to monitor usage information regarding relative use of network resources, and to give priority to those message flows 160 which use relatively fewer network resources. This can occur when a first message flow 160 is using a relatively low-bandwidth transmission channel (such as a 28.8 kilobits per second modem transmission channel) and when a second message flow 160 is using a relatively high-bandwidth transmission channel (such as a T-1 transmission line).
[0050] At a flow point 230, the routing device 140 is disposed for maintaining the flow cache.
[0051] At a step 241, the routing device 140 examines each entry in the flow cache and compares a current time with a last time a packet 150 was routed using that particular entry. If the difference exceeds a first selected timeout, the message flow 160 represented by that entry is considered to have expired due to nonuse and thus to no longer be valid.
[0052] In a preferred embodiment, the routing device 140 also examines the entry in the flow cache and compares a current time with a first time a packet 150 was routed using that particular entry. If the difference exceeds a second selected timeout, the message flow 160 represented by that entry is considered to have expired due to age and thus to no longer be valid. The second selected timeout is preferably about one minute.
[0053] Expiring message flows 160 due to age artificially requires that a new message flow 160 must be created for the next packet 150 in the same communication session represented by the old message flow 160 which was expired. However, it is considered preferable to do so because it allows information to be collected and reported about message flows 160 without having to wait for those message flows 160 to expire from nonuse. For example, a multiple-broadcast communication session could reasonably last well beyond the time message flows 160 are expired for age, and if not so expired would mean that information about network usage would not account for significant network usage.
[0054] In a preferred embodiment, the routing device 140 also examines the entry in the flow cache and determines if the “next hop” information has changed. If so, the message flow 160 is expired due to changed conditions. Other changed conditions which might cause a message flow 160 to be expired include changes in access control lists or other changes which might affect the proper treatment of packets 150 in the message flow 160. The routing device 140 also expires entries in the flow cache on a least-recently-used basis if the flow cache becomes too full.
[0055] If the message flow 160 is still valid, the routing device 140 continues with the next entry in the flow cache until all entries have been examined. If the message flow 160 is no longer valid, the routing device 140 continues with the step 242.
[0056] At a step 242, the routing device 140 collects historical information about the message flow 160 from the entry in the flow cache, and deletes the entry.
Flow Cache
[0057] FIG. 3 shows data structures for use with a method for routing in networks responsive to message flow patterns.
[0058] A flow cache 300 comprises a memory which associates flow keys 310 with information about message flows 160 identified by those flow keys 310. The flow cache 300 includes a set of buckets 301. Each bucket 301 includes a linked list of entries 302. Each entry 302 includes information about a particular message flow 160, including routing, access control, accounting, special treatment for packets 150 in that particular message flow 160, and a pointer to information about treatment of packets 150 to the destination device 130 for that message flow 160.
[0059] In a preferred embodiment, the flow cache 300 includes a relatively large number of buckets 301 (preferably about 16,384 buckets 301), so as to minimize the number of entries 302 per bucket 301 and thus so as to minimize the number of memory accesses per entry 302. Each bucket 301 comprises a four-byte pointer to a linked list of entries 302. The linked list preferably includes only about one or two entries 302 at the most.
[0060] In a preferred embodiment, each entry 302 includes a set of routing information, a set of access control information, a set of special treatment information, and a set of accounting information, for packets 150 in the message flow 160.
[0061] The routing information comprises the output port for routing packets 150 in the message flow 160.
[0062] The access control information comprises whether access is permitted for packets 150 in the message flow 160.
[0063] The accounting information comprises a time stamp for the first packet 150 in the message flow 160, a time stamp for the most recent packet 150 in the message flow 160, a cumulative count for the number of packets 150 in the message flow 160, and a cumulative count for the number of bytes 150 in the message flow 160.
IP Address Cache
[0064] FIG. 4 shows an IP address cache for use with a method for routing in networks responsive to message flow patterns.
[0065] An IP address cache 400 comprises a tree having a root node 410, a plurality of inferior nodes 410, and a plurality of leaf data structures 420.
[0066] Each node 410 comprises a node/leaf indicator 411 and an array 412 of pointers 413.
[0067] The node/leaf indicator 411 indicates whether the node 410 is a node 410 or a leaf data structure 420; for nodes 410 it is set to a “node” value, while for leaf data structures 420 it is set to a “leaf” value.
[0068] The array 412 has room for exactly 256 pointers 413; thus, the IP address cache 400 comprises an M-trie with a branching width of 256 at each level. M-tries are known in the art of tree structures. IP addresses comprise four bytes, each having eight bits and therefore 256 possible values. Thus, each possible IP address can be stored in the IP address cache 400 using at most four pointers 413.
[0069] The inventors have discovered that IP addresses in actual use are unexpectedly clustered, so that the size of the IP address cache 400 is substantially less, by a factor of about five to a factor of about ten, than would be expected for a set of randomly generated four-byte IP addresses.
[0070] Each pointer 413 represents a subtree of the IP address cache 400 for its particular location in the array 412. Thus, for the root node 410, the pointer 413 at location 3 represents IP addresses having the form 3.xxx.xxx.xxx, where “xxx” represents any possible value from zero to 255. Similarly, in a subtree for IP addresses having the form 3.xxx.xxx.xxx, the pointer 413 at location 141 represents IP addresses having the form 3.141.xxx.xxx. Similarly, in a subtree for IP addresses having the form 3.141.xxx.xxx, the pointer 413 at location 59 represents IP addresses having the form 3.141.59.xxx. Similarly, in a subtree for IP addresses having the form 3.141.59.xxx, the pointer 413 at location 26 represents the IP address 3.141.59.26.
[0071] Each pointer 413 is either null, to indicate that there are no IP addresses for the indicated subtree, or points to an inferior node 410 or leaf data structure 420. A least significant bit of each pointer 413 is reserved to indicate the type of the pointed-to structure; that is, whether the pointed-to structure is a node 410 or a leaf data structure 420. In a preferred embodiment where pointers 413 must identify an address which is aligned on a four-byte boundary, the two least significant bits of each pointer 413 are unused for addressing, and reserving the least significant bit for this purpose does not reduce the scope of the pointer 413.
[0072] Each leaf data structure comprises information about the IP address, stored in the IP address cache 400. In a preferred embodiment this information includes the proper processing for packets 150 addressed to that IP address, such as a determination of a destination port for routing those packets and a determination of whether access control permits routing those packets to their indicated destination.
Flow Data Export
[0073] FIG. 5 shows a method for collecting and reporting information about message flow patterns.
[0074] A method 500 for collecting and reporting information about message flow patterns is performed by the routing device 140.
[0075] At a flow point 510, the routing device 140 is disposed for obtaining information about a message flow 160. For example, in a preferred embodiment, as noted herein, the routing device 140 obtains historical information about a message flow 160 in the step 242. In alternative embodiments, the routing device 140 may obtain information about message flows 160, either in addition or instead, by occasional review of entries in the flow cache, or by directly monitoring packets 150 in message flows 160.
[0076] It will be clear to those skilled in the art, after perusing this application, that the concept of reporting information about message flows is quite broad, and encompasses a wide variety of possible alternatives within the scope and spirit of the invention. For example, in alternative embodiments, information about message flows may include bi-directional traffic information instead of unidirectional traffic information, information about message flows may include information at a different protocol layer level other than that of transport service access points and other than that at which the message flow is itself defined, or information about message flows may include actual data transmitted as part of the message flow itself. These actual data may include one or more of the following: information in packet headers, information about files of file names transmitted during the message flow, or usage conditions of the message flow (such as whether the message flow involves steady or bursty transmission of data, or is relatively interactive or relatively unidirectional).
[0077] At a step 521, the routing device 140 obtains historical information about a particular message flow 160, and records that information in a flow data table.
[0078] At a step 522, the routing device 140 determines a size of the flow data table, and compares that size with a selected size value. If the flow data table exceeds the selected size value, the routing device 140 continues with the step 523 to report flow data. If the flow data table does not exceed the selected size value, the routing device 140 returns to the step 521 to obtain historical information about a next particular message flow 160.
[0079] At a step 523, the routing device 140 builds an information packet, responsive to the information about message flows 160 which is recorded in the flow data table.
[0080] At a step 524, the routing device 140 transmits the information packet to a selected destination device 130 on the network 100. In a preferred embodiment, the selected destination device 130 is determined by an operating parameter of the routing device 140. This operating parameter is set when the routing device 140 is initially configured, and may be altered by an operator of the routing device 140.
[0081] In a preferred embodiment, the selected destination device 130 receives the information packet and builds (or updates) a database in the format for the RMON protocol. The RMON protocol is known in the art of network monitoring.
[0082] At a flow point 530, a reporting device 540 on the network 100 is disposed for reporting using information about message flows 160.
[0083] At a step 531, the reporting device 540 queries the selected destination device 130 for information about message flows 160. In a preferred embodiment, the reporting device 540 uses the RMON protocol to query the selected destination device 130 and to obtain information about message flows 160.
[0084] At a step 532, the reporting device 540 builds a report about a condition of the network 100, responsive to information about message flows 160.
[0085] At a step 533, the reporting device 540 displays or transmits that report about the condition of the network 100 to interested parties.
[0086] In preferred embodiments, the report may comprise one or more of a wide variety of information, and interested parties may use that information for one or more of a wide variety of purposes. Some possible purposes are noted herein:
[0087] Interested parties may diagnose actual or potential network problems. For example, the report may comprise information about packets 150 in particular message flows 160, including a time stamp for a first packet 150 and a time stamp for a last packet 150 in the message flow 160, a cumulative total number of bytes in the message flow 160, a cumulative total number of packets 150 in the message flow 160, or other information relevant to diagnosing actual or potential network problems.
[0088] Interested parties may determine patterns of usage of the network by date and time or by location. For example, the report may comprise information about which users or which services on the network are making relatively heavy use of resources. In a preferred embodiment, usage of the network 100 is displayed in a graphical form which shows use of the network 100 in a false-color map, so that network administrators and other interested parties may rapidly determine which services, which users, and which communication links are relatively loaded or relatively unloaded with demand.
[0089] Interested parties may determine which services are accessed by particular users, or which users access particular services. For example, the report may comprise information about which services are accessed by particular users at a particular device on the network 100, or which users access a particular service at a particular device on the network 100. This information may be used to market or otherwise enhance these services. In a preferred embodiment, users who access a particular world wide web page using the HTTP protocol are recorded, and information is sent to those users about changes to that web page and about further services available from the producers of that web page. Providers of the particular web page may also collect information about access to their web page in response to date and time of access, and location of accessing user.
[0090] Information about patterns of usage of the network, or about which services are accessed by particular users, or which users access particular services, may be used to implement accounting or billing for resources, or to set limits for resource usage, such as by particular users, by particular service providers, or by particular protocol types (and therefore by particular types of services).
[0091] Interested parties may determine usage which falls within (or without) selected parameters. These selected parameters may involve access during particular dates or times, such as for example access to particular services during or outside normal working hours. For example, it may be desirable to record those accesses to a company database which occur outside normal working hours.
[0092] These selected parameters may involve access to prohibited services, excessive access to particular services, or excessive use of network resources, such as for example access to particular servers using the HTTP protocol or the FTP protocol which fall within (or without) a particular administrative policy. For example, it may be desirable to record accesses to repositories of games or other recreational material, particularly those accesses which occur within normal working hours.
[0093] These selected parameters may involve or lack of proper access, such as for example access control list failures or unauthorized attempts to access secure services. For example, it may be desirable to record unauthorized attempts to access secure services, particularly those attempts which form a pattern which might indicate a concerted attempt to gain unauthorized access.
[0094] In alternative embodiments, the routing device 140 could save the actual packets 150 for the message flow 160, or some part thereof, for later examination. For example, a TELNET session (a message flow 160 comprising use of the TELNET protocol by a user and a host) could be recorded in its entirety, or some portion thereof, for later examination, e.g., to diagnose problems noted with the network or with the particular host.
[0095] In further alternative embodiments, the routing device 140 could save the actual packets 150 for selected message flows 160 which meet certain selected parameters, such as repeated unauthorized attempts to gain access.
[0096] In embodiments where actual packets 150 of the message flow 160 are saved, it would be desirable to perform a name translation (such as a reverse DNS lookup), because the IP addresses for the source device 120 and the destination device 130 are transitory. Thus, it would be preferable to determine the symbolic names for the source device 120 and the destination device 130 from the IP addresses, so that the recorded data would have greater meaning at a later time.
Alternative Embodiments
[0097] 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
Certificate of Correction present
The claims shown below may not include correction changes. Use the corrected PDF for authoritative text.
1. A method in a router for determining how to treat packets, comprising the steps of:
determining a flow and a flow key for a packet;
performing a first lookup in a flow cache based on the flow key, with the flow determined to be old if the first lookup is successful and determined to be new if the first lookup is unsuccessful;
if the flow is old, using results of the first lookup to determine how to treat the packet; and
if the flow is new, performing a second lookup in an IP address cache, with results of the second lookup used to determine how to treat the packet and to make an entry for the flow in the flow cache such that if a next packet in the flow is received, the flow is identified as old, and the next packet is treated in a same manner as the packet.
2. A method as in claim 1, wherein the flow key is determined based on a source IP address and port, destination IP address and port, and protocol type for the packet.
3. A method as in claim 2, wherein determining how to treat the packet includes determining how to route the packet from the router.
4. A method as in claim 3, wherein determining how to treat the packet further includes determining whether access is allowed for the packet.
5. A method as in claim 3, wherein determining how to treat the packet further includes determining encryption treatment for the packet.
6. A method as in claim 1, further comprising the step of entering accounting information in the flow cache for the flow.
7. A method as in claim 1, wherein the IP address cache is an M-trie having a branching width of at least 16, said M-trie having a set of nodes including a root node, each said node having a pointer and a node/leaf indicator included within a data word, said node/leaf indicator determining whether said pointer points to an inferior node or to a leaf data structure, each leaf data structure including information associated with one IP address, said pointer to said inferior node being located at an offset in an array of nodes, said offset within an Nth level of said M-trie corresponding to an associated value represented by an Nth byte of said IP address, wherein because said set of IP addresses are clustered, said M-trie is smaller, by a factor of about five to a factor of about ten, than if said set of IP addresses were randomly distributed.
8. A router that determines how to treat packets, comprising:
links for receiving packets from at least one source device and routing those packets to at least one destination device;
a processor for executing instructions; and
a memory for storing data and said instruction, said data including a flow cache and an IP address cache, and said instructions including the steps of (a) determining a flow and a flow key for a packet, (b) performing a first lookup in the flow cache based on the flow key, with the flow determined to be old if the first lookup is successful and determined to be new if the first lookup is unsuccessful, (c) if the flow is old, using results of the first lookup to determine how to treat the packet, and (d) if the flow is new, performing a second lookup in the IP address cache, with results of the second lookup used to determine how to treat the packet and to make an entry for the flow in the flow cache such that if a next packet in the flow is received, the flow is identified as old and the next packet is treated in the same manner as the packet.
9. A router as in claim 8, wherein the flow key is determined based on a source IP address and port, destination IP address and port, and protocol type for the packet.
10. A router as in claim 9, wherein determining how to treat the packet includes determining how to route the packet from the router.
11. A router as in claim 10, wherein determining how to treat the packet further includes determining whether access is allowed for the packet.
12. A router as in claim 10, wherein determining how to treat the packet further includes determining encryption treatment for the packet.
13. A router as in claim 8, wherein the instructions further comprise the step of entering accounting information in the flow cache for the flow.
14. A router as in claim 8, wherein the IP address cache is an M-trie having a branching width of at least 16, said M-trie having a set of nodes including a root node, each said node having a pointer and a node/leaf indicator included within a data word, said node/leaf indicator determining whether said pointer points to an inferior node or to a leaf data structure, each leaf data structure including information associated with one IP address, said pointer to said inferior node being located at an offset in an array of nodes, said offset within an Nth level of said M-trie corresponding to an associated value represented by an Nth byte of said IP address, wherein because said set of IP addresses are clustered, said M-trie is smaller, by a factor of about five to a factor of about ten, than if said set of IP addresses were randomly distributed.
15. A memory storing instructions for causing a router to determine how to treat packets, the instructions comprising the steps of:
determining a flow and a flow key for a packet;
performing a first lookup in a flow cache based on the flow key, with the flow determined to be old if the first lookup is successful and determined to be new if the first lookup is unsuccessful;
if the flow is old, using results of the first lookup to determine how to treat the packet; and
if the flow is new, performing a second lookup in an IP address cache, with results of the second lookup used to determine how to treat the packet and to make an entry for the flow in the flow cache such that if a next packet in the flow is received, the flow is identified as old and the next packet is treated in the same manner as the packet.
16. A memory as in claim 15, wherein the flow key is determined based on a source IP address and port, destination IP address and port, and protocol type for the packet.
17. A memory as in claim 16, wherein determining how to treat the packet includes determining how to route the packet from the router.
18. A memory as in claim 17, wherein determining how to treat the packet further includes determining whether access is allowed for the packet.
19. A memory as in claim 17, wherein determining how to treat the packet further includes determining encryption treatment for the packet.
20. A memory as in claim 15, wherein the instructions further comprise the step of entering accounting information in the flow cache for the flow.
21. A memory as in claim 15, wherein the IP address cache is an M-trie having a branching width of at least 16, said M-trie having a set of nodes including a root node, each said node having a pointer and a node/leaf indicator included within a data word, said node/leaf indicator determining whether said pointer points to an inferior node or to a leaf data structure, each leaf data structure including information associated with one IP address, said pointer to said inferior node being located at an offset in an array of nodes, said offset within an Nth level of said M-trie corresponding to an associated value represented by an Nth byte of said IP address, wherein because said set of IP addresses are clustered, said M-trie is smaller, by a factor of about five to a factor of about ten, than if said set of IP addresses were randomly distributed.
22. A router that determines how to treat packets, comprising:
means for determining a flow and a flow key for a packet;
means for performing a first lookup in a flow cache based on the flow key, with the flow determined to be old if the first lookup is successful and determined to be new if the first lookup is unsuccessful;
means for using, if the flow is old, results of the first lookup to determine how to treat the packet; and
means for performing, if the flow is new, a second lookup in an IP address cache, with results of the second lookup used to determine how to treat the packet and to make an entry for the flow in the cache such that if a next packet in the flow is received, the flow is identified as old, and the next packet is treated in a same manner as the packet.
Patent Citations (293)
| Patent | Date | Inventor | Cited By |
|---|---|---|---|
| US4064360(A) | 1977-12-01 | Koenig | Applicant |
| US4131767(A) | 1978-12-01 | Weinstein | Applicant |
| US4161719(A) | 1979-07-01 | Parikh et al. | Applicant |
| US4316284(A) | 1982-02-01 | Howson | Applicant |
| US4397020(A) | 1983-08-01 | Howson | Applicant |
| US4419728(A) | 1983-12-01 | Larson | Applicant |
| US4424565(A) | 1984-01-01 | Larson | Applicant |
| US4437087(A) | 1984-03-01 | Petr | Applicant |
| US4438511(A) | 1984-03-01 | Baran | Applicant |
| US4439763(A) | 1984-03-01 | Limb | Applicant |
| US4445213(A) | 1984-04-01 | Baugh et al. | Applicant |
| US4446555(A) | 1984-05-01 | Devault et al. | Applicant |
| US4456957(A) | 1984-06-01 | Schieltz | Applicant |
| US4464658(A) | 1984-08-01 | Thelen | Applicant |
| US4491945(A) | 1985-01-01 | Turner | Applicant |
| US4499576(A) | 1985-02-01 | Fraser | Applicant |
| US4506358(A) | 1985-03-01 | Montgomery | Applicant |
| US4507760(A) | 1985-03-01 | Fraser | Applicant |
| US4532626(A) | 1985-07-01 | Flores et al. | Applicant |
| US4644532(A) | 1987-02-01 | George et al. | Applicant |
| US4646287(A) | 1987-02-01 | Larson et al. | Applicant |
| US4677423(A) | 1987-06-01 | Benvenuto et al. | Applicant |
| US4679189(A) | 1987-07-01 | Olson et al. | Examiner |
| US4679227(A) | 1987-07-01 | Hughes-Hartogs | Applicant |
| US4713806(A) | 1987-12-01 | Oberlander et al. | Applicant |
| US4723267(A) | 1988-02-01 | Jones et al | Applicant |
| US4731816(A) | 1988-03-01 | Hughes-Hartogs | Applicant |
| US4750136(A) | 1988-06-01 | Arpin et al. | Applicant |
| US4757495(A) | 1988-07-01 | Decker et al. | Applicant |
| US4763191(A) | 1988-08-01 | Gordon et al. | Applicant |
| US4769810(A) | 1988-09-01 | Eckberg, Jr. et al. | Applicant |
| US4769811(A) | 1988-09-01 | Eckberg, Jr. et al. | Applicant |
| US4771425(A) | 1988-09-01 | Baran et al. | Applicant |
| US4788657(A) | 1988-11-01 | Douglas et al. | Applicant |
| US4819228(A) | 1989-04-01 | Baran et al. | Applicant |
| US4827411(A) | 1989-05-01 | Arrowood et al. | Applicant |
| US4833706(A) | 1989-05-01 | Hughes-Hartogs | Applicant |
| US4835737(A) | 1989-05-01 | Herrig et al. | Applicant |
| US4879551(A) | 1989-11-01 | Georgiou et al. | Applicant |
| US4893304(A) | 1990-01-01 | Giacopelli et al. | Applicant |
| US4893306(A) | 1990-01-01 | Chao et al. | Applicant |
| US4903261(A) | 1990-02-01 | Baran et al. | Applicant |
| US4905233(A) | 1990-02-01 | Cain et al. | Applicant |
| US4922486(A) | 1990-05-01 | Lidinsky et al. | Applicant |
| US4933937(A) | 1990-06-01 | Konishi | Applicant |
| US4960310(A) | 1990-10-01 | Cushing | Applicant |
| US4962497(A) | 1990-10-01 | Ferenc et al. | Applicant |
| US4962532(A) | 1990-10-01 | Kasirai et al. | Applicant |
| US4965772(A) | 1990-10-01 | Daniel et al. | Applicant |
| US4970678(A) | 1990-11-01 | Sladowski et al. | Applicant |
| US4979118(A) | 1990-12-01 | Kheradpir | Applicant |
| US4980897(A) | 1990-12-01 | Decker et al. | Applicant |
| US4991169(A) | 1991-02-01 | Davis et al. | Applicant |
| US5003595(A) | 1991-03-01 | Collins et al. | Applicant |
| US5014265(A) | 1991-05-01 | Hahne et al. | Applicant |
| US5014327(A) | 1991-05-01 | Potter et al. | Applicant |
| US5020058(A) | 1991-05-01 | Holden et al. | Applicant |
| US5033076(A) | 1991-07-01 | Jones et al. | Applicant |
| US5051987(A) | 1991-09-01 | Conlon | Applicant |
| US5054034(A) | 1991-10-01 | Hughes-Hartogs | Applicant |
| US5059925(A) | 1991-10-01 | Weisbloom | Applicant |
| US5063612(A) | 1991-11-01 | McKeown | Applicant |
| US5072449(A) | 1991-12-01 | Enns et al. | Applicant |
| US5088032(A) | 1992-02-01 | Bosack | Applicant |
| US5095480(A) | 1992-03-01 | Fenner | Examiner |
| US5101402(A) | 1992-03-01 | Chiu et al. | Applicant |
| USRE33900(E) | 1992-04-01 | Howson | Applicant |
| US5115431(A) | 1992-05-01 | Williams et al. | Applicant |
| US5115495(A) | 1992-05-01 | Tsuchiya et al. | Applicant |
| US5128926(A) | 1992-07-01 | Perlman et al. | Applicant |
| US5128945(A) | 1992-07-01 | Enns et al. | Applicant |
| US5136580(A) | 1992-08-01 | Videlock et al. | Applicant |
| US5166930(A) | 1992-11-01 | Braff et al. | Applicant |
| US5189662(A) | 1993-02-01 | Kleine-Altekamp | Applicant |
| US5199049(A) | 1993-03-01 | Wilson | Applicant |
| US5206638(A) | 1993-04-01 | McKeown | Applicant |
| US5206886(A) | 1993-04-01 | Bingham | Applicant |
| US5208811(A) | 1993-05-01 | Kashio et al. | Applicant |
| US5212686(A) | 1993-05-01 | Joy et al. | Applicant |
| US5224099(A) | 1993-06-01 | Corbalis et al. | Applicant |
| US5226120(A) | 1993-07-01 | Brown et al. | Applicant |
| US5228062(A) | 1993-07-01 | Bingham | Applicant |
| US5229994(A) | 1993-07-01 | Balzano et al. | Applicant |
| US5231633(A) | 1993-07-01 | Hluchyj et al. | Applicant |
| US5233604(A) | 1993-08-01 | Ahmadi et al. | Applicant |
| US5237564(A) | 1993-08-01 | Lespagnol et al. | Applicant |
| US5241682(A) | 1993-08-01 | Bryant et al. | Applicant |
| US5243342(A) | 1993-09-01 | Kattemalalavadi et al. | Applicant |
| US5243596(A) | 1993-09-01 | Port et al. | Applicant |
| US5247516(A) | 1993-09-01 | Bernstein et al. | Applicant |
| US5249178(A) | 1993-09-01 | Kurano et al. | Applicant |
| US5249292(A) | 1993-09-01 | Chiappa | Applicant |
| US5251205(A) | 1993-10-01 | Callon | Applicant |
| US5253251(A) | 1993-10-01 | Aramaki | Applicant |
| US5255291(A) | 1993-10-01 | Holden et al. | Applicant |
| US5260933(A) | 1993-11-01 | Rouse | Applicant |
| US5260978(A) | 1993-11-01 | Fleischer et al. | Applicant |
| US5268592(A) | 1993-12-01 | Bellamy et al. | Applicant |
| US5268900(A) | 1993-12-01 | Hluchyj et al. | Applicant |
| US5271004(A) | 1993-12-01 | Proctor et al. | Applicant |
| US5274631(A) | 1993-12-01 | Bhardwaj | Applicant |
| US5274635(A) | 1993-12-01 | Rahman et al. | Applicant |
| US5274643(A) | 1993-12-01 | Fisk | Applicant |
| US5280470(A) | 1994-01-01 | Buhrke et al. | Applicant |
| US5280480(A) | 1994-01-01 | Pitt et al. | Applicant |
| US5280500(A) | 1994-01-01 | Mazzola et al. | Applicant |
| US5283783(A) | 1994-02-01 | Nguyen et al. | Applicant |
| US5287103(A) | 1994-02-01 | Kasprzyk et al. | Applicant |
| US5287453(A) | 1994-02-01 | Roberts | Examiner |
| US5291482(A) | 1994-03-01 | McHarg et al. | Applicant |
| US5301333(A) | 1994-04-01 | Lee | Applicant |
| US5305311(A) | 1994-04-01 | Lyles | Applicant |
| US5307343(A) | 1994-04-01 | Bostica et al. | Applicant |
| US5309437(A) | 1994-05-01 | Perlman et al. | Applicant |
| US5311509(A) | 1994-05-01 | Heddes et al. | Applicant |
| US5313454(A) | 1994-05-01 | Bustini et al. | Applicant |
| US5313582(A) | 1994-05-01 | Hendel et al. | Applicant |
| US5317562(A) | 1994-05-01 | Nardin et al. | Applicant |
| US5319644(A) | 1994-06-01 | Liang | Applicant |
| US5325358(A) | 1994-06-01 | Goeldner | Applicant |
| US5327421(A) | 1994-07-01 | Hiller et al. | Applicant |
| US5331637(A) | 1994-07-01 | Francis et al. | Applicant |
| US5335224(A) | 1994-08-01 | Cole et al. | Applicant |
| US5339311(A) | 1994-08-01 | Turner | Applicant |
| US5345445(A) | 1994-09-01 | Hiller et al. | Applicant |
| US5345446(A) | 1994-09-01 | Hiller et al. | Applicant |
| US5353283(A) | 1994-10-01 | Tsuchiya | Applicant |
| US5357506(A) | 1994-10-01 | Sugawara | Applicant |
| US5359592(A) | 1994-10-01 | Corbalis et al. | Applicant |
| US5361250(A) | 1994-11-01 | Nguyen et al. | Applicant |
| US5361256(A) | 1994-11-01 | Doeringer et al. | Applicant |
| US5361259(A) | 1994-11-01 | Hunt et al. | Applicant |
| US5365524(A) | 1994-11-01 | Hiller et al. | Applicant |
| US5367517(A) | 1994-11-01 | Cidon et al. | Applicant |
| US5371852(A) | 1994-12-01 | Attanasio et al. | Applicant |
| US5377181(A) | 1994-12-01 | Rogers | Applicant |
| US5381413(A) | 1995-01-01 | Tobagi et al. | Applicant |
| US5386413(A) | 1995-01-01 | McAuley et al. | Applicant |
| US5386567(A) | 1995-01-01 | Lien et al. | Applicant |
| US5390170(A) | 1995-02-01 | Sawant et al. | Applicant |
| US5390175(A) | 1995-02-01 | Hiller et al. | Applicant |
| US5392280(A) | 1995-02-01 | Zheng | Applicant |
| US5394394(A) | 1995-02-01 | Crowther et al. | Applicant |
| US5394402(A) | 1995-02-01 | Ross | Applicant |
| US5400325(A) | 1995-03-01 | Chatwani et al. | Applicant |
| US5408469(A) | 1995-04-01 | Opher et al. | Applicant |
| US5416842(A) | 1995-05-01 | Aziz | Applicant |
| US5422880(A) | 1995-06-01 | Heitkamp et al. | Applicant |
| US5422882(A) | 1995-06-01 | Hiller et al. | Applicant |
| US5423002(A) | 1995-06-01 | Hart | Applicant |
| US5426636(A) | 1995-06-01 | Hiller et al. | Applicant |
| US5428607(A) | 1995-06-01 | Hiller et al. | Applicant |
| US5430715(A) | 1995-07-01 | Corbalis et al. | Applicant |
| US5430729(A) | 1995-07-01 | Rahnema | Applicant |
| US5432784(A) | 1995-07-01 | Ozveren | Applicant |
| US5434863(A) | 1995-07-01 | Onishi et al. | Applicant |
| US5436886(A) | 1995-07-01 | McGill | Applicant |
| US5440550(A) | 1995-08-01 | Follett | Applicant |
| US5442457(A) | 1995-08-01 | Najafi | Applicant |
| US5442624(A) | 1995-08-01 | Bonomi et al. | Applicant |
| US5442630(A) | 1995-08-01 | Gagliardi et al. | Applicant |
| US5448559(A) | 1995-09-01 | Hayter et al. | Applicant |
| US5452294(A) | 1995-09-01 | Natarajan | Applicant |
| US5452297(A) | 1995-09-01 | Hiller et al. | Applicant |
| US5473599(A) | 1995-12-01 | Li et al. | Applicant |
| US5473607(A) | 1995-12-01 | Hausman et al. | Applicant |
| US5477541(A) | 1995-12-01 | White et al. | Applicant |
| US5485455(A) | 1996-01-01 | Dobbins et al. | Applicant |
| US5490140(A) | 1996-02-01 | Abensour et al. | Applicant |
| US5490258(A) | 1996-02-01 | Fenner | Examiner |
| US5491687(A) | 1996-02-01 | Christensen et al. | Applicant |
| US5491804(A) | 1996-02-01 | Heath et al. | Applicant |
| US5497368(A) | 1996-03-01 | Reijnierse et al. | Applicant |
| US5497371(A) | 1996-03-01 | Ellis et al. | Applicant |
| US5500858(A) | 1996-03-01 | McKeown | Applicant |
| US5504747(A) | 1996-04-01 | Sweasey | Applicant |
| US5509006(A) | 1996-04-01 | Wilford et al. | Applicant |
| US5509123(A) | 1996-04-01 | Dobbins et al. | Applicant |
| US5517494(A) | 1996-05-01 | Green | Applicant |
| US5517662(A) | 1996-05-01 | Hashimoto et al. | Applicant |
| US5519704(A) | 1996-05-01 | Farinacci et al. | Applicant |
| US5519858(A) | 1996-05-01 | Walton et al. | Applicant |
| US5526489(A) | 1996-06-01 | Nilakantan et al. | Applicant |
| US5530963(A) | 1996-06-01 | Moore et al. | Applicant |
| US5535195(A) | 1996-07-01 | Lee | Applicant |
| US5539734(A) | 1996-07-01 | Burwell et al. | Applicant |
| US5539737(A) | 1996-07-01 | Lo et al. | Applicant |
| US5539743(A) | 1996-07-01 | Burwell et al. | Applicant |
| US5541911(A) | 1996-07-01 | Nilakantan et al. | Applicant |
| US5546370(A) | 1996-08-01 | Ishikawa | Applicant |
| US5548593(A) | 1996-08-01 | Peschi | Applicant |
| US5550816(A) | 1996-08-01 | Hardwick et al. | Applicant |
| US5555244(A) | 1996-09-01 | Gupta et al. | Applicant |
| US5559801(A) | 1996-09-01 | Lo | Applicant |
| US5561669(A) | 1996-10-01 | Lenney et al. | Applicant |
| US5566170(A) | 1996-10-01 | Bakke et al. | Applicant |
| US5572522(A) | 1996-11-01 | Calamvokis et al. | Applicant |
| US5577035(A) | 1996-11-01 | Hayter et al. | Applicant |
| US5583862(A) | 1996-12-01 | Callon | Applicant |
| US5586121(A) | 1996-12-01 | Moura et al. | Applicant |
| US5592470(A) | 1997-01-01 | Rudrapatna et al. | Applicant |
| US5598115(A) | 1997-01-01 | Holst | Applicant |
| US5598532(A) | 1997-01-01 | Liron | Applicant |
| US5598581(A) | 1997-01-01 | Daines et al. | Applicant |
| US5600798(A) | 1997-02-01 | Cherukuri et al. | Applicant |
| US5604868(A) | 1997-02-01 | Komine et al. | Applicant |
| US5608726(A) | 1997-03-01 | Virgile | Applicant |
| US5613096(A) | 1997-03-01 | Danknick | Applicant |
| US5617417(A) | 1997-04-01 | Sathe et al. | Applicant |
| US5617421(A) | 1997-04-01 | Chin et al. | Applicant |
| US5625622(A) | 1997-04-01 | Johri | Applicant |
| US5630125(A) | 1997-05-01 | Zellweger | Examiner |
| US5631908(A) | 1997-05-01 | Saxe | Applicant |
| US5632021(A) | 1997-05-01 | Jennings et al. | Applicant |
| US5633869(A) | 1997-05-01 | Burnett et al. | Applicant |
| US5634010(A) | 1997-05-01 | Ciscon et al. | Applicant |
| US5634011(A) | 1997-05-01 | Auerbach et al. | Applicant |
| US5638359(A) | 1997-06-01 | Peltola et al. | Applicant |
| US5644713(A) | 1997-07-01 | Makishima | Applicant |
| US5644718(A) | 1997-07-01 | Belove et al. | Applicant |
| US5651002(A) | 1997-07-01 | Van Seters et al. | Applicant |
| US5659684(A) | 1997-08-01 | Giovannoni et al. | Applicant |
| US5666353(A) | 1997-09-01 | Klausmeier et al. | Applicant |
| US5673265(A) | 1997-09-01 | Gupta et al. | Applicant |
| US5675579(A) | 1997-10-01 | Watson et al. | Applicant |
| US5678006(A) | 1997-10-01 | Valizadeh et al. | Applicant |
| US5680116(A) | 1997-10-01 | Hashimoto et al. | Applicant |
| US5684797(A) | 1997-11-01 | Aznar et al. | Applicant |
| US5684954(A) | 1997-11-01 | Kaiserswerth et al. | Applicant |
| US5687324(A) | 1997-11-01 | Green et al. | Applicant |
| US5689506(A) | 1997-11-01 | Chiussi et al. | Applicant |
| US5691984(A) | 1997-11-01 | Gardner et al. | Applicant |
| US5694390(A) | 1997-12-01 | Yamato et al. | Applicant |
| US5699532(A) | 1997-12-01 | Barrett | Applicant |
| US5724351(A) | 1998-03-01 | Chao et al. | Applicant |
| US5740157(A) | 1998-04-01 | Demiray | Applicant |
| US5742760(A) | 1998-04-01 | Picazo, Jr. et al. | Applicant |
| US5742905(A) | 1998-04-01 | Pepe et al. | Applicant |
| US5748186(A) | 1998-05-01 | Raman | Examiner |
| US5748617(A) | 1998-05-01 | McLain, Jr. | Applicant |
| US5754547(A) | 1998-05-01 | Nakazawa | Applicant |
| US5771231(A) | 1998-06-01 | Watanabe | Applicant |
| US5774698(A) | 1998-06-01 | Olnowich | Applicant |
| US5781772(A) | 1998-07-01 | Wilkinson, III | Applicant |
| US5793745(A) | 1998-08-01 | Manchester | Applicant |
| US5793978(A) | 1998-08-01 | Fowler | Applicant |
| US5796736(A) | 1998-08-01 | Suzuki | Applicant |
| US5802054(A) | 1998-09-01 | Bellenger | Applicant |
| US5809415(A) | 1998-09-01 | Rossmann | Applicant |
| US5835696(A) | 1998-11-01 | Hess | Applicant |
| US5835710(A) | 1998-11-01 | Nagami et al. | Applicant |
| US5842224(A) | 1998-11-01 | Fenner | Applicant |
| US5854903(A) | 1998-12-01 | Morrison et al. | Applicant |
| US5856981(A) | 1999-01-01 | Voelker | Applicant |
| US5859837(A) | 1999-01-01 | Crayford | Applicant |
| US5872783(A) | 1999-02-01 | Chinetal | Applicant |
| US5892924(A) | 1999-04-01 | Lyon et al. | Applicant |
| US5898686(A) | 1999-04-01 | Virgile | Applicant |
| US5903559(A) | 1999-05-01 | Acharya et al. | Applicant |
| US5905723(A) | 1999-05-01 | Varghese et al. | Applicant |
| US5909440(A) | 1999-06-01 | Ferguson | Applicant |
| US5914953(A) | 1999-06-01 | Krause et al. | Applicant |
| US5917820(A) | 1999-06-01 | Rekhter | Applicant |
| US5917821(A) | 1999-06-01 | Gobuyan et al. | Applicant |
| US5920566(A) | 1999-07-01 | Hendel et al. | Applicant |
| US5970232(A) | 1999-10-01 | Passint et al. | Applicant |
| US5991817(A) | 1999-11-01 | Rowett et al. | Applicant |
| US5996021(A) | 1999-11-01 | Civanlar | Applicant |
| US6006264(A) | 1999-12-01 | Colby et al. | Applicant |
| US6011795(A) | 2000-01-01 | Varghese et al. | Applicant |
| US6014659(A) | 2000-01-01 | Wilkinson, III | Applicant |
| US6018524(A) | 2000-01-01 | Turner et al. | Applicant |
| US6023733(A) | 2000-02-01 | Periasamy et al. | Applicant |
| US6047323(A) | 2000-04-01 | Krause | Examiner |
| US6052683(A) | 2000-04-01 | Irwin | Applicant |
| US6055364(A) | 2000-04-01 | Speakman | Applicant |
| US6061712(A) | 2000-05-01 | Tzeng | Applicant |
| US6067574(A) | 2000-05-01 | Tzeng | Applicant |
| US6078590(A) | 2000-06-01 | Farinacci et al. | Applicant |
| US6101115(A) | 2000-08-01 | Ross | Applicant |
| US6111877(A) | 2000-08-01 | Wilford | Applicant |
| US6122279(A) | 2000-09-01 | Milway et al. | Applicant |
| US6147996(A) | 2000-11-01 | Laor | Applicant |
| US6167438(A) | 2000-12-01 | Yates et al. | Examiner |
| US21295(A1) | 2001-08-01 | Wilford | Applicant |
| US6157641(A1) | 2001-12-01 | Wilford | Applicant |
| EP384758(A2) | 1990-08-01 | Applicant | |
| EP431751(A1) | 1991-06-01 | Applicant | |
| EP567217(A2) | 1993-10-01 | Applicant | |
| WO9307569 | 1993-04-01 | Applicant | |
| WO9307692 | 1993-04-01 | Applicant | |
| WO9401828 | 1994-01-01 | Applicant | |
| WO9520850 | 1995-08-01 | Applicant |
Non-Patent Literature (26)
- Awerbuch et al., “Sparse Partitions,” IEEE, 1990, pp. 503-513.*Applicant
- Bouloutas et al., “Some Graph Partitioning Problems and Algorithms Related to Raiting in Large Computer Networks,” IEEE, 1989, pp. 362-370.*Applicant
- Chandranmenon and Varghese, “Trading Packet Headers for Packet Processing,” IEEE, Apr. 96, pp. 141-52.*Applicant
- Allen, M., “Novell IPX Over Various WAN Media (IPXW AN),” Network Working Group, RFC 1551, Dec. 1993, pp. 1-22.Applicant
- Becker, D., “3c589.c: A 3c589 EtherLink3 ethernet driver for linux,” becker @CESDIS.gsfc.nasa.gov, May 3, 1994, pp. 1-13.Applicant
- Chowdhury, et al., “Alternative Bandwidth Allocation Algorithms for Packet Video in ATM Networks,” INFOCOM 1992, pp. 1061-1068.Applicant
- Doeringer, W., “Routing on Longest-Matching Prefixes,” IEEE/ACM Transactions in Networking, vol. 4, No. 1, Feb. 1996, pp. 86-97.Applicant
- Esaki, et al., “Datagram Delivery in an ATM-Internet,” 2334b IEICE Transactions on Communications, Mar. 1994, No. 3, Tokyo, Japan.Applicant
- IBM Corporation, “Method and Apparatus for the Statistical Multiplexing of Voice, Data and Image Signals,” IBM Technical Disclosure Bulletin, No. 6, Nov. 1992, pp. 409-411.Applicant
- Pei, et al., “Putting Routing Tables in Silicon,” IEEE Network Magazine, Jan. 1992, pp. 42-50.Applicant
- Perkins, D., “Requirements for an Internet Standard Point-to-Point Protocol,” Network Working Group, RFC 1547, Dec. 1993, pp. 1-19.Applicant
- Simpson, W., “The Point-to-Point Protocol (PPP),” Network Working Group, RFC 1548, Dec. 1993, pp. 1-53.Applicant
- Tsuchiya, P.F., “A Search Algorithm for Table Entries with Non-Contiguous Wildcarding,” Abstract, Bellcore.Applicant
- Zhang, et al., “Rate-Controlled Static-Priority Queueing,” INFOCOM 1993, pp. 227-236.Applicant
- Williams Stallings, Data and Computer Communications, pp: 329-333, Prentice Hall, Upper Saddle River, New Jersey 07458.Applicant
- Anderson, Thomas E. et al. “High Speed Switch Scheduling for Local-Area networks”. IEEE. pp. 319-352. Dated Nov. 1993.Applicant
- McKeown, Nicholas et al. “Sceduling Cells in an Input-Queued Switch”. IEEE Electronics Letters. Dec. 9, 1993, pp. 2174-5.Applicant
- Newman et al. “Flow Fabelled IP: A Connectionless Approach to ATM”. IEEE, 1996, pp. 12 51-60.Applicant
- Prabhaker, Balaji et al. “Multicast Scheduling for Input-Queued Switches”. IEEE Jounal of Selected Areas in Communications, vol. 15, No. 5, pages: 1-23, 855-866.Applicant
- Le, My T. et al. The BayBridge: A High Speed Bridge/Router Between FDDI and SMDS part II-the SMDS interface and DQDB MAC Chip. IEEE Trans Networking (to appear).Applicant
- McKeown, Nicholas et al. “The BayBridge: A High Speed brdige/Router Between FDDI and SMDS part I-Architecture and Performance”. IEEE Trans Networking (to appear).Applicant
- Karol, Mark J. et al. “Input Output Queuing on a Space-Division Packet Switch”. IEEE. pp. 59-68. Dated Dec. 1987.Applicant
- Chuang, Shang-Tse et al. Matching Output Queuing with a Combined Input and Output Queued Switch pp. 1-25.Applicant
- Demers, A. et al. “Analysis and Simulation of a Fair Queuing Algorithm”. Proceedings ACM SIGcomm, pp. 1-12, Sep. 1989.Applicant
- Duffy, JIM. “Cisco Goes With The Flow”. Network World, Apr. 22, 1996.Applicant
- Girish et al. “Trading Packet Headers for Packet Processing”. IEEE, 1996, pp. 141-152.Applicant