检索结果-内蒙古大学图书馆

arXiv 2025年

作者： Zhang, Yichi Yang, Qianqian Zhejiang University Hangzhou China

Implicit Neural Representations (INRs), also known as neural fields, have emerged as a powerful paradigm in deep learning, parameterizing continuous spatial fields using coordinate-based neural networks. In this paper, we propose PICO, an INR-based framework for static point cloud compression. Unlike prevailing encoder-decoder paradigms, we decompose the point cloud compression task into two separate stages: geometry compression and attribute compression, each with distinct INR optimization objectives. Inspired by Kolmogorov-Arnold networks (KANs), we introduce a novel network architecture, LeAFNet, which leverages learnable activation functions in the latent space to better approximate the target signal’s implicit function. By reformulating point cloud compression as neural parameter compression, we further improve compression efficiency through quantization and entropy coding. Experimental results demonstrate that LeAFNet outperforms conventional MLPs in INR-based point cloud compression. Furthermore, PICO achieves superior geometry compression performance compared to the current MPEG point cloud compression standard, yielding an average improvement of 4.92 dB in D1 PSNR. In joint geometry and attribute compression, our approach exhibits highly competitive results, with an average PCQM gain of 2.7 × 10−3 Copyright © 2025, The Authors. All rights reserved.

关键词： network function virtualization

来源：评论

学校读者我要写书评

暂无评论

In-network Computing for Object Recognition in XR Applications

In-Network Computing for Object Recognition in XR Applicatio...

引用

Consumer Communications and networking Conference, CCNC IEEE

作者： Jiajing Zhang Muhammad Sami Suleman Sina Shafaei Giang T. Nguyen Frank H. P. Fitzek Technische Universität Dresden Dresden Germany Centre for Tactile Internet with Human-in-the-Loop (CeTI) Dresden Germany Vodafone Group Services GmbH Dresden Germany

ISBN: (数字)9798331508050

ISBN: (纸本)9798331508067

Extended Reality (XR) applications are emerging as a transformative technology, significantly enhancing user experiences in various domains, such as marketing and in-store shopping. In this context, object detection is a crucial component that enables XR-based gadgets to identify and interact with products in real-time. Object detection tasks typically employ AI-based models like YOLO (a.k.a. You Only Look Once), which require substantial computing power and currently are often offloaded to cloud servers. However, with advancements in hardware and Software-Defined networking (SDN) and network functions virtualization (NFV) technologies, In-network Computing (INC) has emerged as a viable alternative. This paper proposes the application of INC for XR applications, specifically for in-store shopping use case, by leveraging the capabilities of programmable network devices to distribute computational tasks across the network. By integrating and enabling INC, we aim to enhance the efficiency and scalability of the evaluated XR applications while reducing latency, bandwidth consumption and reliance on cloud servers.

关键词： YOLO Cloud computing Extended reality Scalability Real-time systems Hardware network function virtualization Servers Object recognition Software defined networking

来源：评论

学校读者我要写书评

暂无评论

Virtual network function Development for NG-PON Access network Architecture

引用

JOURNAL OF network AND SYSTEMS MANAGEMENT 2023年第4期31卷 78-78页

作者： Araujo, Igor Brizido, Andre Rito Lima, Solange Univ Minho Ctr Algoritmi Braga Portugal Altice Labs Direcao Sistemas Rede DSR Aveiro Portugal

Modern networks urge agility, flexibility, and capacity to cope with the growing demand for media content and applications increasingly oriented toward data consumption. The Central Offices (CO) of telecommunication providers, being a vital aggregator of different access networks, such as optical and mobile, need to be prepared to deal with these demands. The Open Broadband-Broadband Access Abstraction (OB-BAA) architecture fits into the initiative to modernize the Information Technology (IT) components of broadband networks, more specifically the COs. This paper discusses the development of a Virtualized network function (VNF) in the context of network security to be integrated as a component of an OB-BAA architecture guided by the Software-Defined network paradigm. More specifically, the authentication and authorization of network equipment within the IEEE 802.1X protocol are applied to Next Generation Passive Optical networks. The VNF development is based on the Golang language combined with gRPC programmable interfaces for communication between the various elements of the OB-BAA architecture, and then the components were "containerized" and inserted in the Docker and Kubernetes virtualization frameworks of a multinational telecommunications operator. Finally, performance metrics such as computational resource usage (CPU, memory, and network I/O) and execution time of VNF processes were analyzed in usage tests with multiple supplicants and distinct operational modes, to attest to the most promising virtualization scenarios.

