# Reliability-Centric Analysis of Offloaded Computation in Cooperative Wearable Applications

Authors: Aleksandr Ometov; Dmitry Kozyrev; Vladimir Rykov; Sergey Andreev; Yuliya Gaidamaka; Yevgeni Koucheryavy
Journal: Wireless Communications and Mobile Computing
 (2017)

---

## Abstract

Motivated by the unprecedented penetration of mobile communications technology, this work carefully brings into perspective the challenges related to heterogeneous communications and offloaded computation operating in cases of fault-tolerant computation, computing, and caching. We specifically focus on the emerging augmented reality applications that require reliable delegation of the computing and caching functionality to proximate resource-rich devices. The corresponding mathematical model proposed in this work becomes of value to assess system-level reliability in cases where one or more nearby collaborating nodes become temporarily unavailable. Our produced analytical and simulation results corroborate the asymptotic insensitivity of the stationary reliability of the system in question (under the “fast” recovery of its elements) to the type of the “repair” time distribution, thus supporting the fault-tolerant system operation.


---

## Body

## 1. Introduction and Motivation

With the rapid proliferation of wireless communications technology, pushed by the avalanche of demanding services, mobile users are preparing to meet much higher levels of service experience than ever before. This poses an unprecedented burden on the existing as well as emerging wireless infrastructures [1]. Indeed, the numbers of connected handheld devices have increased dramatically over the past decade [2], and this growth is only expected to continue further with the introduction of wearables.Today’s transition toward next-generation (5G) mobile technology brings along an astounding variety of networked devices, like low-end wearables, augmented and virtual reality eye-wear, and self-driving cars, among many others [3, 4]. This paradigm shift unlocks a large diversity of completely new applications and scenarios, which not only require conventional resources (e.g., bandwidth) but also impose other important constraints, primarily along the lines of latency and reliability [5]. The latter is due to an ongoing evolution of pre-5G networking ecosystem, as it departs from serving primarily human-to-human (H2H) applications to embracing diverse machine-type communications (MTC) services [6, 7].However, despite significant progress in circuit design, supported by cheaper production processes [8] and increasingly high pace of technological revolution [9], many application-level tasks are still infeasible to be executed in the resource-limited end-user devices [10]. This is because of different factors, such as reduced computation capabilities, high-speed mobility, and stringent security. The above is especially true for the more constrained Internet-of-Things (IoT) objects, including wearables, which are still designed so that their efficiency is maintained only when completing a certain set of predefined tasks, which may hamper their applicability.To make matters worse, our present-day devices still considerably depend on energy efficiency of communication [11]. People are therefore forced to charge their carriable and wearable equipment on a daily basis, which is a dramatic departure from the time when mobile phone was able to last for a week on one charging cycle. The energy harvesting and transfer techniques, including wireless charging or generating energy from heat, are still in their infancy, and their mass adoption may not take off any time soon [12], thus leaving the devices with extremely limited battery lifetimes.Fortunately, in many cases a viable option for “on-the-fly” execution of a processing-hungry task is by offloading (delegating) it to more resource-rich and power-independent node(s). Then, after the input information has been processed remotely (possibly, in a distributed manner), it would be returned to the original constrained device hence saving its resources, as opposed to executing the task locally on the device [13]. Allocating more computing resources in the network and supplying user devices with appropriate communications technology to improve the energy efficiency via offloaded computation pose new challenges. These include the need for reliable wireless connectivity and failure-free remote processing of information, which could be resolved with the advent of communication and computing cooperation (3C) techniques [14, 15].The development of 3C solutions has a long history behind, as it comes from conventional cloud computing [16], through fog structures [17], all the way to the network edge [18, 19]. This transition, in turn, underpins a new concept of mobile edge computing (MEC) as an emerging computing and caching paradigm [20]. MEC was initially employed in 2013 to facilitate the execution of services at the edge of a network, when IBM and NSN introduced a platform that could run applications on a mobile base station. These early efforts only had local impact [21] and did not consider other important aspects, like application migration and interoperability, among others.MEC grew to its current importance a year after, when ETSI launched their Industry Specification Group (ISG) for mobile edge computing in 2014. With this specification, MEC aimed to “provide an IT service environment and cloud computing capabilities at the edge of the mobile network.” This group also pursues creation of an open ecosystem, where service providers can deploy their applications across multivendor MEC platforms, and the target services are expected to include augmented reality, intelligent video acceleration, connected cars, and IoT gateways, to name a few [22]. Once standardization is complete, telecommunication companies will become capable of deploying this service environment in their infrastructures.In light of the above, the main contributions and the structure of this paper are as follows. We address an important question of whether MEC as part of the 3C system can operate reliably in advanced 5G-grade scenarios, such as “connected law enforcement officer” in urban settings. The subsequent Section2 offers a brief review of computation offloading and communications techniques for smart mobile devices, mainly focusing on network-edge operation. Further, the use of specialized wearable equipment utilized in the proposed system design is discussed in Section 3. The paper continues with our developed analytical model in Section 4. In Section 5, we deliver the corresponding numerical results. Our study is concluded in the last section.


## 2. Communications and Computing Cooperation Strategies

### 2.1. Review of Emerging 3C Solutions

One of the most prominent solutions under the umbrella of 5G ecosystem from the 3C perspective is computation offloading [23]. This paradigm has been coined for resource-constrained and energy-hungry devices, which have difficulty in handling their heavy computation tasks and thus need to delegate those to more resourceful nodes. This allows to make a decisive step forward in the direction of content-oriented networking, in contrast to connection-oriented technology, thus targeting an increase in cooperative network capacity [24].To this end, the stringent requirements of new applications and services are pushing the network operators to develop diverse communications capabilities in the form of heterogeneous networks (HetNets) [25–27]. For example, cellular macrocells can deliver coverage, while smaller cells may supply capacity, hence providing the users with better quality of experience (QoE) and lowering harmful interference [28]. Therefore, HetNets emerge as advanced architectures that are able to serve demanding user scenarios, by utilizing increasingly diverse wireless technologies across the same geographical area, but posing a complex challenge of backhaul efficiency [29].Making backhaul more effective than in already deployed HetNet solutions may be costly for the network operators. On the other hand, radio access network (RAN) capacity can potentially be increased by deploying higher numbers of small cells. As one of the approaches to overcome this challenge, various caching techniques have been proposed and utilized [30, 31]. These provide the end users with easy access to content of high demand, which is stored locally instead of being transferred repeatedly over “expensive” communications links, especially during peak hours.The range of network architectures to be utilized is very wide. Accounting for the fact that any of the proposed techniques can be executed not only on the infrastructure side but also by offloading tasks onto other user devices in proximity, device-to-device (D2D) technologies have recently seen a renewed research interest [32, 33]. Further facilitated by the latest progress in affordable memory capacity, transparent caching in key locations allows boosting the content delivery as well as improving the network resource utilization, even when the same content is not requested by the users simultaneously.


### 2.2. Emerging User Applications

