Lecture

Ad-Hoc Networks: Routing and DHTs

Graph Chat

Chat with Graph Search

Ask any question about EPFL courses, lectures, exercises, research, news, etc. or try the example questions below.

DISCLAIMER: The Graph Chatbot is not programmed to provide explicit or categorical answers to your questions. Rather, it transforms your questions into API requests that are distributed across the various IT services officially administered by EPFL. Its purpose is solely to collect and recommend relevant references to content that you can explore to help you answer your questions.

In course

CS-438: Decentralized systems engineering

A decentralized system is one that works when no single party is in charge or fully trusted. This course teaches decentralized systems principles while guiding students through the engineering of their own decentralized system featuring messaging, file sha ...

Description

This lecture covers the basics of peer-to-peer networks, focusing on ad-hoc networks, routing algorithms, and distributed hash tables. Starting with examples of P2P networks, the instructor explains the challenges of routing packets and the importance of efficient routing protocols like AODV and DSDV. The lecture then delves into the concept of distributed hash tables, discussing the structure of Chord DHT and its key features such as data reliability, load distribution, and performance optimization.

Instructors (2)

Pierluca Borsò

Expertise Teaching & PhD Courses Decentralized systems engineering CS-438 A decentralized system is one that works when no single party is in charge or fully trusted. This course teaches decentralized systems principles while guiding students through the engineering of their own decentralized system featuring messaging, file sharing, encryption, and blockchain concepts.

Bryan Alexander Ford

Links DEDIS lab home pagePersonal home page Curriculum vitae https://bford.info/cv.pdf Teaching & PhD PhD Students Shailesh Mishra Past EPFL PhD Students Eleftherios Kokoris Kogias, Kirill Nikitin, Cristina Basescu, Enis Ceyhun Alp, Simone Colombo, Pasindu Nivanthaka Tennage, Louis-Henri Manuel Jakob Merino Past EPFL PhD Students as codirector David Froelicher, Ludovic Barman, Georgia Fragkouli Courses Decentralized systems engineering CS-438 A decentralized system is one that works when n

Official source

Related concepts (20)

Peer-to-peer

Peer-to-peer (P2P) computing or networking is a distributed application architecture that partitions tasks or workloads between peers. Peers are equally privileged, equipotent participants in the network. This forms a peer-to-peer network of nodes. Peers make a portion of their resources, such as processing power, disk storage or network bandwidth, directly available to other network participants, without the need for central coordination by servers or stable hosts.

Routing loop

A routing loop is a common problem with various types of networks, particularly computer networks. They are formed when an error occurs in the operation of the routing algorithm, and as a result, in a group of nodes, the path to a particular destination forms a loop. In the simplest version, a routing loop of size two, node A thinks that the path to some destination (call it C) is through its neighbouring node, node B. At the same time, node B thinks that the path to C starts at node A.

Distance-vector routing protocol

A distance-vector routing protocol in data networks determines the best route for data packets based on distance. Distance-vector routing protocols measure the distance by the number of routers a packet has to pass; one router counts as one hop. Some distance-vector protocols also take into account network latency and other factors that influence traffic on a given route. To determine the best route across a network, routers using a distance-vector protocol exchange information with one another, usually routing tables plus hop counts for destination networks and possibly other traffic information.

Peer-to-peer file sharing

Peer-to-peer file sharing is the distribution and sharing of digital media using peer-to-peer (P2P) networking technology. P2P file sharing allows users to access media files such as books, music, movies, and games using a P2P software program that searches for other connected computers on a P2P network to locate the desired content. The nodes (peers) of such networks are end-user computers and distribution servers (not required).

Hash table

In computing, a hash table, also known as hash map, is a data structure that implements an associative array or dictionary. It is an abstract data type that maps keys to values. A hash table uses a hash function to compute an index, also called a hash code, into an array of buckets or slots, from which the desired value can be found. During lookup, the key is hashed and the resulting hash indicates where the corresponding value is stored.

Related lectures (32)

Decentralized Systems Engineering: Chord DHT

Covers the Chord DHT in decentralized systems engineering, focusing on reliability, redundancy, and structure maintenance.

Network Coding: Opportunistic Routing and Coding

Explores network coding for efficient data delivery in wireless networks, optimizing packet transmissions through opportunistic routing and coding.

Chord: Search & Routing

Covers the Chord algorithm for search and routing in distributed hash tables.

Multi-Hop Networks: Wireless Routing Strategies

Explores multi-hop wireless networks, routing protocols, and innovative solutions to enhance wireless communication efficiency.

Decentralized Storage & Distribution: BitTorrent & IPFS Log in to Mediaspace to watch this video

Explores decentralized storage & distribution using BitTorrent & IPFS, covering goals, challenges, building specifications, integrity, bootstrapping, performance, incentives, versioning, naming, and CRDTs.