关键词： Passive optical network Central office network function virtualization Virtual network function Software-defined network Golang

来源：评论

学校读者我要写书评

暂无评论

Performance characterization and profiling of chained CPU-bound Virtual network functions

引用

COMPUTER networkS 2023年第1期231卷

作者： Troia, Sebastian Savi, Marco Nava, Giulia Zorello, Ligia Maria Moreira Schneider, Thomas Maier, Guido Politecn Milan Dept Elect Informat & Bioengn DEIB Milan Italy Univ Milano Bicocca Dept Informat Syst & Commun DISCo Milan Italy ADVA Opt Networking Munich Germany

The increased demand for high-quality Internet connectivity resulting from the growing number of connected devices and advanced services has put significant strain on telecommunication networks. In response, cutting -edge technologies such as network function virtualization (NFV) and Software Defined networking (SDN) have been introduced to transform network infrastructure. These innovative solutions offer dynamic, efficient, and easily manageable networks that surpass traditional approaches. To fully realize the benefits of NFV and maintain the performance level of specialized equipment, it is critical to assess the behavior of Virtual network functions (VNFs) and the impact of virtualization overhead. This paper delves into understanding how various factors such as resource allocation, consumption, and traffic load impact the performance of VNFs. We aim to provide a detailed analysis of these factors and develop analytical functions to accurately describe their impact. By testing VNFs on different testbeds, we identify the key parameters and trends, and develop models to generalize VNF behavior. Our results highlight the negative impact of resource saturation on performance and identify the CPU as the main bottleneck. We also propose a VNF profiling procedure as a solution to model the observed trends and test more complex VNFs deployment scenarios to evaluate the impact of interconnection, co-location, and NFV infrastructure on performance.

关键词： network function virtualization Software defined networking Virtual network function Service function Chain Profiling Monitoring Virtual router Virtual firewall

来源：评论

学校读者我要写书评

暂无评论

Availability Evaluation of Service function Chains Under Different Protection Schemes 2

Availability Evaluation of Service Function Chains Under Dif...

引用

2nd IEEE International Mediterranean Conference on Communications and networking, MeditCom 2022

作者： Asdikian, Jean-Pierre H. Askari, Leila Ayoub, Omran Musumeci, Francesco Bregni, Stefano Tornatore, Massimo American University of Science and Technology Beirut Lebanon Politecnico di Milano Milan Italy University of Applied Sciences and Arts of Southern Switzerland Lugano Switzerland

ISBN: (数字)9781665498258

ISBN: (纸本)9781665498258

network function virtualization (NFV) calls for a new resource management approach where virtualized network functions (VNFs) replace traditional network hardware appliances. Thanks to NFV, operators are given a much greater flexibility, as these VNFs can be deployed as virtual nodes and chained together to form Service function Chains (SFCs). An SFC represents a set of dedicated virtualized resources deployed to provide a certain service to the consumer. One of its most important performance requirements is availability. In this paper, the availability achieved by SFCs is evaluated analytically, by modelling several protection schemes and given different availability values for the network components. The cost of each protection scheme, based on its network resource consumption, is also taken into account. Extensive numerical results are reported, considering various SFC characteristics, such as availability requirements, number of NFV nodes and availability values of network components. The lowest-cost protection strategy, in terms of number of occupied network components, which meets availability requirement, is identified. Our analysis demonstrates that, in most cases, resource-greedy protection schemes, such as end-to-end protection, can be replaced by less aggressive schemes, even when availability requirements are in the order of five or six nines, depending on the number of elements in the service function chain. © 2022 IEEE.

关键词： network function virtualization

来源：评论

学校读者我要写书评

暂无评论

Towards optimal synchronization in NFV-based environments

引用

INTERNATIONAL JOURNAL OF network MANAGEMENT 2023年第1期33卷 e2218-e2218页

作者： Alomari, Zakaria Zhani, Mohamed Faten Aloqaily, Moayad Bouachir, Ouns Ecole Technol Super ETS Montreal PQ Canada Mohamed Bin Zayed Univ Artificial Intelligence MBZ Machine Learning Dept Abu Dhabi U Arab Emirates Zayed Univ Coll Technol Innovat Dubai U Arab Emirates Ecole Technol Super ETS Dept Software & IT Engn Montreal PQ H3C 1K3 Canada

