Automatic provisioning of new users of interest for capture on a communication network

Description

FIELD OF TECHNOLOGY

This disclosure relates generally to the technical fields of network communication, and in one example embodiment, this disclosure relates to a method, apparatus and system of collection of data on a network.

BACKGROUND

An analyst may want to monitor a set of users or a set of online identities associated with the set of users to observe their behavior online. The analyst may already be monitoring a set of known users of the communication network. The analyst may have previously identified a set of known users based on a set of identifier characteristics. The analyst may also be interested in locating other new users or new online identities of interest based on a set of desired identifier characteristic. The analyst may be interested in finding other users based on a set of desired characteristics or a type of project he may be working on. The analyst may be interested in understanding and studying a whole set of online behavior associated with the user or online identity associated with a person of interest. The analyst may want to study a set of communication and transaction data created and exchanged between a known user of interest of the communication network and a new user of interest. The analyst may want to collect a set of data belonging to the user of interest and/or a new user of interest to study a particular pattern in behavior. The analyst may also want to understand a set of interactions between the user of interest and a user not currently of interest or a new user of interest. Similarly, the analyst may seek content and metadata communicated between users on a wide variety of communication systems and formats. This information can be useful for determining commercial, investment, and personal information and relationships between the users or online identities and persons at large.

A network monitoring system may be required to monitor a set of activity between users and/or online identities associated with a set of persons. Some users of a communication system may be easily identifiable. However, other users of a communication system may be of interest, but may not yet be identified or provisioned easily. These users and/or online identities may be difficult to locate, and analysts may have a difficult time finding links between existing online identities and other potential online identities manually. Finding links between known users and new users or online identities related to the known user users may be time-consuming and inefficient task. In addition to being cumbersome and inefficient, it may also be financially expensive to identify new users of interest manually.

SUMMARY

A method and system for collecting data streams, such as data packets, on a network, such as the Internet, is disclosed.

In one or more embodiments, a network monitoring system may include a metadata processing device operative to receive a metadata portion of a data stream from a user not currently of interest in a network. The metadata processing device may also evaluate the metadata portion of the data stream, in one or more embodiments. In one or more embodiments, metadata processing device may also be operative to create a relationship between the metadata portion of the data stream of the user not currently of interest and any data of a known user of interest.

The application also discloses a method of monitoring data that may also include receiving at a metadata processing device, a metadata portion of a data stream from a user not currently of interest in a network. The method also includes evaluating the metadata portion of the data stream. The method also includes creating a relationship between the metadata portion of the data stream of the user not currently of interest and any data of a known user of interest.

The application also discloses a network monitoring system comprising an access device for retrieving data from a network and a metadata processing engine coupled to the access device, wherein the metadata processing engine determines a new user of interest using metadata from a user not currently of interest of the network. The metadata processing engine may further be operative to retrieve the data to be monitored from the network, to evaluate the data retrieved from the network, to create a new user of interest of the network based on the evaluating of the data retrieved from the network, to communication an ID for the new user of interest to the access device and to monitor the network for data related to the user of interest.

The application finally also discloses a method of provisioning a new user to be monitoring in a network, the method comprising retrieving data to be monitored from the network, evaluating the data retrieved from the network, creating a new user of interest on the network based on the evaluating of the data retrieved from the network, communicating an ID for the new user of interest to the access device and monitoring the network for data related to the new user of interest

The methods, systems, and apparatuses disclosed herein may be implemented in any means for achieving various aspects, and may be executed in a form of a machine-readable medium embodying a set of instructions that, when executed by a machine, cause the machine to perform any of the operations disclosed herein. Other features will be apparent from the accompanying drawings and from the detailed description that follows.

BRIEF DESCRIPTION OF THE VIEW OF DRAWINGS

Example embodiments are illustrated by way of example and not limitation in the figures of the accompanying drawings, in which like references indicate similar elements and in which:

FIG. 1 is a functional block diagram of a network monitoring system, according to one or more embodiments.

FIG. 2 is an architecture layout of the network monitoring system as applied to a plurality of networks, according to one or more embodiments.

FIG. 3 is a block diagram of an access device+mass metadata server+storage buffer engine of the network security system, for collecting data on a network, according to one or more embodiments.

FIG. 4 is a block diagram of a metadata and advanced targeting engine portion of the network security system for evaluating a metadata portion of the network traffic, according to one or more embodiments.

FIG. 5 is a block diagram of a data mediation engine portion of the network monitoring system for provisioning new users of interest and/or online identities of interest according to one or more embodiments.

FIG. 6 is a block diagram of a collection and analysis engine portion of the network monitoring system for analyzing and presenting collected data to the analyst, according to one or more embodiments.

FIG. 7A is a case table illustrating data entry to data mediation engine and access function, showing several different possible combinations of identifier scenarios for known users of interest and users not currently of interest communicating on a network, according to one or more embodiments.

FIG. 7B is a case table illustrates functions of access and mediation, mass metadata processing, and circular buffer functions of data collected from known users of interest and users currently not of interest communicating on a network, according to one or more embodiments.

FIG. 7C is a case table illustrating collection and analysis of data provided by the network monitoring system for GUI display, according to one or more embodiments.

FIG. 8A is a flowchart of a method for collecting data streams on a network, according to one or more embodiments.

FIG. 8B is a flowchart, continued from FIG. 8A, of a method of mediating the collected data, according to one or more embodiments.

FIG. 8C is a flowchart, continued from FIG. 8A, of a method of mass metadata extraction and analysis, according to one or more embodiments.

FIG. 8D is a flowchart, continued from FIG. 8A, of a method of storing and retrieving data on a circular buffer, according to one or more embodiments.

FIG. 8E is a flowchart, continued from FIG. 8B, 8C, or 8D, of a method of collecting and analyzing collected and processed data, according to one or more embodiments.

FIG. 9 is an illustration of partitioned memory for storing content, metadata, and analysis information for known users of interest and users not currently of interest, according to one or more embodiments.

Other features of the present embodiments will be apparent from the accompanying drawings and from the detailed description that follows.

DETAILED DESCRIPTION

A method, apparatus and system of a hierarchy of a structure of a volume is disclosed. In the following description, for the purposes of explanation, numerous specific details are set forth in order to provide a thorough understanding of the various embodiments. It will be evident, however to one skilled in the art that various embodiments may be practiced without these specific details.

The analyst may be interested in identifying a set of new users of interest communicating through a communication network or any network based on what the analyst is looking to monitor. These new users of interest may not be identifiable because their existence is unknown, or their relationship to a known user or other users of the network is not currently known. The analyst may use a network monitoring system to monitor a set of known users of interest and to identify new users of interest. The network monitoring systems and architecture may utilize hardware and software solutions that may be segregated into three primary functional groups, or stages, called: access, mediation, and collection.

The term ‘access’ refers to the function of literally accessing data from a network. Thereafter, the data is similarly communicated to mediation equipment.

Typically, communications associated with known users of interest interacting on a network are sought by analysts who are monitoring a particular system. A known user of interest may refer to a specific person, online entity or any entity communicating on a specific medium and format. For example, an analyst may monitor a particular online identity xyz@gmail.com who might be communicating via email on the Internet at any time during the day. The analyst may be interested in collecting a set of information and data associated with a set of communications between the online identity xyz@ gmail.com and all correspondences of the online identity, in one example.

Mediation may refer to the hardware and software solutions that provide the function of literally ‘mediating’ between the analyst and the system itself with its access function and collection function of data.

The collection function may refer to the hardware and software solutions that further organize, analyze, and provide the data to the analyst and the solutions that may interact with the analyst typically via a graphical user interface (GUI), to locate and identify meaningful data. The type of data may be a set of communication and transaction data associated with a user and/or online identity. The set of data may further be broken down to: content and metadata.

The set of communication and transaction data may consist of a metadata (e.g. IP address, email address, cyber-address recipient address, sender address, time of the email, time of the mail, information on a post card, etc.). The metadata may be an information about the data in one or more embodiments. The metadata may encompass a time and place that the data was received. The metadata also encompass a set of information related to the senders and receivers of the information, a time of a communication event, or where an information was collected from. For example, if an email is sent to the POI, the metadata may consist of the sender and recipient addresses of the email, an IP address and a time of the email among others. In one or more embodiments, the metadata may also be a cyber-name, a cyber-address, contact list, an analyst login information, a chat IP address, a chat alias, a VOIP address, a web forum login, a website login, a social network login, a sender and/or receiver of a chat, a time of a chat conversation, a file name sent in a chat or an email or any other cyber-communication, a number of files transferred in the cyber communication, a type of chat text, a name of an audio and/or video attachment sent in the cyber communication, a number of parties involved in a communication, a buddy list, an avatar description associated with the cyber communication. The metadata may also be associated with voice and/or voice over IP communications. The metadata may also be associated with social networking sites, and may include an analyst name, a time of a social networking communication or publication, a size of a social networking communication, a number of followers and others. The metadata may also include telephone numbers, phone numbers, IMSI information and/or IMEI information.

The set of data may also consist of a content. The content may be the substantive part of the data collected. The data may consist of the actual text of the email, attachments in the email and what the information actually says. Similarly, the content may include the substantive portion of a record. In addition to the text of the communication, or a transcript of a recorded conversation, it may also include a text of an email attachment, a transferred file, a content of an uploaded or downloaded document/video or any other file, a pooled information between many users of a network, a substance of social network communication, a tweet, a message exchanged between two parties, a substance of a text message, and any other communication.

Function Block Diagram

Referring now to FIG. 1, a functional block diagram 100 of a network monitoring system (NMS) is shown, according to one or more embodiments. The functions shown herein represent a high-level overview of the functionality of the NMS to be implemented in hardware, software and methods that are described in subsequent figures. A starting function is known user receiving block 110-A and optional known user receiving block 110-B which act as an interface to receive known user data from an analyst, either manually or electronically, which is then passed to a known user mediating function block 112 for mediating the known user of interest based on predetermined criteria for identification of users on the network as well as for resource allocation. The present disclosure provides for one NMS to receive known user inputs from a plurality of analysts, e.g., via known user input blocks 110-A and optional 110-B; hence it is referred to as multi-tenant capable. Once approved, known user information, shown as a solid line, is passed to functional block 114 for provisioning an accessing function 116 to the appropriate networks, e.g., Network NW1103 and NW5105, which would then actually access and collect data from the appropriate networks to be monitored. The present disclosure provides for one NMS to access a plurality of networks with a single NMS system; hence it is referred to as multi-network capable.

Portions of data collected from the network by access functional block 116 are communicated parallely on multiple paths to first, second, and third paths, or any combination thereof, then serially communicated down each multipath for subsequent processing and analysis. In particular, a first data path, or first path, couples accessing function 116 to collecting function 130 that collects metadata and/or authorized or desired content, of data streams collected from the network for known users of interest (shown as solid lines) and for new users of interest, (shown as dashed lines) and for optionally storing data. In one or more embodiments, a new user of interest may be a user of the network who was previously not of interest to the analyst, but may be of interest to the analyst based on criteria determined by the system. In one or more embodiments, the system may auto provision these new users of interest indicating to the analyst that his new user of interest warrants his attention. This collected data is communicated to: mediation block 112 for subsequent processing such as assembling data streams into communications, such that packets of fragmented data can be reconstructed into more meaningful and readable messages, and for temporarily storing them prior to communicating them to collecting and analyzing functional block 150; and subsequently displaying data and relationships to GUI functions 152-A and optional 152-B, for interacting by one or more analysts.

A second data path includes an collecting function 120 coupled to accessing function 116 that receives metadata, but essentially no content data, from any quantity of users of the network, including an option to collect and communicate metadata to a metadata mediating function 122 from either every available data stream of a single user on the network to every available user on the network, e.g., mass metadata, or any quantity of users or population definition of users in between. Mediating the metadata includes: primarily extracting the metadata portion of the data stream and discarding the balance of the data stream; establishing possible relationships between the communicated data; temporarily storing this data therein; delivering the metadata to other engines; and receiving feedback of known user data, e.g., from known user mediating function 112. After mediating the data, the relationship information and metadata itself is communicated to the advanced targeting function 124 which identifies a new user of interest to be monitored on the network, and communicates it, as indicated by the dashed lines, to the mediation function 112 to then be provisioned per provisioning function 114 on accessing network function 116.

The new user of interest and metadata analysis information can also pass to collecting and analyzing function 150 for displaying the results of the metadata, either directly, or in conjunction with data from mediation function 112. Together, the function of generating a new user of interest, based on relationships algorithmically determined between metadata from collected data streams of both known users and users not currently of interest may be referred to as autoprovisioning. That is, the new user of interest is provisioned automatically without requiring an ab initio input from the analyst, thereby resulting in the collection of data streams more timely and with fewer resources.

A third data path from accessing function 116 to collecting function 140 collects data streams from the network and communicates them to storing data function 142 for storage of data. Third data path in one embodiment neither dissects data streams, e.g., content from data, nor, process them beyond tagging, storing, retrieving, and overwriting them. Thus, the third data path can store any desired portion of data, whether the data originating from the known user of interest or from a user not currently of interest regardless of whether the data is and metadata or content. In one embodiment, third data path stores both content and metadata for every available data stream of all available users on the network and communicates them to circular buffer functional block 142 for storage of data. In one or more embodiments, all users of the network may comprise of known users of interest, users currently not of interest and new users of interest. However, many different embodiments can be realized with third data path, from recording different portions of a data stream, e.g., content or metadata, for any population of communication network users, with any kind of retention duration algorithm.

