Forums before death by AOL, social media and spammers... "We can't have nice things"
|    comp.protocols.tcp-ip    |    TCP and IP network protocols.    |    14,669 messages    |
[   << oldest   |   < older   |   list   |   newer >   |   newest >>   ]
|    Message 12,967 of 14,669    |
|    Mark to All    |
|    help to choose appropriate data structur    |
|    15 Jul 09 15:39:12    |
      From: mark_cruzNOTFORSPAM@hotmail.com              Hello              I think this question ahould be fine with this group, not only it applies to       comp.programming.       I need to implement IGMP snooping and suppression on a layer2 device with 24       ports. To do so I'm planning to store in memory the hosts exchanging IGMP       messages with multicast router, there might be thousands of hosts behind       each port.              My question is what data structure will be more appropriate for this, on the       ground of the IGMP protocol behavior? I should consider how often will hosts       leave IGMP groups and join to another, i.e. depending on how often the       elements will be added, deleted etc. the linked lists, trees or hashes will       be selected. I understand it might be a tradeoff.              Thanks in advance.              --       Mark              --- SoupGate-Win32 v1.05        * Origin: you cannot sedate... all the things you hate (1:229/2)    |
[   << oldest   |   < older   |   list   |   newer >   |   newest >>   ]
(c) 1994, bbs@darkrealms.ca