Include outgoing connection events in receive queue
Nadie ha tomado este issue todavía.
Evaluación
- Dificultad
- 5/5
- Tiempo estimado
- Más de una semana
- Aptitud para principiantes
- 25/100
- Tipo de issue
- Nueva funcionalidad
- Claridad
- Necesita aclaración
- Estado de actividad
- Estancado
- Stack tecnológico
- haskell
- Área
- distributed-systems
Línea de trabajo
Empieza leyendo el issue haskell-distributed/distributed-process#406 y comparando su problema con los dos diseños alternativos de Event descritos aquí. Después, inspecciona las definiciones existentes de Event y Connection, así como las rutas de connect, send y close. El trabajo estará terminado cuando se haya elegido un diseño y se hayan preservado la procedencia, el orden, la unicidad y la semántica de eventos exactamente una vez especificados.
Escrito por el modelo de indexación a partir del texto del issue.
Descripción
This is an alternative to, and intended to solve the same problem as, issue haskell-distributed/distributed-process#406.
New Events
Three new event constructors are introduced:
data Event =
...
| OutboundConnectionOpened ConnectionId Reliability EndPointAddress
| OutboundConnectionClosed ConnectionId
| OutboundConnectionSent ConnectionId [ByteString]
Or perhaps instead:
data Provenance = Local | Peer
deriving (Show, Eq, Generic)
instance Binary Provenance
data Event =
-- Replaces 'Received', which can now mean 'Sent'.
Data Provenance ConnectionId [ByteString]
| ConnectionOpened Provenance ConnectionId Reliability EndPointAddress
| ConnectionClosed Provenance ConnectionId
| ...
deriving (Show, Eq, Generic)
pattern Received connid bss = Data Peer connid bss
pattern Sent connid bss = Data Local connid bss
and in any case:
data Connection = Connection {
...
, connectionId :: ConnectionId
}
Events with provenance Peer are the familiar incoming events, whereas events with provenance Local are generated in response to locally-initiated connection features: connect, send, and close.
Semantics of local-provenance Events
When connect ep address reliability hints succeeds, a ConnectionOpened Local connid reliability address must be posted exactly once to eps event queue, where connid is any suitable (unique) ConnectionId.
When close conn succeeds, a ConnectionClosed connid must be posted exactly once to the event queue of the EndPoint against which conn was created.
When send conn bs succeeds, a Data Local connid bs must be posted exactly once to the event queue of the EndPoint against which conn was created, even if the connection is not reliable (in which case the receiver may see different Data events than the sender for the same connection).
If the connection is ordered, then Data Local events must be posted in the same order that the peer will observe the Data Peer events corresponding to these sends (it's assumed the concrete transport is capable of doing this, else it shouldn't allow an ordered connection).
Regardless of reliability and ordering, a Data Local event must come after the ConnectionOpened for that connection, and before any event which terminates that connection (ConnectionClosed or error events which cause it to close).
Note that these rules imply that for self connections (from one EndPoint to itself), the EndPoint will see two of each posted event, one for each provenance (they are both Local and Peer).
The connectionId of a Connection must be unique among incoming and outgoing connections, but need not match the ConnectionId which the peer uses for that same connection.
It solves the problem brought up in haskell-distributed/distributed-process#406
There is now an ordering on outgoing connections. If we observe ErrorEvent (TransportError (EventConnectionLost addr) _) then every ConnectionOpened Local connid _ addr which is unmatched by a ConnectionClosed Local connid is known to be broken, and subsequent ConnectionOpened Local connid' _ addr are not broken by that error event.
- Lenguaje dominante
- Haskell
- Estrellas
- 753
- Forks
- 101
- Merge medio
- 1 d 3 h
- PR fusionados (30 d)
- 4
Preparar el entorno
- Sin Dockerfile ni archivo de Docker Compose
- Sin plantilla de pull request
- Leer la guía de contribución
Primeros pasos
- Lee el issue completo y luego la guía de contribución del proyecto.
- Comenta en el issue que vas a ocuparte — evita que dos personas hagan lo mismo.
- Haz un fork del repositorio y trabaja en una rama.
- Abre un pull request que haga referencia al número del issue.
Más de haskell-distributed/distributed-process
-
enhancement Feature Request
Dificultad 5/5 Más de una semana Aptitud para principiantes 25/100
haskell-distributed/distributed-process#486 · 1 comentario · 1 reacción ·
-
discuss enhancement Feature Request
Dificultad 5/5 Más de una semana Aptitud para principiantes 25/100
haskell-distributed/distributed-process#478 · 4 comentarios · 3 reacciones ·
-
enhancement Feature Request
Dificultad 5/5 Más de una semana Aptitud para principiantes 15/100
haskell-distributed/distributed-process#476 · 2 reacciones ·
-
Demonstrating the use of Cloud Haskell for a Raft implementationQuizá libre de nuevo @LaurentRDC la tomó hace 482 días y no hay ningún pull request abierto. Abiertoenhancement Feature Request
haskell-distributed/distributed-process#475 · 3 reacciones · 1 asignado ·
-
Dificultad 4/5 3-5 días Aptitud para principiantes 20/100
haskell-distributed/distributed-process#473 · 4 comentarios · 1 reacción ·
Todos los issues de haskell-distributed/distributed-process
Issues similares
-
MorphRule, DataizeRule and ContextualizeRule silently accept unknown YAML keys, unlike rewrite `Rule`Posiblemente ocupada @renyamamoto2026-cmyk la tomó hoy. Abierto
Dificultad 2/5 1-3 horas Aptitud para principiantes 78/100
objectionary/phino#2107 ·
Los mantenedores suelen responder en 1 día
-
Dificultad 1/5 Menos de una hora Aptitud para principiantes 72/100
Los mantenedores suelen responder en 1 día