# Approximate Networking for Universal Internet Access
## 2 Approximate Networking Technologies
### Approximate Networking Hardware
\begin{table}
\begin{tabular}{l l l l} \hline
**Reference** & **Task** & **Refied Summary** & **How Approximation is Used to Increase Performance** \\ \hline
**Hardware** & & & \\ [PERSON] et al. [33] & Network Hardware Approximation & Power over Wi-Fi delivers power to low-power sensors & A new approximate-computing-enabled energy harvesting design that provides the far-field power delivery to Wi-Enabled is provided. \\ [PERSON] et al. [54] & Custom Hardware Chip for Machine & Google’s Tense Processing Unit (TPU) provides tolerance & Google is using TPUs in data/access since 2016; thereby achieving \\ [PERSON] et al. [54] & Learning (ML) & for reduced computational precision in ML programs. & better-optimal ML performance per unit, With learning, code transfer, and approximate computing enabled instruction set architecture, 2-\(>\) performance and energy-saving improvement is achieved. \\ [PERSON] et al. [55] & Neural Processing Unit (NPU) & MPC: Correction is applied to errors accumulated from CRC is used in Approximate Hardware Accelerates for area saving and speed enhancement. \\ [PERSON] et al. [56] & Consolidated Error Correction (CEC) & several radiators. & \\ [PERSON] et al. [20] & Low latency generic accuracy configurable hardware & Adder provides a better accuracy, area and speed tradeoff as compared to computing high accuracy. & \\ [PERSON] et al. [30] & Low Latency Adder & combined with error recovery circuit for applications & \\ [PERSON] et al. [10] & Approximate Computing Toolkit & Intel’s approximate computing (ACT) toolkit comprises a run-time compiler and a simulated hardware testbed. & Intel’s ACT is a approximate computing toolkit designed for promoting industry and academia research. \\ \hline
**Architectures** & & & \\ [PERSON] et al. [58] & Opportunistic Communication for Delay & A routing platform for delay-tolerant social networks. & Packets from source to destination reaches in cooperative communication \\ Tolerant Networks & Describes how content-centric applications perform in & QoS of content-centric networks is improved by approximating delays, content popularity and availability. \\ [PERSON] et al. [59] & Opportunistic Communication & Opportunistic scenarios. & Open Secure Library for further Research and Development of approximate computing at higher abstraction level of HW/SW stack. \\ [PERSON] et al. [16] & Architectural Exploration of Approximate Multipliers & Using variants of approximate/accurate adders/ & When proposed scheme is tested with several applications up to 43\% energy is expected as the cost of small degradation in accuracy. \\  & & & \\ [PERSON] et al. [13] & Architectural Support for Approximate Programming & & \\  & & & \\  & & \\  & & & \\  & & \\ \hline
**Prolecels** & & \\ [PERSON] et al. [40] & Flexible Best Effort Protocol & Proposes a UDP variant called UDP-Lite that uses partial & UDP-Line allows for error tolerance and this approximation can significantly improve the network throughput. \\ [PERSON] et al. [41] & Best Effort Protocol & Proposes a best-effort application layer protocol for & Constraint application protocol uses UDP and UDP-Lite as the underlying approximation tensor layer protocol to facilitate error tolerance. \\ [PERSON] et al. [15] & Cross Layer Approximation Protocol & Selective Approximate Protocol (SAP) enables network applications to receive potentially damaged network data. & Approximation introduced in SAT process the throughput and reduce the retransmission rate of wireless communication networks. \\ \hline
**Algorithms** & & & \\ [PERSON] et al. [42] & Incremental Approximation Algorithm & An incremental approximate computing algorithm (IncApprox) is presented for network and Twitter data analytics. & IncApprox combines incremental and approximate computing paradigms to achieve 2.1\(>\) the throughput achieved by either. \\ [PERSON] et al. [13] & Approximation Algorithms & Approximation algorithms for network design are presented. & Different emerging solutions for minimum spanning tree problem using different approximate assumption are discussed. \\ [PERSON] et al. [44] & Approximation Algorithms & A one-to-all approximate wireless broadcasting algorithm is presented. & An approximate solution is proposed for an NP-Complete optimization problem with routing, scheduling and QoS applications. \\ \hline \end{tabular}
\end{table}