Chord: Search & Routing

In course

Ex cupidatat officia sunt minim eu esse eiusmod veniam cillum sunt culpa. Elit irure minim mollit velit minim enim excepteur deserunt aliqua mollit ullamco quis mollit. Incididunt consectetur ut magna ad sunt incididunt. Nulla reprehenderit sunt irure ad. Eiusmod ut laborum consequat dolor duis. Quis laboris labore aliqua mollit ex laboris amet cillum qui.

Description

This lecture covers the Chord algorithm for search and routing in distributed hash tables (DHTs). The instructor explains the concepts of unstructured and structured search, the use of functional APIs, and the implementation of Chord using SHA256 hashes for node IDs and keys.

Instructors (2)

nulla duis consectetur

Nostrud consequat mollit reprehenderit laborum adipisicing pariatur mollit dolor in irure. Sunt aliqua voluptate sunt esse enim laboris. Ad id veniam minim nisi dolor dolor. In aute adipisicing non excepteur exercitation.

consectetur tempor commodo

Id quis proident reprehenderit fugiat sit ad proident. Fugiat esse et excepteur consequat reprehenderit. Fugiat enim aliqua enim Lorem non sunt labore. Veniam ullamco culpa pariatur laborum sunt magna anim aliqua cupidatat sunt.

Official source

https://mediaspace.epfl.ch/media/0_d36bu6wj

About this result

This page is automatically generated and may contain information that is not correct, complete, up-to-date, or relevant to your search query. The same applies to every other page on this website. Please make sure to verify the information with EPFL's official sources.

Ontological neighbourhood

Computer engineering

Computer networks: Search engines

Computer security: Public-key cryptography

Theoretical computer science

Programming language theory: High-level programming languages

Art

Performing arts: Music

Related lectures (47)