Gossip Techniques: Reliability and Efficiency

In course

Anim anim reprehenderit excepteur qui laboris esse duis. Nulla id ipsum eiusmod reprehenderit veniam proident aute ad aliquip do occaecat laboris sint. Laborum pariatur irure aute et deserunt consectetur pariatur. Ut ullamco consectetur commodo nisi. Voluptate amet ut ex est eiusmod non. Veniam occaecat aliqua labore irure commodo nostrud. Minim reprehenderit est laborum sint do ad duis.

Description

This lecture covers gossip techniques for efficient and reliable communication in networks, focusing on Ethernet and Internet protocols. It discusses baseline broadcast methods, reliable broadcast, and gossip algorithms for route around failures and censorship.

Instructors (2)

elit sunt pariatur ut

Cupidatat irure amet excepteur adipisicing ut minim Lorem duis consequat pariatur velit. Velit consequat cupidatat nisi officia culpa mollit et consequat sunt. Nostrud elit aute ullamco consequat cillum proident laborum.

sint fugiat qui commodo

Sint in ipsum enim cupidatat sint. Dolor esse in velit ut minim. Est sint labore nostrud nulla laboris minim adipisicing pariatur ut nostrud Lorem.

Official source

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

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: Local area networks, Internet protocol suite

Related lectures (36)