As follows from the above, capable mobile devices (smartphones, high-end wearables, cars, etc.) are changing the lives of people. Already in 2015, the time spent by the average user online has been up to 5 hours daily [34] and it is commonly anticipated to grow further, since people turn more to their mobile devices as opposed to legacy stationary equipment. This, in turn, creates higher loads due to repetitive content downloads that could however be cached either on the network or on the user side.A particularly challenging use case in the above context, enabled by the decisive advancements in wearable and computing technologies, is augmented reality (AR), which opens the door to genuinely interactive user experience [35]. Different from virtual reality (VR), AR aims to supplement the real world instead of creating an entirely artificial environment. To this end, various objects in the person’s surroundings become the target items for computer-generated annotations, which require complex and often real-time computation. This, in turn, substantiates the need for content delivery transformation, thus producing a diversity of computation-heavy and delay-sensitive AR applications [36].While modern AR devices are already capable of advanced hardware acceleration [37], the opportunities for software-based data analysis remain rather limited. Today, the data is typically sent to the dedicated processing device by utilizing a cable connection. Hence, leading vendors are actively pursuing the implementation of mobile and truly wireless AR/VR technology [38]. However, the task of pattern matching, especially in the video processing applications, is still very challenging for the standalone smart glasses, and hence distributed/offloaded computation methods rapidly become one of the key areas of interest [39].


### 2.3. Computation Offloading Techniques

The notion of “cloud” first appeared in the late 70s, thus shaping the concept of distributed storage and computation. Since then, the evolution of cloud-based techniques counted a long history and in this paper we sketch the state of the art in this area only briefly.(1) Cloud and Fog Computing. Generally, the concept of migrating the computation and data from portable and desktop devices to larger data centers is known as cloud computing [40]. The applications of interest are therefore delivered as services to the end users over the Internet, while the hardware for actually running those is “rented” from the service providers. Cloud-service clients help receive more capacity during the peak demand hours, reduce the device costs, and increase the network utilization dramatically, primarily at the network edge.Another development in cloud computing is named fog computing [41]. The original definition was, “extension of the cloud computing paradigm (that) provides computation, storage, and networking services between end devices and traditional cloud servers” [42]. Technically, fog computing is a supplement for the conventional cloud computing that allows analyzing localized information “on-the-fly” by taking advantage of the locally deployed servers instead of forwarding all of the data to the remote server.(2) Mobile Edge Computing. The core idea behind the concept of MEC is to execute the demanding applications even closer to the end user, that is, on the most proximate base stations [43]. The main benefits delivered to both the network operators and the end clients are as follows: (i) lower latency; (ii) higher bandwidth; and (iii) improved location awareness.(3) Mobile Cloud Computing.Another noteworthy direction in the development of computation offloading from MEC techniques is mobile cloud computing (MCC) [44, 45]. Based on the concept of mobile delegation, MCC leads to decentralized storage and facilitates distribution of execution between various mobile nodes that may operate at the network edge [46].Solutions for MCC are many, but in cases where wireless connection to the base station (or, more generally, to the cloud) is not reliable, the devices can group together and solve the task collaboratively [47]. Existing multiplatform frameworks already allow migrating a part of the device’s code to the neighboring “helper” nodes [48]. When such delegation is complete, the memory, CPU state, and other application-related resources are utilized independently. After the task at hand is finalized, the result is delivered back to the requester device.In the following subsection, we briefly elaborate on the caching techniques that correspond to the reviewed offloading mechanisms.


### 2.4. Caching Strategies

Similarly to the case of classifying the computing strategies, two main groups of caching techniques could be identified. One involves using the network infrastructure, while the other is based on utilizing distributed user devices in proximity.(1) Conventional Caching Strategies.First, infrastructure-based caching strategies are to be considered. In the Long Term Evolution (LTE) cellular networks by 3GPP, two types of locations appear attractive for deploying 5G-grade caches [49]: (i) in the Evolved Packet Core (reflecting the cloud computing paradigm) or (ii) in the RAN on the base station side (representing the MEC concept). For example, caching the content library at the femtocell stations (so-called femtocaching [50]) holds a promise to mitigate the backhaul requirements in next-generation 5G-grade HetNets [51].(2) Distributed Caching Strategies.On the other hand, mobile user equipment already has a significant amount of data storage at its disposal. Since most of the users tend to consume similar content in their daily life [52] (e.g., news, social network data, blogs, and popular location-based files), the possibilities of utilizing direct D2D links for delivering popular content arise as an attractive solution [53]. Moreover, the costs of such technology integration appear to be more affordable as compared to the infrastructure-based caching.The discussed development of 3C toward MEC and MCC solutions opens numerous opportunities for emerging 5G applications. The following section outlines our representative scenario of interest, where the goal is to select the most appropriate approach for supporting an advanced wearable application.


## 2.1. Review of Emerging 3C Solutions

One of the most prominent solutions under the umbrella of 5G ecosystem from the 3C perspective is computation offloading [23]. This paradigm has been coined for resource-constrained and energy-hungry devices, which have difficulty in handling their heavy computation tasks and thus need to delegate those to more resourceful nodes. This allows to make a decisive step forward in the direction of content-oriented networking, in contrast to connection-oriented technology, thus targeting an increase in cooperative network capacity [24].To this end, the stringent requirements of new applications and services are pushing the network operators to develop diverse communications capabilities in the form of heterogeneous networks (HetNets) [25–27]. For example, cellular macrocells can deliver coverage, while smaller cells may supply capacity, hence providing the users with better quality of experience (QoE) and lowering harmful interference [28]. Therefore, HetNets emerge as advanced architectures that are able to serve demanding user scenarios, by utilizing increasingly diverse wireless technologies across the same geographical area, but posing a complex challenge of backhaul efficiency [29].Making backhaul more effective than in already deployed HetNet solutions may be costly for the network operators. On the other hand, radio access network (RAN) capacity can potentially be increased by deploying higher numbers of small cells. As one of the approaches to overcome this challenge, various caching techniques have been proposed and utilized [30, 31]. These provide the end users with easy access to content of high demand, which is stored locally instead of being transferred repeatedly over “expensive” communications links, especially during peak hours.The range of network architectures to be utilized is very wide. Accounting for the fact that any of the proposed techniques can be executed not only on the infrastructure side but also by offloading tasks onto other user devices in proximity, device-to-device (D2D) technologies have recently seen a renewed research interest [32, 33]. Further facilitated by the latest progress in affordable memory capacity, transparent caching in key locations allows boosting the content delivery as well as improving the network resource utilization, even when the same content is not requested by the users simultaneously.


## 2.2. Emerging User Applications

As follows from the above, capable mobile devices (smartphones, high-end wearables, cars, etc.) are changing the lives of people. Already in 2015, the time spent by the average user online has been up to 5 hours daily [34] and it is commonly anticipated to grow further, since people turn more to their mobile devices as opposed to legacy stationary equipment. This, in turn, creates higher loads due to repetitive content downloads that could however be cached either on the network or on the user side.A particularly challenging use case in the above context, enabled by the decisive advancements in wearable and computing technologies, is augmented reality (AR), which opens the door to genuinely interactive user experience [35]. Different from virtual reality (VR), AR aims to supplement the real world instead of creating an entirely artificial environment. To this end, various objects in the person’s surroundings become the target items for computer-generated annotations, which require complex and often real-time computation. This, in turn, substantiates the need for content delivery transformation, thus producing a diversity of computation-heavy and delay-sensitive AR applications [36].While modern AR devices are already capable of advanced hardware acceleration [37], the opportunities for software-based data analysis remain rather limited. Today, the data is typically sent to the dedicated processing device by utilizing a cable connection. Hence, leading vendors are actively pursuing the implementation of mobile and truly wireless AR/VR technology [38]. However, the task of pattern matching, especially in the video processing applications, is still very challenging for the standalone smart glasses, and hence distributed/offloaded computation methods rapidly become one of the key areas of interest [39].


