scholarly journals Programming Protocol-Independent Packet Processors High-Level Programming (P4HLP): Towards Unified High-Level Programming for a Commodity Programmable Switch

Electronics ◽  
2019 ◽  
Vol 8 (9) ◽  
pp. 958 ◽  
Author(s):  
Zijun Hang ◽  
Mei Wen ◽  
Yang Shi ◽  
Chunyuan Zhang
Keyword(s):  
Programming Language ◽  
Building Blocks ◽  
Limited Resources ◽  
Topology Change ◽  
Network Algorithms ◽  
Network Applications ◽  
Modular Programming ◽  
And Topology ◽  
Data Plane ◽  
High Level

Network algorithms are building blocks of network applications. They are inspired by emerging commodity programmable switches and the Programming Protocol-Independent Packet Processors (P4) language. P4 aims to provide target-independent programming neglecting the architecture of underlying infrastructure. However, commodity programmable switches have tight programming restrictions due to limited resources and latency. In addition, manufacturers tailor P4 according to their architecture, putting more restrictions on it. These intrinsic and extrinsic restrictions dilute the goal of P4. This paper proposes P4 high-level programming (P4HLP) framework, a suite of toolchains that simplifies P4 programming. The paper highlights three aspects: (i) E-Domino, a high-level programming language that defines both stateless and stateful processing of data plane in C-style codes; (ii) P4HLPc, a compiler that automatically generates P4 programs from E-Domino programs, which removes the barrier between high-level programming and low-level P4 primitives; (iii) modular programming that organizes programs into reusable modules, to enable fast reconfiguration of commodity switches. Results show that P4HLPc is efficient and robust, thus is suitable for data plane high-level programming. Compared with P4, E-Domino saves at least 5.5× codes to express the data plane algorithm. P4HLPc is robust to policy change and topology change. The generated P4 programs achieve line-rate processing.

scholarly journals Performance Analysis of Quality of Service in Software-Defined Networking

2019 ◽  
Vol 10 (4) ◽  
pp. 1
Author(s):  
Amir Hossein Moravejosharieh ◽  
Jaime Lloret
Keyword(s):  
Quality Of Service ◽  
Simulation Study ◽  
Software Defined Networking ◽  
Multimedia Traffic ◽  
Network Applications ◽  
Central Controller ◽  
Data Plane ◽  
High Level ◽  
Application Requirements

Software-Defined Networking (SDN) is a new networking strategy designed to overcome issues experienced in traditional IP network e.g. high level of complexity and inability to adaptively respond to newly arisen Quality of Service (QoS) requirements in a timely fashion. In SDN, control plane and data plane are decoupled which justifies the need to have a central controller to receive the application requirements (e.g. Quality of Service requirements) and implements a set of network policies on the data plane to eventually satisfy the requirements of the application. Implementing a proper set of policies on data plane can be quite a challenging task. In many cases implementing a set of policies in order to satisfy the requirements of an application negates requirements of other applications. In this paper, a simulation study is conducted to evaluate the performance of a QoS policy (i.e. reserving bandwidth) on a specific type of multimedia traffic (e.g. video, audio and data) and its influences on other types of multimedia traffic. The outcome of the simulation study has motivated the authors to conduct a mathematical analysis on the sensitivity of network applications over all possible combination of network policies to eventually implement a proper set of policies that imposes minimum destructive impact on other network applications or services.

scholarly journals E-learning-Oriented Software Architecture Design and Case Study

2015 ◽  
Vol 10 (4) ◽  
pp. 59
Author(s):  
Peng Lu ◽  
Xiao Cong ◽  
Dongdai Zhou
Keyword(s):  
Software Architecture ◽  
Building Blocks ◽  
Domain Model ◽  
Learning System ◽  
Application Framework ◽  
Component Library ◽  
E Learning ◽  
The Difference ◽  
High Level

Nowadays, E-learning system has been widely applied to practical teaching. It was favored by people for its characterized course arrangement and flexible learning schedule. However, the system does have some problems in the process of application such as the functions of single software are not diversified enough to satisfy the requirements in teaching completely. In order to cater more applications in the teaching process, it is necessary to integrate functions from different systems. But the difference in developing techniques and the inflexibility in design makes it difficult to implement. The major reason of these problems is the lack of fine software architecture. In this article, we build domain model and component model of E-learning system and components integration method on the basis of WebService. And we proposed an abstract framework of E-learning which could express the semantic relationship among components and realize high level reusable on the basis of informationized teaching mode. On this foundation, we form an E-learning oriented layering software architecture contain component library layer, application framework layer and application layer. Moreover, the system contains layer division multiplexing and was not built upon developing language and tools. Under the help of the software architecture, we could build characterized E-learning system flexibly like building blocks through framework selection, component assembling and replacement. In addition, we exemplify how to build concrete E-learning system on the basis of this software architecture.

RESEARCH OF METHODS FOR DECREASE OF THE CAPACITANCE RATIO IN THE STW-RESONATORS

2021 ◽  
pp. 43-56
Author(s):  
S. A. Dobershtein ◽  
N. M. Zhilin ◽  
I. V. Veremeev
Keyword(s):  
Experimental Data ◽  
Quality Factor ◽  
Quality Factors ◽  
Topology Change ◽  
Series Connection ◽  
Capacitance Ratio ◽  
And Topology

This paper presents the research of methods for decrease of the capacitance ratio in the STW-resonators without significant degradation of the quality factor by use of the external inductors and topology change: IDT division on parts and their series connection. The calculated and experimental data are presented for 416 MHz and 766 MHz STW-resonators with quality factors Q = 7000–7978. The capacitance ratio has been reduced from 1200 to 301.

