On the public citation graph
Delay-Bounded Range Queries in DHT-based Peer-to-Peer Systems
0 signed · 48 inferred · view as graph
Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.
Is this your work? Sign in with ORCID and put your name on the
claims that are yours.
Reference health. See whether every reference in this work resolves to a
known work and none has been retracted — and get a dated CiteStamped
badge you can embed.
What this work says
Outgoing claims: the papers this work cites, builds on, or argues with.
inferredcites →https://doi.org/10.1007/11558989_5openalex-snapshot
Brushwood: Distributed Trees in Peer-to-Peer Systems
inferredcites →https://doi.org/10.1007/3-540-45748-8_23openalex-snapshot
Complex Queries in DHT-based Peer-to-Peer Networks
inferredcites →https://doi.org/10.1016/b978-012088469-8.50041-3openalex-snapshot
Online Balancing of Range-Partitioned Data with Applications to Peer-to-Peer Systems
inferredcites →https://doi.org/10.1109/icdcs.2005.75openalex-snapshot
Supporting Complex Multi-Dimensional Queries in P2P Systems
inferredcites →https://doi.org/10.1109/infcom.2005.1498449openalex-snapshot
FISSIONE: A scalable constant degree and low congestion DHT scheme based on kautz graphs
inferredcites →https://doi.org/10.1109/jsac.2003.818784openalex-snapshot
Tapestry: A Resilient Global-Scale Overlay for Service Deployment
inferredcites →https://doi.org/10.1109/jsac.2003.818805openalex-snapshot
On the Fundamental Tradeoffs Between Routing Table Size and Network Diameter in Peer-to-Peer Networks
inferredcites →https://doi.org/10.1109/mic.2004.1297269openalex-snapshot
Enabling flexible queries with guarantees in p2p systems
inferredcites →https://doi.org/10.1109/ptp.2002.1046310openalex-snapshot
Scalable, efficient range queries for grid information services
inferredcites →https://doi.org/10.1109/tnet.2002.808407openalex-snapshot
Chord: a scalable peer-to-peer lookup protocol for internet applications
inferredcites →https://doi.org/10.1145/1011767.1011785openalex-snapshot
Load balancing and locality in range-queriable data structures
inferredcites →https://doi.org/10.1145/1080091.1080104openalex-snapshot
A case study in building layered DHT applications
inferredcites →https://doi.org/10.1145/383059.383072openalex-snapshot
A scalable content-addressable network
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1007/978-3-540-72606-7_121openalex-snapshot
PIBUS: A Network Memory-Based Peer-to-Peer IO Buffering Service
inferred← citeshttps://doi.org/10.1007/978-981-13-2721-6_1openalex-snapshot
Backgrounds of Searchable Storage
inferred← citeshttps://doi.org/10.1007/s11432-006-2030-6openalex-snapshot
Internet-based virtual computing environment (iVCE): Concepts and architecture
inferred← citeshttps://doi.org/10.1007/s11432-009-0016-xopenalex-snapshot
SKY: efficient peer-to-peer networks based on distributed Kautz graphs
inferred← citeshttps://doi.org/10.1007/s11432-011-4377-6openalex-snapshot
Survey of DHT topology construction techniques in virtual computing environments
inferred← citeshttps://doi.org/10.1016/j.comcom.2007.08.003openalex-snapshot
Range queries over skip tree graphs
inferred← citeshttps://doi.org/10.1109/clustr.2007.4629260openalex-snapshot
Multi-dimensional range query for data management using bloom filters
inferred← citeshttps://doi.org/10.1109/hpcc.and.euc.2013.237openalex-snapshot
A New DHT Supporting Multi-attribute Queries for Grid Information Services
inferred← citeshttps://doi.org/10.1109/icdcs.2008.40openalex-snapshot
iSky: Efficient and Progressive Skyline Computing in a Structured P2P Network
inferred← citeshttps://doi.org/10.1109/icdcs.2008.61openalex-snapshot
LHT: A Low-Maintenance Indexing Scheme over DHTs
inferred← citeshttps://doi.org/10.1109/icmt.2011.6003110openalex-snapshot
A distributed top-k query algorithm integrated k-Cone structure for DHT overlay networks
inferred← citeshttps://doi.org/10.1109/icpp.2007.26openalex-snapshot
Collaborative Search in Large-scale Unstructured Peer-to-Peer Networks
inferred← citeshttps://doi.org/10.1109/icws.2009.124openalex-snapshot
DHT-Based Range Query Processing for Web Service Discovery
inferred← citeshttps://doi.org/10.1109/infcom.2009.5062062openalex-snapshot
Distributed Arrays: A P2P Data Structure for Efficient Logical Arrays
inferred← citeshttps://doi.org/10.1109/isdpe.2007.101openalex-snapshot
An Approach to the Sensitive Information Protection for Mobile Code
inferred← citeshttps://doi.org/10.1109/isdpe.2007.124openalex-snapshot
Processing Multi-Attribute Queries in Peer-to-Peer Systems
inferred← citeshttps://doi.org/10.1109/pdcat.2007.51openalex-snapshot
Peer clustering-based cache sharing for multi-attribute range queries in grid environments
inferred← citeshttps://doi.org/10.1109/pdcat.2007.69openalex-snapshot
A Service Discovery Framework for Ubiquitous Computing
inferred← citeshttps://doi.org/10.1109/scc.2008.132openalex-snapshot
A Service-Oriented Approach to Storage Backup
inferred← citeshttps://doi.org/10.1109/tc.2009.97openalex-snapshot
BR-Tree: A Scalable Prototype for Supporting Multiple Queries of Multidimensional Data
inferred← citeshttps://doi.org/10.1109/tkde.2008.235openalex-snapshot
Efficient Skyline Computation in Structured Peer-to-Peer Systems
inferred← citeshttps://doi.org/10.1109/tkde.2008.99openalex-snapshot
Efficient Range Query Processing in Peer-to-Peer Systems
inferred← citeshttps://doi.org/10.1109/tkde.2009.47openalex-snapshot
LIGHT: A Query-Efficient Yet Low-Maintenance Indexing Scheme over DHTs
inferred← citeshttps://doi.org/10.1360/jos182851openalex-snapshot
An Efficient P2P Routing Algorithm Supporting Multi-Dimensional Resource Description
inferred← citeshttps://doi.org/10.14257/ijgdc.2016.9.2.01openalex-snapshot
A Novel Distributed Index Method for Cloud Computing
inferred← citeshttps://doi.org/10.1504/ijaacs.2009.029172openalex-snapshot
A peer-to-peer IO buffering service based on RAM-grid
inferred← citeshttps://doi.org/10.1587/transcom.2016ebp3005openalex-snapshot
Name Resolution Based on Set of Attribute-Value Pairs of Real-World Information
inferred← citeshttps://doi.org/10.3390/en10091275openalex-snapshot
A Novel Locality Algorithm and Peer-to-Peer Communication Infrastructure for Optimizing Network Performance in Smart Microgrids
Editorial review for independent work. ICSAC — the Institute for Complexity
Science and Advanced Computing — runs a structured editorial panel for researchers
publishing outside journals, and publishes on CiteStamp rails. Submission is free
and goes through ORCID: icsacinstitute.org/submit.