network function virtualization (NFV) is known for its ability to reduce deployment costs and improve the flexibility and scalability of network functions. Due to processing capacity limitations, the infrastructure provider may need to instantiate multiple instances of the same network function. However, most of network functions are stateful, meaning that the instances of the same function need to keep a common state and hence the need for synchronization among them. In this paper, we address this problem with the goal of identifying the optimal synchronization pattern between the instances in order to minimize the synchronization costs and delay. We propose a novel network function named Synchronization function able to carry out data collection and further minimize these costs. We first mathematically model this problem as an integer linear program that finds the optimal synchronization pattern and the optimal placement and number of synchronization functions that minimize synchronization costs and ensure a bounded synchronization delay. We also put forward three greedy algorithms to cope with large-scale scenarios of the problem, and we explore the possibility to migrate network function instances to further reduce costs. Extensive simulations show that the proposed algorithms efficiently find near-optimal solutions with minimal computation time and provide better results compared to existing solutions.

关键词： network function virtualization state synchronization synchronization costs synchronization delay VNF instance migration

来源：评论

学校读者我要写书评

暂无评论

On Ensuring Full Yet Cost-Efficient Survivability of Service function Chains in NFV Environments

引用

JOURNAL OF network AND SYSTEMS MANAGEMENT 2023年第3期31卷 45-45页

作者： Alomari, Zakaria Zhani, Mohamed Faten Aloqaily, Moayad Bouachir, Ouns Ecole Technol Super ETS Software & Informat Technol Engn Dept 1100 Notre Dame St Montreal PQ H3C 1K3 Canada Univ Sousse Inst Super Informat & Tech Commun ISITCom Dept Networks & Multimedia Hammam Sousse Tunisia Mohamed Bin Zayed Univ Artificial Intelligence MBZ Machine Learning Dept Abu Dhabi U Arab Emirates Zayed Univ Coll Technol Innovat Dubai U Arab Emirates

The emergence of network function virtualization enables the deployment of network services in the form of service function chains. In this context, one of the key challenges is to ensure the survivability of these chains in face of single or multiple simultaneous physical node failures. In this paper, we address this challenge and propose solutions to guarantee the survivability of service chains by ensuring that there are enough backups ready to take over when failures occur. Specifically, we put forward a Survivability Management Framework that predicts traffic demand in service function chains and provision enough backups for network functions with minimal costs. To this end, we leverage the AutoRegressive Integrated Moving Average (ARIMA) model to predict future demand. We mathematically model the service chain survivability problem as an integer linear program that determines the minimal number of shared backups and their optimal location in the infrastructure such that backup operational costs are minimized. We also devise two greedy algorithms to deal with the problem in large-scale scenarios. We show, through several simulations, the performance and efficiency of the proposed solutions in different scenarios. We also show that demand prediction could help to avoid unnecessary provisioning of backups, and thereby reduce their operational costs.

关键词： network function virtualization Virtual network function Shared backup Multiple-node failures

来源：评论

学校读者我要写书评

暂无评论

NEST: Optimal deploying DAG-SFCs to maximize the flows wholly served in the network edge

引用

COMPUTER networkS 2023年第1期235卷

作者： Lin, Xu Liu, Chuchu Luo, Lailong Guo, Deke Xu, Ming Natl Univ Def Technol Coll Comp Changsha 410073 Peoples R China Natl Univ Def Technol Coll Syst Engn Sci & Technol Informat Syst Engn Lab Changsha 410073 Peoples R China Changsha Univ Technol & Sci Sch Econ & Management Changsha 410015 Peoples R China Natl Univ Def Technol Coll Syst Engn Changsha 410073 Peoples R China

