The Formulation and Solution of the Task of the Optimum Reservation in the System of Residual Classes

Krasnobaev, Victor; Koshman, Sergеy; Kononchenko, Anna; Kuznetsov, Alexandr; Кузнецова, Тетяна

doi:10.1109/atit49449.2019.9030483

Cited by 9 publications

(3 citation statements)

References 12 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…If the Boolean value is zero, it indicates that the packet should not be forwarded from the corresponding port, otherwise, it indicates that the flow should be forwarded along with the port as shown in Table 2. Generally, NDN data flows are thus able to de-map the same RPI from the above calculation process, a more detailed description of the CRT algorithm can be found in [15], and also some papers focused on optimal RNS can be found in [20], [21], and [22].…”

Section: Querying Group Membershipmentioning

confidence: 99%

“…In the proposed method, we simulate and compare the required memory space for different output port densities and the number of input entries. which includes ρ = 16, 32, 64, and 128, and the number of entries ranging from 2 8 -2 20 , and BF with different false positive rates (P=1E-03, 1E-05, 1E-08), and the corresponding optimal number of hash functions are used for comparison. As shown in Figure 4, it can be seen that the memory required grows linearly with the number of entries, and it can be seen that the memory required by RNS is always much smaller than that of BF in all port-densities.…”

Section: Space Efficiencymentioning

confidence: 99%

See 1 more Smart Citation

An RNS-Based NDN Forwarding Plane: Design and Evaluation

Jia

2023

IEEE Access

View full text Add to dashboard Cite

Due to the variable length and uniqueness of names in NDN, traditional IP address-based routing and forwarding architecture is no longer suitable for NDN networks. It is still a challenge to design a high-performance forwarding engine to solve the problem of variable name length and uniqueness in NDN. In this article, Residue Number System (RNS) is applied to the routing and forwarding of NDN for the first time, and a new forwarding engine framework based on the RNS is designed. The simulation results show that this method has a significant performance increase in memory space and system latency. At the core-level node, the RNS-based process requires only about 5 percent of Bloom Filter (BF) in terms of memory space and has a 9.8 percent decrease in system latency compared to applying BF (P=1E-08). This method not only achieves less memory usage and reduces the system latency but also fundamentally solves the false positives and has good scalability due to the superiority of the algorithm itself. The proposed work is admirably suited for realizing large-scale NDNs by hardware implementation of NDN routers.INDEX TERMS Named data networking (NDN), packet forwarding engine (PFE), residue number system (RNS), membership querying.

show abstract

Section: Querying Group Membershipmentioning

confidence: 99%

Section: Space Efficiencymentioning

confidence: 99%

An RNS-Based NDN Forwarding Plane: Design and Evaluation

Jia

2023

IEEE Access

View full text Add to dashboard Cite

show abstract

“…The existence of fault tolerant features of the CS can be achieved as a result of the application of two main methods namely the Active Fault Tolerance (AFT) and the Passive Fault Tolerant (PFT). Some studies done by (Yatskiv and Tsavolyk, 2017;Krasnobaev et al, 2019) indicate the use of PFT technique that helps in the improvement of reliability in CS that is widely used in positional number systems. There is however lack of studies conducted using residue classes in achieving fault tolerance and also improving the reliability of CS that is based on the application of AFT.…”

Section: Introductionmentioning

confidence: 99%

A Novel Exploitation of Errors in Redundant Residue Number System Architecture

Afriyie¹

2021

American Journal of Applied Sciences

View full text Add to dashboard Cite

Residue Number System (RNS) is an unweighted number system that symbolizes big integers with smaller numbers. It can perform operations in particular addition and multiplication in parallel. Because of this property, RNS is extensively used in communication, Finite Impulse Response (FIR), cryptography and signal processing devices. The transfer of data in digital channels is very important for some critical applications where accuracy is very important. In this study, we proposed a novel algorithm that is premised on the Hamming Distance (HD) and one of the reverse conversion methods, which is, the Chinese Remainder Theorem (CRT) and) as a joint technique for the detection and correction of multiple bit errors in RNS. The proposed algorithm provides a more efficient technique that improves on the hardware size and increases the processing speed with fewer iterations when compared with other stateof-the-art schemes. The work analyses the area and delay of the hardware architecture and compared with other similar schemes. The results indicated the effectiveness of our proposed scheme in terms of the area and delay specifications.

show abstract