At+t Corp.

Emc Corporation

Emc IP Holding Company LLC

Other

Cisco Technology, Inc.

At&t Intellectual Property I, L.p.

Anurag Singh Maunder

Christos Tryfonas

Sudhakar Muddu

Gerald Richard Ash

Saul Daniel Fishman

Jiayu Chen

Gagan Choudhury

Amnon Naamad

Ron Bigman

Kuram T Narayana

John Joseph Williams, Jr

Ajay K Jain

Thomas Dejanovic

Muddu Sudhakar

Brad Corey Maltz

Sathyanarayaman Kavacheri

The invention relates generally to a method and system that provides robust metric reporting based on analysis of computer vision derived-video data. The invention utilizes learning-based methods for object identification, object localization, and contextual analysis in order to generate insights into, for example, efficiency, productivity, design and planning, and health and safety compliance in a workflow environment.

Method and system for using learning to generate metrics from computer vision-derived video data

A method, computer program product, and computing system for defining one or more computing system requirements for desired data storage array. One or more design criteria is defined for the desired data storage array. At least one recommended data storage array is identified for the desired data storage array based, at least in part, upon the one or more computing system requirements and the one or more design criteria.

Recommendation system and method

Described are techniques for determining data storage system configurations. Inputs are provided to a data storage system configuration generator. The inputs include first inputs and second inputs. The first inputs include a performance objective, a storage capacity, and input(s) characterizing an I/O workload. The second inputs characterize performance of data storage system components and costs of the data storage system components. First processing is performed by the data storage system configuration generator in accordance with the inputs to determine a set of one or more candidate data storage system configurations. The data storage system configuration selects, in accordance with one or more criteria, a first candidate data storage system configuration from the set.

Techniques for determining a storage configuration

A system for managing file movement between a first storage and a second storage is disclosed. The system may include a set of file manager nodes connected to the first storage and the second storage. The set of file manager nodes may be configured to move a first set of files from the first storage to the second storage based on at least the content of the first set of files.

Systems and methods for managing file movement

A system for facilitating management of content data contained in a plurality of files is disclosed. The system may include a data discovery program configured to scan context data pertaining to the content data. The system may also include logic (or a service profile program) configured to determine one or more service profiles. The one or more service profiles may be selected and/or determined by a user or determined based on one or more rules and the current state of the context data. The one or more service profiles may define one or more services to be performed on at least one of one or more files among the plurality of files and at least a portion of the content data and/or the context data.

Systems and methods for facilitating management of data

A system for facilitating data discovery on a network, wherein the network has one or more data storage devices. The system may include a crawler program configured to select at least a first set of files and a second set of files, each of the first set of files and the second set of files being stored in at least one of the one or more data storage devices. The system may also include a data fetcher program configured to obtain a copy of the first set of files, the data fetcher program being further configured to resist against obtaining a copy of the second set of files. The system may also include circuit hardware implementing one or more functions of one or more of the crawler program and the data fetcher program.

Systems and methods for facilitating data discovery

A method for handling files to timely provide reports concerning the files is disclosed. The method may include crawling (or enumerating) the files, to figure out how many files/data are to be processed and/or how much processing work is to be performed. The method may also include processing the files in batches. Identification information (e.g., filenames, file paths, and/or object identifiers) pertaining to the files may be sent to one or more queues for batch processing of the files. The method may further include generating a report after processing of a batch among the batches is completed. The report may be generated before subsequent processing of a subsequent batch is completed.

Systems and methods for handling data

What is disclosed includes a method for searching objects in response to a query that includes a first set of criteria pertaining to a first index, a second set of criteria pertaining to a second index, and logic joining the first set of criteria and the second set of criteria. The method includes querying the first and second indexes based on the first and second set of criteria, respectively, to obtain a first set of first-identifier values and a first set of second-identifier values, respectively. The method also includes correlating the first set of second-identifier values with a set of unique-identifier values and/or a second set of first-identifier values. The method also includes using the logic and, the set of unique-identifier values, and/or the second set of first-identifier values to determine a set of matched objects.

