• Aucun résultat trouvé

A degree-optimal, ordered peer-to-peer overlay network

N/A
N/A
Info
Télécharger
Protected

Academic year: 2021

Partager "A degree-optimal, ordered peer-to-peer overlay network"

Copied!
96
0
0

Chargement.... (Voir le texte intégral maintenant)

Texte intégral

Figure

Figure 2-1: Cormpares the process of building skip lists and SkipNet. Each node is a rectangle containing a name ID (letter) and numeric ID (3 bits)
Figure 2-4: JOIN adds the new node Z into the network. The request starts at the node X already in the network.
Figure 3-1: Shows the subdomain of location tree containing locations starting with a.
Figure 4-1: An example family tree with 24 nodes. Each node, denoted by a square, has a name ID, numeric ID, and level
+7

Références

Télécharger maintenant ( PDF - 96 Page - 5.25 MB )

Documents relatifs