Skip to content

High-throughput hashing system for converting subscriber numbers to hash and vice versa

License

Notifications You must be signed in to change notification settings

yykhomenko/hash-system

Folders and files

NameName
Last commit message
Last commit date

Latest commit

 

History

85 Commits
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 

Repository files navigation

hash-system

Example:

380670000001 -> fa769a2d564e384aa3867bc23d6a9cd1

fa769a2d564e384aa3867bc23d6a9cd1 -> 380670000001

Results:

  • 135000 HTTP requests per second per node(current 270000 by 2 nodes);
  • easy to vertical scaling(async server model);
  • easy to horizontal scaling(nodes works independently);
  • REST interface for clients;
  • responsive, resilient, elastic and message driven solution.

This service deployed on 2VMs(4cores Xeon e5 2699 per VM, 32GB RAM, 100GB HDD) and has 1 application and 1 DB per node. It stores 150 000 000 hashes in memory. The service handle 270 000 HTTP requests per second. It easy to vertical scaling because it uses fully asynchronous model of computing. It also easy to horizontal scaling because builds as independent nodes. When I design that service I was inspired The Reactive Manifesto.

About

High-throughput hashing system for converting subscriber numbers to hash and vice versa

Resources

License

Stars

Watchers

Forks

Releases

No releases published

Packages

No packages published