{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,5]],"date-time":"2026-05-05T12:29:41Z","timestamp":1777984181648,"version":"3.51.4"},"reference-count":16,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"4","license":[{"start":{"date-parts":[[2024,8,1]],"date-time":"2024-08-01T00:00:00Z","timestamp":1722470400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2024,8,1]],"date-time":"2024-08-01T00:00:00Z","timestamp":1722470400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2024,8,1]],"date-time":"2024-08-01T00:00:00Z","timestamp":1722470400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE\/ACM Trans. Networking"],"published-print":{"date-parts":[[2024,8]]},"DOI":"10.1109\/tnet.2024.3393476","type":"journal-article","created":{"date-parts":[[2024,4,29]],"date-time":"2024-04-29T13:57:06Z","timestamp":1714399026000},"page":"3528-3543","source":"Crossref","is-referenced-by-count":2,"title":["MementoHash: A Stateful, Minimal Memory, Best Performing Consistent Hash Algorithm"],"prefix":"10.1109","volume":"32","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-5601-7870","authenticated-orcid":false,"given":"Massimo","family":"Coluzzi","sequence":"first","affiliation":[{"name":"Department of Innovative Technologies, University of Applied Sciences and Arts of Southern Switzerland, Lugano-Viganello, Switzerland"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-0262-2044","authenticated-orcid":false,"given":"Amos","family":"Brocco","sequence":"additional","affiliation":[{"name":"Department of Innovative Technologies, University of Applied Sciences and Arts of Southern Switzerland, Lugano-Viganello, Switzerland"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-7915-2768","authenticated-orcid":false,"given":"Alessandro","family":"Antonucci","sequence":"additional","affiliation":[{"name":"Department of Innovative Technologies, University of Applied Sciences and Arts of Southern Switzerland, Lugano-Viganello, Switzerland"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-6335-7977","authenticated-orcid":false,"given":"Tiziano","family":"Leidi","sequence":"additional","affiliation":[{"name":"Department of Innovative Technologies, University of Applied Sciences and Arts of Southern Switzerland, Lugano-Viganello, Switzerland"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"issue":"5","key":"ref1","first-page":"217","article-title":"Analysis of various hash function","volume":"3","author":"Priyamvada","year":"2018","journal-title":"Int. J. Innov. Sci. Res. Technol."},{"key":"ref2","volume-title":"A name-based mapping scheme for rendezvous","author":"Thaler","year":"1996"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/90.663936"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1145\/258533.258660"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1016\/S1389-1286(99)00055-9"},{"key":"ref6","article-title":"A fast, minimal memory, consistent hash algorithm","author":"Lamping","year":"2014","journal-title":"arXiv:1406.2294"},{"key":"ref7","article-title":"Multi-probe consistent hashing","author":"Appleton","year":"2015","journal-title":"arXiv:1505.00062"},{"key":"ref8","first-page":"523","article-title":"Maglev: A fast and reliable software network load balancer","volume-title":"Proc. 13th USENIX Symp. Networked Syst. Design Implement.","author":"Eisenbud"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/TNET.2020.3039547"},{"key":"ref10","article-title":"DxHash: A scalable consistent hash based on the pseudo-random sequence","author":"Dong","year":"2021","journal-title":"arXiv:2107.07930"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/ISPASS57527.2023.00048"},{"key":"ref12","first-page":"1","article-title":"Consistently faster: A survey and fair comparison of consistent hashing algorithms","volume-title":"Proc. 31st Symp. Adv. Database Syst.","author":"Coluzzi"},{"key":"ref13","volume-title":"Java-Consistent-Hashing-Algorithms","year":"2023"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1016\/0378-3758(86)90143-6"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1090\/S0002-9939-2011-10925-0"},{"key":"ref16","article-title":"Consistent hashing with bounded loads","author":"Mirrokni","year":"2016","journal-title":"arXiv:1608.01350"}],"container-title":["IEEE\/ACM Transactions on Networking"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/90\/10640200\/10510260.pdf?arnumber=10510260","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,9,2]],"date-time":"2024-09-02T00:39:53Z","timestamp":1725237593000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/10510260\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,8]]},"references-count":16,"journal-issue":{"issue":"4"},"URL":"https:\/\/doi.org\/10.1109\/tnet.2024.3393476","relation":{"has-preprint":[{"id-type":"doi","id":"10.36227\/techrxiv.23531235.v1","asserted-by":"object"},{"id-type":"doi","id":"10.36227\/techrxiv.23531235.v2","asserted-by":"object"}]},"ISSN":["1063-6692","1558-2566"],"issn-type":[{"value":"1063-6692","type":"print"},{"value":"1558-2566","type":"electronic"}],"subject":[],"published":{"date-parts":[[2024,8]]}}}