Results and Achievements of the ALLIANCE Project: New Network Solutions for 5G and Beyond

Careglio, Davide; Spadaro, Salvatore; Cabellos, Albert; Lázaro, José A.; Barlet‐Ros, Pere; Gené, Joan M.; Perelló, Jordi; Bujan, Fernando Agraz; Suárez-Varela, José; Pages, Albert; Paillissé, Jordi; Almasan, Paul; Domingo‐Pascual, Jordi; Sole-Pareta, J.

doi:10.3390/app11199130

Cited by 4 publications

(3 citation statements)

References 58 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Furthermore, PD-TC tends to deploy VNFs so that the total number of used CPU cores is as small as possible since the while loop of determining VNF placement and request routes in PD-TC starts from the minimum number of CPU cores obtained with the ILP problem in ( 33)- (35). This leads to increase in the number of hops between the source and the node where traffic- [6], [12], [29], [30]. decreasing VNFs are placed, and thus, leads to increase in the link utilization cost.…”

Section: Evaluation In Realistic Situationsmentioning

confidence: 99%

Service Chain Provisioning Model Considering Traffic Changes Due to Virtualized Network Functions

Ozaki

Sato

Oki

2023

IEEE Trans. Netw. Serv. Manage.

View full text Add to dashboard Cite

Service chaining provides network services by flexibly configuring service chains that connect virtualized network functions (VNFs) in the appropriate order so as to satisfy users' needs. Existing models can be inefficient in terms of consuming network and computation resources since the models do not consider the traffic changes due to VNFs or the models restrict routing and VNF placement. This paper proposes a service chain provisioning model that handles the traffic changes created by VNFs while determining the VNF visit order of each request, request routes, and VNF placement. The service chain provisioning problem is formulated as an integer linear programming (ILP) problem. Three methods for limiting the number of VNF visit order patterns considered in the ILP problem are introduced to shorten the computation time. In order to handle a problem that is intractable with the ILP model, we introduce a greedy algorithm and an algorithm that divides the problem into the VNF placement part and the routing part. Numerical results show that considering the traffic changes due to VNFs yields more efficient consumption of network and computation resources than the alternative of assuming that the traffic amount of each request is constant between the endpoints. The results also show that the computation time can be shortened in our examined scenarios while we obtain the objective value larger by at most 0.4% than the optimal value by limiting the number of visit order patterns considered.

show abstract

Section: Evaluation In Realistic Situationsmentioning

confidence: 99%

Service Chain Provisioning Model Considering Traffic Changes Due to Virtualized Network Functions

Ozaki

Sato

Oki

2023

IEEE Trans. Netw. Serv. Manage.

View full text Add to dashboard Cite

show abstract

“…Spanish-funded ALLIANCE report highlights new architecture includes monitoring, trust, the SDN/NFV cross-layer domain, RINA, and KDN orchestration. This project fixed 5G/B5G networking difficulties (7) . Energy-efficient Adaptive Route Decision Sink relocation procedure using Cluster Head Chain Cycling was proposed by (8) .…”

Section: Introductionmentioning

confidence: 99%

A Novel Packet Scheduler Policy for Multi-Hop Wireless Networks Using Diameter Based Consensus Algorithm

Joshi,

Parvati

2023

IJST

View full text Add to dashboard Cite

Background: Over the time, the wireless communications have become more universal. Development of packet scheduling algorithms in wireless networks can proficiently improve delivery of packets via wireless links. Method of packet scheduling can promise quality of service and enhance transmission rate in wireless networks. Objectives: To develop an efficient packet scheduler policy to reduce the average End to End delay among the flowsand to fix the number of queues by finding diameter and TB-DVA. Methods: The timedbuffer distributed voting algorithm (TB-DVA) is a kind of voting algorithm that used to determine the maximum distance reported by all the nodes. We have used NS-3 simulator for simulation model and average throughput and average packet delay parameters are considered; we have compared the novel TB-DVA based Packet Scheduler policy with the traditional AODV Packet Scheduler policy. Mention the dataset considered. How comparison made with gold standards Findings: Comparing the new packet scheduler policy to the standard AODV packet scheduler policy, the simulation revealed that the new packet scheduler policy provides lower average end-to-end latency and high throughput. In comparison to the traditional AODV packet scheduler policy, average end-to-end delay is reduced by 7.14 percent and average throughput is enhanced by 9 percent. Novelty: The farthest node is determined by a distributed vote across all nodes.

show abstract

“…The use of smartphones in the management of such a problem can substantially reduce the risk of road accidents and can combat the loss of human life caused by carelessness. Although the fifth generation (5G) has been introduced, there is still no stability in terms of data transfer rate, and it is not possible to take into account the reference speeds that have transfer rates above 10 Gbps [16,17]. Given the fact that there is a problem with the degree of massive connectivity of users through the Internet-of-Things (IoT) paradigm, we cannot have extremely viable expectations for RF technologies, and therefore we need an alternative.…”

Section: Introductionmentioning

confidence: 99%

Analysis and Experiment of Wireless Optical Communications in Applications Dedicated to Mobile Devices with Applicability in the Field of Road and Pedestrian Safety

Zadobrischi

2022

Sensors

View full text Add to dashboard Cite

Current developments and the need for high-performance devices that provide safe and reliable communications present a future perspective by using visible light as an alternative solution that can substantially improve road and pedestrian safety. The daily use of smartphones is imperative; thus one can build on this premise a system dedicated to the aforementioned problem. However, the problem of the visible light communication channel (VLC) is highly dynamic and becomes extremely unpredictable in terms of exposure to noise sources. Developing applications dedicated to direct communications with infrastructure and vehicles using portable devices is becoming a challenge and at the same time a necessary solution. The article proposes the shaping of an emission–reception architecture dedicated to adaptive fuse light communications using OCC (optical camera communication) but also standard VLC communications using ambient light sensors via an Android application. This approach aims to provide a first step in shaping information-sharing applications using VLC communications. As far as we know, this approach has not been implemented in external VLC systems. The performance of the architecture and the application was demonstrated by practical tests that confirmed the capacity of the technology even if we are in the first stage.

show abstract

Results and Achievements of the ALLIANCE Project: New Network Solutions for 5G and Beyond

Cited by 4 publications

References 58 publications

Service Chain Provisioning Model Considering Traffic Changes Due to Virtualized Network Functions

Service Chain Provisioning Model Considering Traffic Changes Due to Virtualized Network Functions

A Novel Packet Scheduler Policy for Multi-Hop Wireless Networks Using Diameter Based Consensus Algorithm

Analysis and Experiment of Wireless Optical Communications in Applications Dedicated to Mobile Devices with Applicability in the Field of Road and Pedestrian Safety

Contact Info

Product

Resources

About