NDLI: Propagation time in stochastic communication networks

Content Provider	IEEE Xplore Digital Library
Author	Rowe, J. Mitavskiy, B. Cannings, C.
Copyright Year	2008
Abstract	Dynamical processes taking place on networks have received much attention in recent years, especially on various models of random graphs (including ldquosmall worldrdquo and rdquoscale freerdquo networks). They model a variety of phenomena, including the spread of information on the Internet; the outbreak of epidemics in a spatially structured population; passage of services or queries in a digital ecosystem network; and communication between randomly dispersed processors in an ad hoc wireless network. Typically, research has concentrated on the existence and size of a large connected component (representing, say, the size of the epidemic) in a percolation model, or uses differential equations to study the dynamics using a mean-field approximation in an infinite graph. Here we investigate the time taken for information to propagate from a single source through a finite network, as a function of the number of nodes and the network topology. We assume that time is discrete, and that nodes attempt to transmit to their neighbors in parallel, with a given probability of success. We solve this problem exactly for several specific topologies, and use a large-deviation theorem to derive general asymptotic bounds, which apply to any family of networks where the diameter grows at least logarithmically in the number of nodes. We use these bounds, for example, to show that a scale-free network has propagation time logarithmic in the number of nodes, and inversely proportional to the transmission probability.
Starting Page	426
Ending Page	431
File Size	390306
Page Count	6
File Format	PDF
ISBN	9781424414895
DOI	10.1109/DEST.2008.4635162
Language	English
Publisher	Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Publisher Date	2008-02-26
Publisher Place	Thailand
Access Restriction	Subscribed
Rights Holder	Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Subject Keyword	Upper bound Network topology Tiles Biological system modeling Conferences Ecosystems Random variables
Content Type	Text
Resource Type	Article

Sl.	Authority	Responsibilities	Communication Details
1	Ministry of Education (GoI), Department of Higher Education	Sanctioning Authority	https://www.education.gov.in/ict-initiatives
2	Indian Institute of Technology Kharagpur	Host Institute of the Project: The host institute of the project is responsible for providing infrastructure support and hosting the project	https://www.iitkgp.ac.in
3	National Digital Library of India Office, Indian Institute of Technology Kharagpur	The administrative and infrastructural headquarters of the project	Dr. B. Sutradhar bsutra@ndl.gov.in
4	Project PI / Joint PI	Principal Investigator and Joint Principal Investigators of the project	Dr. B. Sutradhar bsutra@ndl.gov.in Prof. Saswat Chakrabarti will be added soon
5	Website/Portal (Helpdesk)	Queries regarding NDLI and its services	support@ndl.gov.in
6	Contents and Copyright Issues	Queries related to content curation and copyright issues	content@ndl.gov.in
7	National Digital Library of India Club (NDLI Club)	Queries related to NDLI Club formation, support, user awareness program, seminar/symposium, collaboration, social media, promotion, and outreach	clubsupport@ndl.gov.in
8	Digital Preservation Centre (DPC)	Assistance with digitizing and archiving copyright-free printed books	dpc@ndl.gov.in
9	IDR Setup or Support	Queries related to establishment and support of Institutional Digital Repository (IDR) and IDR workshops	idr@ndl.gov.in

On the limiting behavior of Random Linear Network Codes

Coding for fast content download

Counting bits for distributed function computation

Topology detection of complex networks with hidden variables and stochastic perturbations

Propagation Time in Stochastic Communication Networks

A simulated annealing algorithm to the stochastic network interdiction problem

Environmentally-Friendly Secondary Network Topology Control for Minimizing Outage Potential

Bandits with budgets

Capacity of social networks in wireless environments

Propagation time in stochastic communication networks

Similar Documents

On the limiting behavior of Random Linear Network Codes

Coding for fast content download

Counting bits for distributed function computation

Topology detection of complex networks with hidden variables and stochastic perturbations

Propagation Time in Stochastic Communication Networks

A simulated annealing algorithm to the stochastic network interdiction problem

Environmentally-Friendly Secondary Network Topology Control for Minimizing Outage Potential

Bandits with budgets

Capacity of social networks in wireless environments

Propagation time in stochastic communication networks