Systems and methods for facilitating searches involving multiple indexes

A system for performing integrated searches and actions is disclosed. The system may include a search engine configured to generate a search result or report in response to a search query. The system may also include a queue manager coupled with the search engine. The queue manager may be configured to receive the search result or report from the search engine. The queue manager may also be configured to assign files in the search result or report to one or more service provider queues according to an action profile. The system may also include one or more nodes coupled with the one or more service provider queues. The one or more nodes may be configured to perform one or more actions on one or more files in the one or more service provider queues according to the action profile.

Systems and methods for performing integrated searches with actions

The present invention concerns a technique for providing Class-of-Service Routing in an ATM network () that utilizes the Private Network-Network Interface (PNNI) protocol. An originating node seeking to route a call to a terminating node does so by initially determining the class-of-service and then selecting a shortest length path there-between. Each successive link on the selected path is examined for sufficient available bandwidth and available depth (i.e., bandwidth not reserved for other services) for the Class-of-Service of the call. If every link possesses sufficient available bandwidth, then the call passes on the selected path. Otherwise, should a link on the selected path lack sufficient bandwidth and available depth, then a crankback message is sent to the originating node, and the originating node selects the next shortest path. Thereafter, the process of examining each link for sufficient bandwidth is repeated. If no path is found, the call is ultimately blocked.

PNNI-based mult-link shortest path class-of service routing technique

A node in a network running a link-state routing protocol identifies certain routing control messages and stores the identified messages in separate queues. The queues are weighted such that each message type is allotted a predetermined amount of processing overhead to optimize the message processing by a node. In one embodiment, the node processor processes the queued messages in accordance with the entries in a weighted round robin polling table. An upper limit of processing time can be specified for each visit to a particular message queue.

Link state network having weighted control message processing

Traffic information is accumulated and flow control information distributed in a packet switching system. Traffic information is collected in multiple elements, which forward in a coordinated fashion to collecting elements indications of congestion and other types of information. The collecting elements manipulate the received indications and generate flow control messages which are sent to individual sending components of the packet switching system. In one implementation, a switching element maintains for each destination a count of packets within itself which are addressed to the particular destination. An indication of a portion of this collected information is included in a packet header forwarded from each of the elements each packet time. Each of the elements are assigned a different offset, such that they send an indication of a different portion of their collected information, so a view of the traffic conditions and/or buffer occupancies within a packet switching system is efficiently produced.

Method and apparatus for accumulating and distributing traffic and flow control information in a packet switching system

A network utilizing a link-state protocol includes a plurality of nodes with associated trunks that recover in a staggered manner. A first trunk associated with a first node is selected for recovery. After the first trunk is recovered, further trunks are selected such that N or less trunks recover at the same time until all trunks associated with the first node are selected for recovery. Node recovery is staggered at selected intervals to minimize or eliminate overload conditions. Staggered recovery in accordance with the present invention can reduce the likelihood of trunk loss due to excessive HELLO messages in an OSPF system and retransmission and retransmission lockout.

Network protocol having staggered recovery

The present invention concerns a technique for providing Class-of-Service Routing in an ATM network ( ) that utilizes the Private Network-Network Interface (PNNI) protocol. An originating node seeking to route a call to a terminating node does so by initially determining the class-of-service and then selecting a shortest length path there-between. Each successive link on the selected path is examined for sufficient available bandwidth and available depth (i.e., bandwidth not reserved for other services) for the Class-of-Service of the call. If every link possesses sufficient available bandwidth, then the call passes on the selected path. Otherwise, should a link on the selected path lack sufficient bandwidth and available depth, then a crankback message is sent to the originating node, and the originating node selects the next shortest path. Thereafter, the process of examining each link for sufficient bandwidth is repeated. If no path is found, the call is ultimately blocked.

Growing community of inventors

Fremont, CA, United States of America

Anurag Singh Maunder