Abstract: Service nodes in a service overlay network are selected to provide a service path for a requested service by determining a reduced search space of service nodes in the service overlay network that are operable to provide service components for the requested service. From the reduced search space of service nodes, service nodes are selected to form a service path that satisfies all quality of service constraints for the service.

Abstract: Distances are determined between an identified node and landmark nodes and milestone nodes in a network. The closest milestone or landmark node associated with a shortest of the measured distances is determined. A corresponding distributed hash table (DHT) overlay node is queried for distances between observed nearest nodes for the closest milestone or landmark node and the identified node. Distances between the identified node and the observed nearest nodes are calculated from distances received from the DHT overlay node and the measured distance to the closest milestone or landmark node. K-closest nodes from the identified node are selected from at least one of the closest milestone or landmark node and one or more of the observed nearest nodes based on the calculated distances.

Abstract: An IP address assignment scheme is described. The IP address assignment scheme is well suited for enabling an Internet Data Center (IDC) to assign IP addresses to its customers such that the IDC's network address space is efficiently utilized. The IP address assignment scheme utilizes variable length subnetting and class-less addressing. Moreover, the IP address assignment scheme ensures that customers are provided sufficient IP addresses for the customers' future expansion needs.

Abstract: A network path property for nodes in a network is estimated using machine learning techniques. Network path property measurements for paths between nodes and a subset of node in the network are received. Using machine learning, the network path property for the nodes is estimated based on the network path property measurements.

Abstract: A query including a plurality of attributes and attribute values for a desired service is received. The query is routed to a destination in the overlay network using different attributes in the query.

Abstract: A method of controlling the flow of data traffic from a source node to a destination node through a flow-controlling node in a data communication network is disclosed. The flow-controlling node monitors data traffic transiting therethrough to detect a congested condition. A congestion notification is sent to the source node when the congested condition is detected. The source node determines a delay period based on a packet inter-arrival time, ia, of data traffic at the source node. The source node then delays direction of data traffic to the flow-controlling node by the delay period.

Abstract: One embodiment relates to a system for linking together multiple registries and aggregating data from the multiple registries. The system includes a plurality of local resource or service (resource/service) registries, a distributed index storage and retrieval system, and at least one proxy registry. The proxy registry is configured to receive a search query from a client system, retrieve information from the distributed index storage and retrieval system as to which of the local resource/service registries are relevant to the search query, and obtain pertinent entries from said relevant resource/service registries. Other embodiments are also disclosed.

Abstract: Network position information for a node in a network is determined. An infrastructure node in the network is identified for storing the network position information for the node based on a network distance to the infrastructure node.

Abstract: Nodes in a network are operable to provide an information service. A set of the nodes having a highest workload are identified by routing a list of workloads for the nodes through the network to a final destination. Each node receiving the list determines whether to include a workload of a respective node in the list.

Abstract: A node is identified from a set of nodes in a peer-to-peer network having the highest workloads in the peer-to-peer network. The workload of the node is split with another node using a splitting algorithm.

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 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: A network includes a plurality of nodes. A set of candidate nodes from the plurality of nodes is selected based on location information for the candidate nodes and a first node also in the network. A clustering algorithm is applied to the location information for the candidate nodes and the first node, and a subset of the set of candidate nodes closest to the first node is identified based on the results of applying the clustering algorithm.

Abstract: A request is received from a first node in a network. The request includes a request for a service node operable to provide a desired service. At least one service node is identified that is operable to provide the desired service based at least on location information for the first node.

Abstract: Location information for a node in a network is determined. A first distance from the node to at least one global landmark node is determined and a second distance from the node to at least one local landmark node proximally located to the node is determined. Location information for the node based on the first distance and the second distance is generated.

Abstract: The present teachings provide for a method and system for facilitating content download to one or more remote devices via an insecure communication channel. The method comprises the steps of receiving at least one shared secret from a device via an insecure communications channel, each shared secret encoded and functioning as an identifier for the device, transmitting an encrypted file, from a file server, to the device associated with the encoded shared secret, receiving the shared secret in a plaintext form a via a secure communications channel, receiving a confirmation authorizing the release of a decryption key, and sending a decryption key corresponding to the transmitted file, for which the authorization for the release of the decryption key has been received. The decryption key is encrypted using the shared secret if transmission is via the insecure channel.

Abstract: The present teachings provide for the download and purchase of a digital movie. Several schemes are described for handling a large file that is a digital movie including separately handling its audio and video component. Because the video component is downloaded separately from an audio component, it can be downloaded over several sessions. A user can separately initiate the download of the corresponding audio component. Because the audio component is significantly smaller, its download can be achieved in a much shorter time, often in one session. Thus, content is provided to a user in a substantially transparent manner such that a user's perception of receiving the functionality of a digital movie essentially becomes the time required to initiate payment and download of a relatively small audio component.

Abstract: The present disclosure allows for the downloading of large digital media files in a progressive manner by allowing for a transfer of such digital media to occur over various sessions. A file server is described that receives a request to transmit a file whereupon the file server locates such requested file in its memory. For verification purposes a unique identifier is computed for the requested file such as an MD5 checksum of the digital file. Thereafter an encryption key, K1, is chosen. Using a second key, K2, the first key and the unique identifier are encrypted, and the requested file is encrypted using the first key. Both these encrypted values are then transmitted. Subsequently, for example, after payment is received, an unencrypted form of the first key is also transmitted. The first key can then be used to decrypt the requested file to unlock full functionality of the requested file.

Abstract: A method of controlling the flow of data traffic from a source node to a destination node through a flow-controlling node in a data communication network is disclosed. The flow-controlling node monitors data traffic transiting therethrough to detect a congested condition. A congestion notification is sent to the source node when the congested condition is detected. The source node determines a delay period based on a packet inter-arrival time, ia, of data traffic at the source node. The source node then delays direction of data traffic to the flow-controlling node by the delay period.

Abstract: An IP address assignment scheme is described. The IP address assignment scheme is well suited for enabling an Internet Data Center (IDC) to assign IP addresses to its customers such that the IDC's network address space is efficiently utilized. The IP address assignment scheme utilizes variable length subnetting and class-less addressing. Moreover, the IP address assignment scheme ensures that customers are provided sufficient IP addresses for the customers' future expansion needs.