Abstract:
A data model represents semantic information associated with objects stored in a file system. The data model includes a first object identifier, a second object identifier and a relation identifier. The first object identifier identifies a first object stored in the file system. The second object identifier identifies a second object stored in the file system, wherein the second object is related to the first object. The relation identifier identifies a relationship between the first object and the second object.
Abstract:
Services are provided via a multicast tree. A request to receive a service is received at a node. Stored information at the node is searched to identify a service path or a service node operable to provide the requested service.
Abstract:
Services are provided via a multicast tree. A request to receive a service is received at a node. Stored information at the node is searched to identify a service path or a service node operable to provide the requested service.
Abstract:
A data model represents semantic information associated with objects stored in a file system. The data model includes a first object identifier, a second object identifier and a relation identifier. The first object identifier identifies a first object stored in the file system. The second object identifier identifies a second object stored in the file system, wherein the second object is related to the first object. The relation identifier identifies a relationship between the first object and the second object.
Abstract:
A multicast tree is provided in an application multicast network. A child node in the multicast tree detects a degradation of quality of service associated with a service being received at the child node. The child node determines whether the degradation of quality of service is resulting from a child-parent link or an upstream link in the multicast tree.
Abstract:
In a method of semantic querying in a peer-to-peer network, an item of information is mapped into a semantic vector based on the latent semantic indexing algorithm or any IR algorithms that can derive a vector representation. The semantic vector is associated with an address index as a key pair. The key pair is stored in an overlay network formed from the peer-to-peer network such that the stored key pair is proximally located to at least one other key pair having a similar semantic vector.
Abstract:
A multicast tree is provided in an application multicast network. A child node in the multicast tree detects a degradation of quality of service associated with a service being received at the child node. The child node determines whether the degradation of quality of service is resulting from a child-parent link or an upstream link in the multicast tree.
Abstract:
In a method of improving querying, a plurality of items of information are transformed into a plurality of vectors, where each item of information of the plurality of items of information is mapped to a respective vector of said plurality of vectors. A plurality of vectors is associated with a subset of nodes selected from a plurality of nodes. Each vector associated with a respective node of said plurality of nodes is based on a similarity between each vector of said plurality of vectors.
Abstract:
A peer-to-peer system includes a destination node operable to receive a query. The destination node receives samples from a first set of nodes proximally located to the destination node in an overlay network for the peer-to-peer system. The samples are associated with information stored at the proximally located nodes. The destination node is operable to identify, based on the samples received from the first set of nodes, a first node of the first set of nodes likely storing information associated with objects stored in the peer-to-peer system that are relevant to the query.
Abstract:
An overlay network is used to logically represent an underlying physical network. A network condition is monitored by a node in a target region of the network. If the network condition occurs, the node transmits a notification to a source node including location information for nodes physically close in the physical network. The source node may select a routing node in the target region based on the location information.