Optimistic Constrained Online Convex Optimization for Resource Reservation in Tactile Internet

Tactile Internet has emerged as a cutting-edge application in 5G, aligning with requirements of Ultra-Reliable Low-Latency Communications (URLLC), and is expected to be an essential service in 6G. TI service traffic is characterized by a high burstiness, and the design of effective resource reservation strategies remains an open research in this context. To address this challenge, we formulate the resource reservation problem in the Tactile Internet as an online decision-making task and address it by applying Optimistic Constrained Online Convex Optimization, profiting from Tactile Internet traffic prediction capabilities. We validate the proposed optimistic algorithm by utilizing a traffic dataset based on a self-developed haptic-visual testbed, demonstrating the optimistic algorithm’s superior performance compared to the non-optimistic baseline.

Authors

Institutions

Publication Details

Published
2025-12-08
DOI
https://doi.org/10.1109/globecom59602.2025.11432179
Primary Topic
Optimization and Search Problems
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Optimistic Constrained Online Convex Optimization for Resource Reservation in Tactile Internet

Vineeth S. Varma, Yu Yeh, Salah Eddine Elayoubi
Optimization and Search Problems
article

Optimistic Constrained Online Convex Optimization for Resource Reservation in Tactile Internet

Vineeth S. Varma, Yu Yeh, Salah Eddine Elayoubi
article en

Abstract

Tactile Internet has emerged as a cutting-edge application in 5G, aligning with requirements of Ultra-Reliable Low-Latency Communications (URLLC), and is expected to be an essential service in 6G. TI service traffic is characterized by a high burstiness, and the design of effective resource reservation strategies remains an open research in this context. To address this challenge, we formulate the resource reservation problem in the Tactile Internet as an online decision-making task and address it by applying Optimistic Constrained Online Convex Optimization, profiting from Tactile Internet traffic prediction capabilities. We validate the proposed optimistic algorithm by utilizing a traffic dataset based on a self-developed haptic-visual testbed, demonstrating the optimistic algorithm’s superior performance compared to the non-optimistic baseline.

Centre National de la Recherche Scientifique (FR), Laboratoire des signaux et systèmes (FR), CentraleSupélec (FR), Centre de Recherche en Automatique de Nancy (FR), Université de Lorraine (FR)
Openalex Percentile: Top 59%
Optimization and Search Problems
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.