Internet of Multimedia Things an Open Source P2P Publish/Subscribe Framework for Massive Semantic Content Spaces
M. Narayanan · 2023
The use of distributed hash tables to create a framework for peer-to-peer networks (DHTs) are well-suited to facilitating communication and collaboration between autonomous entities that are both dynamic and geographically scattered due to their decentralized and highly scalable character. Since the advent of interactive software and services in the IoT, the communication traffic generated by sensing devices has undergone a drastic transformation, moving away from structured textual and numerical data and towards unstructured and massive virtual tours. Since it may be utilized to extract such a wide variety of human-recognizable concepts, the semantic content space of digital information like video and audio is exceedingly large. Semantic distance between data consumers and producers is created by vast the sheer size of the share this will ensure necessitates the use of community publish/subscribe systems. Neither any DHT would ever achieve that exact-match query method to work when users are trying to specify the same semantic notions using different terms. In this paper, we introduce OpenPubSub, an approximative semantic publish/subscribe system based on peer-to-peer content distribution. In this research, we present an original event routing model that integrates hierarchical peer-to-peer rendezvous routing with gossiping. This network, in contrast to those created on card access control spaces, is based on a vector space for meaning with many dimensions. Methods for roughly conducting semantic lookup operations, splitting the world in two, creating a semantic DHT via bootstrapping, and categorizing nodes according to their shared properties are provided. Using the findings, we discover that the hybrid routing strategy can achieve up to 42.3% recall while reducing the messaging cost by 56%, and that at an expected upper constraint on recall for event matching of 54.4%, Using a shuttle routing strategy can improve recall by up to 52.0% while reducing transmission latency by 41%.