NDLI: Index-based sampling policies for tracking dynamic networks under sampling constraints

Content Provider	IEEE Xplore Digital Library
Author	Ting He Anandkumar, A. Agrawal, D.
Copyright Year	2011
Description	Author affiliation: Dept. of EECS, University of California Irvine, USA (Anandkumar, A.) \|\| IBM T.J. Watson Research Center, Hawthorne, NY, USA (Ting He; Agrawal, D.)
Abstract	We consider the problem of tracking the topology of a large-scale dynamic network with limited monitoring resources. By modeling the dynamics of links as independent ON-OFF Markov chains, we formulate the problem as that of maximizing the overall accuracy of tracking link states when only a limited number of network elements can be monitored at each time step. We consider two forms of sampling policies: link sampling, where we directly observe the selected links, and node sampling, where we observe states of the links adjacent to the selected nodes. We reduce the link sampling problem to a Restless Multi-armed Bandit (RMB) and prove its indexability under certain conditions. By applying the Whittle's index policy, we develop an efficient link sampling policy with methods to compute the Whittle's index explicitly. Under node sampling, we use a linear programming (LP) formulation to derive an extended policy that can be reduced to determining the nodes with maximum coverage of the Whittle's indices. We also derive performance upper bounds in both sampling scenarios. Simulations show the efficacy of the proposed policies. Compared with the myopic policy, our solution achieves significantly better tracking performance for heterogeneous links.
Starting Page	1233
Ending Page	1241
File Size	483192
Page Count	9
File Format	PDF
ISBN	9781424499199
ISSN	0743166X
e-ISBN	9781424499212
DOI	10.1109/INFCOM.2011.5934904
Language	English
Publisher	Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Publisher Date	2011-04-10
Publisher Place	China
Access Restriction	Subscribed
Rights Holder	Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Subject Keyword	Indexes Markov processes Equations Monitoring Accuracy Network topology Upper bound Whittle's index policy Network sampling network topology tracking restless multi-armed bandits
Content Type	Text
Resource Type	Article
Subject	Computer Science Electrical and Electronic Engineering

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

Multi-armed restless bandits, index policies, and dynamic priority allocation (2010).

Weighted Restless Bandit and Its Applications

Multi-armed restless bandits, index policies, and dynamic priority allocation

A Fast-Pivoting Algorithm for Whittle's Restless Bandit Index

Asymptotically optimal priority policies for indexable and non-indexable restless bandits

Adaptive learning of uncontrolled restless bandits with logarithmic regret

Parametrized stochastic multi-armed bandits with binary rewards

Restless Multi-Armed Bandits under Time-Varying Activation Constraints for Dynamic Spectrum Access

Sensor scheduling for hunting elusive hiding targets via whittle's restless bandit index policy

Index-based sampling policies for tracking dynamic networks under sampling constraints

Similar Documents

Multi-armed restless bandits, index policies, and dynamic priority allocation (2010).

Weighted Restless Bandit and Its Applications

Multi-armed restless bandits, index policies, and dynamic priority allocation

A Fast-Pivoting Algorithm for Whittle's Restless Bandit Index

Asymptotically optimal priority policies for indexable and non-indexable restless bandits

Adaptive learning of uncontrolled restless bandits with logarithmic regret

Parametrized stochastic multi-armed bandits with binary rewards

Restless Multi-Armed Bandits under Time-Varying Activation Constraints for Dynamic Spectrum Access

Sensor scheduling for hunting elusive hiding targets via whittle's restless bandit index policy

Index-based sampling policies for tracking dynamic networks under sampling constraints