18832650. LATENCY-EFFICIENT REDESIGNS FOR STRUCTURED, WIDE-AREA PEER-TO-PEER NETWORKS (Ohio State Innovation Foundation)
LATENCY-EFFICIENT REDESIGNS FOR STRUCTURED, WIDE-AREA PEER-TO-PEER NETWORKS
Organization Name
Ohio State Innovation Foundation
Inventor(s)
Shaileshh Bojja Venkatakrishnan of Hilliard OH US
LATENCY-EFFICIENT REDESIGNS FOR STRUCTURED, WIDE-AREA PEER-TO-PEER NETWORKS
This abstract first appeared for US patent application 18832650 titled 'LATENCY-EFFICIENT REDESIGNS FOR STRUCTURED, WIDE-AREA PEER-TO-PEER NETWORKS
Original Abstract Submitted
Disclosed herein is “Kadabra,” a decentralized. adaptive algorithm for selecting routing table entries in Kademlia to minimize object lookup times while being robust against Sybil attacks. Kadabra implements a multi-armed bandit (MAB) problem. with each Kademlia node acting as an independent MAB player and the node's routing table configurations being the arms of the bandit problem. By balancing exploring new routing table configurations with exploiting known configurations, a node adaptively discovers an efficient routing table that provides fast lookups. The methods described herein are fully decentralized, relying only on local timestamp measurements for feedback at each node and does not require any cooperation between nodes.