Known user mediating function 112 can request retained data associated with known user of interest and user not currently of interest from storing data function 142 for retrieval and communication to collecting and analyzing block 150 and subsequently to displaying data GUI function 152. Thus, collecting and analyzing function 150 can receive data from a plurality of sources via mediation function 112, including essentially real-time collected data streams for known user and new user of interest from function 130, real-time metadata from advanced targeting functional block 124, and retained, or saved and collected, data from circular buffer function 142. The latter function is referred to as retained data recovery.

By tagging, e.g., in a header, each collected data stream with an identifier, i.e. a known user identification (ID) that is unique to the NMS, the collected data can be routed and managed through the network monitoring system as traditional data packets. A database, look up table (LUT), or any other system for tracking data can be utilized by components in the NMS to cross-reference the unique identifier in the data stream with details about the data stream including known user of interest status, analyst administration details, and other useful fields.

Overall, functional block diagram 100 illustrates several features including: a multi-path approach for parallely processing different levels of metadata and/or content from users of a network; a dynamic feedback retrieval system for identifying new users of interest, using among other things metadata from all users on a network in conjunction with data from a known user of interest; auto provisioning of the new users of interest to access functions for collecting data; recovery of retained data based on known user of interest or new user of interest needs; mediating of collected data using scaled mediation functions; managing packets through the NMS via known user ID; and collecting and analyzing functions of data received from a plurality of parallel sources.

System Architecture

Referring now to FIG. 2, an architecture layout of the network monitoring system (NMS) 200 as applied to a plurality of networks is shown, according to one or more embodiments. Known user input block 204 is a graphical user interface (GUI) that can be a centralized data entry point or a distributed and remotely accessed interface that performs the known user entry function of block 110 of FIG. 1. Input block 204 can be hardware and software such as a computer system with keyboard data entry, scanner and optical character recognition, or any other system to enter data. While only one known user input block 204 is shown, the present system is capable of coupling a plurality of known user input blocks, where one or more can be utilized by one or more authorized analysts. Data mediation engine 502 receives known user of interest information from known user input block 204, to which it is coupled, and mediates the known user of interest information per the functionality of block 112 of FIG. 1. Data mediation engine 502 can process collected data streams from known users of interest and users not currently of interest via standard scalable network components as described in subsequent FIG. 5, or it can use an application specific integrated circuit and hardware

One or more Access+Mass Metadata extraction (MME) storage+Buffer devices 302-A1 to 302-Ap and 302-z1 are coupled on the backend to data mediation engine 502 to receive instructions on the known user of interest and the new user of interest that they should collect on one or more networks, e.g., NW1202-1 and NWn 202-n, where n and p≧0. An access device, e.g., 302-z1 can be coupled to a plurality of networks, e.g., 202-1 and 202-n, or a plurality of access devices, e.g., 302-A1 and 302-Ap can be coupled to a single network, e.g., NW1202-1. AMB devices 302-A1, to 302-Ap and 302-z1 utilize hardware and software described in subsequent FIG. 3 to perform the functions of FIG. 1 including: access network functional block 116; collecting metadata of at least one or of all data streams per block 120; collecting data streams of known users of interest 130; and collecting data streams of all users 140. Instructions may be communicated to access devices via secure, or encrypted, links on wired systems, wireless, satellite, etc.

Access devices 302-A1 to 302-Ap and 302-z1 are also coupled to a plurality of processing devices on the frontend, and particularly to: a mass metadata extraction (MME) and advanced targeting engine, or metadata mediation engine, 402 that receives metadata; and to data mediation engine, 502 that receives collected data. Data mediation engine 502 performs the mediation function 112 of FIG. 1 where it mediates the known user of interest against predetermined rules and criteria for identification and data collection on the network as well as against available resource allocation. Data mediation engine 502 then communicates processed data from known users of interest and new users of interest to collection and analysis engine 602, and also to metadata mediation engine 402 for processing against metadata from all users or a portion of users, e.g., to find meaningful relationships, correlations of data, and other insights into relationships between known users of interest to other known users of interest and to users not currently of interest, which can be output to GUI 610, e.g., data monitors. Meanwhile, metadata mediation engine 402 is also coupled in parallel to data mediation engine 502 to send and receive data regarding new users of interest.

NMS 200 is modular, such that an analyst can build up or scale down the functionality to a system as budget and need dictates. Thus, a core function of collection of data of a known user of interest can be a starting function, with an upgrade of autoprovisioning via metadata mediation, or an upgrade of retained data recovery via circular buffer being modularly addable. Thus hardware integration and expansion can be implemented with software upgrades and interface sensing techniques that allow the NMS 200 to detect the hardware and provision the system to implement the increased or decreased functionality.

Referring now to FIG. 3, a block diagram of the access device+mass metadata extraction (MME) server+storage buffer (together “AMB”) engine 302-A1 of the network security system is shown, for collecting data on a network, according to one or more embodiments. Access function 116 of FIG. 1 is implemented in Access engine 302-A1 via a scalable quantity of line cards, i.e., 10 Gigabit, or 10 G, line cards 332-1 through 332-t with t≧0, being receive cards as required to collect content and metadata from all available traffic on the network, i.e., NW1202-1, and to communicate it with other components in the network security system. Line cards 332-1 through 332-t receive data streams from the network via any commercially available or proprietary access device coupled to the network to collect the data streams used by the known users of interest. The access device can be a passive probe tied or tapped into a junction on the line of the network or it can be an active port to a network router, both of which are known to those skilled in the art; collecting the data streams of the known user on the network; optionally capable of tagging the data streams of the known user of interest that are being collected from the network with a respective known user ID or record ID; and transmitting the data streams of the known user to the NMS for subsequent analysis.

Ethernet interface (I/F) 336 with 1 G/10 G capability and optional legacy compatibility, i.e., with 10/100/1000 M bit/sec, communicates the full content and metadata of all available traffic on the network to the following coupled devices: 1) an MME server 310; 2) a peripheral control interface (PCI) mezzanine card (MC) input/output (I/O) module (together “PIM”) data card 334 and 3) a storage, or circular buffer 350. Note that any communication protocol can be utilized between engines or components in the NMS, e.g., 40 G/100 G, etc., while still meeting the functionality, methods, and overall system architecture and benefits of the present disclosure.

MME server 310 buffers and transmits metadata for users on the network to the metadata mediation engine 402 of FIG. 2, e.g., via connection “B,” thereby satisfying function 120 of collecting metadata as second data path shown in FIG. 1. MME server 310 also functions to buffer and manage data to account for differences in line speed, line failures, data backup, and other system interconnectivity issues that inhibits continuous and real-time data streaming between the components.

PIM data card 334 is essentially the gate keeper for what portion of the data stream gets directed to the first data path of known user mediation and the second data path of metadata mediation for the NMS. For example, PIM data card 334 can send the first few packets having raw metadata for a session for all users to the MME server 310 for subsequent transmission to metadata mediation engine 402 for processing metadata. Similarly, the PIM data card 334 can send the entire data stream for known users of interest, including the first few packets having raw metadata and the subsequent packets containing the content, to the data mediation engine 502, shown in FIG. 2, e.g., via connection “C,” thereby satisfying function 130 that monitors and stores data streams of known users as first data path, as shown in FIG. 1. Metadata belonging to the known user of interest is stripped out by data mediation engine 502 and communicated to, and processed in parallel by, metadata mediation engine 402, e.g., as tracked by a common known user ID as shown in FIG. 2. PIM data card 334 can be a commercially available card, or a proprietary design PIM card capable of communicating with the packets as described herein.

Storage, or circular, buffer, or drive, 350 receives and stores metadata and content of desired users, which can include known users of interest, users not currently of interest and new users of interest on a network, via the Ethernet interface card 336. Storage buffer 350 satisfies circular buffer functional block 142 and collecting function 140 as third data path, as shown in FIG. 1 for temporary storage of all metadata and content collected for every available data stream of all available users, in one embodiment, on a network. Storage buffer 350 can be any size buffer device, translating to a time limit of original stored data for a given data rate, with optional expandability, and various data management techniques for interruption, recovery, and preservation of strings of critical data. Storage buffer can be accessed to recover retained data that was collected from a known user of interest, a new user of interest or a user not currently of interest, via an analyst's request input from data mediation engine 502, e.g., via connection “A,” or via an autoprovisioning function via MME server 310 from the metadata mediation engine 402 through data mediation engine 502. Storage buffer 350 can be any commercially available or proprietary design drive that will communicate with the system and store data.

Optionally, additional storage buffers, not shown, may be used in parallel with shown storage buffer 350. Additional storage buffers could use a hand-off technique whereby when a critical security event occurs, as notified by an analyst or an algorithm, e.g., sensing key terms or traffic from specific known users of interest, users not currently of interest or analysts, a first storage buffer that was actively recording data can stop overwriting its existing data, thus saving the most recent communications on the network at the time of the notice. This would provide a ‘snapshot’ of the existing communications on networks up to that point which can be downloaded to other storage devices, e.g., long term or off-site storage devices. Going forward, recording of current communications on the network is seamlessly transferred to the parallel circular buffer unit. Thus, the most recent past data is preserved, while current and future data is captured as well. In other words, multiple banks of storage buffers can serially store data e.g., via flip-flopping or round robin, until an event occurs, at which point, the most recent storage buffer changes to a download mode, while the unused storage buffer is swapped to assume the duty of recording current communications. Storage buffer 350 can be either an external unit communicating to access device 302-A1 or it can be a unit integrated into access device 302-A1. Storage buffer 350 is coupled to MME server 310 to provide data back and forth between the units.

While FIGS. 2 and 3 illustrate an integrated storage buffer 350 and MME server 310 located in each Access engine, e.g., as a card in a blade server, for element 302-A1, the present disclosure is well suited to implementing the functions in a distributed metadata server device and storage buffer device, either as a standalone or incorporated in another engine, i.e., the metadata mediation engine 402.

Additionally, while access device 302-A1 is illustrated for collecting data on communications on a hardwire communication system, e.g., electromagnetic signal communication on copper lines or electromagnetic light waves on a fiber optic line via taps, etc., it can also be implemented via receivers or probes on other communication links such as wireless, e.g., satellite, radio signals including microwave, cellular communications, etc., via either monitoring that link in its domain, e.g., wirelessly on the airwaves, or monitoring it in the wired domain, e.g., accessing cellular communications when transmitting through hardwire links in the mobile telephone switching office (MTSO) or via a subscribers wireless fidelity (Wi-Fi™) network

Referring now to FIG. 4, a block diagram of a mass metadata extraction (MME) and advanced targeting engine, or metadata mediation engine, 402 portion of the network security system, for evaluating a metadata portion of the network traffic, is shown, according to one or more embodiments. Metadata mediation engine 402 embodies the metadata mediation functions 122 and advanced targeting function 124 of FIG. 1 for second data path.

MME and Advanced Targeting engine 402 includes a 1 G/10 G Ethernet card 406 coupled to a storage buffer 404, for receiving and buffering the first few packets of raw metadata for each session, e.g., primarily for users not currently of interests received from MME server 310, via connection “B” from AMB engine 302-A1 of FIG. 3, and for receiving and buffering collected data, e.g., for known users of interest and new users of interest, via connection “E” from data mediation engine 502 of FIG. 1. Thereafter, both the first few packets with the raw metadata and the collected data is communicated to metadata extraction engine 408, which strips and retains, the metadata portion of the raw metadata and the collected data, and communicates the processed metadata to the MME output handler 410, while discarding the rest of the content. The MME output handler 410 groups, labels, and packetizes the metadata for subsequent communication to the MME output application programming interface (API) 412 for transmission to collection and analysis engine 602, via connection “G.” Metadata extraction engine 408 is implemented in one embodiment using any commercially available deep packet inspection solution for inspecting and/or filtering of the packets for advanced network management, user service, and security functions as well as internet data mining and other functions.

Advanced targeting function 124 of FIG. 1 is specifically accomplished by advanced targeting agent engine 414 communicating with both MME output handler 410 for known user update 413-B and known user configuration 413-A as well as with data mediation engine 502 of FIG. 1, via connection “D.” In particular, advanced targeting agent engine 414 implements algorithms and recursive analysis to infer relationships and correlations between known-user-data received from data mediation engine 502 and metadata portions of known users of interest and users not currently of interest collected from the network. The newly identified user not currently of interest is then labeled as a ‘new user of interest’ and communicated to data mediation engine 502 for provisioning on the network via the Access engine of FIG. 3. Storage buffer 404, metadata extraction engine 408, MME output handler 410, advanced targeting agent engine 414, and MME output API 412 can all be implemented as discrete devices or as integrated functions on a personal computer, minicomputer, server or other suitable device.

Referring now to FIG. 5, a block diagram of a data mediation engine 502 portion of the network security system for provisioning known users to be monitored and for mediating collected data is shown, according to one or more embodiments. Data mediation engine 502 embodies the mediation function 112 for known users of interest and new users of interest for both first data path and second path, as shown in FIG. 1.

