Conference paper · 2024 · Open access
A Practical Near Optimal Deployment of Service Function Chains in Edge-to-Cloud Networks
IEEE Conference on Computer Communications (INFOCOM), 751–760 · Published 20 May 2024 · DOI 10.1109/infocom52122.2024.10621162
In brief
“A Practical Near Optimal Deployment of Service Function Chains in Edge-to-Cloud Networks” is a 2024 conference paper by Rasoul Behravesh and 3 co-authors, published in IEEE Conference on Computer Communications (INFOCOM). OpenAlex counts 10 citations as of 19 November 2026. It is open access under a CC BY-NC-ND licence: the full text is free to read at arXiv (Cornell University).
- Citations
- 10
- Most cited in
- 2026 (5)
- Field-weighted impact
- 2.49
- References
- 32
- Authors
- 4
Abstract
Mobile edge computing offers a myriad of opportunities to innovate and introduce novel applications, thereby enhancing user experiences considerably. A critical issue extensively investigated in this domain is efficient deployment of Service Function Chains (SFCs) across the physical network, spanning from the edge to the cloud. This problem is known to be NP-hard. As a result of its practical importance, there is significant interest in the development of high-quality sub-optimal solutions.In this paper, we consider this problem and propose a novel near-optimal heuristic that is extremely efficient and scalable. We compare our solution to the state-of-the-art heuristic and to the theoretical optimum. In our large scale evaluations, we use realistic topologies which were previously reported in the literature. We demonstrate that the execution time offered by our solution grows slowly as the number of Virtual Network Function (VNF) forwarding graph embedding requests grows, and it handles one million requests in slightly more than 20 seconds for 100 nodes and 150 edges physical topology.
Cite this paper
Formatted from the catalogue record. Check names, capitals and page numbers against the paper before you submit.
APA 7
Behravesh, R., Breitgand, D., Lorenz, D. H., & Raz, D. (2024). A Practical Near Optimal Deployment of Service Function Chains in Edge-to-Cloud Networks. IEEE Conference on Computer Communications (INFOCOM), 751–760. https://doi.org/10.1109/infocom52122.2024.10621162
MLA 9
Behravesh, Rasoul, et al. “A Practical Near Optimal Deployment of Service Function Chains in Edge-to-Cloud Networks.” IEEE Conference on Computer Communications (INFOCOM), 2024, pp. 751–760. https://doi.org/10.1109/infocom52122.2024.10621162.
Chicago
Behravesh, Rasoul, David Breitgand, Dean H. Lorenz, and Danny Raz. 2024. “A Practical Near Optimal Deployment of Service Function Chains in Edge-to-Cloud Networks.” IEEE Conference on Computer Communications (INFOCOM): 751–760. https://doi.org/10.1109/infocom52122.2024.10621162.
Harvard
Behravesh, R. et al. (2024) ‘A Practical Near Optimal Deployment of Service Function Chains in Edge-to-Cloud Networks’, IEEE Conference on Computer Communications (INFOCOM), pp. 751–760. doi:10.1109/infocom52122.2024.10621162.
IEEE
R. Behravesh, D. Breitgand, D. H. Lorenz, and D. Raz, “A Practical Near Optimal Deployment of Service Function Chains in Edge-to-Cloud Networks,” IEEE Conference on Computer Communications (INFOCOM), pp. 751–760, 2024, doi: 10.1109/infocom52122.2024.10621162.
BibTeX
@inproceedings{behravesh2024practical,
title = {{A Practical Near Optimal Deployment of Service Function Chains in Edge-to-Cloud Networks}},
author = {Behravesh, Rasoul and Breitgand, David and Lorenz, Dean H. and Raz, Danny},
booktitle = {IEEE Conference on Computer Communications (INFOCOM)},
year = {2024},
pages = {751--760},
doi = {10.1109/infocom52122.2024.10621162},
url = {https://doi.org/10.1109/infocom52122.2024.10621162}
}
Download for a reference manager: BibTeX (.bib) · RIS for Zotero, Mendeley and EndNote (.ris)
Citations by year
| Year | Citations | Share of the best year |
|---|---|---|
| 2024 | 1 | |
| 2025 | 4 | |
| 2026 | 5 |
Its field-weighted citation impact is 2.49: it has been cited 2.49 times as often as the average work of the same field, type and year (1.00 is the world average).
Topic and keywords
Physical Sciences › Computer Science › Computer Networks and Communications › Software-Defined Networks and 5G
- service function chaining
- mobile edge computing
- heuristic algorithms
- near-optimal solutions
- NP-hard optimization
- scalability
Work with this paper
Most-cited papers in Computer Science
- ImageNet classification with deep convolutional neural networksAlex Krizhevsky, Ilya Sutskever, Geoffrey E. Hinton · Communications of the ACM · 2017 · 114,726 citations
- Long Short-Term MemorySepp Hochreiter, Jürgen Schmidhuber · Neural Computation · 1997 · 109,097 citations
- A Mathematical Theory of CommunicationClaude E. Shannon · Bell System Technical Journal · 1948 · 91,736 citations
- Deep learningYann LeCun, Yoshua Bengio, Geoffrey E. Hinton · Nature · 2015 · 90,226 citations
- Faster R-CNN: Towards Real-Time Object Detection with Region Proposal NetworksShaoqing Ren, Kaiming He, Ross Girshick and 1 more · IEEE Transactions on Pattern Analysis and Machine Intelligence · 2016 · 74,143 citations
Questions about this paper
How do I cite this paper in APA style?
Behravesh, R., Breitgand, D., Lorenz, D. H., & Raz, D. (2024). A Practical Near Optimal Deployment of Service Function Chains in Edge-to-Cloud Networks. IEEE Conference on Computer Communications (INFOCOM), 751–760. https://doi.org/10.1109/infocom52122.2024.10621162
How many times has this paper been cited?
10 times, according to OpenAlex on 19 November 2026. Google Scholar and Scopus count different sets of sources, so their numbers differ.
Is this paper free to read?
Yes. It is open access at arXiv (Cornell University): sign in and open the PDF from this page.
Who wrote this paper?
Rasoul Behravesh, David Breitgand, Dean H. Lorenz, Danny Raz.
What is the DOI of this paper?
10.1109/infocom52122.2024.10621162, permanently at https://doi.org/10.1109/infocom52122.2024.10621162. Sign in and open it from this page.
Bibliographic data from OpenAlex (CC0), last checked 19 November 2026. ResearchGuru does not host this paper; once you are signed in, the links open it at the publisher or the repository that does.