United States

&quot;During this presentation, we consider communication market scenarios where operators lease resources from the InP.
We propose a resolution approach based on an admission control program and a greedy heuristic algorithm that performs the resource allocation.
We show that our algorithm provides good results for multiple scenarios generated in a real environment.
&quot;

IEEE NCA 2022

Inter-slice B5G Bandwidth Resource Allocation

admission control

bandwidth resource allocation

network slicing

### Welcome to IEEE NCA 2022!

NCA 2022, the International Symposium on Network Computing and Applications, is a successful series of conferences that serves as a large international forum for presenting and sharing recent research results and technological developments in the fields of Network and Cloud Computing. NCA, which is sponsored by the IEEE Computer Society, reaches out to both researchers and practitioners, and to both academia and industry. The conference features keynotes, technical presentations, and workshops.

All papers presented at the main conference and the workshops will be submitted to IEEE Xplore for publication and indexing.

[More about NCA](https://www.nca-ieee.org/2022/index.html)

**Organization**

* Steering Committee Chair: Dimiter R. Avresky, *IRIANC, Boston/Munich, USA/Germany*
* General Chair: Michele Colajanni, *University of Bologna, Italy*
* Program Chair: Miguel Pardal, *INESC-ID, Lisboa, Portugal*
* Program Chair: Luca Ferretti, *University of Modena and Reggio Emilia, Italy*
* Financial Chair: Mauro Andreolini, *University of Modena and Reggio Emilia, Italy*

**The topics of interest include, but are not limited to:**

* Theory of Network Computing
* Autonomic Network Computing
* Content Delivery Network (CDN)
* High Speed Networks/Protocols and Middleware
* Routing Mechanisms
* Overlay Networks/Peer-to-Peer Systems
* System Area Networks (SAN)/Clusters
* Performance Modeling/Quality of Services (QoS) Issues
* Web Caching and Switching
* Dependable Wide, Local, and System Area Networks
* Network Security
* Intrusion-Tolerant Networked Systems
* Scalable and Dependable Servers and Data Centers
* Middleware for Dependable Network Computing
* Self* (Configuring, Healing, Optimizing, Protecting, Organizing, Aware)
* Platforms for Network Computing
* Network Protocols: Verification and Validation
* Autonomic Network Computing for Achieving Self* Properties and Applications Availability
* Seamless and Virtual Capabilities for Implementing Self* Properties
* Software Defined Networking (SDN): Principles and Implementation
* Designing Highly-Available and Secure SDN
* Network Functions Virtualization (NFV): Design and Optimization
* Network Cloud Computing
* Machine Learning Techniques for Cloud Resources Management
* Big Data in Clouds for IoT
* Future Internet and Communicating Objects
* Mobile Ad-Hoc Networks (MANET)
* Sensor Networks
* Fog/Edge Computing
* Energy-Efficient Computation and Communication
* Applications to Real and/or Complex Problems, Practical Experiences and Prototypes
* Programming Environments for Distributed Systems
* Blockchain
* Byzantine Fault Tolerance
* Web and Mobile Security
* Security of Networked Applications (including Automotive, Industrial and Cyberphysical Systems)


To access the IEEE NCA 2022 content, [please register here ](https://www.nca-ieee.org/2022/registration.html)

NCA 2022, the International Symposium on Network Computing and Applications, is a successful series of conferences that serves as a large international forum for presenting and sharing recent research results and technological developments in the fields of Network and Cloud Computing.

"During this presentation, we consider communication market scenarios where operators lease resources from the InP.
We propose a resolution approach based on an admission control program and a greedy heuristic algorithm that performs the resource allocation.
We show that our algorithm provides good results for multiple scenarios generated in a real environment.
"

technical paper

"State machine replication (SMR) allows nodes to jointly maintain a consistent ledger, even when a part of nodes are Byzantine. To defend against and/or limit the impact of attacks launched by Byzantine nodes, there have been blocks that combine reputation mechanisms to SMR, where each node
has a reputation value based on its historical behaviours, and the
node’s voting power will be proportional to its reputation. Despite
the promising features of reputation-based SMR, existing studies
do not provide formal treatment on the reputation mechanism on
SMR protocols, including the types of behaviours affecting the
reputation, the security properties of the reputation mechanism,
and the extra security properties of SMR using reputation
mechanisms.
In this paper, we provide the first formal study on the
reputation-based SMR. We define the security properties of the
reputation mechanism w.r.t. these misbehaviours. Based on the
formalisation of the reputation mechanism, we formally define the
reputation-based SMR, and identify a new property reputationconsistency that is necessary for ensuring reputation-based SMR’s
safety. We then design a simple reputation mechanism that
achieves all security properties in our formal model. To demonstrate the practicality, we combine our reputation mechanism to
the Sync-HotStuff SMR protocol, yielding a simple and efficient
reputation-based SMR at the cost of only an extra ∆ in latency,
where ∆ is the maximum delay in synchronous networks."

Reputation-based state machine replication

"In this paper, we examine the inherent properties
of the Byzantine Reliable Broadcast (BRB) primitive as pertain
to the ability to provide causal ordering. We prove the following
results. First, we analyze Bracha’s BRB algorithm and show
that under the failure-free model, safety is guaranteed across
broadcasts. Second, we also prove that Bracha’s BRB algorithm
guarantees safety across broadcasts under the crash failure model
tolerating any number of crash failures. Third, we prove that
Bracha’s BRB algorithm cannot provide weak or strong safety
under the Byzantine failure model. Fourth, we prove that neither
the Imbs-Raynal BRB protocol nor any (2,*)-round BRB protocol
can provide causal order even if all processes are correct, and
they must incur additional latency to causally order messages at a
higher layer. The inherent causal ordering properties of Bracha’s
BRB can be of use under favourable circumstances in practical
applications, given the widespread adoption of the protocol."

Causal Ordering Properties of Byzantine Reliable Broadcast Primitives

Gossip-based dissemination protocols are important building blocks of large-scale distributed systems as they may impact both the systems' efficiency and fault tolerance. There exist many flavors of gossip dissemination protocols. IDA-Gossip is one of the gossip dissemination protocols proposed in the context of blockchains to efficiently disseminate large messages. It relies on multi-chunk gossip dissemination, erasure coding, and Merkle hash trees. However, despite its claimed efficiency, there is no in-depth analysis of this protocol to understand its behavior under different conditions (e.g., with injected faults). In this work, we evaluate the behavior of IDA-Gossip by relying on extensive experiments and simulations. Specifically, we evaluate IDA-Gossip both in terms of performance and resilience to faults by varying its configuration parameters and the number of faulty nodes, respectively. This study results in several takeaways. First, IDA-Gossip provides excellent dissemination latency compared to classic gossip. Second, it provides excellent coverage even with 40 percent of faulty nodes in the system. Finally, the use of erasure coding provides an important advantage to IDA-Gossip compared to classic multi-chunk gossip dissemination protocols.

In-depth analysis of the IDA-Gossip protocol

In beyond 5G (B5G) network, unmanned aerial vehicle (UAV) is considered as a promising solution to improve network coverage and satisfy the wide variety of service requirements. In B5G, mobile terminals (MTs) will be able to connect to
UAVs flying in different altitudes and serving different classes of applications such as enhanced mobile broadband (eMBB), ultra reliable low latency communication (uRLLC) and security intensive applications such as security as a service (SaaS). It
may be noted that UAVs in high altitude incur high power consumption, but reduced secrecy throughput and packet loss. In contrast, lower altitude UAVs incur high packet loss and secrecy throughput with reduced power consumption. Due to
such trade-off and the fact that the traditional user association problem is NP hard, selecting an appropriate UAV to satisfy the user requirement is a computationally challenging task. In this work, an UAV selection mechanism has been proposed for UAV enabled B5G network based on analytic hierarchy process (AHP) which essentially captures the aforementioned trade-off while associating the MTs with the UAVs. The proposed AHP selects the best UAV based on the application class. Simulation results show that the proposed UAV selection mechanism outperforms the existing best downlink (BD) based approach in terms of user throughput, secrecy throughput and packet loss rate

An analytic hierarchy process (AHP) based UAV selection mechanism for beyond 5G networks

In this work, a network selection mechanism for reconfigurable intelligent surface (RIS) assisted network has been proposed. The goal of the proposed mechanism is to select appropriate base station (BS) or BS-RIS pair to maximize user throughput while satisfying the delay and reliability constraints of uRLLC users. First, the network selection mechanism for RIS assisted network has been formulated as multi arm bandit (MAB) problem; Then, based on the formulation, a network selection strategy has been proposed. Finally, through extensive system level simulations, it has been shown that the proposed scheme outperforms the existing A3 handover scheme in terms of reliability and user throughput.

MAB based Network Selection mechanism for URLLC users in RIS assisted network

Video streaming is the dominating traffic in today's data-sharing world. Media service providers stream video content for their viewers, while worldwide users create and distribute videos using mobile or video system applications that significantly increase the traffic share. We propose a multilayer and pipeline encoding on the computing continuum (MPEC2) method that addresses the key technical challenge of high-price and computational complexity of video encoding. MPEC2 splits the video encoding into several tasks scheduled on appropriately selected Cloud and Fog computing instance types that satisfy the media service provider and user priorities in terms of time and cost. In the first phase, MPEC2 uses a multilayer resource partitioning method to explore the instance types for encoding a video segment. In the second phase, it distributes the independent segment encoding tasks in a pipeline model on the underlying instances. We evaluate MPEC2 on a federated computing continuum encompassing Amazon Web Services (AWS) EC2 Cloud and Exoscale Fog instances distributed on seven geographical locations. Experimental results show that MPEC2 achieves 24% faster completion time and 60% lower cost for video encoding compared to resource allocation related methods. When compared with baseline methods, MPEC2 yields 40-50% lower completion time and 5-60% reduced total cost.

MPEC2: Multilayer and Pipeline Video Encoding on the Computing Continuum

It becomes very common to use cell phones in public transportation and the cars. Vehicular networking has a major problem which is the degradation of signal quality due to interference and the large number of mobile devices. Artificial intelligence (AI) is a promising technique for next-generation wireless networks. Deep learning is a type of AI derived from machine learning; here the machine can learn by itself, unlike programming where it is content to execute rules to the letter predetermined. In addition, AI can be explored in order to solve various problems. In this paper, we tackle the problem of resource allocation in a vehicular small cell network (VSCN). Indeed, we propose a new mechanism based on deep reinforcement learning denoted Resource Allocation based Deep Reinforcement Learning (RA-DRL). The main goal of our proposed method is to maximize the total system sum rate (throughput) while guaranteeing minimum interferences, Quality of Service (QoS) and the demand for all users. Simulation results demonstrate that our proposed RA-DRL algorithm exhibits better performance comparing to the other methods, by maximizing the total system sum rate while maintaining inter-VSCs interferences and a minimum latency

Deep Reinforcement Learning for Downlink Resource Allocation in Vehicular Small Cell Networks

The Internet of Vehicles (IoV) has been recognized as a powerful application of the Internet of Things (IoT) in the Intelligent Transportation System (ITS), providing intelligence for interconnection between devices, interaction with the environment, and thus, greater efficiency in sensor data exploitation. Therefore, leveraging the huge capability of sensors embedded in vehicles to offer a Sensing As A Service (Se-aaS) represents a great solution to exploit under-used sensor resources and continue providing sensors despite their positions and mobility patterns.
Nevertheless, the high network mobility and the fast topology changes in IoV impact the vehicle availability and complicate the service provision. To this aim, we propose a vehicle sensor virtualization in a Cloud IoV architecture that encompasses functional blocks of mobile sensor suppliers, Sensor Cloud Service Provider (SCSP), and service consumers. Moreover, we propose a reinforcement learning-based solution for vehicle sensor selection to predict and dynamically select the physical sensors composing the vehicle virtual sensor. The conducted simulations show the effectiveness of the proposed solution.

Reinforcement Learning-based Virtual Sensor Provision in Internet of Vehicles (IoV)

Under the vision of industry 4.0, industrial networks are expected to accommodate a large amount of aggregated traffic of both operation and information technologies to enable the integration of innovative services and new applications. In this respect, guaranteeing the uninterrupted operation of the installed systems is an indisputable condition for network management. Network measurement and performance monitoring of the underlying communication states can provide invaluable insight for safeguarding the system performance by estimating required and available resources for flexible integration without risking network interruption or degrading network performance. In this work, we propose a data-driven in-band telemetry method to monitor the aggregated traffic of the network at the switch level. The method learns and models the communication states by local network-level measurement of communication intensity. The approximated model parameters provide information for network management for prognostic purposes and congestion avoidance resource planning when integrating new applications. Applying the method also addresses the consequence of telemetry data overhead on QoS since the transmission of telemetry packets can be done based on the current state of the network. The monitoring at the switch level is a step towards the Network-AI for future industrial networks. 

Data driven method for In band Network Telemetry Monitoring of Aggregated Traffic

Industrial Internet-of-Things (IoT) massively deploys intelligent computing in industrial production and manufacturing environments seeking automation, reliability, and control. Machine Learning models provide intelligent decisions to drive manufacturing systems to the next level of productivity, efficiency, and safety. One of the critical challenges that must be faced is the deployment of Machine Learning models at the network edge to detect data anomalies caused by Industrial IoT hardware failures, since industrial IoT devices are prone to errors and failures. These anomalies can harm the industrial IoT system by producing false alarms, consuming network resources, and affecting productivity. Because of that, it is critical to rely on low latency and high precision detection systems to verify the data received from industrial IoT devices. In light of this, we assessed key performance indicators of five machine learning models running at edge computing, to provide in-depth discussions. The performance results were obtained from an oil refinery scenario using a real industrial IoT dataset. The performance was measured in terms of (a) Accuracy, (b) Precision, (c) Recall, (d) F1 score, (e) Training time, and (f) Response time.

Inter-slice B5G Bandwidth Resource Allocation

Downloads

Next from IEEE NCA 2022

Reputation-based state machine replication

Stay up to date with the latest Underline news!

PRESENTATIONS

CONFERENCES

COMPANY

RESOURCES