Computers in Operations Research.

Internet of Vehicles (IoV) has drawn great interest recent years. Various IoV applications have emerged for improving the safety, efficiency, and comfort on the road. Cloud computing constitutes a popular technique for supporting delay-tolerant entertainment applications. However, for advanced latency-sensitive applications (e.g., auto/assisted driving and emergency failure management), cloud computing may result in excessive delay. Edge computing, which extends computing and storage capabilities to the edge of the network, emerges as an attractive technology. Therefore, to support these computationally intensive and latency-sensitive applications in IoVs, in this article, we integrate mobile-edge computing nodes (i.e., mobile vehicles) and fixed edge computing nodes (i.e., fixed road infrastructures) to provide low-latency computing services cooperatively. For better exploiting these heterogeneous edge computing resources, the concept of software-defined networking (SDN) and edge-computing-aided IoV (EC-SDIoV) is conceived. Moreover, in a complex and dynamic IoV environment, the outage of both processing nodes and communication links becomes inevitable, which may have life-threatening consequences. In order to ensure the completion with high reliability of latency-sensitive IoV services, we introduce both partial computation offloading and reliable task allocation with the reprocessing mechanism to EC-SDIoV. Since the optimization problem is nonconvex and NP-hard, a heuristic algorithm, fault-tolerant particle swarm optimization algorithm is designed for maximizing the reliability (FPSO-MR) with latency constraints. Performance evaluation results validate that the proposed scheme is indeed capable of reducing the latency as well as improving the reliability of the EC-SDIoV.

Reliable Computation Offloading for Edge-Computing-Enabled Software-Defined IoV

Computing systems are of growing importance because of their wide use in many areas including those in safety-critical systems. This book describes the basic models and approaches to the reliability analysis of such systems. An extensive review is provided and models are categorized into different types. Some Markov models are extended to the analysis of some specific computing systems such as combined software and hardware, imperfect debugging processes, failure correlation, multi-state systems, heterogeneous subsystems, etc. One of the aims of the presentation is that based on the sound analysis and simplicity of the approaches, the use of Markov models can be better implemented in the computing system reliability.

Computing System Reliability: Models and Analysis

A hybrid vendor managed inventory and redundancy allocation optimization problem in supply chain management: An NSGA-II with tuned parameters

https://ssyu.im.ncnu.edu.tw/08002813274913549.pdf

Task allocation for maximizing reliability of a distributed system using hybrid particle swarm optimization

https://ir.nctu.edu.tw:443/bitstream/11536/31250/1/000081471700004.pdf

Efficient algorithms for reliability analysis of distributed computing systems

https://ir.nctu.edu.tw:443/bitstream/11536/190/1/A1997YJ57400006.pdf

The computational complexity of the reliability problem on distributed systems

https://ir.nctu.edu.tw:443/bitstream/11536/29604/1/000168174200002.pdf

The distributed program reliability analysis on ring-type topologies

https://ir.nctu.edu.tw:443/bitstream/11536/30791/1/000084433000003.pdf

The distributed program reliability analysis on star topologies

This paper investigates the problem of distributed-program reliability in various classes of distributed computing systems. This problem is computationally intractable for arbitrary distributed computing systems, even when it is restricted to the class of star distributed computing systems. One solvable case for star distributed computing systems is identified, in which data files are distributed with respective to a consecutive property; a polynomial-time algorithm is developed for this case. A linear-time algorithm is developed to test whether or not an arbitrary star distributed computing system has this consecutive file distribution property. Efficient algorithms may still be sought for computing lower and upper bounds on the distributed program reliability for arbitrary distributed computing systems.

https://ir.nctu.edu.tw:443/bitstream/11536/31465/1/000080389600015.pdf

Min-Sheng Lin

Papers

Efficient algorithms for reliability analysis of distributed computing systems

The computational complexity of the reliability problem on distributed systems

The distributed program reliability analysis on ring-type topologies

The distributed program reliability analysis on star topologies

Distributed-program reliability analysis: complexity and efficient algorithms