Learning to route queries in unstructured P2P networks: Achieving throughput optimality subject to query resolution constraints

Virag Shah, Gustavo De Veciana, George Kesidis

Research output: Chapter in Book/Report/Conference proceedingConference contribution

1 Citation (Scopus)

Abstract

Finding a document or resource in an unstructured peer-to-peer network can be an exceedingly difficult problem. In this paper we propose a dynamic query routing approach that accounts for arbitrary overlay topologies, nodes with heterogeneous processing capacity and heterogenous class-based likelihoods of query resolution at nodes, reflecting the query loads and manner in which files/resources are distributed across the network. Finite processing capacity at nodes, e.g., reflecting their degree of altruism, can indeed limit the stabilizable load into the system. Our approach is shown to be throughput optimal subject to a grade of service constraint, i.e., it stabilizes the query load subject to a guarantee that queries' routes meet pre-specified class-based bounds on their associated a priori probability of query resolution. Numerical and simulation results show significant improvement in capacity region and performance benefits, in terms of mean delay, over random walk based searches. Additional aspects associated with reducing complexity, learning, and adaptation to class-based query resolution probabilities and traffic loads are studied.

Original languageEnglish (US)
Title of host publication2012 Proceedings IEEE INFOCOM, INFOCOM 2012
Pages2327-2335
Number of pages9
DOIs
StatePublished - Jun 4 2012
EventIEEE Conference on Computer Communications, INFOCOM 2012 - Orlando, FL, United States
Duration: Mar 25 2012Mar 30 2012

Publication series

NameProceedings - IEEE INFOCOM
ISSN (Print)0743-166X

Other

OtherIEEE Conference on Computer Communications, INFOCOM 2012
CountryUnited States
CityOrlando, FL
Period3/25/123/30/12

Fingerprint

Throughput
Peer to peer networks
Processing
Topology

All Science Journal Classification (ASJC) codes

  • Computer Science(all)
  • Electrical and Electronic Engineering

Cite this

Shah, V., De Veciana, G., & Kesidis, G. (2012). Learning to route queries in unstructured P2P networks: Achieving throughput optimality subject to query resolution constraints. In 2012 Proceedings IEEE INFOCOM, INFOCOM 2012 (pp. 2327-2335). [6195620] (Proceedings - IEEE INFOCOM). https://doi.org/10.1109/INFCOM.2012.6195620
Shah, Virag ; De Veciana, Gustavo ; Kesidis, George. / Learning to route queries in unstructured P2P networks : Achieving throughput optimality subject to query resolution constraints. 2012 Proceedings IEEE INFOCOM, INFOCOM 2012. 2012. pp. 2327-2335 (Proceedings - IEEE INFOCOM).
@inproceedings{66669547eede4c22aa9fa7c51f264888,
title = "Learning to route queries in unstructured P2P networks: Achieving throughput optimality subject to query resolution constraints",
abstract = "Finding a document or resource in an unstructured peer-to-peer network can be an exceedingly difficult problem. In this paper we propose a dynamic query routing approach that accounts for arbitrary overlay topologies, nodes with heterogeneous processing capacity and heterogenous class-based likelihoods of query resolution at nodes, reflecting the query loads and manner in which files/resources are distributed across the network. Finite processing capacity at nodes, e.g., reflecting their degree of altruism, can indeed limit the stabilizable load into the system. Our approach is shown to be throughput optimal subject to a grade of service constraint, i.e., it stabilizes the query load subject to a guarantee that queries' routes meet pre-specified class-based bounds on their associated a priori probability of query resolution. Numerical and simulation results show significant improvement in capacity region and performance benefits, in terms of mean delay, over random walk based searches. Additional aspects associated with reducing complexity, learning, and adaptation to class-based query resolution probabilities and traffic loads are studied.",
author = "Virag Shah and {De Veciana}, Gustavo and George Kesidis",
year = "2012",
month = "6",
day = "4",
doi = "10.1109/INFCOM.2012.6195620",
language = "English (US)",
isbn = "9781467307758",
series = "Proceedings - IEEE INFOCOM",
pages = "2327--2335",
booktitle = "2012 Proceedings IEEE INFOCOM, INFOCOM 2012",

}