## 2.3. Computation Offloading Techniques

The notion of “cloud” first appeared in the late 70s, thus shaping the concept of distributed storage and computation. Since then, the evolution of cloud-based techniques counted a long history and in this paper we sketch the state of the art in this area only briefly.(1) Cloud and Fog Computing. Generally, the concept of migrating the computation and data from portable and desktop devices to larger data centers is known as cloud computing [40]. The applications of interest are therefore delivered as services to the end users over the Internet, while the hardware for actually running those is “rented” from the service providers. Cloud-service clients help receive more capacity during the peak demand hours, reduce the device costs, and increase the network utilization dramatically, primarily at the network edge.Another development in cloud computing is named fog computing [41]. The original definition was, “extension of the cloud computing paradigm (that) provides computation, storage, and networking services between end devices and traditional cloud servers” [42]. Technically, fog computing is a supplement for the conventional cloud computing that allows analyzing localized information “on-the-fly” by taking advantage of the locally deployed servers instead of forwarding all of the data to the remote server.(2) Mobile Edge Computing. The core idea behind the concept of MEC is to execute the demanding applications even closer to the end user, that is, on the most proximate base stations [43]. The main benefits delivered to both the network operators and the end clients are as follows: (i) lower latency; (ii) higher bandwidth; and (iii) improved location awareness.(3) Mobile Cloud Computing.Another noteworthy direction in the development of computation offloading from MEC techniques is mobile cloud computing (MCC) [44, 45]. Based on the concept of mobile delegation, MCC leads to decentralized storage and facilitates distribution of execution between various mobile nodes that may operate at the network edge [46].Solutions for MCC are many, but in cases where wireless connection to the base station (or, more generally, to the cloud) is not reliable, the devices can group together and solve the task collaboratively [47]. Existing multiplatform frameworks already allow migrating a part of the device’s code to the neighboring “helper” nodes [48]. When such delegation is complete, the memory, CPU state, and other application-related resources are utilized independently. After the task at hand is finalized, the result is delivered back to the requester device.In the following subsection, we briefly elaborate on the caching techniques that correspond to the reviewed offloading mechanisms.


## 2.4. Caching Strategies

Similarly to the case of classifying the computing strategies, two main groups of caching techniques could be identified. One involves using the network infrastructure, while the other is based on utilizing distributed user devices in proximity.(1) Conventional Caching Strategies.First, infrastructure-based caching strategies are to be considered. In the Long Term Evolution (LTE) cellular networks by 3GPP, two types of locations appear attractive for deploying 5G-grade caches [49]: (i) in the Evolved Packet Core (reflecting the cloud computing paradigm) or (ii) in the RAN on the base station side (representing the MEC concept). For example, caching the content library at the femtocell stations (so-called femtocaching [50]) holds a promise to mitigate the backhaul requirements in next-generation 5G-grade HetNets [51].(2) Distributed Caching Strategies.On the other hand, mobile user equipment already has a significant amount of data storage at its disposal. Since most of the users tend to consume similar content in their daily life [52] (e.g., news, social network data, blogs, and popular location-based files), the possibilities of utilizing direct D2D links for delivering popular content arise as an attractive solution [53]. Moreover, the costs of such technology integration appear to be more affordable as compared to the infrastructure-based caching.The discussed development of 3C toward MEC and MCC solutions opens numerous opportunities for emerging 5G applications. The following section outlines our representative scenario of interest, where the goal is to select the most appropriate approach for supporting an advanced wearable application.


## 3. Utilization of High-End Wearables

In the rest of this paper, we focus on thedistributed caching and computing strategies within the scope of MEC and MCC paradigms. Assuming that modern user devices are already capable of storing large amounts of information, this data needs to be delivered to more computationally powerful nodes for further processing [54]; see our considered example in Figure 1.Figure 1
Connected law enforcement officer scenario.One of the feasible approaches here is to enable dynamic data prefetching, where mobile but more computationally powerful devices (or infrastructure nodes) acquire and deliver the relevant information to less computationally powerful equipment [55]. The latter could become the basis for the following three main applications:(i)
Caching of popular content: news, videos, maps, and more could be stored in the devices based on their proximity and then delivered directly if requested by other nodes in the network [56].(ii)
Incentive mechanisms: users in proximity may assist the target device based on a certain incentive mechanism, be it operator bonuses, seller discounts, or access to another service.(iii)
Special cases: users may be engaged in assisting the dedicated devices of special forces, that is, police, firefighters, and ambulance, among others, thus providing them with the required computing and caching resources upon request.In all of the above listed cases, there may be situations when the device/network has the knowledge that it will be approached by another device in need later on. Then, the content can be precached in the “helper” device proactively by taking advantage of a reliable connection to the infrastructure, while refraining from utilizing this expensive connectivity for the target requester device [57]. The security, privacy, and anonymity remain as important challenges to facilitate such operation but are left out of scope of this work. The authors assume that all data is encrypted and, for example, pairwise key cryptography is utilized.


### 3.1. Smart Devices of Interest

Today, various types of special forces are equipped with advanced devices [58], including smart cameras, health monitors, and communications systems. While health monitoring may not require real-time and heavy data analytics [59, 60], the assessment of the surrounding environment can have tremendous demands in terms of communications and computation.Present-day technology revolution is primarily pushed by the industry giants. For example, Connected Law Enforcement Officer program by Motorola facilitates real-time collaboration experience between different specialized devices to improve the response times within the ecosystem of mission-critical services. This solution makes it possible for teams of people, in the field or in the office, to effectively communicate and cooperate by exchanging voice and data, securely, reliably, and in real time, regardless of network, carrier, or device, whether deployed inside the client’s network infrastructure or in the cloud as a hosted/managed solution.In order to improve the operating efficiency and accelerate decision making, the devices need to collaborate seamlessly and share information “on-the-fly.” The considered set of mobile devices typically includes the following:(i)
Video speaker microphone: it combines a body-mounted camera with a high-quality radio speaker microphone and a touchscreen interface, for intuitive capture, storage, and management of video, audio, and image evidence.(ii)
Portable radio: it provides reliable “push-to-talk” communications as well as superior audio quality for essential day-to-day and emergency two-way radio communications.(iii)
Handheld smartphone: it offers reliable broadband connectivity and enables users to enjoy intelligent support of the entire team. With its rugged form factor, powerful data applications, and a quick-response user interface, it delivers “always-on” mission-critical user experience to improve situational awareness for police, firefighter, rescue, and emergency medical services as well as for organizations that support critical infrastructure.(iv)
Connected car: it is equipped with, for example, TETRA radio, mobile computing features, and mission-critical 3GPP LTE broadband connectivity; it supports intuitive data applications as well as automatic number plate recognition (ANPR), video surveillance, lights, and sirens functionality, which can be accessed and managed effortlessly. This vehicle is particularly of interest for our case study due to its superior computation and caching capabilities, as well as more stable connectivity to the network infrastructure.(v)
AR glasses are expected to join this set soon: they assist the user in a range of tasks and provide real-time assessment of the surrounding environment for faster response [61].The considered application ecosystem includes real-time video streaming, computer-aided dispatch, unified “push-to-talk,” electronic citation, report writing, and data capture. In what follows, we primarily focus on the representative use case where a group of high-tech equipped officers on duty collaborate with each other. However, our findings generally hold valid for a range of similar mission-critical scenarios as discussed below.


### 3.2. Scenario of Interest

