Geometry-aware and approximation-free Dijkstra optimization for discrete and continuous pareto fronts for task offloading in edge computing

Key Points

• Optimized task offloading significantly reduces latency and improves resource management across networks.
• Dijkstra optimization achieves a reduction in processing time by up to 25% for continuous pareto fronts.
• Analytical framework focusing on geometry-aware algorithms ensures effective navigation of task requirements.
• Improvement in task allocation has potential implications for scaling edge computing solutions in real-world applications.