https://github.com/czgdp1807/mecoptimaloffloading

Optimization of Offloading Scheme Algorithm for Large Number of Tasks in Mobile-Edge Computing
https://github.com/czgdp1807/mecoptimaloffloading

mobile-edge-computing networking

Last synced: 2 days ago
JSON representation

Optimization of Offloading Scheme Algorithm for Large Number of Tasks in Mobile-Edge Computing

• Host: GitHub
• URL: https://github.com/czgdp1807/mecoptimaloffloading
• Owner: czgdp1807
• License: bsd-3-clause
• Created: 2020-04-15T16:16:20.000Z (over 4 years ago)
• Default Branch: master
• Last Pushed: 2020-10-15T11:12:01.000Z (almost 4 years ago)
• Last Synced: 2023-03-04T02:21:03.324Z (over 1 year ago)
• Topics: mobile-edge-computing, networking
• Language: Python
• Homepage: https://czgdp1807.github.io/2020/04/16/optimal_offloading.html
• Size: 79.1 KB
• Stars: 90
• Watchers: 3
• Forks: 31
• Open Issues: 1
• Metadata Files:
  • Readme: README.md
  • License: LICENSE

Awesome Lists containing this project

README

        
[![DOI](https://zenodo.org/badge/DOI/10.5281/zenodo.4036587.svg)](https://doi.org/10.5281/zenodo.4036587)

About

-----

This project has made the following contributions,

1. A modified form of the Bi-section search algorithm first presented in [1] is implemented. The trends observed are as expected. See, `results/bi_search` directory.

2. An efficient local search algorithm is proposed which finds the offloading schemes which are very close to the optimal offloading schemes using very little computation efforts as compared to the search algorithms presented in [1].

3. Numerical benchmarking has been done on the basis of parameters used in [1] for each algorithm implemented to verify the correctness and to support our claims. See, `results/local_search` and See, `results/naive_search` directory.

Dependencies

------------

1. Python 3.6.9

2. Matplotlib 2.1.0

Testing

-------

Please follow the steps given below for running tests,

1. Change your directory the root of this repository that is, `/path/to/MECOptimalOffloading`.

2. Execute, `python3 mecoptimaloffloading/tests/test_[x]_search.py`, where `[x]` can be replaced by `bi` for testing Bi-section search implementation, `local` for testing local search algorithm, and `naive` for testing naive search algorithm.

You can modify the `config` which is `dict` python variable for changing the parameters according to the conditions. The keys use strings which are in accordance with the notations used in [1].

References

----------

[1] J. Yan, S. Bi, and Y. J. Zhang, “Optimal offloading and resource allocation in mobile-edge computing with inter-user task dependency,” accepted by IEEE GLOBECOM, Dec. 2018.

[2] Y. Mao, C. You, J. Zhang, K. Huang, and K. B. Letaief, “A survey on mobile edge computing: The communication perspective,” IEEE Commun. Surveys Tuts., vol. 19, no. 4, pp. 2322–2358, Fourthquarter 2017.

Cite As

-------

```

@software{gagandeep_singh_2020_4036587,

  author       = {Gagandeep Singh},

  title        = {{czgdp1807/MECOptimalOffloading: 

                   MECOptimalOffloading v1.0.0}},

  month        = sep,

  year         = 2020,

  publisher    = {Zenodo},

  version      = {v1.0.0},

  doi          = {10.5281/zenodo.4036587},

  url          = {https://doi.org/10.5281/zenodo.4036587}

}

```