On the public citation graph
The impact of storage capacity on end-to-end delay in time varying networks
0 signed · 36 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.1002/net.3230180405openalex-snapshot
Minimum‐delay routing in continuous‐time dynamic networks with Piecewise‐constant capacities
inferredcites →https://doi.org/10.1109/9.182479openalex-snapshot
Stability properties of constrained queueing systems and scheduling policies for maximum throughput in multihop radio networks
inferredcites →https://doi.org/10.1109/90.222926openalex-snapshot
Minimum delay routing in stochastic network
inferredcites →https://doi.org/10.1109/icc.2010.5502217openalex-snapshot
Algorithms for Constrained Bulk-Transfer of Delay-Tolerant Data
inferredcites →https://doi.org/10.1109/infcom.2009.5062086openalex-snapshot
On Combining Shortest-Path and Back-Pressure Routing Over Multihop Wireless Networks
inferredcites →https://doi.org/10.1109/infcom.2009.5062262openalex-snapshot
Novel Architectures and Algorithms for Delay Reduction in Back-Pressure Scheduling and Routing
inferredcites →https://doi.org/10.1109/ispdc.2005.4openalex-snapshot
A Distributed Algorithm for the Maximum Flow Problem
inferredcites →https://doi.org/10.1109/tmc.2007.1016openalex-snapshot
Practical Routing in Delay-Tolerant Networks
inferredcites →https://doi.org/10.1109/tnet.2010.2094204openalex-snapshot
On Combining Shortest-Path and Back-Pressure Routing Over Multihop Wireless Networks
inferredcites →https://doi.org/10.1145/1015467.1015484openalex-snapshot
Routing in a delay tolerant network
inferredcites →https://doi.org/10.1145/1555349.1555376openalex-snapshot
Delay tolerant bulk data transfers on the internet
inferredcites →https://doi.org/10.1145/195058.195238openalex-snapshot
Improved approximation algorithms for the multi-commodity flow problem and local competitive routing in dynamic networks
inferredcites →https://doi.org/10.14279/depositonce-14226openalex-snapshot
Minimum Cost Flows Over Time without Intermediate Storage
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.2139/ssrn.4500520openalex-extracted
Realization of Maximum Flow in Dtn and Application in Cgr
inferred← citeshttps://doi.org/10.1007/s11082-022-03903-5openalex-snapshot
Modeling inter-DC bulk data transfer in optical networks with edge storage
inferred← citeshttps://doi.org/10.1016/j.adhoc.2017.01.006openalex-snapshot
A maximum flow algorithm based on storage time aggregated graph for delay-tolerant networks
inferred← citeshttps://doi.org/10.1016/j.comnet.2014.02.017openalex-snapshot
Multiple bulk data transfers scheduling among datacenters
inferred← citeshttps://doi.org/10.1016/j.osn.2020.100558openalex-snapshot
Performance study of an SnF scheduling method for bulk data transfers over inter-datacenter WANs
inferred← citeshttps://doi.org/10.1109/acp55869.2022.10088617openalex-snapshot
SnF with Balanced Storage Use in Optical Circuit Switched (OCS) Networks
inferred← citeshttps://doi.org/10.1109/glocom.2014.7417456openalex-snapshot
Delay Bound Analysis Using Martingale for Multimedia DTN under Heterogeneous Network for High-Speed Trains
inferred← citeshttps://doi.org/10.1109/glocom.2015.7417456openalex-snapshot
Delay Bound Analysis Using Martingale for Multimedia DTN under Heterogeneous Network for High-Speed Trains
inferred← citeshttps://doi.org/10.1109/jiot.2020.2966660openalex-snapshot
Deep-Learning-Based Joint Optimization of Renewable Energy Storage and Routing in Vehicular Energy Network
inferred← citeshttps://doi.org/10.1109/lcomm.2015.2509993openalex-snapshot
An Analytical Framework for Resource-Limited Small Satellite Networks
inferred← citeshttps://doi.org/10.1109/msn.2012.30openalex-snapshot
Pre-fetching Webpages on Mobile Social Network: User-Aware Dynamic Markov Chain
inferred← citeshttps://doi.org/10.1109/tmc.2012.115openalex-snapshot
Optimal Content Downloading in Vehicular Networks
inferred← citeshttps://doi.org/10.1109/tmc.2024.3500132openalex-snapshot
Similarity Caching in Dynamic Cooperative Edge Networks: An Adversarial Bandit Approach
inferred← citeshttps://doi.org/10.1109/tnet.2016.2633370openalex-snapshot
Distributed Storage Control Algorithms for Dynamic Networks
inferred← citeshttps://doi.org/10.1109/tpds.2013.221openalex-snapshot
Reliable Bulk-Data Dissemination in Delay Tolerant Networks
inferred← citeshttps://doi.org/10.1109/tvt.2016.2587080openalex-snapshot
Scheduling Strategy for Multimedia Heterogeneous High-Speed Train Networks
inferred← citeshttps://doi.org/10.1109/vtcfall.2013.6692123openalex-snapshot
Carreau: CARrier REsource Access for mUle, DTN Applied to Hybrid WSN / Satellite System
inferred← citeshttps://doi.org/10.1109/vtcfall.2015.7391124openalex-snapshot
Routing in Disruption Tolerant Networks with Limited Storage
inferred← citeshttps://doi.org/10.1186/s13638-018-1139-9openalex-snapshot
On multi-copy forwarding protocols for large data chunk dissemination in vehicular sensor networks
inferred← citeshttps://doi.org/10.1364/jocn.8.000162openalex-snapshot
Time-Shifted Multilayer Graph: A Routing Framework for Bulk Data Transfer in Optical Circuit-Switched Networks With Assistive Storage
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.