Hi Till, thank you for your answer. I am afraid defining an allowed lateness won't help. It will just change the problem by constant time. If we agree an element can come in arbitrary time after watermark (depends on the network latency), it may be assigned to the window or may be not if comes before/after allowed lateness period expires. Then element may be counted in or discarded.
Still seems the results are not deterministic. In other words if I run the job reading from Kafka multiple times I may get different result depending on external conditions like network and cluster stability. Please correct me if i'm wrong. J.V. -- View this message in context: http://apache-flink-mailing-list-archive.1008284.n3.nabble.com/Deterministic-processing-with-out-of-order-streams-tp14409p14422.html Sent from the Apache Flink Mailing List archive. mailing list archive at Nabble.com.
