In 2014, we launched our open-access repository which offers full text access to conference proceedings from many of our events including the INC and HAISA series. These papers are free to access and distribute (subject to citing the source).
Eleventh International Network Conference (INC 2016)
Title: Algorithm for Generating Peer-to-Peer Overlay Graphs based on WebRTC Events
Author(s): Christian von Harscher, Marco Schindler, Johannes Kinzig, Sergej Aleklseev
Keywords: WebRTC, Finite State Machine, Graph, Algorithm
Abstract: Abstract—The peer-to-peer paradigm is widely used in the distribution of data and documents and direct multimedia communications on the internet. The network nodes, which are concerned in a peer-to-peer network, create an infrastructure that provides and offers a desired functionality or application in a distributed manner. Upcoming communication standards, such as WebRTC, also enable a setup where web browsers can act as peer-to-peer nodes. In this paper we present an algorithm for generating connection graphs of the peers based on WebRTC state events. The essential idea of the algorithm is to collect events, generated by changing a signaling and connection state of peers. The algorithm processes the collected events and generates a connection graph of the peers, which represent the overlay topology of the peer-to-peer application. Additionally we present examples of collected events and corresponding connection graphs.
Download count: 832
How to get this paper:
PDF copy of this paper is free to download. You may distribute this copy providing you cite this page as the source.