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

Automated Controller Placement for Software-Defined Networks to Resist DDoS Attacks

computers, Materials & Continua 2021年第9期68卷 3147-3165页

作者： Muhammad Reazul Haque Saw Chin Tan Zulfadzli Yusoff Kashif Nisar Lee Ching Kwang Rizaludin Kaspin Bhawani Shankar Chowdhry Rajkumar Buyya Satya Prasad Majumder Manoj Gupta Shuaib Memon Faculty of Computing&Informatics Multimedia UniversityPersiaran MultimediaCyberjaya63100SelangorMalaysia Faculty of Engineering Multimedia UniversityPersiaran MultimediaCyberjaya63100SelangorMalaysia Faculty of Computing and Informatics University Malaysia SabahJalan UMSKota Kinabalu Sabah88400Malaysia Telekom Malaysia Research&Development TM Innovation CentreCyberjaya63000SelangorMalaysia National Center of Robotics and Automation Mehran University of Engineering&TechnologyJamshoroPakistan Department of Computer Science and Engineering Hanyang UniversitySeoul04763South Korea School of Electrical and Electronic Engineering Nanyang Technological University639798Singapore Cloud Computing and Distributed Systems Laboratory The University of MelbourneMelbourneVIC 3053Australia Department of Electrical and Electronic Engineering Bangladesh University of Engineering and Technology(BUET)Dhaka1205Bangladesh Department of Electronics and Communication Engineering JECRC UniversityVidhaniJaipur303905India Auckland Institute of Studies Mt AlbertAucklandNew Zealand

In software-defined networks(SDNs),controller placement is a critical factor in the design and planning for the future Internet of Things(IoT),telecommunication,and satellite communication *** research has concentrated largely on factors such as reliability,latency,controller capacity,propagation delay,and energy ***,SDNs are vulnerable to distributed denial of service(DDoS)attacks that interfere with legitimate use of the *** ever-increasing frequency of DDoS attacks has made it necessary to consider them in network design,especially in critical applications such as military,health care,and financial services networks requiring high *** propose a mathematical model for planning the deployment of SDN smart backup controllers(SBCs)to preserve service in the presence of DDoS *** a number of input parameters,our model has two distinct ***,it determines the optimal number of primary controllers to place at specific locations or nodes under normal operating ***,it recommends an optimal number of smart backup controllers for use with different levels of DDoS *** goal of the model is to improve resistance to DDoS attacks while optimizing the overall cost based on the *** simulated results demonstrate that the model is useful in planning for SDN reliability in the presence of DDoS attacks while managing the overall cost.

关键词： SDN automated controller placement SBC ILP DDoS attack

来源：评论

学校读者我要写书评

暂无评论

A Full Dive into Realizing the Edge-enabled Metaverse: Visions, Enabling Technologies,and Challenges

arXiv

引用

arXiv 2022年

作者： Xu, Minrui Ng, Wei Chong Lim, Wei Yang Bryan Kang, Jiawen Xiong, Zehui Niyato, Dusit Yang, Qiang Shen, Xuemin Sherman Miao, Chunyan The School of Computer Science and Engineering Nanyang Technological University Singapore Alibaba Group Alibaba-NTU Joint Research Institute Nanyang Technological University Singapore The School of Automation Guangdong University of Technology China The Pillar of Information Systems Technology and Design Singapore University of Technology and Design Singapore487372 Singapore The Department of Computer Science and Engineering Hong Kong University of Science and Technology Hong Kong Webank China The Department of Electrical and Computer Engineering University of Waterloo WaterlooONN2L 3G1 Canada

