• Aucun résultat trouvé

Network Algorithms

N/A
N/A
Protected

Academic year: 2022

Partager "Network Algorithms"

Copied!
26
0
0

Texte intégral

(1)

Network Algorithms

lundi 23 janvier 2017

(2)

Internet

lundi 23 janvier 2017

(3)

Wireless networks

lundi 23 janvier 2017

(4)

Sensor Networks

lundi 23 janvier 2017

(5)

Body Area Networks

lundi 23 janvier 2017

(6)

Robot Networks

lundi 23 janvier 2017

(7)

VANETs

lundi 23 janvier 2017

(8)

Social Networks

lundi 23 janvier 2017

(9)

Clouds

lundi 23 janvier 2017

(10)

Internet of Things

lundi 23 janvier 2017

(11)

Internet of Everything

lundi 23 janvier 2017

(12)

Common Issues

lundi 23 janvier 2017

(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 ?

lundi 23 janvier 2017

(14)

Transmission

How to schedule transmissions without collisions ?

Synchronous vs Asynchronous ?

lundi 23 janvier 2017

(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 ?

lundi 23 janvier 2017

(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 ?

lundi 23 janvier 2017

(17)

Placing and retrieving data

Where to place most demanded data ?

How to retrieve efficiently data ?

lundi 23 janvier 2017

(18)

Solutions

lundi 23 janvier 2017

(19)

lundi 23 janvier 2017

(20)

Distributed

Systems Networks

Algorithms

lundi 23 janvier 2017

(21)

Distributed Network Algorithms

Networks model

Computational model

Techniques to develop algorithms

Techniques to analyse and prove algorithms correctness

lundi 23 janvier 2017

(22)

Why distributed ?

lundi 23 janvier 2017

(23)

Organization

Lectures 2016-2017 :

Franck Petit

Maria Potop-Butucaru

Exercises (TD)

Applications (TP) - Sinalgo simulator (Java programming)

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

pmwiki.php?n=Main.ALGORES

lundi 23 janvier 2017

(24)

Evaluation

Final exam : 40%

Mid-term Exam : 40 %

TP + presentations : 20%

lundi 23 janvier 2017

(25)

Organization

Lectures

Coloring, MIS, DS, Matching (Maria Potop)

Trees Algorithms (Maria Potop)

Echo Algorithms (Franck Petit)

Compact Routing (Franck Petit)

Overlays (P2P) (Maria Potop)

lundi 23 janvier 2017

(26)

Bibliography

Distributed Computing : A locality-sensitive approach - David Peleg

lundi 23 janvier 2017

Références

Documents relatifs

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

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

pastry shell in the pie plate..

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

• 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