Patent application number | Description | Published |
20100014424 | DISCOVERING NETWORK TOPOLOGY FROM ROUTING INFORMATION - A method for inferring network link topology includes receiving an address of a seed node in a network, initializing a set of links and monitors of the network, refining, iteratively beginning at the seed node, the set of links and monitors of the network, wherein a local topology of links is inferred from routing information of a current node and a remote topology of links is inferred from routing information of the set of monitors, wherein the set of monitors is created from the local topology of links, and outputting the topology of links including the local and remote topology of links as a topology of the network. | 01-21-2010 |
20100091685 | Method and System for Deducing Network Routes by Querying Routers - A method and system for detecting and correcting invalid network paths in a network having a plurality of routers and a set of global invariant rules imbedded in the network including querying a subset of a routing table data structure defining network paths wherein said subset includes a plurality of routing table entries and comparing a network routing table entry with an earlier network routing table entry for the same node. The method and system also includes detecting inconsistencies between the newer network routing table entry and the earlier network routing table entry, and invalidating the network entries of the older network routing table that are inconsistent with the newer entries. The method and system also includes reconstructing the routing structure by replacing the invalidated network routing table entries with new routing table entries that minimize violation of the invariant protocols. | 04-15-2010 |
20100332991 | Increasing Resilience of a Network Service - A set of data is obtained, representing a graph of a computer network having a set of hardware nodes and a set of hardware links between the hardware nodes. The hardware links are represented as edges in the graph. A first subset (for example, a vertex cut set) of the set of hardware nodes is found, such that those of the hardware nodes in the first subset are able to withstand a maximum number of failures before the graph disconnects. The failures include node failures and/or edge failures. The hardware nodes in the first subset are ranked based on expected resiliency, to obtain a ranked list. Optionally, in case of a tie between two or more of the hardware nodes in the ranked list, the tie is broken using a sum of shortest path metric. | 12-30-2010 |
20110218920 | METHOD AND SYSTEM FOR PROVENANCE TRACKING IN SOFTWARE ECOSYSTEMS - A system and method for tracking provenance for software use and development includes a developer toolkit program stored in memory media and accessible by a software market place wherein the software marketplace provides a library of software bundles that can be used for software development and modification of the software bundles. The developer toolkit includes a user interface configured to enable software creation of original works and derivative works. The development toolkit further includes a provenance tracker configured to track provenance of the derivative works and original works wherein the provenance tracker makes the derivative work and the provenance of the derivative work available in the software market place. The provenance tracker includes a software bundle identification module configured to identify and verify ownership of the original works and derivative works by associating an owner of the derivative works and original works with features included in portions of the derivative works and original works. | 09-08-2011 |
20110292834 | Maintaining Time Series Models for Information Technology System Parameters - A network-centric modeling mechanism is provided for updating network models in order to mitigate network issues. The network-centric modeling mechanism determines for each component in a plurality of components whether a system parameter in a set of parameters particular to the component has deviated from a predicted system parameter value in a set of predicted system parameter values past a predetermined threshold. Responsive to the system parameter deviating from the predicted system parameter value past the predetermined threshold, the network-centric modeling mechanism generates an event stream indicating a sufficient deviation. The network-centric modeling mechanism determines whether the event stream matches a previous pattern. Responsive to identifying the previous pattern that matches the event stream, the network-centric modeling mechanism preemptively mitigates any related issues in the component or in a related component in the plurality of components using topology-aware indices associated with the previous pattern. | 12-01-2011 |
20120047103 | System and method for secure information sharing with untrusted recipients - System, method and computer program product for modelling information sharing domains as Partially Observable Markov Decision Processes (POMDP), and that provides solutions that view the information sharing as a sequential process where the trustworthiness of the information recipients is monitored using data leakage detection mechanisms. In one embodiment, the system, method and computer program product performs (i) formulating information sharing decisions using Partially Observable Markov Decision Processes combined with a digital watermarking leakage detection mechanism, and (ii) deriving optimal information sharing strategies for the sender and optimal information leakage strategies for a recipient as a function of the efficacy of the underlying monitoring mechanism. By employing POMDPs in information sharing domains, users (senders) can maximize the expected reward of their data/information sharing actions. | 02-23-2012 |
20120066167 | Assessing Trust in Information Sources - Techniques for assessing trust in information are provided. The techniques include collecting information from one or more information sources, detecting one or more inconsistencies in one or more statements from the information collected from the one or more sources, assigning a penalty to each information source involved in an inconsistency and a reward for each statement not involved in any inconsistencies, and using each assigned penalty and reward to perform an aggregation to assess trust in the collected information. | 03-15-2012 |
20120239797 | RECONCILING NETWORK MANAGEMENT DATA - Network management data is managed by determining that a first version and a second version of a set of network management data have been created. The set of network management data is associated with a plurality of managed entities in a network. First and second network graphs are created based on the first version and second version of the set of network management data, respectively. The first and second network graphs include a first and second set of entities in the plurality of managed entities, respectively. A similarity metric is assigned between at least one or more entities in the first and second set of entities. At least a first entity in the first set of entities and at least a second entity in the second set of entities are determined to be identical entities based on the similarity metric being one of equal to and above a first given threshold. | 09-20-2012 |
20120297008 | CACHING PROVENANCE INFORMATION - Techniques are disclosed for caching provenance information. For example, in an information system comprising a first computing device requesting provenance data from at least a second computing device, a method for improving the delivery of provenance data to the first computing device, comprises the following steps. At least one cache is maintained for storing provenance data which the first computing device can access with less overhead than accessing the second computing device. Aggregated provenance data is produced from input provenance data. A decision whether or not to cache input provenance data is made based on a likelihood of the input provenance data being used to produce aggregated provenance data. By way of example, the first computing device may comprise a client and the second computing device may comprise a server. | 11-22-2012 |
20120327087 | SUPPORTING RECURSIVE DYNAMIC PROVENANCE ANNOTATIONS OVER DATA GRAPHS - Systems and methods are provided for supporting dynamic provenance annotations over data graphs. A method includes receiving a plurality of dynamic graphs representing dynamic provenance data. The method further includes evaluating a provenance query over the plurality of dynamic graphs to obtain an answer to the provenance query. The method additionally includes providing the answer to the provenance query to a user, using at least a display device. | 12-27-2012 |
20130208888 | MANAGING CONTENT DISTRIBUTION IN A WIRELESS COMMUNICATIONS ENVIRONMENT - A method, system and computer program product for managing content distribution in a mobile communications environment. The communications environment includes a core network and a multitude of end-user devices. In one embodiment, the method comprises downloading content from the core network to the end-user devices; and maintaining a map between the end-user devices, the content downloaded to the end-user devices, and the locations of the end-user devices. When a first of the end-user devices requests a specified content, this map and one or more rules are used to identify a second of the end-user devices having the specified content. The first of the end-user devices fetches the specified content from this identified second of the end-user devices. In one embodiment, object location descriptors embedded in the content are rewritten when the content is downloaded to the end-user devices. | 08-15-2013 |
20130237186 | SERVING TIME CRITICAL INFORMATION TO MOBILE DEVICES - A method, system and computer program product for disseminating information to mobile communication devices from a content provider via a core network. In an embodiment, the content provider sends specified information to the core network, and the content provider sends an information dissemination policy and a time release policy to the core network. The core network determines a time distribution plan for disseminating the specified information, and disseminates the specified information to one or more of the mobile communication devices in accordance with the dissemination policy from the content provider and the time distribution plan. The core network enables the one or more of the mobile devices to release the specified information to a user or users of the one or more of the mobile devices in accordance with the time release policy from the content provider. | 09-12-2013 |
20130298175 | CONSTRUCTING A CUSTOMIZED MESSAGE IN A VIDEO-ON-DEMAND SERVICE - A method, system and computer program product for creating a customized message in a video-on-demand service, in which a user accesses the service using a communications device. In an embodiment, the method comprises using a video-on-demand server to intercept the access by the user of the video-on-demand service, obtain information about video content of a local cache of the video-on-demand service, obtain a profile of the user, and identify a context of the user. A customized message is constructed for the communications device based on the information about the local cache, the profile of the user, and the context of the user. The video-on-demand server sends the customized message to the communications device. In one embodiment, the user accesses the video-on-demand service through an edge base station of a core network, and the video-on-demand server is in this base station of the core network. | 11-07-2013 |
20130318300 | Byte Caching with Chunk Sizes Based on Data Type - Methods and apparatus are provided for performing byte caching using a chunk size based on the object type of the object being cached. Byte caching is performed by receiving at least one data packet from at least one network node; extracting at least one data object from the at least one data packet; identifying an object type associated with the at least one data packet; determining a chunk size associated with the object type; and storing at least a portion of the at least one data packet in a byte cache based on the determined chunk size. The chunk size of the object type can be determined, for example, by evaluating one or more additional criteria, such as network conditions and object size. The object type may be, for example, an image object type; an audio object type; a video object type; and a text object type. | 11-28-2013 |
20140013057 | OBJECT TYPE AWARE BYTE CACHING - One or more embodiments perform byte caching. At least one data packet is received from at least one network node. At least one data object is received from the at least one data packet. An object type associated with the at least one data object is identified. The at least one data object is divided into a plurality of byte sequences based on the object type that is associated with the at least one data object. At least one byte sequence in the plurality of byte sequences is stored into a byte cache. | 01-09-2014 |
20140067989 | CACHING PROVENANCE INFORMATION - Techniques are disclosed for caching provenance information. For example, in an information system comprising a first computing device requesting provenance data from at least a second computing device, a method for improving the delivery of provenance data to the first computing device, comprises the following steps. At least one cache is maintained for storing provenance data which the first computing device can access with less overhead than accessing the second computing device. Aggregated provenance data is produced from input provenance data. A decision whether or not to cache input provenance data is made based on a likelihood of the input provenance data being used to produce aggregated provenance data. By way of example, the first computing device may comprise a client and the second computing device may comprise a server. | 03-06-2014 |
20140080457 | INFORMATION SHARING FOR THIRD PARTY APPLICATIONS IN CELLULAR TELECOMMUNICATION INFRASTRUCTURES - A method, system and computer program product are disclosed for providing content to a communications device. In an embodiment of the invention, a communications network receives a first content portion from a content provider and sends the first content portion to the communications device. The communications network also sends a second content portion to the communications device, and this second content portion is customized for the user of the communications device based on selected information about the user that the communications network has. In one embodiment, the communications network uses the selected information about the user to customize the second content portion for the user, and sends the customized second content portion to the communications device. In an embodiment, the communications network sends the selected information to the content provider, and the content provider uses the selected information to customize the second content portion. | 03-20-2014 |
20140143444 | SAVING BANDWIDTH IN TRANSMISSION OF COMPRESSED DATA - A method, system and computer program product for transmitting content across a link in a communications network. In an embodiment, the method comprises examining traffic in the network at a sender end of the link to determine if the traffic is carrying compressed content; when the traffic is carrying compressed content, decompressing at least one portion of the compressed content; and checking a cache to determine if the cache has content matching the at least one decompressed portion of the content. In an embodiment, the method further comprises when the cache has content matching the at least one decompressed portion of the content, determining an identifier associated with the at least one decompressed portion of the content; and using the identifier to reconstruct, at a receiving end of the link, the at least one decompressed portion of the content. In one embodiment, the at least one decompressed portion of the content from the traffic is replaced with an index, the index is compressed to form the associated identifier, and the associated identifier is sent to the receiving end of the link. | 05-22-2014 |
20140266819 | COMPACTLY STORING GEODETIC POINTS - Mechanisms are provided for the compact storage of geographical geometries as a collection of points, where individual points are encoded as binary/ternary strings (with the property that points closer to each other share a longer binary/ternary prefix) and the geometry is encoded by compressing the binary/ternary representation of common-prefix points. Mechanisms are also provided for the representation of a geometry using a ternary string that allows efficient storage of arbitrary shapes (e.g., long line segments, oblong polygons) as opposed to binary representations that are more efficient when the geometries are square or nearly square shaped. | 09-18-2014 |
20140278228 | MAPPING UNCERTAIN GEOMETRIES TO GRATICULES - A geohash based cover for a geometry whose uncertainty is described as a circle with center point and a radius is disclosed. In one example, a geohash cover is computed that does not require any expensive geodesic calculations, providing roughly an order of magnitude improvement in speed up of cover calculation. In another example, distance computations are exact compared to a conventional process. In another example, the geohashes returned by the technique can vary between 4 to 9—with a median 6 (a certain conventional process would always return 9 hashes (all the 8 neighbors and the self geohash)). In another example, results are accurate, while still avoiding expensive geodesic computations. | 09-18-2014 |
20140279970 | COMPACTLY STORING GEODETIC POINTS - Mechanisms are provided for the compact storage of geographical geometries as a collection of points, where individual points are encoded as binary/ternary strings (with the property that points closer to each other share a longer binary/ternary prefix) and the geometry is encoded by compressing the binary/ternary representation of common-prefix points. Mechanisms are also provided for the representation of a geometry using a ternary string that allows efficient storage of arbitrary shapes (e.g., long line segments, oblong polygons) as opposed to binary representations that are more efficient when the geometries are square or nearly square shaped. | 09-18-2014 |
20140328207 | DISCOVERING NETWORK TOPOLOGY FROM ROUTING INFORMATION - A method for inferring network link topology includes receiving an address of a seed node in a network, initializing a set of links and monitors of the network, refining, iteratively beginning at the seed node, the set of links and monitors of the network, wherein a local topology of links is inferred from routing information of a current node and a remote topology of links is inferred from routing information of the set of monitors, wherein the set of monitors is created from the local topology of links, and outputting the topology of links including the local and remote topology of links as a topology of the network. | 11-06-2014 |
20140364096 | INFORMATION SHARING FOR THIRD PARTY APPLICATIONS IN CELLULAR TELECOMMUNICATION INFRASTRUCTURE - A method, system and computer program product are disclosed for providing content to a communications device. In an embodiment of the invention, a communications network receives a first content portion from a content provider and sends the first content portion to the communications device. The communications network also sends a second content portion to the communications device, and this second content portion is customized for the user of the communications device based on selected information about the user that the communications network has. In one embodiment, the communications network uses the selected information about the user to customize the second content portion for the user, and sends the customized second content portion to the communications device. In an embodiment, the communications network sends the selected information to the content provider, and the content provider uses the selected information to customize the second content portion. | 12-11-2014 |
20140379628 | PRIVACY RISK METRICS IN LOCATION BASED SERVICES - The present disclosure relates generally to mechanisms for the estimation of location privacy risk, comprising: building one or more trajectory models from auxiliary information (e.g., one or more maps, one or more routes); capturing common behavioral patterns (e.g., shortest route(s),/fastest route(s)); identifying, given unlinked trajectories for a plurality of users, most likely linkages using the trajectory model(s); eliminating one or more unlikely linkages based on deviation from the shortest route(s) and/or the fastest route(s); measuring privacy as the percentage of linkages correctly identified; and outputting the measured privacy. | 12-25-2014 |
20150046452 | GEOTAGGING UNSTRUCTURED TEXT - Mechanisms are described to extract location information from unstructured text, comprising: building a language model from geo-tagged text; building a classifier for differentiating referred and physical location; given unstructured text, identifying referred location using the language model (that is, the location to which the unstructured text refers); given the unstructured text, identifying if referred location is also the physical location using the classifier; and predicting (that is, performing calculation(s) and/or estimation(s) of degree of confidence) of referred and physical location. | 02-12-2015 |