Dubbed "the successor to the mobile Internet", the concept of the Metaverse has grown in popularity. While there exist lite versions of the Metaverse today, they are still far from realizing the full vision of an immersive, embodied, and interoperable Metaverse. Without addressing the issues of implementation from the communication and networking, as well as computation perspectives, the Metaverse is difficult to succeed the Internet, especially in terms of its accessibility to billions of users today. In this survey, we focus on the edge-enabled Metaverse to realize its ultimate vision. We first provide readers with a succinct tutorial of the Metaverse, an introduction to the architecture, as well as current developments. To enable ubiquitous, seamless, and embodied access to the Metaverse, we discuss the communication and networking challenges and survey cutting-edge solutions and concepts that leverage next-generation communication systems for users to immerse as and interact with embodied avatars in the Metaverse. Moreover, given the high computation costs required, e.g., to render 3D virtual worlds and run data-hungry artificial intelligence-driven avatars, we discuss the computation challenges and cloud-edge-end computation framework-driven solutions to realize the Metaverse on resource-constrained edge devices. Next, we explore how blockchain technologies can aid in the interoperable development of the Metaverse, not just in terms of empowering the economic circulation of virtual user-generated content but also to manage physical edge resources in a decentralized, transparent, and immutable manner. Finally, we discuss the future research directions towards realizing the true vision of the edge-enabled Metaverse. © 2022, CC BY.

关键词： Blockchain

来源：评论

学校读者我要写书评

暂无评论

Generative AI for Space-Air-Ground Integrated Networks

arXiv

引用

arXiv 2023年

作者： Zhang, Ruichen Du, Hongyang Niyato, Dusit Kang, Jiawen Xiong, Zehui Jamalipour, Abbas Zhang, Ping Kim, Dong In The College of Computing and Data Science Nanyang Technological University Singapore The Department of Electrical and Electronic Engineering University of Hong Kong Pok Fu Lam Hong Kong The School of Automation Guangdong University of Technology China The Pillar of Information Systems Technology and Design Singapore University of Technology and Design Singapore The University of Sydney SydneyNSW2006 Australia The State Key Laboratory of Networking and Switching Technology Beijing University of Posts and Telecommunications Beijing100876 China The Department of Electrical and Computer Engineering Sungkyunkwan University Suwon16419 Korea Republic of

Recently, generative AI technologies have emerged as a significant advancement in artificial intelligence field, renowned for their language and image generation capabilities. Meantime, space-air-ground integrated network (SAGIN) is an integral part of future B5G/6G for achieving ubiquitous connectivity. Inspired by this, this article explores an integration of generative AI in SAGIN, focusing on potential applications and case study. We first provide a comprehensive review of SAGIN and generative AI models, highlighting their capabilities and opportunities of their integration. Benefiting from generative AI’s ability to generate useful data and facilitate advanced decision-making processes, it can be applied to various scenarios of SAGIN. Accordingly, we present a brief survey on their integration, including channel modeling and channel state information (CSI) estimation, joint air-space-ground resource allocation, intelligent network deployment, semantic communications, image extraction and processing, security and privacy enhancement. Next, we propose a framework that utilizes a generative diffusion model (GDM) to construct channel information map to enhance quality of service for SAGIN. Simulation results demonstrate the effectiveness of the proposed framework. Finally, we discuss potential research directions for generative AI-enabled SAGIN. © 2023, CC BY.

关键词： Generative adversarial networks

来源：评论

学校读者我要写书评

暂无评论

Distributed Online Convex Optimization with Adversarial Constraints: Reduced Cumulative Constraint Violation Bounds under Slater’s Condition

arXiv

引用

arXiv 2023年

作者： Yi, Xinlei Li, Xiuxian Yang, Tao Xie, Lihua Hong, Yiguang Chai, Tianyou Johansson, Karl H. Lab for Information & Decision Systems Massachusetts Institute of Technology CambridgeMA02139 United States Department of Control Science and Engineering College of Electronics and Information Engineering Tongji University Shanghai201804 China Shanghai Research Institute for Intelligent Autonomous Systems China The State Key Laboratory of Synthetical Automation for Process Industries Northeastern University Shenyang110819 China School of Electrical and Electronic Engineering Nanyang Technological University 50 Nanyang Avenue Singapore639798 Singapore Division of Decision and Control Systems School of Electrical Engineering and Computer Science KTH Royal Institute of Technology Sweden Digital Futures Stockholm10044 Sweden

