• Aucun résultat trouvé

Network Algorithms

N/A
N/A
Protected

Academic year: 2022

Partager "Network Algorithms"

Copied!
25
0
0

Texte intégral

(1)

Network Algorithms

(2)

Internet

(3)

Wireless networks

(4)

Sensor Networks

(5)

Body Area Networks

(6)

Robot Networks

(7)

VANETs

(8)

Social Networks

(9)

Clouds

(10)

Internet of Things

(11)

Internet of Everything

(12)

Common Issues

(13)

Topologys & Overlays

What is the (best) network topology ?

How to discover the network topology ?

What is a virtual topology ?

How to maintain the topology under the network churn ?

(14)

Transmission

How to schedule transmissions without collisions ?

Synchronous vs Asynchronous ?

(15)

Routing

Is the actual internet routing (e.g. link state, distance vector) satisfying ?

What are the ingredients to do an optimal routing ?

What is the future of routing ?

(16)

Communication Primitives

How to efficiently send data from one node to all nodes in the network (or some of

them) ?

How to gather efficiently data from all

nodes (or some of them) into a single node

?

(17)

Placing and retrieving data

Where to place most demanded data ?

How to retrieve efficiently data ?

(18)

Solutions  

(19)

Distributed

Systems Networks

Algorithms

(20)

Distributed Network Algorithms

Networks model

Computational model

Techniques to develop algorithms

Techniques to analyse and prove algorithms correctness

(21)

Why distributed ?

(22)

Organization

Lectures 2020-2021 :

Franck Petit

Maria Potop-Butucaru

Exercises (TD)

Applications (TP) - Sinalgo Simulator

Page web http://www-npa.lip6.fr/~tixeuil/

m2r/pmwiki.php?n=Main.ALGORES

(23)

Evaluation

Final exam : 40%

Mid-term Exam : 40 %

TP + presentation : 20%

(24)

Organization

Lectures

Coloring, MIS, DS, Matching (Maria Potop)

Trees Algorithms (Maria Potop)

Echo Algorithms (Franck Petit)

Compact Routing (Franck Petit)

Overlays (P2P, Blockchains etc) (Maria Potop)

(25)

Bibliography

Distributed Computing : A locality-sensitive approach - David Peleg

Références

Documents relatifs

• A temporary routing table (TemporaryTab) which maintains the routes in consistency check process. 2 Consistency Check mechanism of an advertised route.. the wired links. The

The Topology Information Base, defined for each router by this specification, stores information received in TC messages in the Advertising Remote Router Set, the Router

Identity Spoofing: Since the control messages of a malicious router will be rejected by other legitimate OLSRv2 routers in the MANET, a router without valid credentials

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

node also keeps a record of latest values for all neighbors initial conditions are arbitrary but 1 0 at all steps;. from time to time, i sends its value to

How many link state databases does router X3

pastry shell in the pie plate..

versions of vector spaces, in which you can not only add and scalar multiply vectors, but can also compute lengths, angles, inner products, etc. One particularly common such