Skip to main content
Software Engineering

You are not logged in. Your edit will be placed in a queue until it is peer reviewed.

We welcome edits that make the post easier to understand and more valuable for readers. Because community members review edits, please try to make the post substantially better than how you found it, for example, by fixing grammar or adding additional resources and hyperlinks.

5
  • 1
    Partitioning by time slice! Just what I was going to suggest. Commented Mar 16, 2012 at 2:15
  • The issue with this is, I would have to query all of those dictionaries that were made within the last five minutes. As the there are 300 connections, the same packet is going to arrive at each one at least once. So in order to not handle the same packet more than once, I must keep them for at least the 5 minute period. Commented Mar 16, 2012 at 7:19
  • 1
    Part of the problem with generic structures is that they aren't customised for a specific purpose. Perhaps you should add a "nextItemForHash" field and a "nextItemForTimeBucket" field to your Packet structure and implement your own hash table, and stop using Dictionary. That way you can quickly find all packets that are too old and only search once when a packet is inserted (ie. have your cake and eat it too). It'd also help for memory management overhead (as "Dictionary" wouldn't be allocating/freeing extra data structures for Dictionary management). Commented Mar 16, 2012 at 10:29
  • @Josh the fastest way to determine if you've seen something before is a hashset. Time-sliced hash sets would be fast and you still wouldn't need to search to evict old items. If you haven't seen it before, then you can store it in your dictionar(y/ies). Commented Nov 1, 2016 at 22:41
  • infoq.com/articles/Big-Memory-Part-3 Commented Jul 15, 2017 at 22:43