Data mediation engine 502 includes a load balancer 504 for receiving collected data, including known users of interest and new users of interest, per connection “C,” from at least one AMBs 302-A1 to 302-Ap through 302-z1, and spraying, or distributing, the data across one or more data processing units (DPUs) 508-1 through 508-f coupled to one or more data storage units (DSUs) 510-1 through 510-g, respectively, and together referred to as data processing engines, where f≧0 and g≧0 and in some cases f=g for matched paring between the units, though multiplexing can occur with f being different than g.

The DPUs 508-1 through 508-f, also known as an internetwork protocol data units (IPDUs), organize the collected packets for content delivery, eliminate any packets not authorized to be captured, fan-out packets destined for multiple analysts and ensure the packet is only sent once to an analyst that has multiple known users of interest that request the same packet and routes them to the DSUs for temporary storage for subsequent communication to collection and analysis engine 602 of FIG. 6, per connector “F.” In addition, DPUs 508-1 to 508-f are coupled to target mediation engine 520 which receives potential new users of interest from metadata mediation engine 402 of FIG. 4, per connector “D,” and compares them to known users of interest being processed in DPUs 508-1 to 508-f as well as performing administrative tracking and approval of potential new user of interest before provisioning them to Access devices 302-A1 to 302-Ap through 302-z1, via connector “A.” DPUs and DSUs can be proprietary communication cards or off-the-shelf line cards. Any commercially available or proprietary-design DPU may be used for this function, given the adaptation and implementation of drivers specific to the actual device. Target mediation engine 520 can be implemented as a discrete ASIC device or as an integrated function on a personal computer, minicomputer, server or other suitable device.

While only one load balancer 504 is illustrated, the data mediation engine 502 can utilize any number of load balancers and any quantity of data processing engines to provide a scalable system based on the quantity of data streams, based on the data rates, and based on any other application or customer needs to provide a functional system. A modular network chassis can be utilized with any quantity of slots for line cards or application specific engines to accommodate data processing engines.

Referring now to FIG. 6, a block diagram of a collection and analysis engine 602 of the network security system for analyzing and presenting collected data to the analyst is shown, according to one or more embodiments. The collection and analysis engine 602 embodies the collecting and analyzing function 150 for collected data from the network, as shown in FIG. 1.

A plurality of sources provide information delivered to collection and analysis engine 602, namely metadata information via connection “G” from metadata mediation engine 402 of FIG. 4, and collected data via connection “F” from data mediation engine 502 of FIG. 5. This received information is interfaced by file transfer protocol (“FTP”) server 604 and distributed in parallel to at least one scalable analysis tools engines 608-1 through 608-r, with r≧0. In particular analysis tools engines 608-1 through 608-r can be proprietary application specific hardware tool, or can be a general processor such as a server. Analysis tools engines 608-1 through 608-r can be a combination of one or more analysis platforms or solutions provided by one or more companies. Analysis GUIs 610-1 through 610-v, where v≧0, are multiplexed to analysis tools engines 608-1 through 608-r to allow concurrent access, such that security and confidentiality is maintained between multiple different analysts, while the multiple analysts are accessing and analyzing their authorized information on known users of interest and users not currently of interest on the NMS, e.g., using metadata mediation, target mediation, circular storage retained data recovery, autoprovisioning, and/or different analysis tools engines. Analysis tools engines 608-1 through 608-r can include proprietary tools known to those of ordinary skill in the art of network analysis. This enables the multi-tenant functionality of the NMS including a situation where same data of the known user of interest or user not currently of interest and/or analysis of the user is provided by a fanout feature to multiple analysts.

Servers mentioned hereinabove, e.g., MME server 310, server for metadata mediation engine 402, server for data mediation engine 502, or FTP server 604, or any other function in the scalable network monitoring system, can be any brand of server, e.g., Sun™, HP™, etc., and any type of server computer, e.g., application server, blade server or any processing device capable of performing the data management and communication functions with any quantity of cores, e.g., six (6) core X86 Intel Quad Xeon MP, which can be programmed for any type of operating system (“OS”), e.g., Solaris, UNIX, LINUX, or other computing OSs.

Case Table

Referring now to FIGS. 7A through 7C, case tables 700-A through 700-C illustrating several different possible combinations of known users of interest and users not currently of interest communicating on a network to be monitored are shown, according to one or more embodiments. Descriptions of columns A through column GG for case table are described immediately hereafter as exemplary fields, which fields are able to be reduced or expanded as desired by a given analyst. Column letters I, O, Q, S, X, and Z are intentionally omitted. The substantive entries for each case, e.g., each cell in rows 701-716 of data in the table, are fictitious and provided as arbitrary examples to illustrate the disclosure, and will be described in respective portions of flowcharts of FIG. 8. All or part of case tables 700-A through 700-C, and additional management data, can be implemented as a lookup table (LUT) in memory managed by a controller or microprocessor of NMS complying with protocol instructions, e.g., per the method of a first data path of metadata and content for known users, second data path of metadata only for some or all users, and third data path of metadata and content for all or selected users, as described for FIG. 1.

Referring now to FIG. 7A, a case table 700-A illustrating data entry to data mediation engine and access function, showing several different possible combinations of identification and collection scenarios for known users of interest and users not currently of interest communicating on a network, is shown according to one or more embodiments. Columns A through N2 of table 700-A illustrate data entry values provided to data mediation engine 502 via known user input block 204 shown in FIG. 2, viz., as input by an analyst. In particular, column A of case table 700-A is an authorization identification (AUTH ID), while column C provides a known user of interest, e.g., a known user name for an individual or a company name for a corporation, or a pseudonym, handle, nom de plume, nom de guerre, alias, chat room name, or other identifier. Column C also includes parenthetical names of users not currently of interest in rows 711, 712, and 713. Column D provides a known user type, such as the medium, link, channel, or other communication media or format on which metadata and content is communicated, thereby indicating what network or format should be provisioned for collection of data. Column E refers to a network identification (NW ID) on which the communication is sought. No column is provided for metadata, as it is presumed that metadata is available for monitoring on all users, including both known users of interest and users not currently of interest.

Column F refers to a third party (3^rdPTY) to whom a known user of interest is communicating. Columns G, H, and J refer to timing of when monitoring is sought, e.g., a start day or date, a duration time or ending date, and times of day during a user prescribes monitoring, respectively. Column K lists the analyst, while the analyst's supervisor or manager is listed in column L, and while a preauthorized contact identification (CONTACT ID) is listed in column M. Column N refers to a known user ID that is assigned by the network monitoring system to the unique case described in the table, e.g., the given combination of variables, or fields, for the given known user of interest. Similarly, column N2 refers to a record ID that is assigned by the network monitoring system as well, in order to unique case described in the table for known users of interest and users not currently of interest. Thus, with a unique known user ID and/or record ID, the data streams, or packets of data, can be tagged or wrapped, e.g., in the header of a packet, with the unique known user ID and record ID. This allows the packet to be processed in the NMS as a discrete and traceable packet on fungible or proprietary, and scalable, hardware and engines, seeing as the unique known user ID and/or record ID can be determined for a given packet, and thus its data can be collected and processed for the given known user ID. A NMS could deselect some of the variables listed in the columns or add other columns such as, for example: known user bio information such as social security number, driver's license number(s), etc.; analyst information such as comments and suspected relationships to other known users, etc.

Rows 701 through 710 represent known users that are available to enter into an NMS at a given point in time. Row 716 is a known user of interest that only becomes known at a future point in time for entering into the NMS, and is thus segregated away from the known users of interest ready to enter immediately. Rows 711-713 are users not currently of interest presented in the table for comparison and explanation of subsequent steps on known users and new users, and are not typically entered into the LUT system for tracking known user IDs. Row 714 represents all known users of interest on all networks serviced by NMS while row 715 represents all users currently not of interest on all networks serviced by NMS; together which represents all available users on all networks serviced by NMS.

Referring now to FIG. 7B, a table 700-B, illustrating functions of access and mediation, mass metadata processing, and circular buffer functions, e.g., first, second, and third path of data processing of FIG. 1, for data collected from known users of interest and users not currently of interest communicating on a network, is shown according to one or more embodiments. Column N known user ID, and column N2 record ID, for known users of interest and users not currently of interest respectively, are repeated in table 700-B because the known user ID or record ID is retained with the collected data as it propagates through the NMS, and thus will be available to any engine in the NMS. Column D, known user type, is repeated in table 700-B for convenience of reading the table. Table heading “Access+Mediate” includes columns T through W which represent variables used in access device 302-A1, or access portion thereof, of FIG. 3 and data mediation engine 502 of FIG. 5 for processing of the data streams. In particular, column T identifies the Mediation user ID, for an administrator or analyst that has access to the mediation functions of the NMS. Column T indicates an Access probe ID used to collect data on a given network. In some cases, multiple probes will be used on a network, and thus, both probes may have to be provisioned and tracked. The probe IDs and network IDs used in tables 700-A and 700-B are exemplary and do not necessarily match NW IDs shown in preceding hardware figures. Column V indicates which known user of interest and which user not currently of interest has mass metadata engine input (MME INPUT) to the NMS. Because all metadata is accessible by the NMS, including both known users and users not currently of interest, every row has a check. However, the analyst can selectively gain metadata information for whichever known users or users not currently of interest desired, possibly based on prioritizing limited resources to only known users and to suspicious users not currently of interest for a high-data rate scenario. Column W refers to communication, e.g., for content of communication, which in most scenarios are limited to known users. Table heading “Circular Buffer” includes column Y which indicates which data is being recorded in storage, or circular, buffer 350 of FIG. 3.

Table heading “MME” includes Column N; known user ID, again for the MME function performed on the data. Column AA indicates whether the Metadata is recorded and evaluated by the MME mediation engine; while column BB indicate whether an analyst has a relationship to a known user of interest, e.g., to known user ID of “2” in this example; and while column CC indicates whether a newly auto provisioned new user of interest was established by the MME function.

Referring now to FIG. 7C, a table 700-C, illustrating collection and analysis of data provided by the network security system for GUI display, is shown according to one or more embodiments. Table 700-C includes column N known user ID, and column N2 record ID, as these identifiers travel with the data stream through the NMS for known users and users not currently of interest respectively. Table heading “Collection—GUI Output” includes: column DD for memory location in the FTP server 604 of FIG. 6; column EE to indicate content available to GUI output, column FF to indicate metadata available to GUI output, and column GG for dossier information available to GUI output, e.g., a summation of known user and user not currently of interest related information and other analysts comments and analysis. Note that memory location per column DD for common known users of interest has row 702 utilizing memory locations M1+M2 and row 705 utilizing the same memory locations M1+M2, seeing as their known user data matches in important areas, such as same known user of interest, same time of collection, etc., per Table 7A that would allow the access to that same data by different analysts, thus saving memory by storing the data once, all while maintaining confidentiality and security between the two analysts, for multi-tenant.

Method of Use

FIGS. 8A through 8C provide flowcharts illustrating a method of collecting, managing, and processing data streams from a network for both known users and users not currently of interest, according to one or more embodiments. The flowchart components, e.g., steps, will be described as applied to both apparatus and system components and to case tables provided herein.

Referring now to FIG. 8A, a flowchart 800-A of a method for collecting data streams on a network is shown, according to one or more embodiments. Flowchart 800-A begins with step 804 of receiving at a network monitoring system (NMS), a known user of interest to be monitored on the network. Step 804 is implemented by entering known user information via known user input 204 of FIG. 2 for columns A-M of table 700-A of FIG. 7A for known users belonging to a given analyst in column K, typically segregated for security and confidentiality purposes. Thus, analyst L1 would enter their known user info in columns A-M for “Dewey Doe” of row 701. Similarly, analyst L2 enters their known user info in rows 702 for “John Doe”, and 706 for “Tom Doe,” while analyst L3 enters known user info in rows 703 for “Chee Doe,” row 704 for John Doe, row 705 for “John Doe”, and row 710 for “Clyde Jones,” and while analyst L4 enters known user info in rows 708 for “John Doe,” which is the same known user and known user type, e.g. cell phone, as row 702, but for a different analyst, and other different factors. At some point in the future, analyst L1 would enter the information for row 716 for “Mary Smith,” which in this example would only be available at some time in the future. Analysts L1-L4 can enter data according to their own independent timetables, and their independent data input facility. Step 804 includes the creation of a known user ID in known user input 204 for the given known user data entered into the NMS.

Alternatively, if implementing a multi-tenant feature of the present disclosure on the NMS, a given neutral administrator could be tasked with entering all known user information for all analysts using the present disclosure, because after being entered, the NMS via the look up table (LUT) would be able to discriminate which data belonged to which known user of interest belonged to which analyst, and could make that information only available to the given analyst with administrative privileges to see it.

Furthermore, with a multi-network feature of the present disclosure, a given analyst entering information for different systems would not have to enter them on different systems slated for different networks. Instead, a given analyst could enter the known user information on a single NMS system for collecting data streams for known users of interest on different networks. Without the multi-network feature the analyst might have to enter known user info on multiple systems, one for each communication network on which the known user of interest is suspected of communicating. Combined together, multi-tenant and multi-network could provide a single NMS with which a single analyst could enter known user information for multiple analysts collecting data on multiple networks, resulting in substantial reductions in turnaround times, bureaucratic conflicts, operating expense, and other resources.