This paper considers distributed online convex optimization with adversarial constraints. In this setting, a network of agents makes decisions at each round, and then only a portion of the loss function and a coordinate block of the constraint function are privately revealed to each agent. The loss and constraint functions are convex and can vary arbitrarily across rounds. The agents collaborate to minimize network regret and cumulative constraint violation. A novel distributed online algorithm is proposed and it achieves an O(T max{c,1−c}) network regret bound and an O(T 1−c/2) network cumulative constraint violation bound, where T is the number of rounds and c ∈ (0, 1) is a user-defined trade-off parameter. When Slater’s condition holds (i.e, there is a point that strictly satisfies the inequality constraints), the network cumulative constraint violation bound is reduced to O(T 1−c). Moreover, if the loss functions are strongly convex, then the network regret bound is reduced to O(log(T)), and the network cumulative constraint violation bound is reduced to O(√log(T)T) and O(log(T)) without and with Slater’s condition, respectively. To the best of our knowledge, this paper is the first to achieve reduced (network) cumulative constraint violation bounds for (distributed) online convex optimization with adversarial constraints under Slater’s condition. Finally, the theoretical results are verified through numerical simulations. Copyright © 2023, The Authors. All rights reserved.

关键词： Economic and social effects

来源：评论

学校读者我要写书评

暂无评论

Quantized Distributed Nonconvex Optimization with Linear Convergence

Quantized Distributed Nonconvex Optimization with Linear Con...

引用

IEEE Conference on Decision and Control

作者： Lei Xu Xinlei Yi Jiayue Sun Yang Shi Karl Henrik Johansson Tao Yang State Key Laboratory of Synthetical Automation for Process Industries Northeastern University Shenyang China Division of Decision and Control Systems School of Electrical Engineering and Computer Science KTH Royal Institute of Technology Digital Futures Stockholm Sweden Department of Mechanical Engineering University of Victoria Victoria Canada

ISBN: (数字)9781665467612

ISBN: (纸本)9781665467629

This paper considers distributed nonconvex op-timization for minimizing the average of local cost functions, by using local information exchange over undirected communication networks. Since the communication channels often have limited bandwidth or capacity, we first introduce a quantization rule and an encoder/decoder scheme to reduce the transmission bits. By integrating them with a distributed algorithm, we then propose a distributed quantized nonconvex optimization algorithm. Assuming the global cost function satisfies the Polyak– Łojasiewicz condition, which does not require the global cost function to be convex and the global minimizer is not necessarily unique, we show that the proposed algorithm linearly converges to a global optimal point. Moreover, a low data rate is shown to be sufficient to ensure linear convergence when the algorithm parameters are properly chosen. The theoretical results are illustrated by numerical simulation examples.

关键词： Quantization (signal) Communication channels Bandwidth Cost function Numerical simulation Communication networks Distributed algorithms

来源：评论

学校读者我要写书评

暂无评论

RumorLens: Interactive Analysis and Validation of Suspected Rumors on Social Media

arXiv

引用

arXiv 2022年

作者： Wang, Ran Zhao, Yifei Wang, Shipan Du, Kehan Tang, Mojie Li, Yiyao Chen, Qianhe Tao, Hongxi Wang, Yong School of Journalism and Information Communication Huazhong University of Science and Technology China School of Artificial Intelligence and Automation Huazhong University of Science and Technology China School of Computer Science United Kingdom University of Bristol United Kingdom School of Architecture and Urban Planning Huazhong University of Science and Technology China School of Computer Science and Technology Huazhong University of Science and Technology China Computer Science Department University College London United Kingdom School of Computing and Information Systems Singapore Management University Singapore