In this work, we concentrate on a study case that involves, for example, daily police officer operation, as demonstrated in Figure2(a). The considered conventional duties include travel of the officer using the law enforcement vehicle, that is, a car, a motorcycle, or any other means of transport [62]. In this case, the resource-limited device is the AR glasses, which for the most of the time has the possibility of connecting to a resource-rich processing unit. The car can feature the required datasets and hardware to simultaneously process a high number of pattern-matching tasks from the AR glasses thus acting as the MEC/MCC unit. By this means, the police officer’s gear can effectively enjoy higher processing power.Figure 2
Our considered scenarios for real-time data offloading.
(a)
(b)Another study case reflects the scenarios, where the AR-user leaves the proximity with the powerful processing unit, as shown in Figure2(b). This may happen for a long list of reasons, like an emergency call, due to operational causes, and so on. This scenario comprises the following modes:(1)
Patrolling (b1): if the processing unit is far away, the AR glasses may keep analyzing the most crucial patterns in their vicinity according to the user preferences. Here, the battery resource becomes the main limiting factor, since running complex computation on this single device may significantly degrade energy efficiency.(2)
Visiting connected buildings (b2): if after losing direct connectivity to the processing node (discontinuing pure MCC operation), the AR-equipped user is moving toward, for example, a police station, shopping mall, or hospital, the respective pattern-matching sets can be securely transferred to the trusted infrastructure as in the MEC case. Hence, the AR glasses may be assisted by relying on the distributed pattern-matching functionality and therefore save their limited resources.(3)
Emergency call (b3): if an emergency situation occurs, the officer may need to arrive at the scene as part of the dispatched unit. In this case, the control center has the knowledge on who participates in the mission and can identify the vehicles and, potentially, other available (mobile) stations in proximity. Therefore, the required datasets can be migrated accordingly onto these nearby devices for the AR glasses to take advantage of the distributed collaborative processing.On the one hand, utilizing “helper” devices with more abundant computation and energy resources becomes the desired option. However, in case a group of police officers turns out to be on a mission without direct access to such MEC/MCC unit (or the connection is not sufficiently reliable), the data in question may be distributed among the group of officers so that the latter could run collaborative computation in a distributed manner; that is, the number of simultaneously processing/caching “servers” becomes more than one.Since the above casesa and b1 do not pose much of a research challenge, we concentrate below on modeling a scenario built aroundseveral content-caching and processing devices that serve the tagged unit. We are specifically interested in assessing the reliability perspective of such operation, which is discussed in detail in the following section.


## 3.1. Smart Devices of Interest

Today, various types of special forces are equipped with advanced devices [58], including smart cameras, health monitors, and communications systems. While health monitoring may not require real-time and heavy data analytics [59, 60], the assessment of the surrounding environment can have tremendous demands in terms of communications and computation.Present-day technology revolution is primarily pushed by the industry giants. For example, Connected Law Enforcement Officer program by Motorola facilitates real-time collaboration experience between different specialized devices to improve the response times within the ecosystem of mission-critical services. This solution makes it possible for teams of people, in the field or in the office, to effectively communicate and cooperate by exchanging voice and data, securely, reliably, and in real time, regardless of network, carrier, or device, whether deployed inside the client’s network infrastructure or in the cloud as a hosted/managed solution.In order to improve the operating efficiency and accelerate decision making, the devices need to collaborate seamlessly and share information “on-the-fly.” The considered set of mobile devices typically includes the following:(i)
Video speaker microphone: it combines a body-mounted camera with a high-quality radio speaker microphone and a touchscreen interface, for intuitive capture, storage, and management of video, audio, and image evidence.(ii)
Portable radio: it provides reliable “push-to-talk” communications as well as superior audio quality for essential day-to-day and emergency two-way radio communications.(iii)
Handheld smartphone: it offers reliable broadband connectivity and enables users to enjoy intelligent support of the entire team. With its rugged form factor, powerful data applications, and a quick-response user interface, it delivers “always-on” mission-critical user experience to improve situational awareness for police, firefighter, rescue, and emergency medical services as well as for organizations that support critical infrastructure.(iv)
Connected car: it is equipped with, for example, TETRA radio, mobile computing features, and mission-critical 3GPP LTE broadband connectivity; it supports intuitive data applications as well as automatic number plate recognition (ANPR), video surveillance, lights, and sirens functionality, which can be accessed and managed effortlessly. This vehicle is particularly of interest for our case study due to its superior computation and caching capabilities, as well as more stable connectivity to the network infrastructure.(v)
AR glasses are expected to join this set soon: they assist the user in a range of tasks and provide real-time assessment of the surrounding environment for faster response [61].The considered application ecosystem includes real-time video streaming, computer-aided dispatch, unified “push-to-talk,” electronic citation, report writing, and data capture. In what follows, we primarily focus on the representative use case where a group of high-tech equipped officers on duty collaborate with each other. However, our findings generally hold valid for a range of similar mission-critical scenarios as discussed below.


## 3.2. Scenario of Interest

In this work, we concentrate on a study case that involves, for example, daily police officer operation, as demonstrated in Figure2(a). The considered conventional duties include travel of the officer using the law enforcement vehicle, that is, a car, a motorcycle, or any other means of transport [62]. In this case, the resource-limited device is the AR glasses, which for the most of the time has the possibility of connecting to a resource-rich processing unit. The car can feature the required datasets and hardware to simultaneously process a high number of pattern-matching tasks from the AR glasses thus acting as the MEC/MCC unit. By this means, the police officer’s gear can effectively enjoy higher processing power.Figure 2
Our considered scenarios for real-time data offloading.
(a)
(b)Another study case reflects the scenarios, where the AR-user leaves the proximity with the powerful processing unit, as shown in Figure2(b). This may happen for a long list of reasons, like an emergency call, due to operational causes, and so on. This scenario comprises the following modes:(1)
Patrolling (b1): if the processing unit is far away, the AR glasses may keep analyzing the most crucial patterns in their vicinity according to the user preferences. Here, the battery resource becomes the main limiting factor, since running complex computation on this single device may significantly degrade energy efficiency.(2)
Visiting connected buildings (b2): if after losing direct connectivity to the processing node (discontinuing pure MCC operation), the AR-equipped user is moving toward, for example, a police station, shopping mall, or hospital, the respective pattern-matching sets can be securely transferred to the trusted infrastructure as in the MEC case. Hence, the AR glasses may be assisted by relying on the distributed pattern-matching functionality and therefore save their limited resources.(3)
Emergency call (b3): if an emergency situation occurs, the officer may need to arrive at the scene as part of the dispatched unit. In this case, the control center has the knowledge on who participates in the mission and can identify the vehicles and, potentially, other available (mobile) stations in proximity. Therefore, the required datasets can be migrated accordingly onto these nearby devices for the AR glasses to take advantage of the distributed collaborative processing.On the one hand, utilizing “helper” devices with more abundant computation and energy resources becomes the desired option. However, in case a group of police officers turns out to be on a mission without direct access to such MEC/MCC unit (or the connection is not sufficiently reliable), the data in question may be distributed among the group of officers so that the latter could run collaborative computation in a distributed manner; that is, the number of simultaneously processing/caching “servers” becomes more than one.Since the above casesa and b1 do not pose much of a research challenge, we concentrate below on modeling a scenario built aroundseveral content-caching and processing devices that serve the tagged unit. We are specifically interested in assessing the reliability perspective of such operation, which is discussed in detail in the following section.


