Downloads provided by UsageCounts
doi: 10.1109/netsoft57336.2023.10175499 , 10.5281/zenodo.8379774 , 10.5281/zenodo.8379775 , 10.48550/arxiv.2210.14208
arXiv: 2210.14208
handle: 10016/46812
doi: 10.1109/netsoft57336.2023.10175499 , 10.5281/zenodo.8379774 , 10.5281/zenodo.8379775 , 10.48550/arxiv.2210.14208
arXiv: 2210.14208
handle: 10016/46812
Recent trends in robotic services propose offloading robot functionalities to the Edge to meet the strict latency requirements of networked robotics. However, the Edge is typically an expensive resource and sometimes the Cloud is also an option, thus, decreasing the cost. Following this idea, we propose Don’t Let Me Down! (DLMD), an algorithm that promotes offloading robot functions to the Cloud when possible to minimise the consumption of Edge resources. Additionally, DLMD takes the appropriate migration, traffic steering, and radio handover decisions to meet robotic service requirements as strict latency constraints. In the paper, we formulate the optimisation problem that DLMD aims to solve, compare DLMD performance against the state of the art, and perform stress tests to assess DLMD performance in small & large networks. Results show that DLMD (i) always finds solutions in less than 30ms; (ii) is optimal in a local warehousing use case; and (iii) consumes only 5% of the Edge resources upon network stress
Networking and Internet Architecture (cs.NI), FOS: Computer and information sciences, robotic, Telecomunicaciones, optimisation, NetSoft 2023, Robotic, Computer Science - Networking and Internet Architecture, Computer Science - Robotics, Optimization : Offloading, Edge, offloading, Robotics (cs.RO), deteministic networking
Networking and Internet Architecture (cs.NI), FOS: Computer and information sciences, robotic, Telecomunicaciones, optimisation, NetSoft 2023, Robotic, Computer Science - Networking and Internet Architecture, Computer Science - Robotics, Optimization : Offloading, Edge, offloading, Robotics (cs.RO), deteministic networking
| selected citations These citations are derived from selected sources. This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | 1 | |
| popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network. | Average | |
| influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | Average | |
| impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network. | Average |
| views | 20 | |
| downloads | 26 |

Views provided by UsageCounts
Downloads provided by UsageCounts