With the development of social media, various rumors can be easily spread on the Internet and such rumors can have serious negative effects on society. Thus, it has become a critical task for social media platforms to deal with suspected rumors. However, due to the lack of effective tools, it is often difficult for platform administrators to analyze and validate rumors from a large volume of information on a social media platform efficiently. We have worked closely with social media platform administrators for four months to summarize their requirements of identifying and analyzing rumors, and further proposed an interactive visual analytics system, RumorLens, to help them deal with the rumor efficiently and gain an in-depth understanding of the patterns of rumor spreading. RumorLens integrates natural language processing (NLP) and other data processing techniques with visualization techniques to facilitate interactive analysis and validation of suspected rumors. We propose well-coordinated visualizations to provide users with three levels of details of suspected rumors: an overview displays both spatial distribution and temporal evolution of suspected rumors;a projection view leverages a metaphor-based glyph to represent each suspected rumor and further enable users to gain a quick understanding of their overall characteristics and similarity with each other;a propagation view visualizes the dynamic spreading details of a suspected rumor with a novel circular visualization design, and facilitates interactive analysis and validation of rumors in a compact manner. By using a real-world dataset collected from Sina Weibo, one case study with a domain expert is conducted to evaluate RumorLens. The results demonstrated the usefulness and effectiveness of our approach. Copyright © 2022, The Authors. All rights reserved.

关键词： Social networking (online)

来源：评论

学校读者我要写书评

暂无评论

Distributed formation trajectory planning for multi-vehicle systems

Distributed formation trajectory planning for multi-vehicle ...

引用

American Control Conference (ACC)

作者： Binh Nguyen Truong Nghiem Linh Nguyen Tung Nguyen Hung La Mehdi Sookhak Thang Nguyen Department of Engineering Texas A&M University–Corpus Christi Corpus Christi TX USA School of Informatics Computing and Cyber Systems Northern Arizona University Flagstaff AZ USA School of Engineering Information Technology and Physical Sciences Federation University Australia Churchill VIC Australia Department of Information Technology Uppsala University Uppsala Sweden Department of Computer Science and Engineering Advanced Robotics and Automation (ARA) Lab University of Nevada Reno NV USA Department of Computing Sciences Texas A&M University–Corpus Christi Corpus Christi TX USA

This paper addresses the problem of distributed formation trajectory planning for multi-vehicle systems with collision avoidance among vehicles. Unlike some previous distributed formation trajectory planning methods, our proposed approach offers great flexibility in handling computational tasks for each vehicle when the global formation of all the vehicles changes. It affords the system the ability to adapt to the computational capabilities of the vehicles. Furthermore, global formation constraints can be handled at any selected vehicles. Thus, any formation change can be effectively updated without recomputing all local formations at all the vehicles. To guarantee the above features, we first formulate a dynamic consensus-based optimization problem to achieve desired formations while guaranteeing collision avoidance among vehicles. Then, the optimization problem is effectively solved by ADMM-based or alternating projection-based algorithms, which are also presented. Theoretical analysis is provided not only to ensure the convergence of our method but also to show that the proposed algorithm can surely be implemented in a fully distributed manner. The effectiveness of the proposed method is illustrated by a numerical example of a 9-vehicle system.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Output consensus control for linear port-Hamiltonian systems

引用

IFAC-PapersOnLine 2022年第30期55卷 230-235页

作者： Shuai Feng Yu Kawano Michele Cucuzzella Jacquelien M.A. Scherpen School of Automation Nanjing University of Science and Technology Nanjing 210094 China Graduate School of Advanced Science and Engineering Hiroshima University Higashi-Hiroshima 739-8527 Japan Department of Electrical Computer and Biomedical Engineering University of Pavia 27100 Pavia PV Italy Jan C. Willems Center for Systems and Control ENTEG Faculty of Science and Engineering University of Groningen 9747 AG Groningen the Netherlands

In this paper, we study output consensus of coupled linear port-Hamiltonian systems on graphs in the presence of constant disturbances, where couplings are allowed to be both static and dynamic. Utilizing port-Hamiltonian structures, we present dynamic controllers achieving output consensus where the consensus values are determined by the disturbances. Finally, the utility of the proposed controller is illustrated by applying it to current sharing of DC microgrids.

关键词： port-Hamiltonian systems networked systems output consensus

来源：评论

学校读者我要写书评

暂无评论

Enhancing Deep Reinforcement Learning: A Tutorial on Generative Diffusion Models in Network Optimization

arXiv

引用

arXiv 2023年