Step 806 is for creating a known user identification (known user ID) for the known user, wherein the known user ID is unique to the NMS in order to track data streams of the known user of interest during subsequent processing, such as extraction of content and metadata, in the NMS. Step 806 is implemented by the NMS, and specifically the data mediation engine 502 of FIG. 2, by having an accounting system that provides unique known user ID numbers for a given unique known user, e.g., one having unique values for all the variables desired, e.g., some or all of columns A through M of table 700-A, all of which values presented in given rows 101-113 are unique with respect to each other. The NMS accounting system would also time out or delete, known user ID values when a given known user of interest had expired or been expunged by an analyst. The known user ID is unique for a combination of information chosen from a set of data including, but not limited to: the known user, e.g., a known user name, phone number, handle, etc.; a known user type associated with the known user; relational data associated with the known user such as a network provider ID, a data collect time and a data collect date, network ID, etc. A look up table (LUT) or other relational data or database system can be used to track the known user and the data streams of the known user. A single common database/LUT, or a plurality of databases/LUTs, can be used for tracking known users of interest and/or users not currently of interest or new users of interest.

Regarding multi-tenant and multi-network features, the different network values entered in columns K and E, respectively, provide another variable for the row, thus making them unique with respect to each other, and thereby resulting in different known user IDs. For example, similar known user of interest John Doe in Row 702 and 708 has different tenants of analysts L2 and L4 as well as different networks NW2 and NW7, respectively.

Step 808 inquires whether additional users are to be entered, and if so, returns to step 804 to repeat steps of receiving a known user and creating a known user ID, so the known user can be provisioned and collected in a group. Step 808 is implemented in table 700-A by entering information for known users that haven't been entered or are newly available, e.g., for rows 701-710 currently, or for row 716 when it is available in the future. Row 705 can be entered at the time it becomes available.

Step 810 implements optional aggregating of the known users of interest received at the NMS to determine a superset of data streams to be provisioned and collected in order to prevent duplication of effort and data in the NMS, due to the intensive storage requirements of current high data rate communications. Step 810 is implemented by data mediation engine 502 examining via software algorithms and comparing values in memory for all entered known users of interest and seeking any rows that are identical for all appropriate fields. The aggregating step can also provide hierarchical grouping functions per user-defined fields, e.g., primarily grouping known users of interest per the network to which they are listed, secondarily grouping known users by date, etc.

Step 812 involves provisioning a list of known user IDs via a data mediation engine 502 to access device(s), e.g., 302-A1, of FIG. 2 in order to collect data streams used by the known users on one or more networks. The provisioning step can include provisioning multiple access devices for a given network, e.g., 302-A1 and 302-Ap coupled to network NW1202-1. In particular, step 812 is implemented by communicating known user type information of column D assigned by data mediation engine 502 per algorithms developed to known user given data communication types and links, e.g., phone number, webmail address, etc.

Step 814 implements collecting data on the network. In one embodiment, only known user data is collected on the network, by searching for strings of identifiers in traffic that match identifiers of known user sought, e.g., the known user name, or alias, per column C, or known user type, per column D, and given chronology variables as in columns G, H and J, amongst other potentially important variables, such as the third-person to whom a known user is communicating, e.g., column F. In another embodiment, the entire data stream, including both metadata and content, for all available users of the network, is collected and then segregated into appropriate portions of data depending on an application and level of monitoring desired by the analyst. Other embodiments can be implemented in step 814 to retrieve: portions of data streams, e.g., content and/or metadata; for known users, users not currently of interest portions thereof, or any population of communication network users that NMS defines, e.g., by an ad hoc or an algorithmic rule.

In one embodiment, the entire data signal, e.g., content and metadata, of all available users on the network are communicated to the AMB device for access. The different quantities of collected data are segregated and split off for different levels of processing as described in a subsequent step. The present disclosure is well-suited to monitoring a wide range of signal types and a wide range of one or more collection conditions, seeing as content and metadata can be analyzed to determine compliance with a given monitoring condition.

Step 816 is for transmitting the collected data streams to the NMS for subsequent analysis. Step 816 is implemented differently depending upon what types of data streams are being collected. In one embodiment, parallel data paths, as described in FIG. 1 of a first, second, and third data path, are communicated in parallel to different respective portions of a NMS for processing according to the protocol of the specific data path. In the present embodiment, the metadata and content for all available users of the network is communicated to engines in each of the three data paths, where the data is then reduced as required by the protocol for that data path. Thus, in the present embodiment, the metadata and content for all available users of the network is communicated via: connector “1” to flowchart 800-B of FIG. 8B for processing of first data path; connector “2” to flowchart 800-C of FIG. 8C for processing of second data path, and connector “3” to flowchart 800-D of FIG. 8D for processing of third data path. Thus, the flow paths are: 1) known user of interest mediation of first data path which will strip out and analyze the content portion of data stream for known users of interest, including new users of interest, and pass the first few packets of the data stream containing primarily raw metadata to the metadata mediation of second data path; 2) while similarly the first few data packets of all non-users are sent to the metadata mediation of the second data path in parallel, wherein the metadata is further refined; and 3) while retained data mediation of third data path will accept and record data, e.g., both metadata and content, of desired data streams, e.g., all communication network users.

Referring now to FIG. 8B, flowchart 800-B, continued via connector “1” from FIG. 8A, of a method of mediating the collected data, is shown according to one or more embodiments. Flowchart 800-B embodies the first data path function of the NMS illustrated in FIG. 1 starting with step 830 of receiving the metadata and content for all available users of the network from the access portion of the NMS via connector “C” of FIG. 5, at the load balancer 504. When a data stream containing metadata, content or both are received at the load balancer 504, then it proceeds directly to subsequent distributing step.

Step 832 is for distributing the data streams across a scalable quantity of data processing engines, such as data processing units (DPUs) and data storage units (DSUs), in the NMS. Step 832 is implemented by load balancer 504 distributing, or spraying, data streams across the scalable quantity of DPUs 508-1 to 508-f and then to subsequent DSUs 510-1 to 510-g, together “data processing engines.” The process of distributing or spraying the data streams can be done according to balancing a quantity of data streams themselves, or balancing a quantity of data in the data streams. The present embodiment balances the quantity of data streams across the scalable quantity of data processing engines. A modulo-x algorithm may be used where ‘x’ is the quantity of branches or parallel data processing engines that are used. Thus, if values ‘f’ and ‘g’ equal 4 for the DPUs and DSUs, then a modulo-4 algorithm would be used to deal one out of every four a sequential data streams to each of the multiple DPU and DSU sets. Other techniques for load balancing and traffic management in an even or a biased distribution across the multiple DPUs and DSUs can be implemented in the present disclosure as well.

In step 834, evaluating a metadata portion of the data streams is performed using a scalable quantity of DPUs. This step essentially screens the metadata and content for all available users of the network for known user data. Step 834 is implemented by DPUs examining the metadata portion of the data stream and comparing it to the known user ID criteria of LUT as exemplified in Table 700-A of FIG. 7A. Data streams that do not qualify as known users do not advance to DSU units 510-1 to 510-g. Thus, while the metadata and content for all available users of the network may be evenly distributed across multiple DPUs, the resulting known user data streams that pass to the multiple DSUs may not be evenly distributed. A feedback loop to load balancer from multiple DSUs 510-1 to 510-g may help to more evenly distribute data streams if a given DSU becomes burdened with a higher than normal traffic rate.

Step 836 implements tagging the data streams of the known user that are collected from the network, with a respective known user ID and optionally a record ID. Thus for example, when a cell phone communication is discovered on a cell network, e.g., via active collection into the mobile traffic switching office (MTSO) or via packetized cell data passed on a network such as the Internet, for known user John Doe, per Row 702 of Table 700-A having a known user ID of “2,” and a record ID of “82,” then this known user ID and record ID is then embedded, e.g., in the header, in the data stream for future reference during processing in the NMS or collection and analysis by an analyst. Thus data collected for rows 701 through 710 will be tagged with respective known user IDs 1-10, and record IDs 81-90 respectively. Step 836 tagging can be implemented in various alternative embodiments, with either access components performing the tagging, or with mediation engines performing the tagging step. In one embodiment, tagging can occur at the time a data stream is collected, e.g., for known users, or at a later time, such as when retained record is retrieved from a historical file and re-designated as a new user and is now tagged and entered into the NMS for processing and analysis. An example of retained data used for a new user would be when data is stored on the NMS from the analyst that was originally a unknown user but who has now become a new user.

Step 836 can be implemented in different ways depending upon the number of modular features and functions integrated into their NMS. For example, an NMS can be configured to only mediate known user content for the first data path, or to analyze metadata of unknown users and known users for the second data path, or to retain data for some or all of known users and unknown users for the third data path, or any combination of these functions. Thus, in another embodiment, data streams for known users are tagged with a known user ID for analysis of content and tagged with record ID for analysis of metadata and/or for short-term retained data storage, while data streams for unknown users are tagged with a record ID for analysis of metadata and/or for short-term retained data storage in circular buffer. If known users are only mediated for known user content for the first data path and are not analyzed for metadata, and their data is not retained for future use, then only a Known user ID is used and a RID is not needed. Tagging a data stream with a record ID or a known user ID can be implemented by using a wrapper around an existing packet in one embodiment. For retained data function, tagging of known user ID and record ID for retained data stored in storage buffer 350 can be performed by MME server 310 of FIG. 3, or by Metadata extraction engine 408 of FIG. 4 and communicated back to storage buffer 350. For metadata mediation, tagging of record ID for a user not currently of interest, and known user ID for a known user, can also be performed by MME server 310 of FIG. 3, or by Metadata extraction engine 408 of FIG. 4.

Step 836 is implemented by known user mediation engine 520 of FIG. 5 that receives metadata of data streams and evaluates the known user, known user type, and other factors of the data communication that allows the system to identify the data stream uniquely, per the LUT 700-A for example, and then tags the previously assigned known user ID value into the respective data stream for subsequent processing in the NMS, e.g., the DPU 508-1 through 508-f and DSU 510-1 through 510-g, and subsequent engines.

With step 838, storing a content portion of the data streams is performed in a scalable quantity of data storage units DSUs 510-1 to 510-g as shown in FIG. 5. This storing process buffers the data streams before being passed via connection “F” to collection and analysis engine 602 of FIG. 6. Thereafter flowchart 800-B proceeds to connector “DD” which leads to FIG. 8E flowchart 800-E of a method for analysis and collection of data.

Referring now to FIG. 8C, a flowchart 800-C, continued via connector “2” from FIG. 8A, of a method of mass metadata extraction and analysis is shown, according to one or more embodiments. Flowchart 800-C embodies the optional second data path function, illustrated in FIGS. 1 and 2 of processing, e.g., collecting and mediating, the mass metadata of at least one of the data streams, or of all the data streams of known users and users not currently of interest and/or new users of interest on the network. A substantial amount of relational data can be obtained between known users and users not currently of interest, and combinations thereof, via the metadata.

Step 840 implements tagging the data streams of the users not currently of interest that are collected from the network, with a respective record ID (RID) for subsequent metadata mediation. The data as content or metadata from either the known user and/or new users or user not currently of interest are provided from step 814. Thus for example, when a data stream of a new unknown user is identified and the first few packets of the session are sent via MME server 310 to MME and Advanced Targeting 402, then metadata extraction engine 408 can assign a new record ID and tag or wrap the data received from access with the RID. For example, the data collected by access for rows 711 through 713 are users not currently of interest and thus will be tagged with respective record IDs 101-103. RID for both known users and users not currently of interest are any unique code for referencing or correlating, including either a: date/time stamp, a revolving number, or etc.

In step 850 the evaluating of the metadata portion of the data stream of all users of the network is performed, after receiving the metadata and content for all available users of the network from flowchart 800-A via connector “2,” at 1 G/10 G Ethernet interface 406 coupled to storage buffer 404 to accommodate bursts of data or variations of data rates between engines. Step 850 is implemented by metadata extraction engine 408 that evaluates the incoming the metadata and content for all available users of the network stream and removes only the metadata portion, e.g., the sender name, receiver name, date and time of transmission, size of communication, attachment file identification, subject line, size of attachment, format or file type of attachment, known user type, protocol of communication, session identification, location, proxy server identification if applicable, and any other logistical information describing the content or the communication link, typically located in a header and/or footer. To locate the metadata, a deep packet inspection per protocol is performed on the data stream. First, the type of communication is identified, e.g., VOIP; Yahoo!™, Gmail™, or Hotmail™, email; chat; video streaming; etc. Then the metadata is retrieved based upon the protocol for that type of communication, which defines the location of the metadata, e.g., a specific bit location in the header of the first or second IP packet for an email. Depending on the protocol, the raw metadata can usually be extracted from the data stream, by line card 332-1 and PIM data card 334, as the first several packets of a session for a given communication network user with the balance of the packets in a data stream being discarded as not needed for metadata meditation. The term “mass metadata extraction” refers to extracting metadata from the entire mass of, e.g., all, users of a communication network. However, step 850 and metadata extraction engine 408 can be applied to any quantity of users of a system, from none to all available users. This analysis of all users can occur in parallel, e.g., on multiple parallel engines; or nearly simultaneously on a single engine.

