[wakaama-dev] Potential Scalability Issues in Wakaama (linked lists)

[Frank Gerlach <Frank_Gerlach@xxxxxxxx>]

Hello,

this is a suggestion for future improvement of Wakaama:

 

In several situations a list of objects, connections etc is being maintained. This is realized via linked lists.

 

For large-scale applications (e.g. a server or a not-so-small IoT device), this can drag down performance, as the algorithm to find an element has O(n) complexity. If two lists are to be compared, this could escalate into O(n^2), which is obviously not nice.

 

It would be better to use a Hashtable in this kind of situations.  There are plenty open source C hashtables out there.

 

EPAM could contribute a hash function that is better than Adler32, but does not require any expensive math operations (no modulo, no multiplications). It is also of higher quality (better randomization) than Adler32. I guess this is especially important for small devices.

 

Kind regards

 

 

Frank Gerlach

Senior Software Engineer

 

Office: +375 17 389 0100 x 23178   Cell: +375 29 877 4976    Email: frank_gerlach@xxxxxxxx

Minsk, Belarus (GMT+3)   epam.com

 

CONFIDENTIALITY CAUTION AND DISCLAIMER
This message is intended only for the use of the individual(s) or entity(ies) to which it is addressed and contains information that is legally privileged and confidential. If you are not the intended recipient, or the person responsible for delivering the message to the intended recipient, you are hereby notified that any dissemination, distribution or copying of this communication is strictly prohibited. All unintended recipients are obliged to delete this message and destroy any printed copies.