Compared with the dedicated hardware-based middle-boxes, network function virtualization (NFV) makes network services more flexible, scalable, and cost-efficient by replacing the network functions, e.g., Firewalls, Deep Packet Inspections (DPI), Load Balancers, by Virtual network functions (VNFs) running on generalpurpose commercial servers. Multiple VNFs usually chain up to formulate Service function Chains (SFC) to enable complex network services. With the exploitation of VNF parallelism, SFC with parallel VNFs (Para-SFC) is proposed to reduce the SFC execution delay. However, the inner-structure of a Para-SFC is usually complex and a Para-SFC may have multiple legitimate topologies. DAG-SFC is one of the basic sharping methods for standardizing the topology of Para-SFCs. To adapt to the fast development of edge computing, it is critical to find an optimal deployment of Para-SFCs in hybrid edge-and-cloud network with the purpose of maximizing the amount of the flows completely serviced in the edge. In this paper, we first analyze the target problem via integer program modeling and prove its NP-hardness. Then, we propose a heuristic algorithm named NEST, which is based on the combination of maximum spanning tree and Next Fit. With extensive evaluations, we demonstrate that, compared with the benchmark methods, NEST can achieve up to respective 14% and 37% performance gain on DAG-SFC edge deployment maximization while can always realize (up to respective 276% and 305%) higher efficiency of link usage.

关键词： network function virtualization Edge computing Service function Chain network function parallelism

来源：评论

学校读者我要写书评

暂无评论

EdgeSFG: A matching game mechanism for service function graph deployment in industrial edge computing environment

引用

INFORMATION SCIENCES 2023年第1期639卷

作者： Liao, Liping Li, Cong Cai, Jun Luo, Jianzhen Zhang, Wenjing Guangdong Polytech Normal Univ Sch Cyber Secur Guangzhou 510635 Peoples R China

network function virtualization-enabled industrial edge computing is a promising service paradigm. In industrial edge computing (IEC), virtual service functions (VSFs) are used to implement basic functionalities and deliver concrete services. To improve the service response speed, VSFs are organized into service function graphs (SFGs) to process service data parallelly. The main challenge is to select proper edge servers for SFG deployment and minimize latency. However, finding an optimal solution to the SFG deployment problem is an NP-hard problem. This paper proposes a matching-game-based algorithm to deploy a large number of concurrent SFGs in an IEC environment. In the proposed algorithm, the deployment of concurrent SFGs is formulated as a college admission problem where SFGs propose to edge servers expecting a low service latency, and then the edge servers decide whether to accept the SFG proposals according to the possible service gain. A distributed matching procedure is introduced to solve the matching game problem between the SFGs and edge servers. The simulations are conducted to verify the SFGs and evaluate the performance of the proposed algorithm in concurrent SFG deployment. Simulation results show that proposed algorithm performs well in reducing average service latency and improving service acceptance rate.

关键词： network function virtualization Industrial Internet of Things Edge computing Service function graphs Resource allocation

来源：评论

学校读者我要写书评

暂无评论

Cost-Aware, Profiling-Based Resource Configuration for Virtual network function Forwarding Graphs

Cost-Aware, Profiling-Based Resource Configuration for Virtu...

引用

International Conference on Intelligence in Next Generation networks (ICIN)

作者： Nafiseh Daemi Amin Ebrahimzadeh Carla Mouradian Fetahi Wuhib Roch. H. Glitho CIISE Concordia University Montréal QC Canada Ericsson Research Montréal QC Canada

ISBN: (数字)9798331542399

ISBN: (纸本)9798331542405

network function virtualization (NFV) enables Virtual network functions (VNFs) to run on shared physical infrastructure, offering flexible resource management. A key challenge in NFV environments is determining the optimal resource configuration for VNFs, particularly in a VNF-Forwarding Graph (VNF-FG) where dependencies between VNFs complicate the process. This paper introduces a Cost-Aware Profiling-based Resource Configuration (CA-PRC) algorithm, which dynamically adjusts the resource configurations to minimize the total allocated CPU while achieving performance targets specified in the Service Level Agreements (SLAs). The proposed CA-PRC algorithm incrementally generates performance profiles for VNFs and balances the trade-off between CPU allocation and profiling cost, thus reducing the need for an exhaustive profiling. Our evaluations demonstrate that the proposed algorithm significantly outperforms the Uniform Random Selection (URS) and Weighted Random VNF Selection (WRVS) in terms of the number of required profiling rounds and total allocated CPU.

关键词： Technological innovation Costs Heuristic algorithms Microservice architectures Dynamic scheduling Cost function Real-time systems network function virtualization Resource management Service level agreements

来源：评论

学校读者我要写书评

暂无评论

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

建议与咨询 留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案： 新增检索档案 确定 取消

请选择收藏分类： 新增自定义分类 确定 取消

通借通还

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

请选择保存的检索档案：

请选择收藏分类：