Effizientes Routing in strukturierten P2P Overlays

As a foundation for novel network applications, structured P2P overlays are attractive. In these structures, data packets follow logical connections between network participants, which often correspond to complex paths through the underlying network. The concepts presented in this work reduce the resulting high routing latencies in the overlay. The focus is on a method for assigning participant identifiers based on network coordinates.