US 6,308,148 B1Grant
Network flow data export
Issue Date:2001-10-23
•17 Claims
•1 Drawing Sheets
Abstract
The invention provides a system for collecting, exporting and using data relating to message flows responsive to message flow patterns in a flow switching network. A router collects and aggregates flow information using a variety of criteria, including (1) ranges of addresses for source and destination, (2) information about packets in the flow, including number and frequency of packets in the flow, size of packets in the flow (total size and distribution), (3) protocol used for the flow, including for example whether the flow uses electronic mail protocol, file transfer protocol, hypertext transfer protocol, real-time audiovisual data transmission protocol, or some other protocol, (4) other administrative criteria which may be pertinent to the flow, including for example initiation time or duration of the flow, and (5) possible aggregations or combinations of these criteria. The router provides the aggregated information to one or more filters at an output port. Each filter selects only a subset of the total set of flows; filters may be combined to create compound filters. Filters may be coupled to aggregators, which further aggregate flow data and may store flow data for use by application programs. Application programs may identify useful information in the flow data and may either (1) present that data to an operator for review, or (2) use that data to adjust features or parameters of the network. The router may also collect information so that flows which are improper or otherwise unusual can be traced to particular source and destination devices.
Metadata
Assignee
- Cisco Technology, Inc.
Inventors
- Barry L. Bruins
- Darren R. Kerr
Application Information
Application Number:US 08/771,438
Filing Date:1996-12-20
Priority Date:1996-05-28
Art Unit:7
Classifications
IPC:
G06F 300
Field of Search:
395500395200543952006339520064370401370411370353370355370408703 26703 27703 22707104
Patent Drawings (1 sheets)
Description
Cross-Reference to Related Application
[0002] This application is a continuation-in-part of U.S. patent application Ser. No. 08/655,429, “Network Flow Switching and Flow Data Export”, filed May 28, 1996, in the name of the same inventors, assigned to the same assignee, hereby incorporated by reference as if fully set forth herein, and referred to herein as the “network flow switching disclosure”. Terms defined in the network flow switching disclosure have the same meanings in the present application.
Background of the Invention
[0003] 1. Field of the Invention
[0004] This invention relates to techniques for exporting and using data relating to flows in a flow switching network and responsive to message flow patterns.
[0005] 2. Related Art
[0006] In computer networks, it is commonly desirable to determine, collect, process, and possibly display information relating to use of the network, including information which could be used by network administrators, routing devices, service providers, and users. This information could be of a variety of types, such as for packets transmitted in the network—their source or destination, number, frequency, size, protocol type, priority, or other administrative information such as security classifications or accounting information. This information could also be aggregated by a variety of categories—for the entire network or subnetworks thereof, for groups of sources or destinations, or for particular types of packets (such as particular size, protocol type, priority, security classifications, or accounting information).
[0007] However, one problem which has arisen in the art is that, in many computer networks, the number of packets transmitted in the network, and thus the amount of information to be collected, processed, and possibly displayed, is extremely large. Thus, the amount of processing power required to collect and process that information is much larger than is available.
[0008] A first known method for collecting information about use of the network is to couple a monitoring processor to a link in the network, and to monitor traffic which passes through that link. For example, the monitoring processor could be coupled to a local-area network (LAN) coupled to a router, and could monitor traffic input to or output from that router using that LAN. A protocol known as “RMON” (remote monitoring) is known for transmitting messages relating to monitoring information between the monitoring processor and the router. However, this known method is subject to drawbacks, including (1) that the number of packets input to and output from the router usually greatly exceeds the capability of the monitoring processor to collect and process information about packets, and (2) that the monitoring processor is only able to collect and process information about packets which pass through that particular link.
[0009] A second known method for collecting information about use of the network is to couple the monitoring processor to the router using protocols at layer 3 of the OSI model, such as using the IP protocol to communicate between the monitoring processor and the router. The RMON protocol may also be used to transmit messages relating to monitoring information between the monitoring processor and the router in this configuration. However, this second method is subject to drawbacks, including that the monitoring processor is either not able to collect information from the router in sufficient detail, or if information is available in sufficient detail, that information greatly exceeds the capability of the monitoring processor to collect and process.
[0010] Accordingly, it would be desirable to provide a method and system for monitoring information about network usage. This advantage is achieved in an embodiment of the invention in which information about network usage is collected and aggregated in a network router responsive to flows in a flow switching network, and presented to monitoring processors for processing at a message flow level of aggregation.
Summary of Invention
[0011] The invention provides a method and system for exporting and using data relating to flows in a flow switching network and responsive to message flow patterns. In a preferred embodiment, the router collects flow history information, so that flows which are improper or otherwise unusual can be traced to the particular source and destination devices. The router also collects and aggregates flow information using a variety of criteria, including (1) ranges of addresses for source and destination, (2) information about packets in the flow, such as the number and frequency of the packets in the flow, the size of the packets in the flow (total size and distribution), (3) the protocol used for the flow, such as for example whether the flow uses an electronic mail protocol, a file transfer protocol, a hypertext transfer protocol, a real-time audiovisual data transmission protocol, or some other protocol, (4) other administrative criteria which may be pertinent to the flow, such as for example the time of initiation or duration of the flow, and (5) possible aggregations or combinations of these criteria.
[0012] In a preferred embodiment, the router provides the aggregated information to one or more filters at an output port. Each filter selects only a subset of the total set of flows; filters may be combined to create compound filters. Filters may be coupled to aggregators, which further aggregate flow data and may store flow data for use by application programs. Application programs may identify useful information in the flow data and may either (1) present that data to an operator for review, or (2) use that data to adjust features or parameters of the network.
Brief Description of the Drawings
[0013] FIG. 1 shows an example network in which routing responsive to message flows is performed.
[0014] FIG. 2 shows an example network in which message flow information is filtered and reported.
Detailed Description of the Preferred Embodiment
[0015] Network Flow Switching and Message Flows
[0016] FIG. 1 shows an example network in which routing responsive to message flows is performed.
[0017] As described in the “network flow switching disclosure”, 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 is disposed for receiving a set of packets 150 from the source device 120 and routing them to the destination device 130. The communication link may comprise any form of physical media layer, such as ethernet, FDDI, or HDLC serial link. The routing device 140 comprises a routing processor for performing steps described in the “network flow switching disclosure”, and steps described herein, and may include specific hardware constructed or programmed for performing such process steps, may include a general purpose processor operating under program control, or some combination thereof.
[0018] As described in the “network flow switching disclosure”, 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).
[0019] As described in the “network flow switching disclosure”, 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.
[0020] It will be clear to those skilled in the art, after perusing this application and the “network flow switching disclosure”, 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 bidirectional 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).
[0021] Filtering and Reporting of Flow Data
[0022] FIG. 2 shows an example network in which message flow information is filtered and reported.
[0023] The routing device 140 includes an output port 210, at which the routing device 140 outputs flow data packets 220 comprising message flow information. The output port 210 is coupled to a communication link 110, to which devices may be coupled to receive the flow data packets 220.
[0024] A set of filters 230 (including at least one filter 230 and preferably a plurality of filters 230), are coupled to the communication link 110, and receive the flow data packets 220. Each of the filters 230 parses the flow data packets 220, and compares those flow data packets 220 with a set of selected criteria to determine if those flow data packets 220 should be considered or should be filtered out of consideration.
[0025] In a preferred embodiment, the set of selected criteria for one particular filter 230 includes a single criterion, although there is no particular reason (except perhaps speed) that one of the filters 230 cannot process more than one criterion simultaneously.
[0026] For a first example, a first one of the filters 230 can select flow data packets 220 which relate to message flows 160 having a selected range of source addresses, such as flow data packets 220 for message flows 160 which originate from the internet domain “cisco.com”. For a second example, a second one of the filters 230 can select flow data packets 220 which relate to message flows 160 having a selected protocol type, such as flow data packets 220 for message flows 160 which use the “FTP” protocol.
[0027] A set of secondary filters 230 can each be coupled to a set of primary filters 230, and operate to compare flow data packets 220 with a further set of selected criteria. In a preferred embodiment, the secondary filters 230 can each be coupled to a plurality of primary filters 230, so as to operate on a set union of flow data packets 220 selected by each of the primary filters 230.
[0028] For example, in the embodiment shown in the figure, a first primary filter 230 operates to select flow data packets 220 which relate to message flows 160 having a selected range of source addresses, such as flow data packets 220 for message flows 160 which originate from the internet domain “cisco.com”, while a second primary filter 230 operates to select flow data packets 220 which relate to message flows 160 having a selected protocol type, such as flow data packets 220 for message flows 160 which use the “FTP” protocol. A secondary filter 230 is coupled to both the first primary filter 230 and the second primary filter 230, and operates to select a subset of those flow data packets 220 selected by either the first primary filter 230 or the second primary filter 230.
[0029] The selection criteria applied by the secondary filter 230 are similar to the selection criteria applied by any of the primary filters 230; thus the secondary filters 230 are like the primary filters 230 except for being coupled to flow data packets 220 selected by the primary filters 230 rather than flow data packets 220 output by the routing device 140.
[0030] Similar to the secondary filter 230, there can be a tertiary filter 230 which selects flow data packets 220 from those selected by secondary filters 230, or by a combination of those selected by primary filters 230 and those selected by secondary filters 230, or by a combination of original flow data packets 220, those selected by primary filters 230 and those selected by secondary filters 230. There can similarly be fourth-level filters 230, and so on, to combine the filtering results of each set of filters 230.
[0031] An aggregator 240 is coupled to each of the filters 230, and collects flow data packets 220 passed by its associated filter 230. Thus, each of the aggregators 240 collects a set of flow data packets 220 which relate to the criteria selected by its associated filter 230 and records aggregated information relating to those flow data packets 220 at a storage element 250. The storage elements 250 record the aggregated information in one or more databases 251 located at those locations.
[0032] A display application 260 is coupled to one or more storage elements 250, accesses the databases 251, and provides a display of information for an operator. In a preferred embodiment, the operator can comprise an individual who uses the display application 260, or can comprise an application program which is coupled to the display application.
[0033] A consolidation element 270 is coupled to one or more storage elements 250 and operates to consolidate the databases 251 stored at those storage elements 250 to create a consolidated database 251. The display application 260 can be coupled to the consolidated database 251 instead of or as well as the individual databases 251, and can operate to display information in the consolidated database 251 instead of or as well as the individual databases 251.
[0034] Types of Display Applications
[0035] The display application 260 provides information to the operator gleaned from the database 251, such as the following:
[0036] The display application 260 can record accounting information, which can be used to charge users of the network 100 for their use. For example, users can be charged for network usage in response to total number of bytes, total number of packets, average transmission bandwidth, or peak transmission bandwidth.
[0037] Although individual message flows 160 are not identified with regard to particular users, individual message flows 160 can be identified with regard to particular source devices 120, which can in many cases be in turn identified with regard to particular users.
[0038] The display application 260 can record events deemed “interesting,” such as attempts to violate access control lists, other security rules, or other administrative policies; initiation or use of particular protocols; or initiation of each message flow 160. For some applications it can be desirable to record initiation of every message flow 160. For relatively short message flows 160, the display application 260 can record the entire actual message flow 160 itself.
[0039] Although it might be difficult to determine for an individual message flow 160 whether or not that message flow 160 violates one or more administrative policies, it is possible to record particular information about each individual message flow 160 and to provide a secondary display application with that information so as to determine if any administrative policy has been violated.
[0040] The display application 260 can show state information about the network 100, including the frequency of packets, number of bytes, number of packets, and average size of packets transmitted on particular communication links 110. The display application 260 can distinguish this information by protocol type, by ultimate destination (such as whether the packets transmitted on a communication link 110 are destined for a destination device 130 coupled to that communication link 110, or are instead destined for a destination device 130 coupled to a different communication link 110 (by way of a routing device 140 coupled to that communication link 110).
[0041] State information about the network 100 can be used to determine whether particular communication links 110 are congested, are heavily used, are lightly used, or are even inoperative. Network administrators can use this information to determine which communication links 110 require maintenance and how often, and can use this information for capacity planning for the network 100.
[0042] Router Use of Exported Flow Data
[0043] The display application 260 is also coupled to the routing device 140 so as to provide the display results to the routing device 140 for altering, augmenting, or modifying the operation of the routing device 140. Thus, the display application 260 provides information to the routing device 140 for use in routing packets 150, such as the following:
[0044] The routing device 140 can use information from the display application 260 to attempt to balance transmission of packets 150 in the network 100 to avoid overloading busy communication links 110 or routing devices 140. Balancing transmission of packets 150 can be directed to raw measures of traffic throughput, such as total number of bytes, total number of packets, average transmission bandwidth, or peak transmission bandwidth, or can be directed to administrative policy modifications of those raw measures, such as assigning a dollar cost to particular resources or resource measures.
[0045] Naturally the router 140 can also use information from the display application 260 in conjunction with information available to the router 140 from the routing protocol it uses (such as IGRP or EIGRP).
[0046] The routing device 140 can use information from the display application 260 to attempt to balance transmission of packets 150 in the network 100 to achieve fairness among a plurality of users of the network 100. As with balancing transmission of packets 150, fairness among a plurality of users can be directed to raw measures of traffic throughput, such as total number of bytes, total number of packets, average transmission bandwidth, or peak transmission bandwidth, or can be directed to administrative policy modifications of those raw measures, such as assigning a dollar cost to particular resources or resource measures.
[0047] The measure of “fairness” to individual users can be adjusted to account for other administrative policies, such as adjusting pricing measures at different times of day, adjusting pricing measures in response to relative loading, granting greater access or preferential access to particular users or preferred classes of users, or granting greater access or preferential access to particular message flows 160 or preferred classes of message flows 160. For example, internet telephony could be granted preferential access on the grounds that it is a real time application; alternatively, internet telephony could have its access reduced in priority on the grounds that it generates excessive traffic.
[0048] The routing device 140 can use information from the display application 260 to achieve particular measures of quality of service or to prioritize different types of traffic, in response to relative loading of particular types of message flows 160.
[0049] For a first example, the routing device 140 can limit particular users to no more network bandwidth than paid for. For a second example, the routing device 140 can assign relative priorities to particular protocols used in message flows 160 in response to the amount of network bandwidth actually being used for those particular protocols.
[0050] The routing device 140 can use information from the display application 260 to enforce particular administrative rules for limiting network traffic or routing.
[0051] For a first example, the routing device 140 can limit use of particular protocols to no more than a selected fraction of network bandwidth (such as a limit of 10% of network bandwidth for HTTP transfers). For a second example, the routing device 140 can limit use of network bandwidth to particular destination devices 130 or can limit use of particular protocols within selected time period.
[0052] Naturally, the number of possible administrative policies is limited only by the imagination of administrators, so long as those administrative policies are responsive to information which can be collected and reported by the display application 260.
[0053] Breadth of Flow Data Export Concept
[0054] 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 bidirectional 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 flow itself.
[0055] Alternative Embodiments
[0056] 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
We claim:
1. A method for exporting data responsive to patterns of message flows passing through a routing device of a network, said method including the steps of:
receiving a plurality of packetized message flows defined by transport protocol fields and each comprising a plurality of sets of packets for a particular TCP or UDP transport connection traveling in a single direction on the network;
collecting history information regarding the plurality of message flows at the routing device;
filtering the message flows to result in selecting at least one subset of said message flows, wherein all message flows in the subset of message flows satisfy a selected criterion;
aggregating the sub-plurality of message flows by creating and storing at least one set of aggregated message flow information that represents the subset of message flows in a database of a storage element for use by one or more external application programs; and
tracing said history information to identify a source or a destination device for said subset of message flows.
2. A method as recited in claim 1, further comprising the steps of:
automatically displaying through a display application program, based on the aggregated message flow information, accounting information pertaining to network usage for use in charging users of the network for their use.
3. A method as recited in claim 1, further comprising the steps of:
automatically displaying through a network management application program, based on the aggregated message flow information, event information that identifies an attempt to violate a security policy as determined according to one or more administrative policies.
4. A system for exporting data responsive to message flow patterns, said system including
means for receiving a message flow defined by transport protocol fields as a set of packets for a particular TCP or UDP transport connection traveling in a single direction on a network;
means for collecting, from a router on the network, history information regarding a plurality of message flows, and for receiving a plurality of flow data packets of the message flows that are generated by the router;
a filter coupled to said flow data packets that filters the message flows to result in selecting at least one subset of said message flows, wherein all message flows in the subset of message flows satisfy a selected criterion;
an aggregator coupled to the filter and that aggregates the sub-plurality of message flows by creating and storing at least one set of aggregated message flow information that represents the sub-plurality of message flows in a database of a storage element for use by one or more external application programs; and
means for tracing said history information to identify a source or a destination device for said selected message flow.
5. A system as recited in claim 4, further comprising means for communicating the stored aggregated message flow information to an application program for use in modifying a performance parameter of the router that improves performance of the router based on the aggregated message flow information.
6. A method for improving performance of a routing device in a network responsive to message flow patterns of messages passing through the routing device, said method including the steps of:
receiving a plurality of message flows represented by transport protocol fields and each comprising a plurality of sets of packets for a particular TCP or UDP transport connection traveling in a single direction on the network;
filtering the message flows to result in selecting at least one subset of said message flows, wherein all message flows in the subset of message flows satisfy a selected criterion;
aggregating the sub-plurality of message flows by creating and storing at least one set of aggregated message flow information that represents the sub-plurality of message flows and occupies less storage than the sub-plurality of message flows in a database of a storage element for use by one or more external application programs; and
communicating the stored aggregated message flow information to the routing device for use in modifying a parameter value of the routing device that results in improving performance of the routing device.
7. A method as recited in claim 6, wherein the step of communicating the stored aggregated message flow information to the routing device comprises the step of communicating the stored aggregated message flow information to the routing device for use in modifying a parameter value of the routing device that results in achieving fairness among a plurality of devices that communicate packets in the network with respect to an administrative policy selected from among: pricing according to time of day; pricing according to relative loading; granting greater or preferential access to particular users or preferred classes of users; or granting greater access or preferential access to particular message flows or classes of message flows.
8. A method as recited in claim 6, wherein the step of communicating the stored aggregated message flow information to the routing device comprises the step of communicating the stored aggregated message flow information to the routing device for use in modifying a parameter value of the routing device that results in achieving a particular quality of service treatment of the message flows.
9. A method as recited in claim 6, wherein the step of communicating the stored aggregated message flow information to the routing device comprises the step of communicating the stored aggregated message flow information to the routing device for use in modifying a parameter value of the routing device that results in prioritizing different types of message traffic, in response to relative loading of particular types of message flows on a communication link that is coupled to the routing device.
10. A method as recited in claim 6, wherein the step of communicating the stored aggregated message flow information to the routing device comprises the step of communicating the stored aggregated message flow information to the routing device for use in modifying a parameter value of the routing device that results in prioritizing different types of message traffic, in response to relative loading of particular protocols used in the message flows in response to an amount of network bandwidth actually being used for the protocols on a communication link that is coupled to the routing device.
11. A method as recited in claim 6, wherein the step of communicating the stored aggregated message flow information to the routing device comprises the step of communicating the stored aggregated message flow information to the routing device for use in modifying a parameter value of the routing device that results in limiting use of a particular protocol to no more than a selected fraction of network bandwidth for that protocol.
12. A computer-readable medium carrying one or more instructions for exporting data responsive to patterns of message flows passing through a routing device, which instructions, when executed by one or more processors, cause the one or more processors to carry out the steps of:
receiving a plurality of packetized message flows defined by transport protocol fields and each comprising a plurality of sets of packets for a particular TCP or UDP transport connection traveling in a single direction on the network;
collecting history information regarding the plurality of message flows at the routing device;
filtering the message flows to result in selecting at least one subset of said message flows, wherein all message flows in the subset of message flows satisfy a selected criterion;
aggregating the sub-plurality of message flows by creating and storing at least one set of aggregated message flow information that represents the sub-plurality of message flows in a database of a storage element for use by one or more external application programs; and
tracing said history information to identify a source or a destination device for said selected message flow.
13. A computer-readable medium carrying one or more instructions for improving performance of a routing device in a network responsive to patterns of message flows passing through the routing device, which instructions, when executed by one or more processors, cause the one or more processors to carry out the steps of:
receiving a plurality of message flows represented by transport protocol fields and each comprising a plurality of sets of packets for a particular TCP or UDP transport connection traveling in a single direction on the network;
filtering the message flows to result in selecting at least one subset of said message flows, wherein all message flows in the subset of message flows satisfy a selected criterion;
aggregating the sub-plurality of message flows by creating and storing at least one set of aggregated message flow information that represents the sub-plurality of message flows and occupies less storage than the sub-plurality of message flows in a database of a storage element for use by one or more external application programs; and
communicating the stored aggregated message flow information to the routing device for use in modifying a parameter value of the routing device that results in improving performance of the routing device.
14. A method for exporting data representing one or more message flows that pass through a routing device of a network, said method including the steps of:
receiving a plurality of packetized message flows defined by transport protocol fields, each of the flows comprising a plurality of sets of packets for a particular TCP or UDP transport connection traveling in a single direction on the network;
filtering the message flows using a first filter to result in selecting a first subset of said message flows, wherein all packets selected by the first filter for the first subset of message flows have the same originating domain value;
filtering the first subset of message flows using a second filter to result in selecting a second subset of said message flows, wherein all packets selected by the second filter for the second subset of message flows have the same protocol value;
aggregating the second subset of message flows by creating and storing first aggregated message flow information that represents the second subset of message flows in a database of a first storage element;
receiving the first aggregated message flow information from the first storage element at a display application program that computes one or more charges to one or more users of the network based on the first aggregated message flow information.
15. A method as recited in claim 14, further comprising the steps of:
filtering the first subset of message flows using a third filter to result in selecting a third subset of said message flows, wherein all packets selected by the third filter for the third subset of message flows satisfy a criterion other than those used by the first filter and second filter;
aggregating the third subset of message flows by creating and storing second aggregated message flow information that represents the third subset of message flows in a second storage element;
consolidating the first aggregated message flow information and the second aggregated message flow information in a consolidated database;
receiving consolidated message flow information from the consolidated database;
computing one or more charges to one or more users of the network based on the consolidated message flow information.
16. A network data flow export system configured to export data representing one or more message flows that pass through a routing device of a network, the system comprising:
a first filter that receives a plurality of packetized message flows defined by transport protocol fields, each of the flows comprising a plurality of sets of packets for a particular TCP or UDP transport connection traveling in a single direction on the network and that filters the message flows to result in selecting a first subset of said message flows, wherein all packets selected by the first filter for the first subset of message flows have the same originating domain value;
a second filter that filters the first subset of message flows to result in selecting a second subset of said message flows, wherein all packets selected by the second filter for the second subset of message flows have the same protocol value;
a first aggregator that aggregates the second subset of message flows by creating and storing first aggregated message flow information that represents the second subset of message flows in a database of a first storage element;
means for communicating the first aggregated message flow information from the first storage element to a display application program that computes one or more charges to one or more users of the network based on the first aggregated message flow information.
17. An apparatus as recited in claim 16, further comprising:
a third filter that filters the first subset of message flows to result in selecting a third subset of said message flows, wherein all packets selected by the third filter for the third subset of message flows satisfy a criterion other than those used by the first filter and second filter;
a second aggregator that aggregates the third subset of message flows by creating and storing second aggregated message flow information that represents the third subset of message flows in a database of a second storage element;
a consolidator that consolidates the first aggregated message flow information and the second aggregated message flow information in a consolidated database;
means for communicating the consolidated message flow information from the consolidated database to a display application program that computes one or more charges to one or more users of the network based on the consolidated message flow information.
Patent Citations (177)
| Patent | Date | Inventor | Cited By |
|---|---|---|---|
| USRe.33900 | 1992-04-01 | Howson | Applicant |
| US4131767 | 1978-12-01 | Weinstein | Applicant |
| US4161719 | 1979-07-01 | Parikh et al. | Applicant |
| US4316284 | 1982-02-01 | Howson | Applicant |
| US4397020 | 1983-08-01 | Howson | Applicant |
| US4419728 | 1983-12-01 | Larson | Applicant |
| US4424565 | 1984-01-01 | Larson | Applicant |
| US4437087 | 1984-03-01 | Petr | Applicant |
| US4438511 | 1984-03-01 | Baran | Applicant |
| US4439763 | 1984-03-01 | Limb | Applicant |
| US4445213 | 1984-04-01 | Baugh et al. | Applicant |
| US4446555 | 1984-05-01 | Devault et al. | Applicant |
| US4456957 | 1984-06-01 | Schieltz | Applicant |
| US4464658 | 1984-08-01 | Thelen | Applicant |
| US4499576 | 1985-02-01 | Fraser | Applicant |
| US4506358 | 1985-03-01 | Montgomery | Applicant |
| US4507760 | 1985-03-01 | Fraser | Applicant |
| US4532626 | 1985-07-01 | Flores et al. | Applicant |
| US4644532 | 1987-02-01 | George et al. | Applicant |
| US4646287 | 1987-02-01 | Larson et al. | Applicant |
| US4677423 | 1987-06-01 | Benvenuto et al. | Applicant |
| US4679189 | 1987-07-01 | Olson et al. | Applicant |
| US4679227 | 1987-07-01 | Hughes-Hartogs | Applicant |
| US4723267 | 1988-02-01 | Jones et al. | Applicant |
| US4731816 | 1988-03-01 | Hughes-Hartogs | Applicant |
| US4750136 | 1988-06-01 | Arpin et al. | Applicant |
| US4757495 | 1988-07-01 | Decker et al. | Applicant |
| US4763191 | 1988-08-01 | Gordon et al. | Applicant |
| US4769810 | 1988-09-01 | Eckberg, Jr. et al. | Applicant |
| US4769811 | 1988-09-01 | Eckberg, Jr. et al. | Applicant |
| US4771425 | 1988-09-01 | Baran et al. | Applicant |
| US4819228 | 1989-04-01 | Baran et al. | Applicant |
| US4827411 | 1989-05-01 | Arrowood et al. | Applicant |
| US4833706 | 1989-05-01 | Hughes-Hartogs | Applicant |
| US4835737 | 1989-05-01 | Herrig et al. | Applicant |
| US4879551 | 1989-11-01 | Georgiou et al. | Applicant |
| US4893306 | 1990-01-01 | Chao et al. | Applicant |
| US4903261 | 1990-02-01 | Baran et al. | Applicant |
| US4922486 | 1990-05-01 | Lidinsky et al. | Applicant |
| US4933937 | 1990-06-01 | Konishi | Applicant |
| US4960310 | 1990-10-01 | Cushing | Applicant |
| US4962497 | 1990-10-01 | Ferenc et al. | Applicant |
| US4962532 | 1990-10-01 | Kasiraj et al. | Applicant |
| US4965772 | 1990-10-01 | Daniel et al. | Applicant |
| US4970678 | 1990-11-01 | Sladowski et al. | Applicant |
| US4980897 | 1990-12-01 | Decker et al. | Applicant |
| US4991169 | 1991-02-01 | Davis et al. | Applicant |
| US5003595 | 1991-03-01 | Collins et al. | Applicant |
| US5014265 | 1991-05-01 | Hahne et al. | Applicant |
| US5020058 | 1991-05-01 | Holden et al. | Applicant |
| US5033076 | 1991-07-01 | Jones et al. | Applicant |
| US5054034 | 1991-10-01 | Hughes-Hartogs | Applicant |
| US5059925 | 1991-10-01 | Weisbloom | Applicant |
| US5072449 | 1991-12-01 | Enns et al. | Applicant |
| US5088032 | 1992-02-01 | Bosack | Applicant |
| US5095480 | 1992-03-01 | Fenner | Applicant |
| US5115431 | 1992-05-01 | Williams et al. | Applicant |
| US5128945 | 1992-07-01 | Enns et al. | Applicant |
| US5136580 | 1992-08-01 | Braff et al. | Applicant |
| US5199049 | 1993-03-01 | Wilson | Applicant |
| US5206886 | 1993-04-01 | Bingham | Applicant |
| US5208811 | 1993-05-01 | Kashio et al. | Applicant |
| US5212686 | 1993-05-01 | Joy et al. | Applicant |
| US5224099 | 1993-06-01 | Corbalis et al. | Applicant |
| US5226120 | 1993-07-01 | Brown et al. | Applicant |
| US5228062 | 1993-07-01 | Bingham | Applicant |
| US5229994 | 1993-07-01 | Balzano et al. | Applicant |
| US5237564 | 1993-08-01 | Lespagnol et al. | Applicant |
| US5241682 | 1993-08-01 | Bryant et al. | Applicant |
| US5243342 | 1993-09-01 | Kattemalalavadi et al. | Applicant |
| US5243596 | 1993-09-01 | Port et al. | Applicant |
| US5247516 | 1993-09-01 | Bernstein et al. | Applicant |
| US5249178 | 1993-09-01 | Kurano et al. | Applicant |
| US5249292 | 1993-09-01 | Chiappa | Examiner |
| US5255291 | 1993-10-01 | Holden et al. | Applicant |
| US5260933 | 1993-11-01 | Rouse | Applicant |
| US5260978 | 1993-11-01 | Fleischer et al. | Applicant |
| US5268592 | 1993-12-01 | Bellamy et al. | Applicant |
| US5274631 | 1993-12-01 | Bhardwaj | Applicant |
| US5274635 | 1993-12-01 | Rahman et al. | Applicant |
| US5274643 | 1993-12-01 | Fisk | Applicant |
| US5280470 | 1994-01-01 | Buhrke et al. | Applicant |
| US5280480 | 1994-01-01 | Pitt et al. | Applicant |
| US5280500 | 1994-01-01 | Mazzola et al. | Applicant |
| US5283783 | 1994-02-01 | Nguyen et al. | Applicant |
| US5287103 | 1994-02-01 | Kasprzyk t al. | Applicant |
| US5287453 | 1994-02-01 | Roberts | Applicant |
| US5291482 | 1994-03-01 | McHarg et al. | Applicant |
| US5305311 | 1994-04-01 | Lyles | Applicant |
| US5307343 | 1994-04-01 | Bostica et al. | Applicant |
| US5311509 | 1994-05-01 | Heddes et al. | Applicant |
| US5313454 | 1994-05-01 | Bustini et al. | Applicant |
| US5313582 | 1994-05-01 | Hendel et al. | Applicant |
| US5317562 | 1994-05-01 | Nardin et al. | Applicant |
| US5319644 | 1994-06-01 | Liang | Applicant |
| US5327421 | 1994-07-01 | Hiller et al. | Applicant |
| US5331637 | 1994-07-01 | Francis et al. | Applicant |
| US5345445 | 1994-09-01 | Hiller et al. | Applicant |
| US5345446 | 1994-09-01 | Hiller et al. | Applicant |
| US5359592 | 1994-10-01 | Corbalis et al. | Applicant |
| US5361250 | 1994-11-01 | Nguyen et al. | Applicant |
| US5361256 | 1994-11-01 | Doeringer et al. | Applicant |
| US5361259 | 1994-11-01 | Hunt et al. | Applicant |
| US5365524 | 1994-11-01 | Hiller et al. | Applicant |
| US5367517 | 1994-11-01 | Cidon et al. | Applicant |
| US5371852 | 1994-12-01 | Attanasio et al. | Applicant |
| US5386567 | 1995-01-01 | Lien et al. | Applicant |
| US5390170 | 1995-02-01 | Sawant et al. | Applicant |
| US5390175 | 1995-02-01 | Hiller et al. | Applicant |
| US5394394 | 1995-02-01 | Crowther et al. | Applicant |
| US5394402 | 1995-02-01 | Ross | Applicant |
| US5400325 | 1995-03-01 | Chatwani et al. | Applicant |
| US5408469 | 1995-04-01 | Opher et al. | Applicant |
| US5416842 | 1995-05-01 | Aziz | Applicant |
| US5422880 | 1995-06-01 | Heitkamp et al. | Applicant |
| US5422882 | 1995-06-01 | Hiller et al. | Applicant |
| US5423002 | 1995-06-01 | Hart | Applicant |
| US5426636 | 1995-06-01 | Hiller et al. | Applicant |
| US5428607 | 1995-06-01 | Hiller et al. | Applicant |
| US5430715 | 1995-07-01 | Corbalis et al. | Applicant |
| US5430729 | 1995-07-01 | Rahnema | Applicant |
| US5442457 | 1995-08-01 | Najafi | Applicant |
| US5442630 | 1995-08-01 | Gagliardi et al. | Applicant |
| US5452297 | 1995-09-01 | Hiller et al. | Applicant |
| US5473599 | 1995-12-01 | Li et al. | Applicant |
| US5473607 | 1995-12-01 | Hausman et al. | Applicant |
| US5477541 | 1995-12-01 | White et al. | Applicant |
| US5485455 | 1996-01-01 | Dobbins et al. | Applicant |
| US5490140 | 1996-02-01 | Abensour et al. | Applicant |
| US5490258 | 1996-02-01 | Fenner | Applicant |
| US5491687 | 1996-02-01 | Christensen et al. | Applicant |
| US5491804 | 1996-02-01 | Heath et al. | Applicant |
| US5509006 | 1996-04-01 | Wilford et al. | Applicant |
| US5519704 | 1996-05-01 | Farinacci et al. | Applicant |
| US5526489 | 1996-06-01 | Nilakantan et al. | Applicant |
| US5530963 | 1996-06-01 | Moore et al. | Applicant |
| US5535195 | 1996-07-01 | Lee | Applicant |
| US5539734 | 1996-07-01 | Burwell et al. | Applicant |
| US5541911 | 1996-07-01 | Nilakantan et al. | Examiner |
| US5546370 | 1996-08-01 | Ishikawa | Applicant |
| US5555244 | 1996-09-01 | Gupta et al. | Applicant |
| US5561669 | 1996-10-01 | Lenney et al. | Applicant |
| US5583862 | 1996-12-01 | Callon | Applicant |
| US5592470 | 1997-01-01 | Rudrapatna et al. | Applicant |
| US5598581 | 1997-01-01 | Daines et al. | Applicant |
| US5600798 | 1997-02-01 | Cherukuri et al. | Applicant |
| US5604868 | 1997-02-01 | Komine et al. | Applicant |
| US5617417 | 1997-04-01 | Sathe et al. | Applicant |
| US5617421 | 1997-04-01 | Chin et al. | Applicant |
| US5621720 | 1997-04-01 | Bronte et al. | Examiner |
| US5630125 | 1997-05-01 | Zellweger | Applicant |
| US5631908 | 1997-05-01 | Saxe | Applicant |
| US5632021 | 1997-05-01 | Jennings et al. | Applicant |
| US5634010 | 1997-05-01 | Ciscon et al. | Applicant |
| US5644718 | 1997-07-01 | Belove et al. | Applicant |
| US5666353 | 1997-09-01 | Klausmeier et al. | Applicant |
| US5673265 | 1997-09-01 | Gupta et al. | Applicant |
| US5678006 | 1997-10-01 | Valizadeh et al. | Applicant |
| US5680116 | 1997-10-01 | Hashimoto et al. | Applicant |
| US5684797 | 1997-11-01 | Aznar et al. | Applicant |
| US5687324 | 1997-11-01 | Green et al. | Applicant |
| US5689506 | 1997-11-01 | Chiussi et al. | Applicant |
| US5691984 | 1997-11-01 | Gardner et al. | Examiner |
| US5724351 | 1998-03-01 | Chao et al. | Applicant |
| US5742760 | 1998-04-01 | Picazo, Jr. et al. | Examiner |
| US5748186 | 1998-05-01 | Raman | Applicant |
| US5754547 | 1998-05-01 | Nakazawa | Applicant |
| US5802054 | 1998-09-01 | Bellenger et al. | Examiner |
| US5835710 | 1998-11-01 | Nagami et al. | Applicant |
| US5854903 | 1998-12-01 | Morrison et al. | Applicant |
| US5856981 | 1999-01-01 | Voelker | Applicant |
| US5898686 | 1999-04-01 | Virgile | Applicant |
| US5903559 | 1999-05-01 | Acharya et al. | Examiner |
| US6091725 | 2000-07-01 | Cheriton et al. | Examiner |
| EP384758 | 1990-02-01 | Applicant | |
| EP431751A1 | 1990-11-01 | Applicant | |
| WO95/20850 | 1995-08-01 | Applicant |
Non-Patent Literature (8)
- Girish et al., Trading Packet Headers for Packet Processing, IEEE, 1996, pp. 141-152.Applicant
- Newman et al., “Flow Labelled IP: A Connectionless Approach to ATM,” IEEE, 1996, pp. 1251-1260.Applicant
- Stallings, William, “Data and Computer Communications”, pp. 329-333, Prentice Hall, Upper Saddle River, New Jersey.Applicant
- Chowdhury, et al., “Alternative Banddwidth Allocation Algorithms for Packet Video in ATM Networks”, 1992, IEEE Infocom 92, pp. 1061-1068.Applicant
- Zhang, et al., “Rate-Controlled Static-Priority Queueing”, 1993, IEEE, pp. 227-236.Applicant
- Doeringer, et al., “Routing on Longest-Matching Prefixes”, IEEE ACM Transactions on Networking, Feb. 1, 1996, vol. 4, No. 1, pp. 86-97.Applicant
- IBM, “Method and Apparatus for the Statistical Multiplexing of Voice, Data, and Image Signals”, Nov., 1992, IBM Technical Data Bulletin n6 11-92, pp. 409-411.Applicant
- Esaki, et al., “Datagram Delivery in an ATM-Internet,” IEICE Transactions on Communications vol. E77-B, No. 3, (1994) Mar., Tokyo, Japan.Applicant