摘要:
In a method for creating expressway for overlay routing, an existing peer-to-peer network is organized into a plurality of zones. The plurality of zones is organized into a plurality of levels. Neighboring zones are identified for each zone of the plurality of zones. One or more representatives are identified for each neighboring zone. A routing table is created based the plurality of zones, the neighboring zones, the one or more representatives, and the plurality of levels.
摘要:
In a method for expressway routing among peers, a request is received to forward data. The destination is determined from said request. A routing table is searched for an expressway route based on zones to the destination. The data is transmitted across the expressway route to the destination.
摘要:
In a method of generating a routing table for a selected peer, a zone of the selected peer is compared to a target zone. A current entry associated with the zone of the selected peer is created in a routing table of the selected peer in response to the zone of the selected peer being one of smaller and equal to the target zone.
摘要:
A peer-to-peer system includes a plurality of nodes. The plurality of nodes includes at least an initial node and a neighboring node. The initial node is operable to determine whether to place an object at either the initial node or another node in the system based on a comparison of storage utilizations for the initial node and the neighboring node.
摘要:
In a method of mapping peers in a peer-to-peer network to an overlay network, network coordinates are determined for a selected peer. The logical coordinates in the overlay network are determined based on the network coordinates. A zone is determined based on the logical coordinates. The network coordinates, a network address of the selected peer and the zone is stored as an object at a peer owning the zone, where associated information is stored in the peer that has the network coordinate and using the network coordinate as a key.
摘要:
In a method for creating expressway for overlay routing, an existing peer-to-peer network is organized into a plurality of zones. A neighboring zone to a destination peer is selected. A plurality of residents of the neighboring zone are retrieved. A candidate peer is selected from the plurality of residents based a physical distance value and an estimated distance value.
摘要:
A peer-to-peer system is divided into a plurality of zones for placing an object. A parent zone having a parent node is identified. The parent zone is divided into the plurality of zones, i.e., subzones, and one of subzones is selected. A node in the subzone is selected for placing the object.
摘要:
Embodiments are directed towards a Modified Sequitur algorithm (MSA) using pipelining and indexed arrays to identify trending topics within a plurality of documents having user generated content (UGC). The documents are parallelized and distributed across a plurality of network devices, which place at least some of the received documents into a buffer for which the MSA may then be applied to the documents within the buffer to identify n-grams or phrases within the documents' contents. The identified phrases are further analyzed to remove extraneous co-occurrences of phrases, and/or words based on a part of speech analysis. A weighting of the remaining phrases is used to identify trending topic phrases. Links to content in the plurality of UGC documents that is associated with the trending topic phrases may then be displayed to a client device.
摘要:
Embodiments are directed towards modifying a distribution of writers as either a push writer or a pull writer based on a cost model that decides for a given content reader whether it is more effective for the writer to be a pull writer or a push writer. A cache is maintained for each content reader for caching content items pushed by a push writer in the content writer's push list of writers when the content is generated. At query time, content items are pulled by the content reader based on writers a content reader's pull list. One embodiment of the cost model employs data about a previous number of requests for content items for a given writer for a number of previous blended display results of content items. When a writer is determined to be popular, mechanisms are proposed for pushing content items to a plurality of content readers.
摘要:
A query-centric system and process for distributing reverse indices for a distributed content system. Relevance ranking techniques in organizing distributed system indices. Query-centric configuration subprocesses (1) analyze query data, partitioning terms for reverse index server(s) (RIS), (2) distribute each partitioned data set by generally localizing search terms for the RIS that have some query-centric correlation, and (3) generate and maintain a map for the partitioned reverse index system terms by mapping the terms for the reverse index to a plurality of different index server nodes. Indexing subprocess element builds distributed reverse indices from content host indices. Routines of the query execution use the map derived in the configuration to more efficiently return more relevant search results to the searcher.