Search Results for "distributed hash table"
Sort By:
Showing 14 open source projects for "distributed hash table"
View related business solutions-
Our Free Plans just got better! | Auth0You asked, we delivered! Auth0 is excited to expand our Free and Paid plans to include more options so you can focus on building, deploying, and scaling applications without having to worry about your security. Auth0 now, thank yourself later.
-
Enterprise-grade ITSM, for every businessFreshservice is an intuitive, AI-powered platform that helps IT, operations, and business teams deliver exceptional service without the usual complexity. Automate repetitive tasks, resolve issues faster, and provide seamless support across the organization. From managing incidents and assets to driving smarter decisions, Freshservice makes it easy to stay efficient and scale with confidence.
-
1
FastDHT is high performance DHT ( distributed hash table ) which based key value pairs. Storage use Berkeley DB, and network IO use libevent. It can store mass key value pairs such as filename mapping, session data and user related data.
-
2
-
3
Italian version of the game Hearts. The game use a central server for chat and authentication; the table is p2p among players. The game supports n-1 crashes of the playing peers.
-
4
BitDHT is a LGPL'd general purpose C++ Distributed Hash Table library. It is designed to take hassle out over creating your own DHT. BitDHT is compatible with bitttorrent's DHT and can leverage this network to bootstrap your own personal DHT.
-
Ship Agents FasterGemini Enterprise Agent Platform lets you rapidly build, scale, govern and optimize production-ready agents grounded in your organization's data. The platform enables developers to build custom or pre-built agents for virtually any use case. New customers get $300 in free credits.
-
5
NChord is a C# implementation of the Chord distributed hash table. The project provides a library containing the routing, lookup, and maintenance routines specified in the MIT Chord paper, and is quite stable including under heavy load and churn.
-
6
Ermdia is a yet another implementation of Kademlia, which is one of the algorithm of ditributed hash table (DHT), in Erlang. This software is lightweight, fast and easy to understand since an amount of source code is quite small.
-
7
BruteNet is a system of the distributed brute force and distributed calculations built on user extensions capable to solve a great number of problems related to the partition on a lot of machines.With sample extention you can distribute brute md5-hash
-
8
C++ Widget Library for CGI/FastCGI applications based on Ajax. Test cases for Tomcat Server and XDAQ framework are available. Widgets included: Tab,Form,Button,Tree,LayoutContainer,Frame,Table,Dialog,FishEyeMenu,EventHandler, etc.
-
9
This program try to crack any md5 hash , but not using one cpu, using the power of distributed computing to get better results in less time
-
$300 Free Credits for Your Google Cloud ProjectsLaunch your next project with $300 in free Google Cloud credits—no strings attached. Test, build, and deploy without risk. Use your credits across the entire Google Cloud platform to find what works best for your needs. After your credits are used, continue with always-free tier services. Only pay when you're ready to scale. Sign up in minutes and start exploring.
-
10
Simulation too for assessing the availability of Peer-to-Peer storage schemes, such as Distributed Hash Tables, Bucketing, and Replication.
-
11
distDES is a Java RMI-based application which manages load balancing on heterogeneous clusters. Development will extend the theoretical initial implementation to include clustered Rainbow Table generation and encryption algorithm collision detection.
-
12
Dermi (Decentralized Event Remote Method Invocation) is a peer-to-peer (P2P), decentralized event-based object middleware framework built on top of a structured Distributed Hash Table based overlay network.
-
13
-
14
Jupp is a Distributed Hash Table focusing on high throughput. It's main characteristics are: 1. Mechanisms for congestion control 2. O(log n) routing for arbitrary peer distributions in the ID space.
- Previous
- You're on page 1
- Next