MME server 310 can be programmed to send to metadata MME and Advanced Targeting 402 only the first several packets of a session that are known to contain the metadata, and not send the subsequent data packets that contain content. Alternatively, metadata mediation engine 402 can be programmed to provide a feedback to MME server 310 when the metadata for a given session has been retrieved and no further packets are necessary for the given session ID. If the data stream is being actively monitored and collected from the network, then that data is currently available. However, if the known user of interest was identified only after a session started, then MME server 310 can request storage buffer 350 to retrieve the retained data for the given known user of interest for delivery to metadata mediation engine 402, assuming the storage buffer is large enough and/or the retained data didn't occur too far in the past to be already overwritten.

Step 852 is for identifying a relationship between at least two of a plurality of data streams from a plurality of network users of a network, e.g., between known users of interest to other known users of interest, known users of interest to users not currently of interest, or between two users not currently of interest and combinations thereof. Sometimes a relationship is not apparent between two or more users of a communication system, whether they are either known users of interest, or users not currently of interest or new users of interest. In this case, a relationship, or link, is created using metrics and other fields of data from both users, along with the evidence that supports the supposition of the relationship, which can optionally be noticed, reviewed and/or approved by an analyst for validity or sufficiency of evidence, e.g., as transmitted from step 852 to collection and analysis methods described in flowchart 800-E. The analyst would have the ability to override the autoprovisioning and thereby withdraw the new user of interest from being monitored on the network and changing the status of the new user of interest back to a user not currently of interest. The increasing separation between two users, e.g., the existence of intermediate users or factors, can be referred to as or degrees of separation (DOS), or degrees of freedom (DOF). A high DOS may make two users of a communication system less likely to have a relationship, but it still may exist, e.g., at different levels of involvement or strategy in a solicitation or conspiracy. For example if a given user passes an email attachment to another user who then passes it to a third and fourth user, then the given user may be sufficiently connected to a fifth user who commits a crime based on a solicitation from the fourth user. If a DOS is sufficient, e.g., meets a threshold of quantity of degrees of separation set by analyst, then the status of the user not currently of interest may be changed to that of a new user of interest, e.g., by assigning a known user ID (TID) to the new user. Step 852 is implemented using mass metadata extraction (MME) output handler 410 which contains algorithms operated on a processor to tabulate metadata and list patterns and degrees of separation between network users, etc. The relationship can be determined from known data, e.g., familial relationships, historical data, etc., or can be constructed by looking for patterns or similarities from a given known user's content or metadata to other users' content and/or metadata, if they are known users of interest or to other users' metadata if they are unknown users. Thus, step 852 may identify a new user as a potential new user of interest based on the relationship of the metadata of the user not currently of interest to any data of the known user of interest. As exemplified in FIG. 7A, the second data path function herein would produce the linking data between John Doe's communications on row 702 and 708 along with the user not currently of interest communications of John Doe on row 711 and 712 and with the user not currently of interest communications of Mrs. J. Doe on row 713, assuming a LEA provided a link between Mrs. J. Doe and John Doe; or assuming metadata analysis provided linking logistical analysis, e.g., origination of communication by John Doe and Mrs. J. Doe from same physical address. The information of which network users contacted which network users, at what chronology information (time, date, duration, etc.), would be available to all analysts. And that information together with the known user information available to LEA L2 and L4 for rows 702 and 708, respectively, a larger comprehensive picture can be established of the known users of interest and other known users of interest and users not currently of interest that might become new users of interest in the future, possibly based on the information gathered herein

Step 854 is for identifying a new user of interest to monitor which is implemented in the present embodiment by algorithms based on experience, stochastic processes, and/or other factors, and combinations thereof. That is, step 854 can identify, a user not currently of interest as a potential new user of interest, e.g., create a new user, based on evaluating data, e.g., the relationship of the metadata of the user not currently of interest to any data of the known user of interest, retrieved from the network. A new user of interest may be identified by an advanced algorithm that is capable of identifying the new user of interest automatically by algorithms with or without identification or evaluation by an analyst. That is, autoprovisioning is capable of identifying a new user of interest on the network solely based on the evaluating of the data retrieved from the network. Step 854 is implemented by processor in MME and advanced targeting engine 402, and in particular by MME output handler 410 that implements these algorithms and rules. Thus, in the example provided for step 852, the relationship identified between Mrs. J. Doe communicating to John Doe on row 711, and then the subsequent communication from Mrs. J. Doe to Shady Joe on row 713 might raise the inference that Mrs. J. Doe should become a new user of interest, especially since John Doe is already a known user of interest with respect to communications with Shady Joe per row 708. In another embodiment, the existence of a known user of interest for a given analyst is utilized in step 854 for determining the strength of a case for creating a new user for another analyst, though none of the substantive data collected from a first analyst is directly given to a second analyst who does not have the known user, without the second analyst generating the known user of interest per protocol themselves as prompted after generation per finding new users of interest. While the example provided simply linked communications between network users, much more sophisticated linking can occur using other variables and fields from metadata, e.g., a common subject reference, a meeting location, a same attachment to an email, etc.

Step 858 inquires whether the new user of interest is listed as an existing known user of interest already for purposes of avoiding duplication of effort. In particular, step 858 inquires whether a new user for a second analyst already exists as a known user of interest for a first analyst. Step 858 is implemented by advanced targeting agent engine 414 communicating to MME output handler 410 the results of a search through existing known users in its memory for one that matches a desired new user, sought by MME output handler 410. If the requested new user of interest already exists, then a pointer per step 859 is provided for the second request for the collected data of the known user of interest to point it to the data, or portion of data, that has already been collected for the known user of interest.

If there is no overlap or only a partial overlap between a potential new user of interest against a known user of interest per step 858, then the new user's information can be provisioned to be collected based upon the relationship discovered by the metadata processing unit for the portion of data needed. The provisioning step 860 is implemented by target mediation engine 520, acting as an interface manager, in data mediation engine 502 of FIG. 5 that is coupled via coupling “D” to advanced targeting agent engine 414 of MME and advanced targeting engine 402 of FIG. 4. Subsequently, step 862 collects any available data streams on the network that meet the predetermined criteria via to access device, e.g., 302-A1-302-Ap and 302-z1 of FIG. 2. Thereafter flowchart 800-C proceeds to connector “BB,” which leads back to step 830 of FIG. 8B for receiving data for known user, e.g., including new user of interest, and proceeds in parallel via connector “DD” which leads to FIG. 8E flowchart 800-E of a method for analysis and collection of data. Connector BB essentially communicates an ID, e.g., a RID, for the new user to the access device; and monitors the network to collect data, either content or metadata, related to the new user. Thereafter, metadata processing engine can process data from the new user as described herein.

Referring now to FIG. 8D, a flowchart 800-D, continued via connector “3” from FIG. 8A, of a method of storing and retrieving data on a circular buffer is shown, according to one or more embodiments. Flowchart 800-D embodies the optional third data path function, illustrated in FIG. 1, of storing collected data on a circular buffer storage and retrieving the retained data on the circular buffer storage at a later time. This method allows the convenience of retrieving data from a circular buffer that stores only a given timeframe of data before being overwritten. A system such as this becomes invaluable when needing to look back in time after the occurrence of a serious security breach to retrieve network communication data that is otherwise not collectable.

Step 870 implements tagging the data streams of known users of interest with a known user ID (TID) and a record ID (RID) and tagging the data streams of users not currently of interest whose data is collected from the network, with only a RID, for subsequent storage as retained data. Thus for example, when data streams of a known user or a user not currently of interest are received in access portion of the NMS, MME server 310 can identify known users of interests, and tag or wrap them with the RID and Known user ID, as well as identify users not currently of interest s and tag or wrap them with the RID (TID is ZERO), then pass them all to storage buffer 350. Step 836 can optionally perform the tagging portion of this step for the known users of interest.

Step 871 is for storing data on a circular storage device, such as a circular, or storage, buffer 350 of FIG. 3, for future access. Storage of data can be performed according to any protocol, whether storing just a portion of, or a full content of, the data streams collected from the network, and whether collecting a portion of the users of the network or all the users of the network. Thus the present method may store both the content and metadata for both known users of interest and users not currently of interest collected from the network, or any other combination desired by an analyst. Step 871 is implemented in FIG. 3 by receiving at a storage buffer 350, the collected data from a network via an access device, e.g., as provided by line cards 332-1 thru 332-t and via 1 G/10 G Ethernet I/F 336. Management of the portion of data stored is provided by control lines, not shown, in FIG. 2 that communicate to the analyst storage preferences to known user input block 204 to AMB, e.g., 302-A1, via data mediation engine 502. As shown in FIG. 7B, column “Y” has a “YES” for every row entry in the present embodiment, thus indicating that every data stream, whether known user or user not currently of interest would be recorded on the circular, or storage, buffer 350. In an optional embodiment, prioritization can be added to given known users and user not currently of interest that have higher likelihood of needing retained data. Thus, in table 700-B of FIG. 7B, rows 702, 708, 711, and 713 have a “YES-1” entry for column “Y” circular buffer, indicating that they have a longer retention time, e.g., overwriting only after a given quantity of cycles, an elapsed time, or a command from an analyst or the NMS system. The record ID and/or known user ID is stored along with the content and/or metadata in the storage buffer 350, so that the stored content and/or metadata may be retrieved at some later point per a request referencing the RID and/or TID.

Step 872 is for overwriting data on the circular buffer, which automatically occurs once the circular buffer capacity has been reached. While the present embodiment utilizes an overwrite protocol that overwrites data continuously on a first-in-first-out (FIFO) basis, the present disclosure is well-suited to a wide range of overwriting algorithms, with optional hierarchical and Pareto sequencing formats for more important data streams, e.g., for suspected but not actual known users. Step 872 is implemented for every AMB device on every network, or on prioritized AMB(s) on prioritized network(s). Thus, a given known user of interest may have fragmented data that is distributed across multiple storage buffers on multiple AMB engines.

Step 874 is for retrieving data from circular buffer 874. A request to retrieve data can be provided by an analyst or by an auto provisioning request. Once received, circular buffer will seek the oldest data for a requested known user or network user. Retained data of either content or metadata can be retrieved from circular buffer via known user ID, record ID, or other global search term. Optionally, circular buffer can be programmed to preserve critical data that would otherwise be overwritten, by selectively skipping over the desired data when overwriting new incoming data, either for either a prescribed or an indefinite time period. Additional circular storage buffers may be coupled to the 1 G/10 G interface so as to preserve the entire record of network communication at the occurrence of a serious security breach. Once requested to be retrieved, retained data can enter into the NMS similar to a real-time collected data stream on the first data path per connector “BB” back to FIG. 8B, e.g., via a 10 G line card 332-t transmitting via PIMS card 334 of FIG. 3 to data mediation block 502 of FIG. 5, where target mediation block would identify the new user of interest from LUT 700-A and tag the data stream for subsequent processing, such as processing per flowchart 800-E of a method for analysis and collection of data. Alternatively, if circular buffer is centrally located, then a single request to a single circular buffer will suffice to retrieve any existing data.

Referring now to FIG. 8E, a flowchart, continued via connector “DD” from either FIG. 8B, 8C, or 8D of a method of collecting and analyzing collected data is shown, according to one or more embodiments. Step 880 is for receiving processed data at a collection and analysis portion of the NMS. Step 880 is implemented by receiving and buffering on FTP server 604: content and meta data of known users and/or new users of interest from the scalable quantity of data processing engines, e.g., DPUs and DSUs, per FIG. 5 connector “F”; metadata from users not currently of interest, from MME & advanced targeting engine 402 connector “G;” and other relational data and metrics from any combination of first, second, and third data path.

Step 882 is for evaluating relational data between data streams of users at an analysis system for performing analysis, evaluation, feedback, and/or output to user interface. Step 882 is implemented via further processing methods including: link charts; dossier collection of metadata and/or content for a given record ID of a user not currently of interest or for a given known user ID or a given known user of interest comprising multiple known user IDs; social networking program for interactive processing of metadata or content of a given known user or user not currently of interest by an analyst with respect to other known users of interest or users not currently of interest; relational data analysis between multiple network users, whether known users of interest or users not currently of interest, using content and/or metadata; relationship and a degree of freedom, or degree of separation, graphing or tabulation between a plurality of network users, etc. on analysis tools platforms 608-1 to 608-r.

Step 886 is for displaying the data of the known user collected on the network on analysis GUI. Optionally, processed or analyzed data may be displayed on GUI for subsequent interface, feedback and instructions from the analyst. The analysis GUI is operable to receive commands from an analysis user in order to collect additional data, query the system, or add notes or other metadata regarding the known user or user not currently of interest.