作者： Du, Hongyang Zhang, Ruichen Liu, Yinqiu Wang, Jiacheng Lin, Yijing Li, Zonghang Niyato, Dusit Kang, Jiawen Xiong, Zehui Cui, Shuguang Ai, Bo Zhou, Haibo Kim, Dong In The School of Computer Science and Engineering The Energy Research Institute @ NTU Interdisciplinary Graduate Program Nanyang Technological University Singapore The School of Computer Science and Engineering Nanyang Technological University Singapore The State Key Laboratory of Networking and Switching Technology Beijing University of Posts and Telecommunications China The School of Information and Communication Engineering University of Electronic Sciences and Technology of China Chengdu China The School of Automation Guangdong University of Technology China The Pillar of Information Systems Technology and Design Singapore University of Technology and Design Singapore Shenzhen China The State Key Laboratory of Rail Traffic Control and Safety Beijing Jiaotong University Beijing100044 China School of Electronic Science and Engineering Nanjing University Jiangsu Nanjing210093 China The Department of Electrical and Computer Engineering Sungkyunkwan University Suwon16419 Korea Republic of

Generative Diffusion Models (GDMs) have emerged as a transformative force in the realm of Generative Artificial Intelligence (GenAI), demonstrating their versatility and efficacy across various applications. The ability to model complex data distributions and generate high-quality samples has made GDMs particularly effective in tasks such as image generation and reinforcement learning. Furthermore, their iterative nature, which involves a series of noise addition and denoising steps, is a powerful and unique approach to learning and generating data. This paper serves as a comprehensive tutorial on applying GDMs in network optimization tasks. We delve into the strengths of GDMs, emphasizing their wide applicability across various domains, such as vision, text, and audio generation. We detail how GDMs can be effectively harnessed to solve complex optimization problems inherent in networks. The paper first provides a basic background of GDMs and their applications in network optimization. This is followed by a series of case studies, showcasing the integration of GDMs with Deep Reinforcement Learning (DRL), incentive mechanism design, Semantic Communications (SemCom), Internet of Vehicles (IoV) networks, etc. These case studies underscore the practicality and efficacy of GDMs in real-world scenarios, offering insights into network design. We conclude with a discussion on potential future directions for GDM research and applications, providing major insights into how they can continue to shape the future of network optimization. © 2023, CC BY.

关键词： Reinforcement learning

来源：评论

学校读者我要写书评

暂无评论

Secure State Estimation against Sparse Attacks on a Time-varying Set of Sensors

arXiv

引用

arXiv 2022年

作者： Li, Zishuo Niazi, Muhammad Umar B. Liu, Changxin Mo, Yilin Johansson, Karl H. Department of Automation Tsinghua University Beijing100084 China Division of Decision and Control Systems Digital Futures School of Electrical Engineering and Computer Science KTH Royal Institute of Technology StockholmSE-100 44 Sweden Laboratory for Information and Decision Systems Massachusetts Institute of Technology 77 Massachusetts Avenue CambridgeMA02139 United States

This paper studies the problem of secure state estimation of a linear time-invariant (LTI) system with bounded noise in the presence of sparse attacks on an unknown, time-varying set of sensors. In other words, at each time, the attacker has the freedom to choose an arbitrary set of no more that p sensors and manipulate their measurements without restraint. To this end, we propose a secure state estimation scheme and guarantee a bounded estimation error subject to 2p-sparse observability and a mild, technical assumption that the system matrix has no degenerate eigenvalues. The proposed scheme comprises a design of decentralized observer for each sensor based on the local observable subspace decomposition. At each time step, the local estimates of sensors are fused by a median operator to obtain a secure estimation, which is then followed by a local detection-and-resetting process of the decentralized observers. The estimation error is shown to be upper-bounded by a constant which is determined only by the system parameters and noise magnitudes. Moreover, we design the detector threshold to ensure that the benign sensors never trigger the detector. The efficacy of the proposed algorithm is demonstrated by its application on a benchmark example of IEEE 14-bus system. © 2022, CC BY-NC-ND.

关键词： Fault detection

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：