PHD, Kent State University, 2018, College of Arts and Sciences / Department of Computer Science

Social Routing in Online Social Networks (OSNs) is very challenging, as it must handle privacy and performance. This study proposes a Social Online Routing (SOR) protocol for OSNs that satisfies Stratified Privacy Model (SPM) core requirements and minimizes end-to-end routing delays corresponding to the social routing information elements exchanged under the SPM. SOR uses five messages (I-need Message, I-have Message, I-thank Message, I-like/dislike message, and the I-Ack Message) for carrying routing information. Forwarding models (I-need Module, I-have Module, I-thank Module, and I-ack Module) and routing algorithms (Topology aware Shortest-Path-Based routing algorithm, Social-Priority-Based routing algorithm, and Queue-aware Social-Priority-Based routing algorithm) are introduced. Four anonymization techniques are also utilized for stratified privacy. To evaluate the study's proposed protocol, an Online Social Networks Simulator is designed and implemented. Using real datasets from Google Plus, the simulator is used to evaluate end-to-end routing delays corresponding to the social routing information elements exchanged under the SPM.

Committee: Javed Khan Prof. (Advisor) Subjects: Computer Science