.png){kind=icon}
.png){kind=icon}
Return
Broadcast tree construction framework in tactile internet via dynamic algorithm
.png){kind=icon}
PRE
AI
DOI：10.1016/j.jss.2017.11.020.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
Extremely low-latency and real-time communications are required in Tactile Internet to transfer physical tactile experiences remotely. In addition, its traffic has stringent requirements on bandwidth and quality of service (QoS). To minimize total costs of establishing the network and satisfy a pre-defined global upper delay-bound on the paths from the server to any other client for message broadcast in Tactile Internet, this paper presents a Rooted Delay-Constrained Minimum Spanning Tree (RDCMST) construction framework based on dynamic algorithm. The network is modeled as a connected weighted and undirected graph. Infeasible and suboptimal edges are discarded first by preprocessing techniques to reduce the processing complexity of the algorithm. Then the edges of the graph are processed based on a dynamic graph algorithm, which can maintain a single-source shortest path tree for the online edge deletions, such that total costs can be minimized while ensuring the delay-constraint and the tree structure. Experimental results show that our proposed approach greatly outperforms existing competing RDCMST formation algorithms, in terms of both average cost and stability of solutions. (C) 2017 Elsevier Inc. All rights reserved.
Keywords:
Tactile Internet
Dynamic algorithm
Rooted delay-constrained minimum spanning tree
Real-time
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
4.1
Papers:
5.4K
Citations:
8.4K