Multi-Tenant and Multi-network usage of a single NMS is implemented by tracking and controlling access to known users, users not currently of interest and their data via an analyst ID vis-à-vis a known user ID and/or record ID, where the analyst ID specifies the administrative rights and privileges the analyst has on the NMS, e.g., to the known users they entered into the NMS or the known users of interest to which they have authority to access. Thus, the present disclosure allows a single NMS to manage multiple analysts while still maintaining strict security and confidentiality from other analysts. By not requiring a separate system for each analyst, substantial savings in cost and other resources can be realized.

While not illustrated in flowcharts, the methods, apparatus, and system herein can act as a single source to manage known users of interest or users not currently of interest, and their collected data for a plurality of analysts (multi-tenant).

Similarly, the methods, apparatus, and system herein can act as a single source to manage known users of interest and users not currently of interest, and their collected data on a plurality of networks (multi-network). This is accomplished by tracking and controlling access to known users and users not currently of interest and their data via a network ID vis-à-vis a known user ID, where the network ID can specify features such as data link types, individual network protocols, rules, and other requirements. Thus, the present disclosure allows a single NMS to manage multiple independent networks, can be realized while still maintaining strict security and confidentiality and compliance on a network by network basis.

A present embodiment of the disclosure utilizes flowcharts in FIGS. 8A-8E to illustrate functions of collecting, mediating, extracting metadata and analyzing both content and metadata, and storing and retrieving data on a network security system for an analyst seeking information on known users of interest and users not currently of interest exemplified from case tables in FIGS. 7A-7C. However, the present invention is useful for any other type of analyst, e.g., a corporate agent, an educational associate, or any other valid person or entity needing to gather and analyze information of a known user of interest or user not currently of interest on a communication system, seeking any kind of information, metric, or relationship.

For example, educational analysts could be any valid educator or student seeking studies on anonymous populations of users, on contractually consenting users, or other broad-based studies such as demographics. Finally, a valid person or entity needing information could include a private citizen performing a missing person or lost relative search.

Any of the above analysts could use the network security system for analyzing content of communications if authorized or if not regulated. Alternatively, any of the above analysts could use the network security system for analyzing metadata of communications, typically without any regulation issues as metadata is not usually regulated.

While fields and metrics utilized in case tables in FIGS. 7A-7C are for known users and users not currently of interest sought by an analyst the present invention is also applicable to a wide range of fields and metrics to be sought and tracked for known users or users not currently of interest for other analysts as well. Other fields and metrics could apply to many different analysts' needs and applications. For example, logistics of the communication such as time, date, location, attachments and names thereof, names of parties, etc. can apply to many different types of analysis. Other fields may be more applicable to a specific analyst's needs. For example, finance metrics for corporate security or marketing could include: financial transactions, product purchases, investments, psychological profiles, buying profiles, stock market transactions, consumer behavior, financial credit ratings, etc. Similarly, educational metrics e.g., case studies, etc.; personal and social networking, e.g., personal information and relationships, suggested connections, marketing, etc.; or any other application of content, metadata, and/or relationship metrics. The type of data gathered and analyzed is limited only by the existence of the data in the communications. Data can be used by the analyst for any valid temporal purpose whether for historical, contemporaneous, or a predictive future basis, and for any degree of resolution, whether for individuals, or different sizes of populations, and for factual data as well as stochastic variations and studies.

Referring now to FIG. 9, an illustration of partitioned memory for storing content, metadata, and analysis information for known users and users not currently of interest is shown, according to one or more embodiments. Memory block M1 covers data stored for known user “John Doe” from day 1 to day 7 from 6 am-6 pm, while block M2 covers data stored for known user “John Doe” from day 8 to day 14 from 6 am-6 pm. Block M3 covers data stored for known user “John Doe” from 6 pm-6 am from data 8 to day 14. By have a sufficient resolution in the data, and by segregating the stored data in partitions that consider the allowed days, times, known user types, etc. for a known user of interest, the data can then be stored, and shared among multiple analysts and thereby save memory and cost.

References to methods, systems, and apparatuses disclosed herein that are implementable in any means for achieving various aspects, and may be executed in a form of a machine-readable medium, e.g., computer readable medium, embodying a set of instructions that, when executed by a machine such as a processor in a computer, server, etc. cause the machine to perform any of the operations or functions disclosed herein. Functions or operations may include receiving, creating, aggregating, provisioning, transmitting, tagging, evaluating, distributing, storing, identifying, overwriting, retrieving, displaying, and the like.

The term “machine-readable” medium includes any medium that is capable of storing, encoding, and/or carrying a set of instructions for execution by the computer or machine and that causes the computer or machine to perform any one or more of the methodologies of the various embodiments. The “machine-readable medium” shall accordingly be taken to include, but not limited to, solid-state memories, optical and magnetic media, compact disc and any other storage device that can retain or store the instructions and information, e.g., only non-transitory tangible medium.

Exemplary computing systems, such as a personal computer, minicomputer, mainframe, server, etc. that are capable of executing instructions to accomplish any of the functions described herein include components such as a processor, e.g., single or multi-processor core, for processing data and instructions, coupled to memory for storing information, data, and instructions, where the memory can be computer usable volatile memory, e.g. random access memory (RAM), and/or computer usable non-volatile memory, e.g. read only memory (ROM), and/or data storage, e.g., a magnetic or optical disk and disk drive). Computing system also includes optional inputs, such as alphanumeric input device including alphanumeric and function keys, or cursor control device for communicating user input information and command selections to processor, an optional display device coupled to bus for displaying information, an optional input/output (I/O) device for coupling system with external entities, such as a modem for enabling wired or wireless communications between system and an external network such as, but not limited to, the Internet. Coupling of components can be accomplished by any method that communicates information, e.g., wired or wireless connections, electrical or optical, address/data bus or lines, etc.

The computing system is only one example of a suitable computing environment and is not intended to suggest any limitation as to the scope of use or functionality of the present technology. Neither should the computing environment be interpreted as having any dependency or requirement relating to any one or combination of components illustrated in the exemplary computing system. The present technology may be described in the general context of computer-executable instructions, such as program modules, being executed by a computer. Generally, program modules include routines, programs, objects, components, data structures, etc., that perform particular tasks or implement particular abstract data types. The present technology may also be practiced in distributed computing environments where tasks are performed by remote processing devices that are linked through a communications network. In a distributed computing environment, program modules may be located in both local and remote computer-storage media including memory-storage devices.

Other features of the present embodiments will be apparent from the accompanying drawings and from the detailed description that follows. In addition, it will be appreciated that the various operations, processes, and methods disclosed herein may be embodied in a machine-readable medium and/or a machine accessible medium compatible with a data processing system (e.g., a computer system), and may be performed in any order. Accordingly, the specification and drawings are to be regarded in an illustrative rather than a restrictive sense.

Claims

1. A network monitoring system comprising: an access device operative to: intercept data in transit over a computer network, andparse a data stream of the data in transit over the computer network based on an interception request made by an analyst to probe the computer network for a communication of a known user of interest; anda metadata processing engine coupled to the access device, wherein the metadata processing engine determines a new user of interest using metadata from a user not currently of interest in conjunction with metadata from the communication of the known user of interest, and wherein the metadata processing engine is operative to: accept the communication from the access device,evaluate the communication intercepted from the computer network for a relationship between the metadata of the communication of the known user of interest and the user not currently of interest,convert the user not currently of interest to a new user of interest based on the evaluation of the data retrieved from the computer network,automatically provision the new user of interest through enabling automatic generation of a second interception criteria to probe the computer network for a second communication of the new user of interest,communicate an identification (ID) for the new user of interest to the access device to enable the access device retrieve a second set of data that is in transit over the computer network based on the automatically generated second interception criteria to probe the computer network for the second communication of the new user of interest, andmonitor the computer network for the second set of data related to the new user of interest.
2. The network monitoring system of claim 1, wherein the metadata processing engine is operative to retrieve a content data of all data streams in the computer network for analysis and a metadata portion of all the data streams in the computer network for analysis.
3. The network monitoring system of claim 2, wherein the content data of all the data streams in the computer network and the metadata portion of all the data streams in the computer network are evaluated for metrics.
4. The network monitoring system of claim 1, wherein evaluation of a set of metadata from a set of communications of the user not currently of interest occurs in parallel to evaluation of the data from the known user of interest.
5. The network monitoring system of claim 1, wherein the metadata processing engine is further operative to: receive a metadata value of the known user of interest, andseek a metadata value associated with the user not currently of interest having a relationship to the metadata value of the known user of interest.
6. The network monitoring system of claim 1, wherein the metadata processing engine is further operative to: strip and discard a content portion of the parsed data stream.
7. The network monitoring system of claim 1, wherein the metadata processing engine is operative to transmit the metadata of the communication from the user not currently of interest to a graphical user interface (GUI) of a terminal of a law enforcement agency for analysis.
8. The network monitoring system of claim 7, wherein the metadata processing engine is operative to identify the user not currently of interest as the new user of interest to the law enforcement agency based on a relationship of the metadata associated with the user not currently of interest to any data of the known user of interest.
9. A method of monitoring data, the method comprising: retrieving data in transit over a computer network through an access device based on an interception request made by an analyst to probe the computer network for a communication of a known user of interest, the communication comprising content data and metadata;appending, through the access device, a detail about the communication to a header of a data packet of the communication, the detail about the communication comprising at least one of a known user ID of the known user of interest and an identification of the analyst authorized to analyze the content data of the communication;determining that the communication of the known user of interest includes metadata identifying a user not currently of interest;converting the user not currently of interest into a new user of interest based on the determination that the communication of the known user of interest includes the metadata identifying the user not currently of interest;communicating an ID for the new user of interest to the access device to enable the access device retrieve a new set of data that is in transit over the computer network; andmonitoring the computer network for the new set of data related to the new user of interest.
10. The method of claim 9, comprising retrieving a content data of all data streams in the computer network for analysis and a metadata portion of all the data streams in the computer network for analysis.
11. The method of claim 10, comprising evaluating the content data of all the data streams in the computer network and the metadata portion of all the data streams in the computer network for metrics.
12. The method of claim 9, comprising receiving and evaluating the metadata associated with the user not currently of interest automatically without input from the analyst.
13. The method of claim 9, further comprising: stripping and discarding a content portion of the retrieved data.
14. The method of claim 9, further comprising: receiving a metadata value of the known user of interest; andseeking a metadata value associated with the user not currently of interest having a relationship to the metadata value of the known user of interest.
15. The method of claim 14, further comprising: identifying the user not currently of interest as the new user of interest based on a relationship of the metadata of the user not currently of interest to any data of the known user of interest.
16. A network monitoring system comprising: an access device operative to: intercept data in transit over a computer network,parse a data stream of the data in transit over the computer network based on an interception request made by an analyst to probe the computer network for a communication of a known user of interest, the communication comprising content data and metadata, andappend, to a header of a data packet of the communication, a detail about the communication, the detail about the communication comprising at least one of a known user ID of the known user of interest and an identification of the analyst authorized to analyze the content data of the communication; anda metadata processing engine coupled to the access device, wherein the metadata processing engine determines a new user of interest using metadata from a user not currently of interest in conjunction with metadata from the communication of the known user of interest, and wherein the metadata processing engine is operative to: accept the communication from the access device,evaluate the communication intercepted from the computer network for a relationship between the metadata of the communication of the known user of interest and the user not currently of interest,convert the user not currently of interest to a new user of interest based on the evaluation of the data retrieved from the computer network,communicate an ID for the new user of interest to the access device, andmonitor the computer network for a new set of data related to the new user of interest.
17. The network monitoring system of claim 16, wherein the metadata processing engine is operative to retrieve a content data of all data streams in the computer network for analysis and a metadata portion of all the data streams in the computer network for analysis.
18. The network monitoring system of claim 17, wherein the content data of all the data streams in the computer network and the metadata portion of all the data streams in the computer network are evaluated for metrics.
19. The network monitoring system of claim 16, wherein the conversion of the user not currently of interest to the new user of interest on the computer network is performed automatically without an approval from the analyst.
20. The network monitoring system of claim 16, wherein the conversion of the user not currently of interest to the new user of interest is performed by algorithmic evaluation of the data from the computer network.
21. The network monitoring system of claim 16, further comprising: a network buffering system comprising a set of one or more storages to buffer the data in transit over the computer network such that a content portion of a data of the user not currently of interest is retained while the data of the user currently of interest is analyzed to determine whether the user not currently of interest should be the new user of interest.
22. The network monitoring system of claim 21, wherein the network buffering system is further operative to: halt within a first storage of the one or more storages an overwriting of an existing data upon sensing a critical security event that comprises at least one of sensing a key term and a key communication traffic from any one of the known user of interest, the user not currently of interest, and the new user of interest, andseamlessly transition a recording of a set of current communications in transit over the computer network to a second storage of the one or more storages.
23. The network monitored system of claim 16, wherein the metadata processing engine is further operative to: notify the analyst that the new user of interest has been added to the computer network, andrequest an approval from the analyst for the changing of status to the new user of interest, andwherein the device intercepts the data in transit over the computer network with at least one of a passive probe tapped into a junction on a line of the computer network and an active port of a network router.
24. The network monitoring system of claim 16, wherein the metadata processing engine is further operative to: withdraw the new user of interest from being monitored on the computer network if the analyst disapproves of the conversion of the user not currently of interest to the new user of interest, andchange a status of the ID of the new user of interest to that of the user not currently of interest in accordance with the withdrawal.
25. A method of provisioning a user to be monitored in a computer network, the method comprising: retrieving data in transit over the computer network through an access device based on an interception request made by an analyst to probe the computer network for a communication of a known user of interest;determining that the communication of the known user of interest includes metadata identifying a user not currently of interest;converting the user not currently of interest into a new user of interest based on the determination that the communication of the known user of interest includes the metadata identifying the user not currently of interest;automatically provisioning the new user of interest by automatically generating a second interception criteria to probe the computer network for a second communication of the new user of interest;communicating an ID for the new user of interest to the access device to enable the access device retrieve a second set of data that is in transit over the computer network based upon the automatically generated second interception criteria to probe the computer network for the second communication of the new user of interest; andmonitoring the computer network for the second set of data related to the new user of interest.
26. The method of provisioning of claim 25, wherein the data retrieved from the computer network to create the new user of interest is content data and metadata that is evaluated at a metadata processing engine coupled to the access device.
27. The method of provisioning of claim 25, further comprising: retrieving the second set of data in transit over the computer network from the access device based upon the second interception criteria to probe the computer network for the second communication of the new user of interest;determining that the second communication of the new user of interest includes a metadata identifying a different user not currently of interest; andconverting the different user not currently of interest into a second new user of interest based on the determination that the second communication of the new user of interest includes the metadata identifying the different user not currently of interest.
28. The method of provisioning of claim 27, further comprising: automatically provisioning the second new user of interest to generate a third interception criteria to probe the computer network for a third communication of the second new user of interest.
29. The method of provisioning of claim 25, comprising performing algorithmic evaluation of the data from the computer network to create the new user of interest on the computer network.
30. The method of provisioning of claim 29, wherein the performing of the algorithmic evaluation further comprises: constructing a link between the user not currently of interest and the known user of interest based on metadata associated with the user not currently of interest and based on any data of the known user of interest.
31. The method of provisioning of claim 28, further comprising: communicating a second ID for the second new user of interest to the access device to enable the access device retrieve a third set of data that is in transit over the computer network based upon the automatically generated third interception criteria to probe the computer network for the third communication of the second new user of interest.
32. The method of provisioning of claim 25, further comprising: notifying an analyst that the new user of interest has been added to the computer network; andrequesting an approval from the analyst for the addition.
33. The method of provisioning of claim 25, further comprising: withdrawing the new user of interest from being monitored on the computer network if the analyst disapproves of conversion of the user not currently of interest to the new user of interest; andchanging a status of the identification ID of the new user of interest to that of the user not currently of interest in accordance with the withdrawal.

