User:G8yingri/Identy hash sorting

Identity Hash Routing (IHR) is a name-indepentent approach to overlay-based addressing and routing in heterogeneous networks. In contrast to Virtual Ring Routing (VRR), IHR explicitly assumes that full connectivity is available inside a each network. IHR establishes a Kademlia-like structure across the heterogeneous network. For filling Kademlia's k-buckets, IHR considers either by physical or virtual neighbors. Similar to VRR, physical neighbors are nodes that share a common network and can be contacted over a physical path that spans a single hop. In contrast, virtual neighbors do not share a common network and can only be connected over a virtual path using intermediate nodes. In the k-buckets of node n, IHR stores the identiers of nodes m that fit into these buckets according to the Kademlia algorithm. Furthermore, it marks an entry for node m as physical, if Node m is a physical neighbor of Node n, or as virtual otherwise. For a physical neighbor p the underlay address UX(p) in a common network X is stored.