Shah, V, De Veciana, G & Kesidis, G 2012, Learning to route queries in unstructured P2P networks: Achieving throughput optimality subject to query resolution constraints. in 2012 Proceedings IEEE INFOCOM, INFOCOM 2012., 6195620, Proceedings - IEEE INFOCOM, pp. 2327-2335, IEEE Conference on Computer Communications, INFOCOM 2012, Orlando, FL, United States, 3/25/12. https://doi.org/10.1109/INFCOM.2012.6195620

Learning to route queries in unstructured P2P networks : Achieving throughput optimality subject to query resolution constraints. / Shah, Virag; De Veciana, Gustavo; Kesidis, George.

2012 Proceedings IEEE INFOCOM, INFOCOM 2012. 2012. p. 2327-2335 6195620 (Proceedings - IEEE INFOCOM).

Research output: Chapter in Book/Report/Conference proceedingConference contribution

TY - GEN

T1 - Learning to route queries in unstructured P2P networks

T2 - Achieving throughput optimality subject to query resolution constraints

AU - Shah, Virag

AU - De Veciana, Gustavo

AU - Kesidis, George

PY - 2012/6/4

Y1 - 2012/6/4

N2 - Finding a document or resource in an unstructured peer-to-peer network can be an exceedingly difficult problem. In this paper we propose a dynamic query routing approach that accounts for arbitrary overlay topologies, nodes with heterogeneous processing capacity and heterogenous class-based likelihoods of query resolution at nodes, reflecting the query loads and manner in which files/resources are distributed across the network. Finite processing capacity at nodes, e.g., reflecting their degree of altruism, can indeed limit the stabilizable load into the system. Our approach is shown to be throughput optimal subject to a grade of service constraint, i.e., it stabilizes the query load subject to a guarantee that queries' routes meet pre-specified class-based bounds on their associated a priori probability of query resolution. Numerical and simulation results show significant improvement in capacity region and performance benefits, in terms of mean delay, over random walk based searches. Additional aspects associated with reducing complexity, learning, and adaptation to class-based query resolution probabilities and traffic loads are studied.

AB - Finding a document or resource in an unstructured peer-to-peer network can be an exceedingly difficult problem. In this paper we propose a dynamic query routing approach that accounts for arbitrary overlay topologies, nodes with heterogeneous processing capacity and heterogenous class-based likelihoods of query resolution at nodes, reflecting the query loads and manner in which files/resources are distributed across the network. Finite processing capacity at nodes, e.g., reflecting their degree of altruism, can indeed limit the stabilizable load into the system. Our approach is shown to be throughput optimal subject to a grade of service constraint, i.e., it stabilizes the query load subject to a guarantee that queries' routes meet pre-specified class-based bounds on their associated a priori probability of query resolution. Numerical and simulation results show significant improvement in capacity region and performance benefits, in terms of mean delay, over random walk based searches. Additional aspects associated with reducing complexity, learning, and adaptation to class-based query resolution probabilities and traffic loads are studied.

UR - http://www.scopus.com/inward/record.url?scp=84861615579&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84861615579&partnerID=8YFLogxK

U2 - 10.1109/INFCOM.2012.6195620

DO - 10.1109/INFCOM.2012.6195620

M3 - Conference contribution

AN - SCOPUS:84861615579

SN - 9781467307758

T3 - Proceedings - IEEE INFOCOM

SP - 2327

EP - 2335

BT - 2012 Proceedings IEEE INFOCOM, INFOCOM 2012

ER -

Shah V, De Veciana G, Kesidis G. Learning to route queries in unstructured P2P networks: Achieving throughput optimality subject to query resolution constraints. In 2012 Proceedings IEEE INFOCOM, INFOCOM 2012. 2012. p. 2327-2335. 6195620. (Proceedings - IEEE INFOCOM). https://doi.org/10.1109/INFCOM.2012.6195620