DoSP: A Deadline-Aware Dynamic Service Placement Algorithm for Workflow-Oriented IoT Applications in Fog-Cloud Computing Environments
Integrity signals
Registry
Cites
Statistics
Claims the paper makes
Claims other papers make about this one
Each is checked against this paper’s own text: does it say what the citing paper says it does?
A main reason for using fog computing is to improve overall efficiency and performance by reducing communications overhead and latency.
“One real reason is mainly to improve the overall efficiency and performance by reducing the communications overhead (before avoiding the need for sending granular/raw data on limited bandwidth wireless access links) and reducing latency [58].”
From Edge AI: A survey (2023) · cites this paper as [58]
Industrial applications in remote geographical locations or at temporary sites are ideal candidates for mDCs.
“Industrial applications in remote geographical locations or at temporary sites are ideal candidates for mDCs [58].”
From Edge AI: A survey (2023) · cites this paper as [58]
Cites
Fog Computing Micro Datacenter Based Dynamic Resource Estimation and Pricing Model for IoT
Aazam, M., & Huh, E.-N. (2015) · 2015 IEEE 29th International Conference on Advanced Information Networking and Applications · doi:10.1109/aina.2015.254 · Cited by 365 · cited 1× · see citing works
“Aazam and Huh [17] have researched adaptive resource estimation and cost allocation models for IoT applications implemented in the fog computing area.”
BackgroundRouter: fog enabled cloud based intelligent resource management approach for smart home iot devices
Gill, S. S., Garraghan, P., & Buyya, R. (2019) · Journal of Systems and Software · doi:10.1016/j.jss.2019.04.058 · Cited by 165 · see citing works
Self-citation
Flagged first, then by citations
Cited by
Sorted by citations
Singh, R., & Gill, S. S. (2023) · Internet of Things and Cyber-Physical Systems · doi:10.1016/j.iotcps.2023.02.004 · Cited by 572 · see citing works
Self-citation
- Authors
- Sriraghavendra, M., Chawla, P., Wu, H., Gill, S. S., & Buyya, R.
- Affiliations
- Lovely Professional University (IN)
- Tianjin University (CN)
- Queen Mary University of London (GB)
- The University of Melbourne (AU)
- Venue
- Lecture Notes on Data Engineering and Communications Technologies
- Publisher
- Springer Singapore
- Published
- 2021-09-08
- Pages
- 21-47
- ISSN
- 2367-4512 (ISSN-L)
- 2367-4520
- OpenAlex
- W3196553641
- Cited by
- 39
- References
- 2
- Citations by year
- 2026: 2 · 2025: 8 · 2024: 7 · 2023: 13 · 2022: 6 · 2021: 3
- FWCI
- 6.70
- Type
- conference paper
- Language
- en
- Open access
- closed
- Locations
- Lecture notes on data engineering and communications technologies (publishedVersion)
- Queen Mary Research Online (Queen Mary University of London) (submittedVersion)
- Topics
- Physical Sciences › Computer Science › Computer Networks and Communications › IoT and Edge/Fog Computing
- Physical Sciences › Computer Science › Information Systems › Cloud Computing and Resource Management
- Physical Sciences › Computer Science › Information Systems › Service-Oriented Architecture and Web Services
- Keywords
- service placement, fog computing, IoT applications, deadline-aware scheduling, quality of service, genetic algorithm, fog-cloud architecture, response time, edge computing, iFogSim
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review