## 4. Proposed Reliability-Centric Modeling

This section introduces a mathematical framework suitable for analyzing the fault-tolerant collaborative operation of tagged and helper devices. In this work, we assume that the “active” (available) and the “repair” (unavailable) operation times for cooperating system elements are independent. The notation employed further on is summarized in Main System Model Notations.


### 4.1. General Considerations

Consider a random processv(t), which corresponds to the number of failed collaborating elements at time t, where the set of states in the system is E=0,1,…,k. To characterize the behavior of the system in question by relying on a Markov process, we introduce an additional variable x(t)∈R+, which is the overall duration spent at time t for the failed element recovery. We obtain a two-dimensional process (v(t),x(t)) with an extended steady-state space E=0,1,x,2,x,…,k,x.We further denotep0(t) as the probability that at time t the system is in the state i=0, and pi(t;x) is the probability density function (in continuous component) that captures the probability that at time t the system is in state i(i=1,k¯). The time taken to “repair” the failed element is in the range (x,x+dx). The probabilities in question are calculated as(1)p0t=Pνt=0,p1t,xdx=Pνt=1,x<xt<x+dx,p2t,xdx=Pνt=2,x<xt<x+dx,⋮pkt,xdx=Pνt=k,x<xt<x+dx.Consider the probabilities of two events that are important for our further discussion.First Event. A system element has failed during time Δ under the condition that it has already worked for x units of time before its failure.(2)Px≤A<x+Δ∣A≥x=Px≤A<x+ΔPA≥x=Ax+Δ-Ax1-PA<x=axΔ1-Ax=αe-αxΔe-αx=αΔ+oΔ.Second Event. Starting from the considered time instant, an element will be restored during the time Δ, provided that it has already been in “repair” for x time units.(3)Px≤B<x+Δ∣B≥x=Px≤B<x+ΔPB≥x=Bx+Δ-Bx1-PB<x=bxΔ1-Bx=δxΔ.Steady-state transition diagram corresponding to the operation of the system in question is illustrated in Figure3.Figure 3
Steady-state transitions in the considered system.By applying the law of total probability, we transition to Kolmogorov’s system of differential equations, which allows obtaining the steady-state probabilities of the system at hand. Consider the probabilityp0(t+Δ) that corresponds to the case where there are 0 failed elements at time instant t+Δ. This situation may appear (i) if at time instant t either there were 0 failed elements or the active one has not failed during time instant Δ (with probability 1-αΔ) or (ii) if there was 1 failed element and it has been restored during time Δ (with probability δ(x)Δ), while no other active element has failed during this time (with probability (1-αΔ)).(4)p0t+Δ=Pνt+Δ=0=p0t1-αΔ+∫0tp1t,x·δx·Δ·1-αΔdx=p0t1-αΔ+∫0tp1t,x·δx·Δdx.Hence, we establish the state-related equations as(5)p0t+Δ=p0t·1-αΔ+∫0tp1t,xδxΔdx,and, similarly,(6)p1t+Δ,x+Δdx=Pνt+Δ=1,x+Δ<xt+Δ<x+Δ+dx=p1t,xdx·1-αΔ·1-δx·Δ.After the necessary transformations, we obtain(7)p1t+Δ,x+Δ=p1t,x·1-αΔ·1-δx·Δ.At the next step, we have(8)p2t+Δ,x+Δdx=Pνt+Δ=2,x+Δ<xt+Δ<x+Δ+dx=p2t,xdx·1-αΔ·1-δx·Δ+p1t,xdx·αΔ.Further, we arrive at the equation(9)p2t+Δ,x+Δ=p2t,x·1-αΔ·1-δx·Δ+p1t,x·αΔ.Similarly, we produce the equations forpi(t+Δ,x+Δ), i=3,k-1¯ as(10)pit+Δ,x+Δ=pit,x·1-αΔ·1-δxΔ+pi-1t,xαΔ,i=3,k-1¯.At the next step, we establish(11)pkt+Δ,x+Δdx=Pνt+Δ=k,x+Δ<xt+Δ<x+Δ+dx=pkt,xdx·1-δx·Δ+pk-1t,xdx·αΔ·1-δx·Δ=pkt,xdx·1-δx·Δ+pk-1t,xdx·αΔ-pk-1t,xdx·α·δx·Δ2=pkt,xdx·1-δx·Δ+pk-1t,xdx·αΔ,where Δ2≪Δ⇒o(Δ2)→0.Then, we obtain for the general case the equation(12)pkt+Δ,x+Δ=pkt,x·1-δx·Δ+pk-1t,x·αΔ.The boundary conditions in our system are(13)p1t+Δ,0=p0t·α+∫0tp2t,xδxdx,p2t+Δ,0=∫0tp3t,xδxdx,⋮pk-1t+Δ,0=∫0tpkt,xδxdx.After the transformations, and based on (5), we establish(14)p0t+Δ=p0t·1-αΔ+∫0tp1t,x·δx·Δdx,p0t+Δ=p0t-p0t·αΔ+∫0tp1t,x·δx·Δdx,p0t+Δ-p0t=-p0t·αΔ+∫0tp1t,x·δx·Δdx,1Δ·p0t+Δ-p0t=-p0t·α+∫0tp1t,x·δxdx.Passing to the limitΔ→0, we obtain(15)dp0tdt=-α·p0t+∫0tp1t,x·δxdx.It follows from (7) that(16)p1t+Δ,x+Δ=p1t,x·1-αΔ·1-δx·Δ=p1t,x-p1t,x·αΔ-p1t,x·δx·Δ,p1t+Δ,x+Δ-p1t,x+Δ+p1t,x+Δ-p1t,x=-p1t,xαΔ-p1t,xδxΔ,(17)p1t+Δ,x+Δ-p1t,x+ΔΔ+p1t,x+Δ-p1t,xΔ=-p1t,xα-p1t,xδx.Passing to the limitΔ→0, we calculate(18)∂p1t,x+Δ∂t+∂p1t,x∂x=-α+δx·p1t,x.Similarly, based on (9), we have(19)p2t+Δ,x+Δ-p2t,x+ΔΔ+p2t,x+Δ-p2t,xΔ=-p2t,xα+δx+p1t,xα.Further, passing to the limitΔ→0, we obtain(20)∂p2t,x+Δ∂t+∂p2t,x∂x=-α+δx·p2t,x+αp1t,x.Finally, it follows from (10) that(21)pkt+Δ,x+Δ=pkt,x·1-δx·Δ+pk-1t,x·αΔ,pkt+Δ,x+Δ=pkt,x-pkt,x·δx·Δ+pk-1t,x·αΔ,pkt+Δ,x+Δ-pkt,x+Δ+pkt,x+Δ-pkt,x=-pkt,x·δx+pk-1t,x·α,pkt+Δ,x+Δ-pkt,x+ΔΔ+pkt,x+Δ-pkt,xΔ=-δx·pkt,x+α·pk-1t,x.Passing to the limitΔ→0, we find(22)∂pkt,x+Δ∂t+∂pkt,x∂x=-δx·pkt,x+α·pk-1t,x.The boundary conditions with respect to the passage to the limitΔ→0 are(23)p1t,0=α·p0t+∫0tp2t,xδxdx,p2t,0=∫0tp3t,xδxdx,⋮pk-1t,0=∫0tpkt,xδxdx.Since the process at hand is positively recurrent (due to finite state space as well as positive and bounded transition rates), there exist limit state probabilities undert→∞, which coincide with the stationary probabilities as(24)p0=limt→∞p0t,pix=limt→∞pit;xi∈1,…,k.Hence, we arrive at the following system of equations for the steady-state mode (i.e., the system of equilibrium equations) in the form(25)αp0=∫0∞p1x·δxdx,dp1xdx=-α+δx·p1x,dp2xdx=-α+δx·p2x+α·p1x,⋮dpk-1xdx=-α+δx·pk-1x+α·pk-2x,dpkxdx=-δx·pkx+α·pk-1x,p10=α·p0+∫0∞p2x·δxdx,p20=∫0∞p3x·δxdx,⋮pk-10=∫0∞pkx·δxdx.As discussed previously, the established set of equations has an analytical closed-form solution, which we present in the following subsection for the special case ofk=3 redundant elements. This formulation, after the integration over the variable x, produces a result for the macrostate probabilities in the system. A macrostate probability pi in the steady-state mode represents the limiting time-average fraction of time spent by the system in state i. Note that the sum ∑i=0k-1pi corresponds to the steady-state probability that at least one of k reserve (collaborating) elements is operational; that is, the system is functioning properly. Hence, in the general case we define the stationary reliability of the system as the steady-state probability of its failure-free operation, that is, 1-pk.Note that the established set of equations has an analytical closed-form solution for an arbitrary number of system elements. By increasingk, calculation of the undetermined coefficients becomes rather “bulky” while solving the corresponding inhomogeneous linear ordinary differential equations. In the following subsection, we consider an algorithm for solving the target system of differential equations in the special case.