scholarly journals A Runtime System for XML Transformations in Java

2004 ◽  
Vol 11 (33) ◽  
Author(s):  
Aske Simon Christensen ◽  
Christian Kirkegaard ◽  
Anders Møller
Keyword(s):  
Static Analysis ◽  
Programming Language ◽  
Program Analysis ◽  
Companion Paper ◽  
General Purpose ◽  
Runtime System ◽  
Xml Documents ◽  
Level Data ◽  
High Level ◽  
The Given

We show that it is possible to extend a general-purpose programming language with a convenient high-level data-type for manipulating XML documents while permitting (1) precise static analysis for guaranteeing validity of the constructed XML documents relative to the given DTD schemas, and (2) a runtime system where the operations can be performed efficiently. The system, named Xact, is based on a notion of immutable XML templates and uses XPath for deconstructing documents. A companion paper presents the program analysis; this paper focuses on the efficient runtime representation.

scholarly journals Learners Programming Language a Helping System for Introductory Programming Courses

2016 ◽  
Vol 35 (3) ◽  
pp. 347-358
Author(s):  
Muhammad Shumail Naveed ◽  
Muhammad Sarim ◽  
Kamran Ahsan
Keyword(s):  
Programming Languages ◽  
Programming Language ◽  
Retention Rate ◽  
Introductory Programming ◽  
Source Program ◽  
Definition Of ◽  
High Level ◽  
Novice Students ◽  
Introductory Programming Courses ◽  
Programming Courses

Programming is the core of computer science and due to this momentousness a special care is taken in designing the curriculum of programming courses. A substantial work has been conducted on the definition of programming courses, yet the introductory programming courses are still facing high attrition, low retention and lack of motivation. This paper introduced a tiny pre-programming language called LPL (Learners Programming Language) as a ZPL (Zeroth Programming Language) to illuminate novice students about elementary concepts of introductory programming before introducing the first imperative programming course. The overall objective and design philosophy of LPL is based on a hypothesis that the soft introduction of a simple and paradigm specific textual programming can increase the motivation level of novice students and reduce the congenital complexities and hardness of the first programming course and eventually improve the retention rate and may be fruitful in reducing the dropout/failure level. LPL also generates the equivalent high level programs from user source program and eventually very fruitful in understanding the syntax of introductory programming languages. To overcome the inherent complexities of unusual and rigid syntax of introductory programming languages, the LPL provide elementary programming concepts in the form of algorithmic and plain natural language based computational statements. The initial results obtained after the introduction of LPL are very encouraging in motivating novice students and improving the retention rate.

scholarly journals Tree-Shaped Formats of Address Programming Language

2021 ◽  
Vol 4 ◽  
pp. 78-87
Author(s):  
Yury Yuschenko
Keyword(s):  
Programming Languages ◽  
Programming Language ◽  
Theoretical Research ◽  
Direct Access ◽  
Complex Data ◽  
Abstract Data Types ◽  
Data Types ◽  
Abstract Data ◽  
The One ◽  
High Level

In the Address Programming Language (1955), the concept of indirect addressing of higher ranks (Pointers) was introduced, which allows the arbitrary connection of the computer’s RAM cells. This connection is based on standard sequences of the cell addresses in RAM and addressing sequences, which is determined by the programmer with indirect addressing. Two types of sequences allow programmers to determine an arbitrary connection of RAM cells with the arbitrary content: data, addresses, subroutines, program labels, etc. Therefore, the formed connections of cells can relate to each other. The result of connecting cells with the arbitrary content and any structure is called tree-shaped formats. Tree-shaped formats allow programmers to combine data into complex data structures that are like abstract data types. For tree-shaped formats, the concept of “review scheme” is defined, which is like the concept of “bypassing” trees. Programmers can define multiple overview diagrams for the one tree-shaped format. Programmers can create tree-shaped formats over the connected cells to define the desired overview schemes for these connected cells. The work gives a modern interpretation of the concept of tree-shaped formats in Address Programming. Tree-shaped formats are based on “stroke-operation” (pointer dereference), which was hardware implemented in the command system of computer “Kyiv”. Group operations of modernization of computer “Kyiv” addresses accelerate the processing of tree-shaped formats and are designed as organized cycles, like those in high-level imperative programming languages. The commands of computer “Kyiv”, due to operations with indirect addressing, have more capabilities than the first high-level programming language – Plankalkül. Machine commands of the computer “Kyiv” allow direct access to the i-th element of the “list” by its serial number in the same way as such access is obtained to the i-th element of the array by its index. Given examples of singly linked lists show the features of tree-shaped formats and their differences from abstract data types. The article opens a new branch of theoretical research, the purpose of which is to analyze the expe- diency of partial inclusion of Address Programming in modern programming languages.

scholarly journals Quantum gravity as a multitrace matrix model

2017 ◽  
Vol 32 (31) ◽  
pp. 1750180
Author(s):  
Badis Ydri ◽  
Cherine Soudani ◽  
Ahlam Rouag
Keyword(s):  
Quantum Gravity ◽  
Matrix Models ◽  
Large Class ◽  
Matrix Model ◽  
Two Dimensions ◽  
Two Dimensional ◽  
Topology Change ◽  
New Model ◽  
And Topology ◽  
Emergent Geometry

We present a new model of quantum gravity as a theory of random geometries given explicitly in terms of a multitrace matrix model. This is a generalization of the usual discretized random surfaces of two-dimensional quantum gravity which works away from two dimensions and captures a large class of spaces admitting a finite spectral triple. These multitrace matrix models sustain emergent geometry as well as growing dimensions and topology change.

Sign in / Sign up

Export Citation Format

Share Document