mirror of
https://github.com/logos-messaging/docs.waku.org.git
synced 2026-01-05 22:33:06 +00:00
1 line
16 KiB
JavaScript
1 line
16 KiB
JavaScript
|
"use strict";(self.webpackChunkwaku_guide=self.webpackChunkwaku_guide||[]).push([[9665],{23830:(e,s,i)=>{i.r(s),i.d(s,{assets:()=>h,contentTitle:()=>r,default:()=>l,frontMatter:()=>o,metadata:()=>t,toc:()=>d});const t=JSON.parse('{"id":"research/research-and-studies/message-propagation","title":"Message Propagation Times With Waku-RLN","description":"TLDR: We present the results of 1000 nwaku nodes running rln using different message sizes, in a real network with bandwidth limitations and network delays. The goal is to study the message propagation delay distribution, and how it\'s affected by i) rln and ii) message size in a real environment. We observe that for messages of 10kB the average end-to-end propagation delay is 508 ms. We can also observe that the message propagation delays are severely affected when increasing the message size, which indicates that it is not a good idea to use waku for messages of eg. 500kB. See simulation parameters.","source":"@site/docs/research/research-and-studies/message-propagation.md","sourceDirName":"research/research-and-studies","slug":"/research/research-and-studies/message-propagation","permalink":"/research/research-and-studies/message-propagation","draft":false,"unlisted":false,"editUrl":"https://github.com/waku-org/docs.waku.org/tree/develop/docs/research/research-and-studies/message-propagation.md","tags":[],"version":"current","lastUpdatedAt":null,"frontMatter":{"title":"Message Propagation Times With Waku-RLN"},"sidebar":"research","previous":{"title":"Maximum Bandwidth for Global Adoption","permalink":"/research/research-and-studies/maximum-bandwidth"},"next":{"title":"RLN Key Benchmarks","permalink":"/research/research-and-studies/rln-key-benchmarks"}}');var n=i(74848),a=i(28453);const o={title:"Message Propagation Times With Waku-RLN"},r=void 0,h={},d=[{value:"Introduction",id:"introduction",level:2},{value:"Theory",id:"theory",level:2},{value:"Simulations",id:"simulations",level:2},{value:"Results",id:"results",level:2}];function c(e){const s={a:"a",code:"code",h2:"h2",img:"img",li:"li",p:"p",strong:"strong",ul:"ul",...(0,a.R)(),...e.components};return(0,n.jsxs)(n.Fragment,{children:[(0,n.jsxs)(s.p,{children:[(0,n.jsx)(s.strong,{children:"TLDR"}),": We present the results of 1000 ",(0,n.jsx)(s.code,{children:"nwaku"})," nodes running ",(0,n.jsx)(s.code,{children:"rln"})," using different message sizes, in a real network with bandwidth limitations and network delays. The goal is to study the message propagation delay distribution, and how it's affected by i) rln and ii) message size in a real environment. We observe that for messages of ",(0,n.jsx)(s.code,{children:"10kB"})," the average end-to-end propagation delay is ",(0,n.jsx)(s.code,{children:"508 ms"}),". We can also observe that the message propagation delays are severely affected when increasing the message size, which indicates that it is not a good idea to use waku for messages of eg. ",(0,n.jsx)(s.code,{children:"500kB"}),". See simulation parameters."]}),"\n",(0,n.jsx)(s.h2,{id:"introduction",children:"Introduction"}),"\n",(0,n.jsxs)(s.p,{children:["Waku uses ",(0,n.jsx)(s.a,{href:"https://rfc.vac.dev/spec/11/",children:"relay"})," as a routing protocol, which is an adaptation of ",(0,n.jsx)(s.a,{href:"https://arxiv.org/pdf/2007.02754.pdf",children:"gossipsub"}),". It routes messages following a publisher/subscriber architecture, where nodes can publish messages or subscribe to topics. If message ",(0,n.jsx)(s.code,{children:"m"})," is published to topic ",(0,n.jsx)(s.code,{children:"t"}),", all ",(0,n.jsx)(s.code,{children:"i"})," nodes ",(0,n.jsx)(s.code,{children:"n_1...n_i"})," subscribed to ",(0,n.jsx)(s.code,{children:"t"})," will get ",(0,n.jsx)(s.code,{children:"m"}),". The ",(0,n.jsx)(s.code,{children:"relay"})," protocol ensures that every node gets the messages of the topics it is subscribed to."]}),"\n",(0,n.jsxs)(s.p,{children:["However, since ",(0,n.jsx)(s.code,{children:"relay"})," works in a decentralized manner, all nodes contribute to the gossiping of a message, until it has successfully r
|