Modeling and analysis of composite network embeddings

Authors:
Ben Baumer;Prithwish Basu;Amotz Bar-Noy
Affiliations:
City University of New York, New York, NY, USA;Raytheon BBN Technologies, Cambridge, MA, USA;City University of New York, New York, NY, USA
Venue:
Proceedings of the 14th ACM international conference on Modeling, analysis and simulation of wireless and mobile systems
Year:
2011

Citing 8
Cited 0

Allocating Task Interaction Graphs to Processors in Heterogeneous Networks

IEEE Transactions on Parallel and Distributed Systems
On approximating arbitrary metrices by tree metrics

STOC '98 Proceedings of the thirtieth annual ACM symposium on Theory of computing
Chord: A scalable peer-to-peer lookup service for internet applications

Proceedings of the 2001 conference on Applications, technologies, architectures, and protocols for computer communications
A scalable content-addressable network

Proceedings of the 2001 conference on Applications, technologies, architectures, and protocols for computer communications
Dynamic task-based anycasting in mobile ad hoc networks

Mobile Networks and Applications
On the Mapping Problem

IEEE Transactions on Computers
Efficient broadcast on random geometric graphs

SODA '10 Proceedings of the twenty-first annual ACM-SIAM symposium on Discrete Algorithms
A survey and comparison of peer-to-peer overlay network schemes

IEEE Communications Surveys & Tutorials

Quantified Score

Hi-index	0.00

Visualization

Abstract

In a composite network, a piece of information traveling through links in a social network may have to travel over multiple links in an associated communication network. In this paper, we propose a model of composite networks that consists of two networks and an embedding between them, and several composite metrics that characterize information flow under a particular type of embedding. We present analytic results for the scaling behavior of "constrained composite stretch" of a path, "constrained composite diameter" of a graph, and "constrained composite broadcast time" of a tree, under random uniform embeddings onto various communication network structures. We validate our analytical results on composite stretch using two data sets consisting of a friendship social network geographically spread across Western Europe and a historical deployment of a military chain of command. We also present a randomized model of field deployment consistent with real-world data, and use simulations over this model to explore the distribution of constrained composite broadcast time. Finally, we show that our analytical bounds for composite broadcast time agree well with the simulation results.