NDLI: On the efficiency-optimal Markov chains for distributed networking applications

Content Provider	IEEE Xplore Digital Library
Author	Chul-Ho Lee Do Young Eun
Copyright Year	2015
Description	Author affiliation: Dept. of Electr. & Comput. Eng., North Carolina State Univ., Raleigh, NC, USA (Do Young Eun) \|\| DMC R&D Center, Samsung Electron., Suwon, South Korea (Chul-Ho Lee)
Abstract	The Metropolis-Hastings (MH) algorithm, in addition to its application for Markov Chain Monte Carlo sampling or simulation, has been popularly used for constructing a random walk that achieves a given, desired stationary distribution over a graph. Applications include crawling-based sampling of large graphs or online social networks, statistical estimation or inference from massive scale of networked data, efficient searching algorithms in unstructured peer-to-peer networks, randomized routing and movement strategies in wireless sensor networks, to list a few. Despite its versatility, the MH algorithm often causes self-transitions of its resulting random walk at some nodes, which is not efficient in the sense of the Peskun ordering - a partial order between off-diagonal elements of transition matrices of two different Markov chains, and in turn results in deficient performance in terms of asymptotic variance of time averages and expected hitting times with slower speed of convergence. To alleviate this problem, we present simple yet effective distributed algorithms that are guaranteed to improve the MH algorithm over time when running on a graph, and eventually reach `efficiency-optimality', while ensuring the same desired stationary distribution throughout.
Starting Page	1840
Ending Page	1848
File Size	254360
Page Count	9
File Format	PDF
ISBN	9781479983810
DOI	10.1109/INFOCOM.2015.7218566
Language	English
Publisher	Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Publisher Date	2015-04-26
Publisher Place	Hong Kong
Access Restriction	Subscribed
Rights Holder	Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Subject Keyword	Markov processes Proposals Peer-to-peer computing Distributed algorithms Computers Eigenvalues and eigenfunctions Conferences
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

Fastest Distributed Consensus on Star-Mesh Hybrid Sensor Networks

Uniform Data Sampling from a Peer-to-Peer Network

Modeling of a Cooperative One-Dimensional Multi-Hop Network Using Quasi-Stationary Markov Chains

A stable fountain code mechanism for peer-to-peer content distribution

Gossip algorithms: design, analysis and applications

Optimal Distributed P2P Streaming Under Node Degree Bounds

Convergence properties of continuous-time Markov chains with application to target search

An Innovative Hybrid P2P Location Network for Distributed Optimal Path Planning

Optimal distributed P2P streaming under node degree bounds

On the efficiency-optimal Markov chains for distributed networking applications

Similar Documents

Fastest Distributed Consensus on Star-Mesh Hybrid Sensor Networks

Uniform Data Sampling from a Peer-to-Peer Network

Modeling of a Cooperative One-Dimensional Multi-Hop Network Using Quasi-Stationary Markov Chains

A stable fountain code mechanism for peer-to-peer content distribution

Gossip algorithms: design, analysis and applications

Optimal Distributed P2P Streaming Under Node Degree Bounds

Convergence properties of continuous-time Markov chains with application to target search

An Innovative Hybrid P2P Location Network for Distributed Optimal Path Planning

Optimal distributed P2P streaming under node degree bounds

On the efficiency-optimal Markov chains for distributed networking applications