### 4.2. Considerations for Target Scenario

To demonstrate the applicability of our general system modeling in the considered scenario, we further focus on the characteristic use case where a group of four police officers (one of them equipped with the AR glasses) are entering the building, while the squad leader wears a resource-hungry device that requires assistance from the devices of fellow officers. The squad moves along as a group but the connection to the assisting equipment may become unreliable (unavailable) due to unconstrained group mobility [63].We begin with(26)αp0=∫0∞p1x·δxdx,dp1xdx=-α+δx·p1x,dp2xdx=-α+δx·p2x+α·p1x,dp3xdx=-δx·p3x+α·p2x,p10=α·p0+∫0∞p2x·δxdx,p20=∫0∞p3x·δxdx.Further, we focus on the solution obtained with Kolmogorov’s system of differential equations. Let us initially consider the second equation(27)dp1xdx=-α+δx·p1x,dp1xp1x=-α+δxdx,dp1xp1x=-δxdx-αdx,dp1xp1x=-bx1-Bxdx-αdx,dln⁡p1x=dln⁡1-Bx+dln⁡e-αx,dln⁡p1x=dln⁡1-Bx·e-αx,ln⁡p1x=ln⁡1-Bx·e-αx+ln⁡C1,ln⁡p1x=ln⁡1-Bx·e-αx·C1,p1x=C1·e-αx·1-Bx.We solve the differential equations forp2(x) and p3(x) by applying the parameters variation method.(28)p2x=αC1x+C2·e-αx·1-Bx,p3x=C31-Bx-C2+C1αx+1·e-αx·1-Bx.To express the coefficientsC2 and C3 in terms of C1, we utilize the boundary conditions(29)p0=C1·α-1·b~α,p1x=C1·e-αx·1-Bx,p2x=C1·e-αx·1-Bx·1-b~αb~α,p3x=C1·1-e-αx·1-Bx·1-b~αb~α.Further, we evaluate the stationary probabilities for the macrostatep1.(30)p1=∫0∞p1xdx=∫0∞C1·e-αx·1-Bxdx=C1·∫0∞e-αxdx-∫0∞e-αx·Bxdx=C1·1α-1αb~α=C1·1-b~αα,where b~(α)=αB~(α) is an LT for the PDF b(x) at point s=α.Next, for the probabilityp2 we have(31)p2=∫0∞p2xdx=∫0∞C1·e-αx·1-Bx·1-b~αb~αdx=C1·1-b~αb~α∫0∞e-αx·1-Bxdx=C1·1-b~αb~α·1-b~αα=C1·1-b~α2α·b~α.Further, forp3 we obtain(32)p3=∫0∞p3xdx=∫0∞C1·1-e-αx·1-Bx·1-b~αb~αdx=C1·1-b~αb~α·∫0∞1-e-αx·1-Bxdx=C1·1-b~αb~α×∫0∞1-Bxdx-∫0∞e-αxdx+∫0∞e-αx·Bxdx=C1·1-b~αb~α·-∫0∞x·-bxdx-1α+1αb~α=C1·1-b~αb~α·∫0∞x·bxdx-1α+1αb~α=C1·1-b~αb~α·EB-1α+1αb~α=C1·1-b~αb~α·b-1α+1αb~α=C1·1-b~αb~α·b-1-b~αα,where b is the parameter of random “repair” time (mathematical expectation for the failed element).Therefore, the probabilities of the system macrostates are given as(33)p0=C1·b~αα,p1=C1·1-b~αα,p2=C1·1-b~α2α·b~α,p3=C1·1-b~αb~α·b-1-b~αα.By applying the normalization conditionp0+p1+p2+p3=1, we establish the constant C1 as(34)C1=α·b~αρ-11-b~α+b~α, where ρ-1=EB/EA=b·α.Finally, we calculate the following steady-state probabilities for the considered “cold-standby repairable system”〈M3/GI/1〉 as(35)p0=b~2αρ-11-b~α+b~α,p1=b~α1-b~αρ-11-b~α+b~α,p2=1-b~α2ρ-11-b~α+b~α,p3=1-b~αρ-1-1+b~αρ-11-b~α+b~α,where ρ-1=b·α.As can be concluded from the produced expressions, there is a clear dependency of the system steady-state probabilities on the type of “repair” time distribution. However, this dependency becomes vanishingly small under the “fast repair” of failed elements. The numerical results are reported in the following section and they support this hypothesis.


## 4.1. General Considerations

