NDLI: Optimal sampling strategies for minimum latency routing with imperfect link state

Content Provider	IEEE Xplore Digital Library
Author	Guha, Saikat Towsley, Don Basu, Prithwish Tripp, Howard Freemany, Timothy Katz-Rogozhnikov, Dmitriy Hancock, Robert Kurose, Jim
Copyright Year	2012
Description	Author affiliation: Raytheon BBN, USA (Guha, Saikat; Basu, Prithwish) \|\| UMASS Amherst, USA (Towsley, Don; Kurose, Jim) \|\| IBM Research US, USA (Katz-Rogozhnikov, Dmitriy) \|\| Roke Manor Research UK (Tripp, Howard; Freemany, Timothy; Hancock, Robert)
Abstract	Since dynamic wireless networks evolve over time, optimal routing computations need to be performed frequently on time-varying network topologies. However, it is often infeasible or expensive to gather the current state of links for the entire network all the time. We provide a thorough analytical characterization of the effect of various link-state sampling strategies operating under a limited sampling budget on the performance of the minimum-latency routing policy in a special class of dynamic networks. We show that for a two-state Markov link-dynamics model parameterized by probabilities p, q, if links are more likely to turn on than off at each time instant (p > q), a “depth-first” sampling strategy is optimal, whereas a “breadth-first” sampling strategy is optimal if links are more likely to turn off than on (p < q)—under the Cut Through (CuT) latency model, i.e., when the packet-forwarding latency is negligible compared to the time scale of the link dynamics. We precisely characterize the optimal-latency spatial-sampling schedules for one-shot interrogation. We also present numerical simulation results on comparing various spatio-temporal sampling schedules under an overall sampling rate constraint, and initial results on comparisons of optimal schedules under a Store-and-Advance (SoA) packet-forwarding latency model.
Starting Page	81
Ending Page	88
File Size	2170444
Page Count	8
File Format	PDF
ISBN	9781467322942
e-ISBN	9783901882456
e-ISBN	9783901882470
Language	English
Publisher	Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Publisher Date	2012-05-14
Publisher Place	Germany
Access Restriction	Subscribed
Rights Holder	IFIP
Subject Keyword	Analytical models Government Routing Numerical models Indexes Erbium Delay
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

Optimal sampling strategies for minimum latency routing with imperfect link state (2012)

Optimal Sampling Strategies for Minimum Latency Routing with Imperfect Link State

Optimal sampling strategies for minimum latency routing with imperfect link state.

Optimal Sampling Strategies for Minimum Latency Routing with Imperfect Link State

Distributed strategies for minimum-latency cooperative retransmission in wireless networks

A simple approximation to minimum-delay routing (1999)

Garcia-Luna-Aceves. A Simple Approximation to Minimum-Delay Routing (1999)

A high-efficiency low-delay routing algorithm for opportunistic networks

Performance modeling of message-driven based energy-efficient routing in delay-tolerant networks with individual node selfishness

Optimal sampling strategies for minimum latency routing with imperfect link state

Similar Documents

Optimal sampling strategies for minimum latency routing with imperfect link state (2012)

Optimal Sampling Strategies for Minimum Latency Routing with Imperfect Link State

Optimal sampling strategies for minimum latency routing with imperfect link state.

Optimal Sampling Strategies for Minimum Latency Routing with Imperfect Link State

Distributed strategies for minimum-latency cooperative retransmission in wireless networks

A simple approximation to minimum-delay routing (1999)

Garcia-Luna-Aceves. A Simple Approximation to Minimum-Delay Routing (1999)

A high-efficiency low-delay routing algorithm for opportunistic networks

Performance modeling of message-driven based energy-efficient routing in delay-tolerant networks with individual node selfishness

Optimal sampling strategies for minimum latency routing with imperfect link state