Multi-Graph Regularization For Efficient Delivery Of User Generated Content In Online Social Networks

We present a methodology for enhancing the delivery of user-generated content in online social networks. To this end, we first regularize the social graph via node capacity and link cost information associated with the underlying data network. We then design a technique for constructing the most efficient delivery tree over the regularized social graph. Finally, we derive an optimization algorithm for allocating the nodes' uplink capacities over the content distribution tree. Our system substantially outperforms the conventional method of flooding data over the social graph, over multiple criteria. In particular, a 100% reduction in terms of network cost and data delivery delay is registered.