On the public citation graph

Efficient algorithms for scheduling multiple bulk data transfers in inter‐datacenter networks

https://doi.org/10.1002/dac.2603
0 signed · 46 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.
Claim with ORCID
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.
See reference health

What this work says

Outgoing claims: the papers this work cites, builds on, or argues with.

inferredcites →https://doi.org/10.1002/dac.1142openalex-snapshot
On the identification and analysis of Skype traffic
inferredcites →https://doi.org/10.1002/dac.1247openalex-snapshot
Skype‐Hunter: A real‐time system for the detection and classification of Skype traffic
inferredcites →https://doi.org/10.1002/dac.1250openalex-snapshot
Enabling live video streaming services realization in telecommunication networks using P2P technology
inferredcites →https://doi.org/10.1002/dac.1279openalex-snapshot
A service‐oriented taxonomical spectrum, cloudy challenges and opportunities of cloud computing
inferredcites →https://doi.org/10.1002/dac.1344openalex-snapshot
On the performance and fairness of dynamic channel allocation in wireless mesh networks
inferredcites →https://doi.org/10.1002/dac.995openalex-snapshot
Wavelength retuning without service interruption in an all‐optical survivable network
inferredcites →https://doi.org/10.1002/net.3230040204openalex-snapshot
Disjoint paths in a network
inferredcites →https://doi.org/10.1007/bf01202792openalex-snapshot
On the complexity of the disjoint paths problem
inferredcites →https://doi.org/10.1007/bf01386390openalex-snapshot
A note on two problems in connexion with graphs
inferredcites →https://doi.org/10.1007/s00453-001-0119-2openalex-snapshot
Fast, Fair and Frugal Bandwidth Allocation in ATM Networks
inferredcites →https://doi.org/10.1016/0166-218x(93)e0177-zopenalex-snapshot
NP-completeness of some edge-disjoint paths problems
inferredcites →https://doi.org/10.1016/j.comnet.2007.12.005openalex-snapshot
Scheduling bulk file transfers with start and end times
inferredcites →https://doi.org/10.1016/j.cor.2006.03.020openalex-snapshot
Max–min fairness in multi-commodity flows
inferredcites →https://doi.org/10.1063/1.3051024openalex-snapshot
Flows in Networks
inferredcites →https://doi.org/10.1063/1.3051070openalex-snapshot
Advances in Geophysics, Volume 9
inferredcites →https://doi.org/10.1073/pnas.0400054101openalex-snapshot
Defining and identifying communities in networks
inferredcites →https://doi.org/10.1073/pnas.122653799openalex-snapshot
Community structure in social and biological networks
inferredcites →https://doi.org/10.1109/49.265708openalex-snapshot
Comparison of k-shortest paths and maximum flow routing for network facility restoration
inferredcites →https://doi.org/10.1109/ccgrid.2007.102openalex-snapshot
Scheduling deadline-constrained bulk data transfers to minimize network congestion
inferredcites →https://doi.org/10.1109/ccgrid.2012.70openalex-snapshot
Lowering Inter-datacenter Bandwidth Costs via Bulk Data Scheduling
inferredcites →https://doi.org/10.1109/icc.2007.100openalex-snapshot
Supporting Bulk Data Transfers of High-End Applications with Guaranteed Completion Time
inferredcites →https://doi.org/10.1109/icdcsw.2012.43openalex-snapshot
Postcard: Minimizing Costs on Inter-Datacenter Traffic with Store-and-Forward
inferredcites →https://doi.org/10.1109/infcom.2011.5934955openalex-snapshot
A first look at inter-data center traffic characteristics via Yahoo! datasets
inferredcites →https://doi.org/10.1109/tnet.2007.905605openalex-snapshot
Centralized and Distributed Algorithms for Routing and Weighted Max-Min Fair Bandwidth Allocation
inferredcites →https://doi.org/10.1109/tpds.2008.250openalex-snapshot
Advance Reservations and Scheduling for Bulk Transfers in Research Networks
inferredcites →https://doi.org/10.1145/1496091.1496103openalex-snapshot
The cost of a cloud
inferredcites →https://doi.org/10.1145/1555349.1555376openalex-snapshot
Delay tolerant bulk data transfers on the internet
inferredcites →https://doi.org/10.1145/2018436.2018446openalex-snapshot
Inter-datacenter bulk transfers with netstitcher
inferredcites →https://doi.org/10.1145/237814.237837openalex-snapshot
Convergence complexity of optimistic rate based flow control algorithms (extended abstract)
inferredcites →https://doi.org/10.1145/248156.248175openalex-snapshot
Routing high-bandwidth traffic in max-min fair share networks
inferredcites →https://doi.org/10.1145/248157.248175openalex-snapshot
Routing high-bandwidth traffic in max-min fair share networks
inferredcites →https://doi.org/10.1145/2492101.1555376openalex-snapshot
Delay tolerant bulk data transfers on the internet
inferredcites →https://doi.org/10.1145/77600.77620openalex-snapshot
The maximum concurrent flow problem
inferredcites →https://doi.org/10.1287/opre.6.3.419openalex-snapshot
Constructing Maximal Dynamic Flows from Static Flows
inferredcites →https://doi.org/10.2307/3033543openalex-snapshot
A Set of Measures of Centrality Based on Betweenness
inferredcites →https://doi.org/10.5555/1924943.1924947openalex-snapshot
Finding a needle in Haystack: facebook's photo storage

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.1002/dac.4552openalex-snapshot
Minimizing data access latency in data grids by neighborhood‐based data replication and job scheduling
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.comnet.2019.06.011openalex-snapshot
A survey on resource scheduling for data transfers in inter-datacenter WANs
inferred← citeshttps://doi.org/10.1016/j.comnet.2019.106903openalex-snapshot
Efficient inter-datacenter bulk transfers with mixed completion time objectives
inferred← citeshttps://doi.org/10.1109/comst.2017.2782753openalex-snapshot
Datacenter Traffic Control: Understanding Techniques and Tradeoffs
inferred← citeshttps://doi.org/10.1109/infocom.2018.8486324openalex-snapshot
QuickCast: Fast and Efficient Inter-Datacenter Transfers Using Forwarding Tree Cohorts
inferred← citeshttps://doi.org/10.14279/depositonce-3966openalex-snapshot
Approximation algorithms for complex network flow over time problems
inferred← citeshttps://doi.org/10.31219/osf.io/uzr24openalex-snapshot
QuickCast: Fast and Efficient Inter-Datacenter Transfers using Forwarding Tree Cohorts
inferred← citeshttps://doi.org/10.3390/e21090902openalex-snapshot
Optimization of Big Data Scheduling in Social Networks
inferred← citeshttps://doi.org/10.48550/arxiv.1812.06553openalex-snapshot
Fast and Efficient Bulk Multicasting over Dedicated Inter-Datacenter Networks
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.