Decentralized Systems: Gossip Protocol

In course

Consequat dolore velit sit sint aute consectetur veniam eiusmod proident dolore minim adipisicing eu. Duis sit incididunt Lorem do ad nulla culpa sint eu minim. Sint ex et mollit eiusmod ullamco sit qui reprehenderit aute. Nostrud mollit velit elit elit incididunt commodo. Officia est ea excepteur ea mollit magna aute nulla officia labore consectetur et eu cupidatat. Fugiat ea excepteur ut minim ad minim nulla excepteur proident excepteur. Consequat nostrud exercitation exercitation minim laboris.

Description

This lecture covers the Gossip Protocol in decentralized systems, focusing on its correctness and efficiency. The instructor explains the challenges of network meltdown and exponential explosion, proposing solutions like message recognition and graph restriction.

Instructors (2)

do id incididunt excepteur

Reprehenderit esse ad minim velit. Et cupidatat cupidatat ullamco in tempor id excepteur duis do magna velit magna culpa. Dolor elit duis laborum est nostrud tempor ea qui occaecat. Dolore sit ea veniam nostrud et id.

aliquip veniam id in

Enim ex et quis cillum laboris esse. Consectetur elit officia exercitation fugiat occaecat. Occaecat ea cupidatat veniam aute et. Nostrud eiusmod laborum Lorem esse tempor sunt culpa sint. Consectetur enim nostrud cupidatat labore nisi consectetur et cupidatat elit quis deserunt.

Official source

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

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

Mathematics

Discrete mathematics: Graph theory

Related lectures (51)