libp2p / libp2p/go-libp2p-pubsub
Question: evaluating message metadata for routing decisions
Nobody has claimed this yet.
- Dominant language
- Go
- Stars
- 364
- Forks
- 221
- PR merge metrics
- No merged PRs in 30d
Description
We don't propagate IHAVE metadata immediately. We stash it for piggybacking, or until the next heartbeat arrives (1s). However, we are planning to use this metadata to evaluate routing decisions (some of which will be based on latency observations).
How can such a model be effective, given that the arrival of gossip is non-deterministic, and it doesn't carry any provable timestamps?
Basically, if I receive a message X from peer A (with with I'm reciprocally meshed), and I also receive an IHAVE from peer B (with with I'm gossiping only), how can I determine if B received message X before A was able to deliver it to me?
Contributor guide
No contributing guide indexed for this repository
First steps
- Read the whole issue, then the project's contributing guide.
- Comment on the issue to say you are picking it up — it saves two people doing the same work.
- Fork the repository and make your change on a branch.
- Open a pull request that references the issue number.
Research direction
The issue provides no file or test entry point. Start by tracing IHAVE metadata handling, piggybacking, heartbeat delivery, and routing decisions in the pubsub implementation; determine whether the available information can establish message ordering or latency relationships, and document the resulting model or requirements.
Written by the indexing model from the issue text.
Assessment
- Tech stack
- go
- Domain
- distributed-systems, networking
- Issue type
- Feature
- Difficulty
- 5/5
- Estimated time
- Over a week
- Activity status
- Stale
- Clarity
- Needs clarification
- Newbie friendliness
- 20/100