Consider a random processv(t), which corresponds to the number of failed collaborating elements at time t, where the set of states in the system is E=0,1,…,k. To characterize the behavior of the system in question by relying on a Markov process, we introduce an additional variable x(t)∈R+, which is the overall duration spent at time t for the failed element recovery. We obtain a two-dimensional process (v(t),x(t)) with an extended steady-state space E=0,1,x,2,x,…,k,x.We further denotep0(t) as the probability that at time t the system is in the state i=0, and pi(t;x) is the probability density function (in continuous component) that captures the probability that at time t the system is in state i(i=1,k¯). The time taken to “repair” the failed element is in the range (x,x+dx). The probabilities in question are calculated as(1)p0t=Pνt=0,p1t,xdx=Pνt=1,x<xt<x+dx,p2t,xdx=Pνt=2,x<xt<x+dx,⋮pkt,xdx=Pνt=k,x<xt<x+dx.Consider the probabilities of two events that are important for our further discussion.First Event. A system element has failed during time Δ under the condition that it has already worked for x units of time before its failure.(2)Px≤A<x+Δ∣A≥x=Px≤A<x+ΔPA≥x=Ax+Δ-Ax1-PA<x=axΔ1-Ax=αe-αxΔe-αx=αΔ+oΔ.Second Event. Starting from the considered time instant, an element will be restored during the time Δ, provided that it has already been in “repair” for x time units.(3)Px≤B<x+Δ∣B≥x=Px≤B<x+ΔPB≥x=Bx+Δ-Bx1-PB<x=bxΔ1-Bx=δxΔ.Steady-state transition diagram corresponding to the operation of the system in question is illustrated in Figure3.Figure 3
Steady-state transitions in the considered system.By applying the law of total probability, we transition to Kolmogorov’s system of differential equations, which allows obtaining the steady-state probabilities of the system at hand. Consider the probabilityp0(t+Δ) that corresponds to the case where there are 0 failed elements at time instant t+Δ. This situation may appear (i) if at time instant t either there were 0 failed elements or the active one has not failed during time instant Δ (with probability 1-αΔ) or (ii) if there was 1 failed element and it has been restored during time Δ (with probability δ(x)Δ), while no other active element has failed during this time (with probability (1-αΔ)).(4)p0t+Δ=Pνt+Δ=0=p0t1-αΔ+∫0tp1t,x·δx·Δ·1-αΔdx=p0t1-αΔ+∫0tp1t,x·δx·Δdx.Hence, we establish the state-related equations as(5)p0t+Δ=p0t·1-αΔ+∫0tp1t,xδxΔdx,and, similarly,(6)p1t+Δ,x+Δdx=Pνt+Δ=1,x+Δ<xt+Δ<x+Δ+dx=p1t,xdx·1-αΔ·1-δx·Δ.After the necessary transformations, we obtain(7)p1t+Δ,x+Δ=p1t,x·1-αΔ·1-δx·Δ.At the next step, we have(8)p2t+Δ,x+Δdx=Pνt+Δ=2,x+Δ<xt+Δ<x+Δ+dx=p2t,xdx·1-αΔ·1-δx·Δ+p1t,xdx·αΔ.Further, we arrive at the equation(9)p2t+Δ,x+Δ=p2t,x·1-αΔ·1-δx·Δ+p1t,x·αΔ.Similarly, we produce the equations forpi(t+Δ,x+Δ), i=3,k-1¯ as(10)pit+Δ,x+Δ=pit,x·1-αΔ·1-δxΔ+pi-1t,xαΔ,i=3,k-1¯.At the next step, we establish(11)pkt+Δ,x+Δdx=Pνt+Δ=k,x+Δ<xt+Δ<x+Δ+dx=pkt,xdx·1-δx·Δ+pk-1t,xdx·αΔ·1-δx·Δ=pkt,xdx·1-δx·Δ+pk-1t,xdx·αΔ-pk-1t,xdx·α·δx·Δ2=pkt,xdx·1-δx·Δ+pk-1t,xdx·αΔ,where Δ2≪Δ⇒o(Δ2)→0.Then, we obtain for the general case the equation(12)pkt+Δ,x+Δ=pkt,x·1-δx·Δ+pk-1t,x·αΔ.The boundary conditions in our system are(13)p1t+Δ,0=p0t·α+∫0tp2t,xδxdx,p2t+Δ,0=∫0tp3t,xδxdx,⋮pk-1t+Δ,0=∫0tpkt,xδxdx.After the transformations, and based on (5), we establish(14)p0t+Δ=p0t·1-αΔ+∫0tp1t,x·δx·Δdx,p0t+Δ=p0t-p0t·αΔ+∫0tp1t,x·δx·Δdx,p0t+Δ-p0t=-p0t·αΔ+∫0tp1t,x·δx·Δdx,1Δ·p0t+Δ-p0t=-p0t·α+∫0tp1t,x·δxdx.Passing to the limitΔ→0, we obtain(15)dp0tdt=-α·p0t+∫0tp1t,x·δxdx.It follows from (7) that(16)p1t+Δ,x+Δ=p1t,x·1-αΔ·1-δx·Δ=p1t,x-p1t,x·αΔ-p1t,x·δx·Δ,p1t+Δ,x+Δ-p1t,x+Δ+p1t,x+Δ-p1t,x=-p1t,xαΔ-p1t,xδxΔ,(17)p1t+Δ,x+Δ-p1t,x+ΔΔ+p1t,x+Δ-p1t,xΔ=-p1t,xα-p1t,xδx.Passing to the limitΔ→0, we calculate(18)∂p1t,x+Δ∂t+∂p1t,x∂x=-α+δx·p1t,x.Similarly, based on (9), we have(19)p2t+Δ,x+Δ-p2t,x+ΔΔ+p2t,x+Δ-p2t,xΔ=-p2t,xα+δx+p1t,xα.Further, passing to the limitΔ→0, we obtain(20)∂p2t,x+Δ∂t+∂p2t,x∂x=-α+δx·p2t,x+αp1t,x.Finally, it follows from (10) that(21)pkt+Δ,x+Δ=pkt,x·1-δx·Δ+pk-1t,x·αΔ,pkt+Δ,x+Δ=pkt,x-pkt,x·δx·Δ+pk-1t,x·αΔ,pkt+Δ,x+Δ-pkt,x+Δ+pkt,x+Δ-pkt,x=-pkt,x·δx+pk-1t,x·α,pkt+Δ,x+Δ-pkt,x+ΔΔ+pkt,x+Δ-pkt,xΔ=-δx·pkt,x+α·pk-1t,x.Passing to the limitΔ→0, we find(22)∂pkt,x+Δ∂t+∂pkt,x∂x=-δx·pkt,x+α·pk-1t,x.The boundary conditions with respect to the passage to the limitΔ→0 are(23)p1t,0=α·p0t+∫0tp2t,xδxdx,p2t,0=∫0tp3t,xδxdx,⋮pk-1t,0=∫0tpkt,xδxdx.Since the process at hand is positively recurrent (due to finite state space as well as positive and bounded transition rates), there exist limit state probabilities undert→∞, which coincide with the stationary probabilities as(24)p0=limt→∞p0t,pix=limt→∞pit;xi∈1,…,k.Hence, we arrive at the following system of equations for the steady-state mode (i.e., the system of equilibrium equations) in the form(25)αp0=∫0∞p1x·δxdx,dp1xdx=-α+δx·p1x,dp2xdx=-α+δx·p2x+α·p1x,⋮dpk-1xdx=-α+δx·pk-1x+α·pk-2x,dpkxdx=-δx·pkx+α·pk-1x,p10=α·p0+∫0∞p2x·δxdx,p20=∫0∞p3x·δxdx,⋮pk-10=∫0∞pkx·δxdx.As discussed previously, the established set of equations has an analytical closed-form solution, which we present in the following subsection for the special case ofk=3 redundant elements. This formulation, after the integration over the variable x, produces a result for the macrostate probabilities in the system. A macrostate probability pi in the steady-state mode represents the limiting time-average fraction of time spent by the system in state i. Note that the sum ∑i=0k-1pi corresponds to the steady-state probability that at least one of k reserve (collaborating) elements is operational; that is, the system is functioning properly. Hence, in the general case we define the stationary reliability of the system as the steady-state probability of its failure-free operation, that is, 1-pk.Note that the established set of equations has an analytical closed-form solution for an arbitrary number of system elements. By increasingk, calculation of the undetermined coefficients becomes rather “bulky” while solving the corresponding inhomogeneous linear ordinary differential equations. In the following subsection, we consider an algorithm for solving the target system of differential equations in the special case.


## 4.2. Considerations for Target Scenario

