-
Notifications
You must be signed in to change notification settings - Fork 1
New issue
Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.
By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.
Already on GitHub? Sign in to your account
DLQ Service (GSI-1073) #128
base: main
Are you sure you want to change the base?
Conversation
Thanks a lot for the comprehensive spec, good read! I have questions, maybe we can sit together with @Cito once he's seen the doc as well.
|
@lkuchenb thanks for the insight. In the proposed solution, I had assumed we would not use compacted DLQ topics. However, if we used a 1:1 DLQ/normal topic arrangement, then we could use compacted DLQ topics. The problem of identical keys for different event types in the one topic had not occurred to me though -- that would be a problem. The endpoint for directly posting an updated event is something I originally included in this spec, actually. However, I removed it because I thought it would be too prone to error. But you're right that it is the fastest way to resolve DLQ events. It's trivial to implement if that's something we want. And no, it can't be scaled. We're the bottleneck. |
Would it make sense to add the original topic name as a kind of prefix to the key in the DLQ and later remove it again? |
That would probably work fine if you're referring to the compacted topic key clashing. |
There was a problem hiding this comment.
Choose a reason for hiding this comment
The reason will be displayed to describe this comment to others. Learn more.
Looks good, see two small comments.
Maybe you should also clarify what you mean with "internal token" for auth.
Contains the plan for building a DLQ service. This iteration has no web UI, only a REST API that returns JSON.
We will be able to see what the next events are in the DLQ topic for a given service, then resolve them one at a time.