Patent application number | Description | Published |
20100295659 | IDENTIFYING RFID CATEGORIES - The set T of all categories in a population of RFID tags is estimated within a specified error bound. For each of one or more frames, a reader broadcasts a probability p, a multiplicity d, a frame size M, and a seed value R to the present tags. A deterministic algorithm on each tag, and known to the reader, calculates (i) whether the tag will transmit in this frame, and, if so, (ii) in which slots the tag will transmit a single “1.” When the tags have responded, the reader calculates set T by initially assuming that all possible categories are in set T and then eliminating those categories that would have transmitted in those slots in which no tag transmitted. Alternatively, the reader initially assumes that set T is empty, and adds those categories that would have transmitted in those slots in which one or more tags did transmit. | 11-25-2010 |
20100316051 | PACKET PROCESSING USING BRAIDED TRIES - Packets are processed (e.g., routed or classified) in accordance with a braided trie, which represents the combination of two or more different original tries (e.g., representing different forwarding/classification tables). The different tries are combined by twisting the mappings for specific trie nodes to make the shapes of the different tries more similar. Each node in the braided trie contains a braiding bit for at least one original trie indicating the mapping for that trie's node. Trie braiding can significantly reduce the number of nodes used to represent the different original tries, thereby reducing memory usage and improving scalability. Braided tries can be used for such applications as virtual routers and packet classification in which different forwarding/classification tables are represented by a single braided trie stored in shared memory. | 12-16-2010 |
20110044201 | LINE-RATE, REAL-TIME-TRAFFIC DETECTOR - A line-rate, real-time-traffic detector classifies a network traffic flow as real-time when it determines the smoothness of the packet arrival rate of the network traffic flow is bounded by an empirically derived bound. In some embodiments, to improve performance, a tighter smoothness bound is applied to the smoothness calculations performed on a first set of packet arrival times, while a looser smoothness bound is applied to a second set of packet arrival times, the second set inclusive of and larger than the first. | 02-24-2011 |
20120136846 | METHODS OF HASHING FOR NETWORKS AND SYSTEMS THEREOF - Example embodiments are directed to methods of hashing for networks and systems thereof. At least one example embodiment provides a method of processing elements in a system. The method includes receiving a first element, generating a first plurality of hash values based on the first element and a first plurality of hash functions, determining a first plurality of buckets in a table based on the first plurality of hash values, each of the first plurality of buckets associated with a different one of the hash values, selecting one of the first plurality of buckets, storing a first associated value in the selected bucket, the first associated value being associated with the first element, and encoding an identifier (ID) of the hash function generating the hash value associated with the selected bucket into a filter based on the hash value. | 05-31-2012 |
20130204903 | PROBABILISTIC FINGERPRINT CHECKING FOR PREVENTING DATA LEAKAGE - A data-leakage prevention capability is presented herein. The data-leakage prevention capability prevents leakage of data, of a file set having a plurality of files, from a secure network using online fingerprint checking of data flows at a boundary of the secure network. The online fingerprint checking is performed using a set of data structures configured for the file set. The data structures for the file set are configured based on file set characteristics information of the file set and a target detection lag indicative of a maximum number of bits within which a data leakage event for the file set is to be determined. The data structure configuration is computed for a plurality of data structures configured for use in monitoring the files of the file set. The data structure configuration includes a plurality of data structure locations and data structure sizes for the respective plurality of data structures. | 08-08-2013 |
20130275669 | APPARATUS AND METHOD FOR MEETING PERFORMANCE METRICS FOR USERS IN FILE SYSTEMS - A data block storage management capability is presented. A file system includes a plurality of data blocks which are managed using a first storage service and a second storage service, where the first storage service has a lower storage cost and a higher input-output cost than the second storage service. The data blocks stored using the second storage service have associated therewith respective expected storage durations indicative of respective lengths of time for which the data blocks are to be stored using the second storage service (which may be the same or different across the ones of the data blocks stored using the second storage service). The expected storage durations of the data blocks are modified based on a comparison of an expected hit rate of the second storage service and a current hit rate of the second storage service or current hit rates of the data blocks. | 10-17-2013 |
20140067994 | REDUCING COSTS RELATED TO USE OF NETWORKS BASED ON PRICING HETEROGENEITY - A capability is provided for reducing the costs of data transfers for networks using pricing heterogeneity. For data to be transferred between an application of a first network and a user device, the data may be transferred directly without using a second network or indirectly using a second network including a transfer of the data between the first network and the second network. In a network-based file system, a first network is primarily used for write requests and a second network is primarily used for read requests, and a data block is transferred from the first network to the second network based on a determination that a threshold number of read requests for the data block have been received. The determination as to when to transfer data between networks may be determined based on various costs associated with the networks. | 03-06-2014 |
20140089510 | JOINT ALLOCATION OF CLOUD AND NETWORK RESOURCES IN A DISTRIBUTED CLOUD SYSTEM - A capability is provided for allocating cloud and network resources in a distributed cloud system including a plurality of data centers. A request for resources is received. The request for resources includes a request for cloud resources and an indication of an amount of cloud resources requested. The request for resources also may include a request for network resources or one or more constraints. A set of feasible resource mappings is determined based on the request for resources and information associated with the distributed cloud system. A resource mapping to use for the request for resources is selected from the set of feasible resource mappings. The selected resource mapping includes a mapping of the requested cloud resources to cloud resources of one or more of the data centers and an identification of network resources configured to support communications for the cloud resources of the one or more data centers. | 03-27-2014 |
20140188656 | DETERMINING COST OPTIMIZATION BASED ON CONSTRAINTS ON SKI-RENTAL PROBLEMS - A constrained ski-rental problem is defined. In the constrained ski-rental problem, a determination as to whether a first action having a first cost associated therewith or a second action having a second cost associated therewith is more cost effective is performed based on moment information associated with events related to the first action or the second action. The moment information may include a moment of the occurrences distribution of events related to the first and second actions. The moment information may include a moment of a number of occurrences of events related to the first and second actions, a moment of the inter-event times of occurrences of events related to the first and second actions, or the like. The moment information may include a first moment, a second moment, or the like. | 07-03-2014 |