oxidecomputer / oxidecomputer/maghemite
mg-lower: consider bulk bestpath synchronization to forwarding plane
Nobody has claimed this yet.
- Dominant language
- Rust
- Stars
- 94
- Forks
- 6
- Avg merge
- 1d 8h
- Merged PRs (30d)
- 12
Description
Currently, when we get a new set of routes, say from a BGP announcement, we compute the bestpath for each distinct destination prefix in the set and synchronize bestpath decisions to the ASIC one prefix at a time. This can be a bit slow for large announcements. For example, the lag is noticeable on a 2k NLRI BGP announcement.
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 names no files or tests. Start by tracing how a route set is bestpath-selected and how each decision is synchronized to the ASIC, then measure the lag for a 2k-NLRI announcement. Done means evaluating a batching approach and confirming that large announcements no longer synchronize one prefix at a time.
Written by the indexing model from the issue text.
Assessment
- Tech stack
- rust
- Domain
- networking, performance
- Issue type
- Feature
- Difficulty
- 5/5
- Estimated time
- Over a week
- Activity status
- Stale
- Clarity
- Mostly clear
- Newbie friendliness
- 35/100