To demonstrate the applicability of our general system modeling in the considered scenario, we further focus on the characteristic use case where a group of four police officers (one of them equipped with the AR glasses) are entering the building, while the squad leader wears a resource-hungry device that requires assistance from the devices of fellow officers. The squad moves along as a group but the connection to the assisting equipment may become unreliable (unavailable) due to unconstrained group mobility [63].We begin with(26)αp0=∫0∞p1x·δxdx,dp1xdx=-α+δx·p1x,dp2xdx=-α+δx·p2x+α·p1x,dp3xdx=-δx·p3x+α·p2x,p10=α·p0+∫0∞p2x·δxdx,p20=∫0∞p3x·δxdx.Further, we focus on the solution obtained with Kolmogorov’s system of differential equations. Let us initially consider the second equation(27)dp1xdx=-α+δx·p1x,dp1xp1x=-α+δxdx,dp1xp1x=-δxdx-αdx,dp1xp1x=-bx1-Bxdx-αdx,dln⁡p1x=dln⁡1-Bx+dln⁡e-αx,dln⁡p1x=dln⁡1-Bx·e-αx,ln⁡p1x=ln⁡1-Bx·e-αx+ln⁡C1,ln⁡p1x=ln⁡1-Bx·e-αx·C1,p1x=C1·e-αx·1-Bx.We solve the differential equations forp2(x) and p3(x) by applying the parameters variation method.(28)p2x=αC1x+C2·e-αx·1-Bx,p3x=C31-Bx-C2+C1αx+1·e-αx·1-Bx.To express the coefficientsC2 and C3 in terms of C1, we utilize the boundary conditions(29)p0=C1·α-1·b~α,p1x=C1·e-αx·1-Bx,p2x=C1·e-αx·1-Bx·1-b~αb~α,p3x=C1·1-e-αx·1-Bx·1-b~αb~α.Further, we evaluate the stationary probabilities for the macrostatep1.(30)p1=∫0∞p1xdx=∫0∞C1·e-αx·1-Bxdx=C1·∫0∞e-αxdx-∫0∞e-αx·Bxdx=C1·1α-1αb~α=C1·1-b~αα,where b~(α)=αB~(α) is an LT for the PDF b(x) at point s=α.Next, for the probabilityp2 we have(31)p2=∫0∞p2xdx=∫0∞C1·e-αx·1-Bx·1-b~αb~αdx=C1·1-b~αb~α∫0∞e-αx·1-Bxdx=C1·1-b~αb~α·1-b~αα=C1·1-b~α2α·b~α.Further, forp3 we obtain(32)p3=∫0∞p3xdx=∫0∞C1·1-e-αx·1-Bx·1-b~αb~αdx=C1·1-b~αb~α·∫0∞1-e-αx·1-Bxdx=C1·1-b~αb~α×∫0∞1-Bxdx-∫0∞e-αxdx+∫0∞e-αx·Bxdx=C1·1-b~αb~α·-∫0∞x·-bxdx-1α+1αb~α=C1·1-b~αb~α·∫0∞x·bxdx-1α+1αb~α=C1·1-b~αb~α·EB-1α+1αb~α=C1·1-b~αb~α·b-1α+1αb~α=C1·1-b~αb~α·b-1-b~αα,where b is the parameter of random “repair” time (mathematical expectation for the failed element).Therefore, the probabilities of the system macrostates are given as(33)p0=C1·b~αα,p1=C1·1-b~αα,p2=C1·1-b~α2α·b~α,p3=C1·1-b~αb~α·b-1-b~αα.By applying the normalization conditionp0+p1+p2+p3=1, we establish the constant C1 as(34)C1=α·b~αρ-11-b~α+b~α, where ρ-1=EB/EA=b·α.Finally, we calculate the following steady-state probabilities for the considered “cold-standby repairable system”〈M3/GI/1〉 as(35)p0=b~2αρ-11-b~α+b~α,p1=b~α1-b~αρ-11-b~α+b~α,p2=1-b~α2ρ-11-b~α+b~α,p3=1-b~αρ-1-1+b~αρ-11-b~α+b~α,where ρ-1=b·α.As can be concluded from the produced expressions, there is a clear dependency of the system steady-state probabilities on the type of “repair” time distribution. However, this dependency becomes vanishingly small under the “fast repair” of failed elements. The numerical results are reported in the following section and they support this hypothesis.


## 5. Representative Numerical Results

This section summarizes selected numerical results obtained after applying our proposed analytical model to the scenario of interest described above. To this end, Figure4 demonstrates the stationary system reliability 1-p3 versus the relative recovery rate ρ for four different special cases of the 〈M3∣GI∣1〉 model, where GW stands for Gnedenko-Weibull distribution [64].Figure 4
Analytical results for stationary system reliability1-p3 versus ρ for various “repair” time distributions.As it can be observed in the figure, the stationary reliability1-p3 becomes close to 1 as ρ tends to infinity irrespective of the shapes of the activity and repair time distributions. However, it reaches the high value of 1-p3=0.99 at different values of ρ. This characterizes the sensitivity of the system stationary reliability with respect to the shape of the activity and repair time distributions (note different rates here). We can assess the rate of convergence of 1-p3 with the means of quantiles for a given reliability level. The corresponding simulations have been conducted with ρ from 1 to 25 for 10,000 time slots over 200 executions, thus making it possible to reach the accuracy of 99.999.Further, the similarity measure (absolute difference) between the plots in Figure4 is presented in Figure 5. The results support our above statement about high asymptotic insensitivity of the system stationary reliability, which is clearly observed due to the proximity of the corresponding curves. For instance, starting from ρ=20, all of the curves are almost indistinguishable.Figure 5
Absolute difference of values for system stationary reliability1-p3 versus ρ for various “repair” time distributions.We also note that explicit analytical expressions for the steady-state distribution of the system under consideration are not always easy to obtain. For this case, we construct a simulation model that approximates the analytical results for the system in question. We conduct our simulations by following the standard discrete event modeling approach. Previously discussed analytical values of the stationary system reliability1-p3 versus ρ (see Figure 4) are supported with simulated data, and the results are displayed in Figure 6. The differences between the produced curves become marginal very quickly. Even for the relatively small values of ρ, the stationary reliability of the system 1-p3 is already very close to 1 for all the four cases.Figure 6
Analytical and simulation results of stationary system reliability1-p3 versus ρ (averaged values based on 200 replications) for various “repair” time distributions.Comparing the results obtained with both analytical and simulation approaches, we confirm that they are in close agreement. Hence, simulations can be employed in the cases where explicit analytical solution cannot be achieved due to its complexity or as part of a more complex simulation-based methodology that targets in-depth assessment of the fault-tolerant operation of MEC/MCC.


## 6. Main Conclusions

Today, mobile communications technology and resource-hungry applications are all over the market. As users expect to receive increasingly high levels of service experience, this introduces a burden on the existing wireless communications mechanisms. This work explores the challenge of delegating computing and caching functionality as the users move away from the network “center” to its edge, therefore supporting the emerging MEC paradigm.With regard to the main contribution of this work, we propose a powerful mathematical methodology that allows assessing system-level reliability in cases where the “helper” nodes fail to provide reliable performance, thus allowing analysis of fault-tolerant MEC/MCC operation. The demonstrated modeling results reveal asymptotic insensitivity of the stationary reliability of the system under the “fast” recovery of its elements to the type of the “repair” time distribution.In addition, the obtained steady-state stationary system distribution enables us to assess other operational variables, primarily with respect to the “helper” node performance, since the corresponding weighted coefficients may be added to the analysis readily. This permits characterizing the average stationary system performance where the assisting devices may belong to different classes.



---

*Source: 9625687-2017-12-07.xml*