REFERENCE TO RELATED APPLICATIONS

This application claims priority to provisional application Ser. No. 61/428,817 filed Dec. 30, 2010 and entitled: “Automatic Provisioning Of Targets For Interception On A Communication Network,” which applications is also incorporated by reference herein in its entirety.

US Referenced Citations (402)

Number	Name	Date	Kind
5185860	Wu	Feb 1993	A
5444850	Chang	Aug 1995	A
5475819	Miller et al.	Dec 1995	A
5675741	Aggarwal et al.	Oct 1997	A
5796952	Davis et al.	Aug 1998	A
5835580	Fraser	Nov 1998	A
5835720	Nelson et al.	Nov 1998	A
5862223	Walker et al.	Jan 1999	A
5878384	Johnson et al.	Mar 1999	A
5894311	Jackson	Apr 1999	A
5944790	Levy	Aug 1999	A
5954797	Sidey	Sep 1999	A
5958010	Agarwal et al.	Sep 1999	A
5987430	Van Horne et al.	Nov 1999	A
5996011	Humes	Nov 1999	A
6006260	Barrick, Jr. et al.	Dec 1999	A
6012088	Li et al.	Jan 2000	A
6055542	Nielsen et al.	Apr 2000	A
6055573	Gardenswartz et al.	Apr 2000	A
6078956	Bryant et al.	Jun 2000	A
6112240	Pogue et al.	Aug 2000	A
6115742	Franklin et al.	Sep 2000	A
6119164	Basche	Sep 2000	A
6134592	Montulli	Oct 2000	A
6148342	Ho	Nov 2000	A
6151631	Ansell et al.	Nov 2000	A
6182075	Hsu	Jan 2001	B1
6289341	Barney	Sep 2001	B1
6314460	Knight et al.	Nov 2001	B1
6317792	Mundy et al.	Nov 2001	B1
6321256	Himmel et al.	Nov 2001	B1
6321336	Applegate et al.	Nov 2001	B1
6321338	Porras et al.	Nov 2001	B1
6327619	Blumenau	Dec 2001	B1
6359557	Bilder	Mar 2002	B2
6373838	Law et al.	Apr 2002	B1
6377987	Kracht	Apr 2002	B1
6385024	Olson	May 2002	B1
6393460	Gruen et al.	May 2002	B1
6393461	Okada et al.	May 2002	B1
6393479	Glommen et al.	May 2002	B1
6404860	Casellini	Jun 2002	B1
6425007	Messinger	Jul 2002	B1
6442590	Inala et al.	Aug 2002	B1
6449604	Hansen et al.	Sep 2002	B1
6466981	Levy	Oct 2002	B1
6466984	Naveh et al.	Oct 2002	B1
6470386	Combar et al.	Oct 2002	B1
6487538	Gupta et al.	Nov 2002	B1
6507869	Franke et al.	Jan 2003	B1
6516345	Kracht	Feb 2003	B1
6564261	Gudjonsson et al.	May 2003	B1
6591251	Leon et al.	Jul 2003	B1
6606657	Zilberstein et al.	Aug 2003	B1
6658465	Touboul	Dec 2003	B1
6665715	Houri	Dec 2003	B1
6678720	Matsumoto et al.	Jan 2004	B1
6714977	Fowler et al.	Mar 2004	B1
6721726	Swaminathan et al.	Apr 2004	B1
6725377	Kouznetsov	Apr 2004	B1
6760761	Sciacca	Jul 2004	B1
6782421	Soles et al.	Aug 2004	B1
6792458	Muret et al.	Sep 2004	B1
6795856	Bunch	Sep 2004	B1
6804701	Muret et al.	Oct 2004	B2
6892226	Tso et al.	May 2005	B1
6925454	Lam et al.	Aug 2005	B2
6941321	Schuetze et al.	Sep 2005	B2
6957229	Dyor	Oct 2005	B1
6973577	Kouznetsov	Dec 2005	B1
6981047	Hanson et al.	Dec 2005	B2
6983317	Bishop et al.	Jan 2006	B1
6985901	Sachse et al.	Jan 2006	B1
7006508	Bondy et al.	Feb 2006	B2
7027398	Fang	Apr 2006	B2
7027416	Kriz	Apr 2006	B1
7031941	Garrow et al.	Apr 2006	B2
7039699	Narin et al.	May 2006	B1
7046247	Hao et al.	May 2006	B2
7047294	Johnson et al.	May 2006	B2
7050396	Cohen et al.	May 2006	B1
7055174	Cope et al.	May 2006	B1
7058704	Mangipudi et al.	Jun 2006	B1
7058976	Dark	Jun 2006	B1
7076275	Karstens et al.	Jul 2006	B1
7083095	Hendrick	Aug 2006	B2
7093020	McCarty et al.	Aug 2006	B1
7143151	Kayashima et al.	Nov 2006	B1
7152103	Ryan et al.	Dec 2006	B1
7152108	Khan et al.	Dec 2006	B1
7152242	Douglas	Dec 2006	B2
7171681	Duncan et al.	Jan 2007	B1
7203674	Cohen	Apr 2007	B2
7206835	Kusumoto et al.	Apr 2007	B2
7212491	Koga	May 2007	B2
7216110	Ogg et al.	May 2007	B1
7228566	Caceres et al.	Jun 2007	B2
7231448	O'Steen et al.	Jun 2007	B1
7246162	Tindal	Jul 2007	B2
7257722	Sone	Aug 2007	B2
7277938	Duimovich et al.	Oct 2007	B2
7277941	Ignatius et al.	Oct 2007	B2
7278037	Sone	Oct 2007	B2
7313625	Tindal et al.	Dec 2007	B2
7328242	McCarthy et al.	Feb 2008	B1
7346658	Simpson	Mar 2008	B2
7356576	Rabe	Apr 2008	B2
7359967	Synnestvedt et al.	Apr 2008	B1
7373399	Steele et al.	May 2008	B2
7376722	Sim et al.	May 2008	B1
7386613	Piccirilli et al.	Jun 2008	B2
7386883	Bardsley et al.	Jun 2008	B2
7406516	Davis et al.	Jul 2008	B2
7437444	Houri	Oct 2008	B2
7437761	Takahashi	Oct 2008	B2
7447909	Reith	Nov 2008	B2
7466690	Schrodi	Dec 2008	B2
7472412	Wolf et al.	Dec 2008	B2
7474617	Molen et al.	Jan 2009	B2
7478161	Bernet et al.	Jan 2009	B2
7490065	Ogg et al.	Feb 2009	B1
7496049	Estrada et al.	Feb 2009	B2
7506072	Waldorf et al.	Mar 2009	B2
7523191	Thomas et al.	Apr 2009	B1
7526541	Roese et al.	Apr 2009	B2
7535993	Cai et al.	May 2009	B2
7536459	Johnson et al.	May 2009	B2
7570743	Barclay et al.	Aug 2009	B2
7571237	Pfitzmann	Aug 2009	B2
7580356	Mishra et al.	Aug 2009	B1
7587453	Bhrara et al.	Sep 2009	B2
7587757	Scoggins et al.	Sep 2009	B2
7617160	Grove et al.	Nov 2009	B1
7624144	Mitrov	Nov 2009	B1
7627664	Sutou et al.	Dec 2009	B2
7631007	Morris	Dec 2009	B2
7636680	Gatto	Dec 2009	B2
7639613	Ghannadian et al.	Dec 2009	B1
7647406	Liu	Jan 2010	B2
7657540	Bayliss	Feb 2010	B1
7664974	Sone	Feb 2010	B2
7676570	Levy et al.	Mar 2010	B2
7698457	Ghetie et al.	Apr 2010	B2
7730120	Singh et al.	Jun 2010	B2
7747737	Apte et al.	Jun 2010	B1
7769851	Guruswamy et al.	Aug 2010	B1
7779073	Hoile et al.	Aug 2010	B2
7809826	Guruswamy	Oct 2010	B1
7835406	Oran et al.	Nov 2010	B2
7852849	Davidson et al.	Dec 2010	B2
7873719	Bishop et al.	Jan 2011	B2
7885194	Narin et al.	Feb 2011	B1
7886049	Adelstein et al.	Feb 2011	B2
7904478	Yu et al.	Mar 2011	B2
7904554	Lu et al.	Mar 2011	B1
7933926	Ebert	Apr 2011	B2
7941507	Murphy, Jr. et al.	May 2011	B1
7953851	Britton et al.	May 2011	B2
7958233	Gutierrez	Jun 2011	B2
7958267	Eiras et al.	Jun 2011	B1
7975046	Sheppard	Jul 2011	B2
7979521	Greaves et al.	Jul 2011	B2
7979529	Kreusch et al.	Jul 2011	B2
7984138	Bantz et al.	Jul 2011	B2
7996493	Hill	Aug 2011	B2
8001246	Lu et al.	Aug 2011	B2
8010085	Apte et al.	Aug 2011	B2
8010602	Shen et al.	Aug 2011	B2
8010689	Deninger et al.	Aug 2011	B2
8014303	Narin et al.	Sep 2011	B2
8015277	Brown et al.	Sep 2011	B2
8032701	Glade et al.	Oct 2011	B1
8041022	Andreasen et al.	Oct 2011	B1
8051130	Logan et al.	Nov 2011	B2
8051168	Boysko et al.	Nov 2011	B1
8055709	Singh et al.	Nov 2011	B2
8059790	Paterik et al.	Nov 2011	B1
8065247	Schlottmann	Nov 2011	B2
8077704	Yin et al.	Dec 2011	B2
8078679	Kajekar et al.	Dec 2011	B2
8090852	Ianchici et al.	Jan 2012	B2
8099500	Deason	Jan 2012	B2
8117314	Croft et al.	Feb 2012	B2
8127005	Gutierrez	Feb 2012	B2
8135134	Orsini et al.	Mar 2012	B2
8135833	Cancel et al.	Mar 2012	B2
8140319	Wasser	Mar 2012	B2
8145753	Inoue et al.	Mar 2012	B2
8156155	Yu et al.	Apr 2012	B1
8200809	Sheppard	Jun 2012	B2
8204884	Freedman et al.	Jun 2012	B2
8230056	Bishop et al.	Jul 2012	B2
8234368	Nielsen et al.	Jul 2012	B1
8244859	Ramakrishnan et al.	Aug 2012	B2
8281027	Martinez et al.	Oct 2012	B2
8281175	Blackburn et al.	Oct 2012	B2
8281360	Flewallen et al.	Oct 2012	B2
8316134	Tanimoto	Nov 2012	B2
8321515	Gailloux et al.	Nov 2012	B1
8327012	Nguyen et al.	Dec 2012	B1
8332477	Kaiserlian et al.	Dec 2012	B1
8332507	Wagh et al.	Dec 2012	B2
8352590	Sankaran et al.	Jan 2013	B2
8375118	Hao et al.	Feb 2013	B2
8380234	Kronander et al.	Feb 2013	B2
8380863	Natarajan et al.	Feb 2013	B2
8396075	Skoczkowski et al.	Mar 2013	B2
8407038	Bizzarri et al.	Mar 2013	B2
8407340	Zamora Cura	Mar 2013	B2
8416695	Liu et al.	Apr 2013	B2
8438089	Wasserblat et al.	May 2013	B1
8443041	Krantz et al.	May 2013	B1
8462160	Lindsay et al.	Jun 2013	B2
8468241	Raizen et al.	Jun 2013	B1
8468244	Redlich et al.	Jun 2013	B2
8478879	Brown et al.	Jul 2013	B2
8479212	Jamjoom et al.	Jul 2013	B2
8527577	Lu et al.	Sep 2013	B2
8542592	Moisand et al.	Sep 2013	B2
8542676	Lakhani et al.	Sep 2013	B2
8544023	Sim-Tang et al.	Sep 2013	B2
8572252	Ahuja et al.	Oct 2013	B2
8589516	Wheeler et al.	Nov 2013	B2
8595490	Von Mueller et al.	Nov 2013	B2
8599747	Saleem et al.	Dec 2013	B1
8620353	Kahn et al.	Dec 2013	B1
8621090	Bustamente	Dec 2013	B2
8626860	Gailloux et al.	Jan 2014	B1
8626901	Pugh et al.	Jan 2014	B2
8627479	Wittenstein et al.	Jan 2014	B2
8630836	Wasser	Jan 2014	B2
8630854	Marvit	Jan 2014	B2
8634423	Olding et al.	Jan 2014	B1
8645453	Cheng et al.	Feb 2014	B2
8655939	Redlich et al.	Feb 2014	B2
8661125	Avner et al.	Feb 2014	B2
8698872	Begeja et al.	Apr 2014	B2
8712019	Anchan et al.	Apr 2014	B2
8713453	Shahine et al.	Apr 2014	B2
8719896	Poulsen et al.	May 2014	B2
8725869	Reiner et al.	May 2014	B1
8756312	Malloy et al.	Jun 2014	B2
8769059	Chheda et al.	Jul 2014	B1
8782283	Attanasio	Jul 2014	B2
8793395	Cadiou et al.	Jul 2014	B2
8810577	De Pauw et al.	Aug 2014	B2
8812740	Li et al.	Aug 2014	B2
8813090	Jamjoom et al.	Aug 2014	B2
20010052081	McKibben et al.	Dec 2001	A1
20020026505	Terry	Feb 2002	A1
20020042821	Muret et al.	Apr 2002	A1
20020078382	Sheikh et al.	Jun 2002	A1
20020099818	Russell et al.	Jul 2002	A1
20020174235	Likourezos	Nov 2002	A1
20030023715	Reiner et al.	Jan 2003	A1
20030043820	Goringe et al.	Mar 2003	A1
20030059017	Cugalj et al.	Mar 2003	A1
20030065605	Gatto	Apr 2003	A1
20030074369	Schuetze et al.	Apr 2003	A1
20030120822	Langrind et al.	Jun 2003	A1
20030140131	Chandrashekhar et al.	Jul 2003	A1
20030214504	Hao et al.	Nov 2003	A1
20040022191	Bernet et al.	Feb 2004	A1
20040049693	Douglas	Mar 2004	A1
20040105424	Skoczkowski et al.	Jun 2004	A1
20040181599	Kreusch et al.	Sep 2004	A1
20040199623	Houri	Oct 2004	A1
20040202295	Shen et al.	Oct 2004	A1
20040215770	Maher, III et al.	Oct 2004	A1
20040243704	Botelho et al.	Dec 2004	A1
20040249938	Bunch	Dec 2004	A1
20040255126	Reith	Dec 2004	A1
20040267729	Swaminathan et al.	Dec 2004	A1
20050013259	Papoushado et al.	Jan 2005	A1
20050060102	O'Reilly et al.	Mar 2005	A1
20050076117	Hou et al.	Apr 2005	A1
20050174937	Scoggins et al.	Aug 2005	A1
20050210409	Jou	Sep 2005	A1
20050246419	Jaatinen	Nov 2005	A1
20060015613	Greaves	Jan 2006	A1
20060026268	Sanda	Feb 2006	A1
20060041660	Bishop et al.	Feb 2006	A1
20060064391	Petrov et al.	Mar 2006	A1
20060168332	Pfitzmann	Jul 2006	A1
20060230037	Sugiyama et al.	Oct 2006	A1
20070005713	LeVasseur et al.	Jan 2007	A1
20070055766	Petropoulakis et al.	Mar 2007	A1
20070118640	Subramanian et al.	May 2007	A1
20070156889	Bhrara et al.	Jul 2007	A1
20070203991	Fisher et al.	Aug 2007	A1
20070266145	Nesbitt et al.	Nov 2007	A1
20070299964	Wong et al.	Dec 2007	A1
20080028031	Bailey et al.	Jan 2008	A1
20080036767	Janzen	Feb 2008	A1
20080052392	Webster et al.	Feb 2008	A1
20080147623	Swaminathan et al.	Jun 2008	A1
20080162397	Zaltzman	Jul 2008	A1
20080183867	Singh et al.	Jul 2008	A1
20090077623	Baum et al.	Mar 2009	A1
20090132450	Schlottmann	May 2009	A1
20090150472	Devarakonda et al.	Jun 2009	A1
20090164629	Klein et al.	Jun 2009	A1
20090165142	Adelstein et al.	Jun 2009	A1
20090171960	Katzir	Jul 2009	A1
20090193037	Yu et al.	Jul 2009	A1
20090254572	Redlich et al.	Oct 2009	A1
20090254653	Kowa et al.	Oct 2009	A1
20100042545	Ogg et al.	Feb 2010	A1
20100057858	Shen et al.	Mar 2010	A1
20100071053	Ansari et al.	Mar 2010	A1
20100079464	Matsumura	Apr 2010	A1
20100086119	De Luca et al.	Apr 2010	A1
20100094910	Bayliss	Apr 2010	A1
20100095017	Ghetie et al.	Apr 2010	A1
20100115018	Yoon et al.	May 2010	A1
20100150138	Bjorsell et al.	Jun 2010	A1
20100169234	Metzger et al.	Jul 2010	A1
20100169479	Jeong et al.	Jul 2010	A1
20100182320	Cartan	Jul 2010	A1
20100199189	Ben-Aroya et al.	Aug 2010	A1
20100211672	Brown et al.	Aug 2010	A1
20100217837	Ansari et al.	Aug 2010	A1
20100228854	Morrison et al.	Sep 2010	A1
20100250497	Redlich et al.	Sep 2010	A1
20100281161	Cohn et al.	Nov 2010	A1
20100287286	Bustamente	Nov 2010	A1
20100309786	Moisand et al.	Dec 2010	A1
20100312884	Nandy et al.	Dec 2010	A1
20100312903	Miyata	Dec 2010	A1
20100318647	Savoor et al.	Dec 2010	A1
20100321183	Donovan et al.	Dec 2010	A1
20100333116	Prahlad et al.	Dec 2010	A1
20110010449	Andrews et al.	Jan 2011	A1
20110029667	Imbimbo et al.	Feb 2011	A1
20110030067	Wilson	Feb 2011	A1
20110047273	Young, Jr. et al.	Feb 2011	A1
20110161507	O'Sullivan et al.	Jun 2011	A1
20110173330	Gong et al.	Jul 2011	A1
20110182205	Gerdes et al.	Jul 2011	A1
20110206198	Freedman et al.	Aug 2011	A1
20110208859	Gutierrez	Aug 2011	A1
20110214187	Wittenstein et al.	Sep 2011	A1
20110252032	Fitzgerald et al.	Oct 2011	A1
20110252138	Ahuja et al.	Oct 2011	A1
20110270977	Ansiaux et al.	Nov 2011	A1
20110282981	Cutler et al.	Nov 2011	A1
20110283343	Jaeger et al.	Nov 2011	A1
20110289134	De Los Reyes et al.	Nov 2011	A1
20110296014	Cancel et al.	Dec 2011	A1
20120005331	Beattie, Jr. et al.	Jan 2012	A1
20120016715	Brown et al.	Jan 2012	A1
20120030729	Schwartz et al.	Feb 2012	A1
20120078708	Taylor et al.	Mar 2012	A1
20120084081	Melamed et al.	Apr 2012	A1
20120084288	Abdul-Razzak et al.	Apr 2012	A1
20120096145	Le et al.	Apr 2012	A1
20120110062	Savage et al.	May 2012	A1
20120117236	Fukuda et al.	May 2012	A1
20120131474	Panchadsaram et al.	May 2012	A1
20120143972	Malik et al.	Jun 2012	A1
20120143973	Niewerth	Jun 2012	A1
20120150955	Tseng	Jun 2012	A1
20120158955	Kim et al.	Jun 2012	A1
20120191854	Bharatia et al.	Jul 2012	A1
20120197976	Welingkar et al.	Aug 2012	A1
20120203847	Kendall et al.	Aug 2012	A1
20120210120	Irvine	Aug 2012	A1
20120210427	Bronner et al.	Aug 2012	A1
20120224021	Begeja et al.	Sep 2012	A1
20120239805	Savoor et al.	Sep 2012	A1
20120239809	Mazumdar et al.	Sep 2012	A1
20120254403	Imbimbo et al.	Oct 2012	A1
20120265824	Lawbaugh	Oct 2012	A1
20120266081	Kao	Oct 2012	A1
20120317196	Schigel et al.	Dec 2012	A1
20120324470	Jamjoom et al.	Dec 2012	A1
20120331126	Abdul-Razzak et al.	Dec 2012	A1
20130007129	German et al.	Jan 2013	A1
20130024506	Setton	Jan 2013	A1
20130054749	Yao et al.	Feb 2013	A1
20130061049	Irvine	Mar 2013	A1
20130091241	Goetz et al.	Apr 2013	A1
20130097308	Le et al.	Apr 2013	A1
20130145289	Abdul-Razzak et al.	Jun 2013	A1
20130155068	Bier et al.	Jun 2013	A1
20130159234	Xing et al.	Jun 2013	A1
20130162648	Abdul-Razzak et al.	Jun 2013	A1
20130191493	Le et al.	Jul 2013	A1
20130207980	Ankisettipalli et al.	Aug 2013	A1
20130262622	Li et al.	Oct 2013	A1
20130268443	Petrov et al.	Oct 2013	A1
20130275306	Ignatchenko et al.	Oct 2013	A1
20130293551	Erez et al.	Nov 2013	A1
20130304761	Redlich et al.	Nov 2013	A1
20130311557	Motes et al.	Nov 2013	A1
20140032170	De Pauw et al.	Jan 2014	A1
20140059024	Le et al.	Feb 2014	A1
20140082087	Bustamente	Mar 2014	A1
20140086102	Doddapaneni	Mar 2014	A1
20140149487	Dikmen et al.	May 2014	A1
20140150077	Shaibal et al.	May 2014	A1
20140222522	Chait	Aug 2014	A1

