• Aucun résultat trouvé

A Speed-Up Technique for Distributed Shortest Paths Computation

N/A
N/A
Protected

Academic year: 2021

Partager "A Speed-Up Technique for Distributed Shortest Paths Computation"

Copied!
17
0
0

Texte intégral

Figure

Fig. 1. Power-law node degree distribution of a graph of the CAIDA IPv4 topology dataset with 5000 nodes and 6109 edges.
Fig. 2. (a) Nodes u and v ask for information to their central neighbors by send- send-ing them message Q (query); (b) Nodes u and v propagate updated routing information to all their neighbors through message U (update); (c) A central node x receiving an
Fig. 4. (a) Node u, as a consequence of a weight change on edge {u, p}, sends message p change (P) to all its neighbors; (b) Node x receiving a message P, propagates it to the whole network.
Fig. 6. Number of messages sent on a 5000 nodes subgraph G IP−5000 of G IP .
+4

Références

Documents relatifs

Let a transaction be initiated on one of the nodes, which changes the state of the data located in the database on the network nodes Participants in a transaction are

In this paper, we propose a distributed version of Fischer’s ap- proximation algorithm that computes a minimum weight spanning tree of de- gree at most b∆ ∗ + ⌈log b n⌉, for

We distributed a questionnaire which contained a set of questions divided into three axes: the quality of beverages and liquids consumed, promotion and advertising for the

Orchestrations et séparation des préoccupations Les orchestrations se présentent comme un ensemble de mécanismes pour la construction d’un nouveau service dit composite dans

Beide Länder weisen einen geringen Versorgungsgrad bei ausserhäuslichen Dienstleistungen für Kinder im Alter von bis drei Jahren auf, sind geprägt durch eine geringe

Pour simuler les gains de l’assureur pour un assuré choisi au hasard, tu vas utiliser le logiciel PyBlock disponible à cette adresse?. Tu auras en outre besoin des

L’archive ouverte pluridisciplinaire HAL, est destinée au dépôt et à la diffusion de documents scientifiques de niveau recherche, publiés ou non, émanant des

An alternative approach to distributed optimization has been proposed in [8], [9], where the nodes exchange a small set of constraints at each iteration, and converge to a consensus