scholarly journals Programmable, Expressive, Scalable, and Agile Service Function Chaining for Edge Data Centers

2020 ◽  
Author(s):  
Cristina Klippel Dominicini ◽  
Magnos Martinello ◽  
Moisés Renato Nunes Ribeiro
Keyword(s):  
Undergraduate Students ◽  
Traffic Engineering ◽  
Data Centers ◽  
Number System ◽  
Residue Number System ◽  
Path Selection ◽  
Source Routing ◽  
Service Function ◽  
Dynamic Composition ◽  
And Performance

Edge computing transfers processing power from large remote data centers (DCs) to distributed DCs at the edge of the network. This shift requires the ability to provide network functions virtualization (NFV) solutions that can efficiently manage and combine a large number of dynamic services in a resource-constrained DC. However, the routing mechanisms of traditional data center networks are not adequate for the dynamic composition of these services, because they are complex, rigid, subject to large delays in the propagation of control information, and limited by the size of switches' routing tables. In addition, traditional service function chaining (SFC) solutions in the service overlay are often decoupled from routing decisions in the network underlay, and restrict path selection options by traffic engineering. In this way, the NFV orchestrator cannot explore the full capacity of the network to provide composite services. To tackle these issues, this thesis investigated a programmable, expressive, scalable, and agile SFC proposal that allows dynamic and efficient orchestration of the network infrastructure of edge DCs with commodity network equipment. The proposal exploits virtualization and programmability technologies of DC networks, server-centric DCs, fabric networks, and a source routing mechanism based on the residue number system (RNS). As proof-of-concept, we developed prototypes with production DC technologies, such as OpenFlow, OpenStack, Open vSwitch and P4. The results of functional and performance tests showed that the proposed SFC scheme provides mechanisms to the NFV orchestrator that allow traffic engineering to make optimized decisions in the selection of network paths. This thesis also paves the way for exploring RNS-based source routing properties in SFC schemes, which can provide features such as fast failure reaction and forwarding without packet rewrite. In a broader analysis, the student published 22 papers in journals and conferences, contributed to funding initiatives, worked on international and national research projects, supervised undergraduate students, and leaded initiatives with innovation impacts.

scholarly journals THE TASK OF CHOOSING A RELIABLE PATH FOR MESSAGE TRANSMISSION IN A COMPUTER NETWORK

2020 ◽  
Vol 3 (61) ◽  
pp. 107-110
Author(s):  
A. Yanko ◽  
I. Fil
Keyword(s):  
Computer System ◽  
Computer Network ◽  
Number System ◽  
Path Selection ◽  
Binary Number ◽  
Message Transmission ◽  
Basic Task ◽  
And Performance ◽  
Positional Number System ◽  
Reliable Path

The article provides a calculation and comparative analysis of the reliability and productivity of computer systems in a positional binary number system and in a non-positional number system in residual classes (residual number system – RNS), for calculations and comparative we consider practical task. The main goal is to solve the task of choosing a reliable path for message transmission in a computer network. Calculation and comparative evaluation of the reliability and performance of the computer system in the RNS and the existing in the positional binary number system computer system APO-221 of the product 15E1235 (automatic message switching center - ASC) when solving the basic task of the ASC – the task of choosing the transmission path of a formalized message (path selection algorithm (PSA))

scholarly journals Montgomery reduction within the context of residue number system arithmetic

2017 ◽  
Vol 8 (3) ◽  
pp. 189-200 ◽  
Author(s):  
Jean-Claude Bajard ◽  
Julien Eynard ◽  
Nabil Merkiche
Keyword(s):  
Number System ◽  
Residue Number System ◽  
Residue Number ◽  
Montgomery Reduction

scholarly journals Computationally Efficient Approach to Implementation of the Chinese Remainder Theorem Algorithm in Minimally Redundant Residue Number System

2021 ◽  
Author(s):  
Mikhail Selianinau
Keyword(s):  
Chinese Remainder Theorem ◽  
Number System ◽  
Residue Number System ◽  
Computer Applications ◽  
Efficient Approach ◽  
Residue Modulo ◽  
Modern Computer ◽  
New Variant ◽  
Residue Number ◽  
Residue Code

AbstractIn this paper, we deal with the critical problem of performing non-modular operations in the Residue Number System (RNS). The Chinese Remainder Theorem (CRT) is widely used in many modern computer applications. Throughout the article, an efficient approach for implementing the CRT algorithm is described. The structure of the rank of an RNS number, a principal positional characteristic of the residue code, is investigated. It is shown that the rank of a number can be represented by a sum of an inexact rank and a two-valued correction to it. We propose a new variant of minimally redundant RNS, which provides low computational complexity for the rank calculation, and its effectiveness analyzed concerning conventional non-redundant RNS. Owing to the extension of the residue code, by adding the excess residue modulo 2, the complexity of the rank calculation goes down from $O\left (k^{2}\right )$ O k 2 to $O\left (k\right )$ O k with respect to required modular addition operations and lookup tables, where k equals the number of non-redundant RNS moduli.

Sign in / Sign up

Export Citation Format

Share Document