Non-Patent Literature Citations (6)

Entry
“Visualizing criminal relationships: comparison of a hyperbolic tree and a hierarchical list”, by Yang Xiang et al., Jul. 14, 2005 (pp. 15) http://ai.arizona.edu/intranet/papers/VisualizingCriminalRelationships.pdf.
“Securing Public Instant Messaging (IM) At Work”, by Nigel Williams, Joanne Ly, Jul. 2004 (pp. 43) http://caia.swin.edu.au/reports/040726A/CAIA-TR-040726A.pdf.
“Network Element Service Specification Template”, by S. Shenker et al., Sep. 1997 (pp. 22) http://tools.ietf.org/pdf/rfc2216.pdf.
“RSVP+: An Extension to RSVP”, by Silvano Gai et al., Jun. 1999 (pp. 18) http://tools.ietf.org/pdf/draft-sgai-rsvp-plus-00.pdf.
“Cellular access control and charging for mobile operator wireless local area networks”, by H. Haverinen et al., Jan. 14, 2003 (p. 1) http://ieeexplore.ieee.org/xpl/articleDetails.jsp?tp=&arnumber=1160081&url=http%3A%2F%2Fieeexplore.ieee.org%2Fxpls%2Fabs—all.jsp%3Farnumber%3D1160081.
“An Analysis of Anonymity in the Bitcoin System”, by Reid Fergal et al., May 7, 2012 (pp. 30) http://arxiv.org/pdf/1107.4524.pdf?origin=publication—detail.

Related Publications (1)

	Number	Date	Country
	20120259975 A1	Oct 2012	US

Provisional Applications (1)

	Number	Date	Country
	61428817	Dec 2010	US

Automatic provisioning of new users of interest for capture on a communication network

Information

Patent Number

Date Filed

Date Issued

Inventors

Original Assignees

Examiners

Agents

CPC

US Classifications

Field of Search

US

CPC

International Classifications

Term Extension