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

NfvInsight:A Framework for Automatically Deploying and Benchmarking VNF Chains

Journal of computer science & technology 2022年第3期37卷 680-698页

作者： Tian-Ni Xu Hai-Feng Sun Di Zhang Xiao-Ming Zhou Xiu-Feng Sui Sa Wang Qun Huang Yun-Gang Bao State Key Laboratory of Computer Architecture Institute of Computing TechnologyChinese Academy of SciencesBeijing 100190China University of Chinese Academy of Sciences Beijing 100049China School of Information and Electronics Beijing Institute of TechnologyBeijing 100081China Peng Cheng Laboratory Shenzhen 518055China Department of Computer Science and Technology Peking UniversityBeijing 100871China

With the advent of virtualization techniques and software-defined networking(SDN),network function virtualization(NFV)shifts network functions(NFs)from hardware implementations to software appliances,between which exists a performance *** to narrow the gap is an essential issue of current NFV ***,the cumbersomeness of deployment,the water pipe effect of virtual network function(VNF)chains,and the complexity of the system software stack together make it tough to figure out the cause of low performance in the NFV *** pinpoint the NFV system performance,we propose NfvInsight,a framework for automatic deployment and benchmarking VNF *** framework tackles the challenges in NFV performance *** framework components include chain graph generation,automatic deployment,and fine granularity *** design and implementation of each component have their *** the best of our knowledge,we make the first attempt to collect rules forming a knowledge base for generating reasonable chain *** deploys the generated chain graphs automatically,which frees the network operators from executing at least 391 lines of bash commands for a single *** diagnose the performance bottleneck,NfvInsight collects metrics from multiple layers of the software ***,we collect the network stack latency distribution ingeniously,introducing only less than 2.2%*** showcase the convenience and usability of NfvInsight in finding bottlenecks for both VNF chains and the underlying *** our framework,we find several design flaws of the network stack,which are unsuitable for packet forwarding inside one single server under the NFV *** optimization for these flaws gains at most 3x performance improvement.

关键词： network function virtualization(NFV) service chain performance bottleneck network stack latency

来源：评论

学校读者我要写书评

暂无评论

CHMasters: A scalable and speed-efficient metadata service in distributed file system

CHMasters: A scalable and speed-efficient metadata service i...

引用

2011 12th International Conference on Parallel and Distributed Computing, Applications and Technologies, PDCAT 2011

作者： Xu, Min Zhou, Junrui Zhou, Wei An, Hong Department of Computer Science and Technology University of Science and Technology Hefei 230026 China Key Laboratory of Computer System and Architecture Chinese Academy of Sciences Beijing 100080 China

ISBN: (纸本)9780769545646

Distributed file system (DFS) is playing important roles of supporting large distributed data-intensive applications to meet storage needs. Typically, the design of DFS, such as GFS in Google, DMS in Cisco and TFS in Alibaba, is driven by observations of specific application workloads, internal demands and technological environment. In such systems, the metadata service is a critical factor that can affect the file system performance and availability to a great degree. Five requirements have been summarized for the metadata service: location transparent file service, smart director, efficient speed, strong scalability and friendly collaborator. In this paper, we present metadata service module called CHMasters in our DFS. Consistent hashing protocol is used to relieve potential hot spots on name servers. Files'metadata and master nodes are mapped into the same hash space by consistent hash function. And then files'metadata are scattered to master nodes by clockwise "closest" principle. Chunkserver acts as a client when report its chunks info. Only a small proportion of files'metadata will be rehashed when master nodes state change. A new scalable file mapping strategy is also proposed to map file sizes from few MB to several GB efficiently. After intensive experiments, it shows CHMasters is satisfying the above five requirements. © 2011 IEEE.

关键词： Metadata

来源：评论

学校读者我要写书评

暂无评论

Adaptive Marine Predator Optimization Algorithm(AOMA)-Deep Supervised Learning Classification(DSLC)based IDS framework for MANET security

引用

Intelligent and Converged Networks 2024年第1期5卷 1-18页

作者： M.Sahaya Sheela A.Gnana Soundari Aditya Mudigonda C.Kalpana K.Suresh K.Somasundaram Yousef Farhaoui Department of Electronics and Communication Engineering Vel Tech Rangarajan Dr.Sagunthala R&D Institute of Science and TechnologyChennai 600069India Department of Computer Science and Engineering Saveetha School of EngineeringSIMATSChennai 602105India JNIAS School of Planning and Architecture Hyderabad 500034India Department of Computer Science and Engineering NPR College of Engineering and TechnologyNatham Dindigul 624401India Department of Computer Science and Engineering PSNA College of Engineering and TechnologyPoolangulathupatti 620009India Department of Computer Science and Engineering Sri Muthukumaran Institute of TechnologyChennai 600069India Department of Computer Science Moulay Ismail UniversityMeknes 5003Morocco

Due to the dynamic nature and node mobility,assuring the security of Mobile Ad-hoc Networks(MANET)is one of the difficult and challenging tasks *** MANET,the Intrusion Detection System(IDS)is crucial because it aids in the identification and detection of malicious attacks that impair the network’s regular *** machine learning and deep learning methodologies are used for this purpose in the conventional works to ensure increased security of ***,it still has significant flaws,including increased algorithmic complexity,lower system performance,and a higher rate of ***,the goal of this paper is to create an intelligent IDS framework for significantly enhancing MANET security through the use of deep learning ***,the min-max normalization model is applied to preprocess the given cyber-attack datasets for normalizing the attributes or fields,which increases the overall intrusion detection performance of ***,a novel Adaptive Marine Predator Optimization Algorithm(AOMA)is implemented to choose the optimal features for improving the speed and intrusion detection performance of ***,the Deep Supervise Learning Classification(DSLC)mechanism is utilized to predict and categorize the type of intrusion based on proper learning and training *** evaluation,the performance and results of the proposed AOMA-DSLC based IDS methodology is validated and compared using various performance measures and benchmarking datasets.

关键词： Intrusion Detection System(IDS) Security Mobile Ad-hoc Network(MANET) min-max normalization Adaptive Marine Predator Optimization Algorithm(AOMA) Deep Supervise Learning Classification(DSLC)

来源：评论

学校读者我要写书评

暂无评论

Using Mobile Sinks in WSN: Computational Complexity and a Theoretical Bound

引用

电子学报(英文版) 2011年第1期20卷 147-150页

作者： GU Yu JI Yusheng CHEN Hongyang ZHAO Baohua Department of Computer Science University of Science and Technology of China Hefei China State Key Laboratory of Networking and Switching Technology Beijing China Information Systems Architecture Science Research Division NII Tokyo Japan Institute of Industrial Science University of Tokyo Tokyo Japan

In this paper, we study the lifetime op- timization problem in wireless sensor networks using mo- bile sink nodes. This problem is inherently difficult since we need to consider both sink scheduling and data rout- ing. Through a simple case study we develop a novel no- tation named the Placement pattern (PP) to bound traffic patterns with candidate locations. This significantly de- creases the number of elements needed to be scheduled. Based on the PP, we mathematically formulate this opti- mization problem as a Mixed-integer non-linear program- ming (MINLP), which is very tough and time consuming to solve. By proving that the problem is NP-complete, we point out that instead of seeking an optimal algorithm, heuristic algorithms, especially those with performance guarantee, would be much more desirable to develop. Fur- thermore, in order to help identify performance gains of heuristic algorithms proposed in the future, we develop a Linear programming (LP) formulation which serves as an upper bound by adopting a reformulation and relaxation technique.

关键词：无线传感器网络移动接收计算复杂性混合整数非线性规划启发式算法 NP完全问题优化问题 MINLP

来源：评论

学校读者我要写书评

暂无评论

A study of secure communications between mobile objects

A study of secure communications between mobile objects

引用

10th IEEE International Conference on Engineering of Complex computer Systems, ICECCS 2005

作者： Zhigang, Liao Zengzhi, Li Yan, Chen Tao, Zhan Institute of Computer Architecture and Network Xi'an Jiaotong University Xi'an China Computer Science and Technology Department Northwest Polytechnical University Xi'an China

ISBN: (纸本)076952284X

JASIAC (Java-based Active-network Secure Inter Active Application Communication) provides a mechanism to solve the security problem for Active Application communication for active networks. JASIAC can work against "unauthorization access" and "masquerading" quite well and work efficiently with "malicious access " and "direct DoS attack" . It stores the variables and methods to be published in a public variable pool and public method pool respectively, so it makes the security manageable and efficient;it also provides multi-level security mechanisms such as timed variable, hiding inner name, parameter by value and read-only parameter to make the security reliable and flexible. © 2005 IEEE.

关键词： Java programming language

来源：评论

学校读者我要写书评

暂无评论

A Provably Secure Lightweight Key Agreement Protocol for Wireless Body Area Networks in Healthcare System

引用

IEEE Transactions on Industrial Informatics 2023年第2期19卷 1683-1690页

作者： Zia, Maryam Obaidat, Mohammad S. Mahmood, Khalid Shamshad, Salman Saleem, Muhammad Asad Chaudhry, Shehzad Ashraf Comsats University Islamabad Department of Computer Science Sahiwal57000 Pakistan University of Jordan King Abdullah Ii School of Information Technology Amman11942 Jordan University of Science and Technology Beijing School of Computer and Communication Engineering Beijing100083 China Amity University UP Noida201301 India National Yunlin University of Science and Technology Future Technology Research Center Yunlin64002 Taiwan The University of Lahore Department of Software Engineering Lahore54590 Pakistan Abu Dhabi University Department of Computer Science and Information Technology College of Engineering Abu Dhabi United Arab Emirates Nisantasi University Department of Computer Engineering Faculty of Engineering and Architecture Istanbul34398 Turkey

Wireless Body Area Network (WBAN) is a vital application of the Internet of Things (IoT) that plays a significant role in gathering a patient's healthcare information. This collected data helps special professionals like doctors or physicians analyze patients' health status to cure different diseases. However, collecting such information from an insecure channel can be threatening due to the potential security threats. Therefore, it is crucial to secure this sensitive information. This article proposes a secure and lightweight authentication protocol for WBAN. The devised protocol is scalable, secure, and lightweight compared to various relevant competing protocols. The informal security analysis shows that the designed protocol is lightweight, secure, and efficient in resisting various major attacks. The performance analysis demonstrates our protocol's supremacy over various competing protocols in terms of computation and communication costs, inducing efficiency of 20.3% and 12.3%, respectively. Moreover, the practical performance of the designed protocol from the network point of view is measured using the widely recognized NS3 simulation tool. © 2005-2012 IEEE.

关键词： Authentication

来源：评论

学校读者我要写书评

暂无评论

Improving latency tolerance of network processors through simultaneous multithreading

引用

6th International Workshop on Advanced Parallel Processing Technologies, APPT 2005

作者： Liang, Bo An, Hong Lu, Fang Guo, Rui Department of Computer Science and Technology University of Science and Technology of China Hefei 230026 China Computer Architecture Laboratory Institute of Computing Technology Chinese Academy of Sciences Beijing 100086 China

ISBN: (纸本)3540296395

Existing multithreaded network processors architecture with multiple processing engines (PEs), aims at taking advantage of blocked multithreading technique which executes instructions of different user-defined threads in the same PE pipeline, in explicit and interleave way. Multiple PEs, each of which is a multithreaded processor core, process several packets in parallel to hide long memory access latency. Most of them are optimized for throughputs mostly in data-plane. In future network workloads, the boundaries between data-plane and control-plane become blurred, so that PEs are demanded not only wire speed packet forwarding on data-plane, but also highly intelligent and increased complex packet processing function on control-plane. In this paper, we analyze SMT's short latency tolerance potential when used in out-of-order and dynamic scheduling PE cores. We show in this paper that 2-4 issue SMT provides an excellent short memory and branch latency tolerance, which gain higher instructions throughout as well as much simpler structures. © Springer-Verlag Berlin Heidelberg 2005.

关键词： Network protocols

来源：评论

学校读者我要写书评

暂无评论

Monitoring edge-to-edge traffic aggregates in differentiated services networks

引用

Journal of Network and Systems Management 2001年第3期9.0卷 267-291页

作者： Kim, Jae-Young Hong, James Won-Ki Choi, Tae-Sang Department of Computer Science and Engineering Pohang University of Science and Technology Internet Architecture Team Internet Technology Department Electronics and Telecommunications Research Institute Dept. of Computer Science and Engineering POSTECH Pohang South Korea IEEE KICS KNOM

Differentiated Services (DiffServ), which are currently being standardized in the IETF DiffServ working group, is a solution that can provide different qualities of service to different network users. DiffServ aggregates network packets at edge routers and forwards the aggregated packets to core routers with different priorities. In this paper, we propose methods using the SNMP framework for monitoring edge-to-edge traffic aggregates in a DiffServ domain, which consists of a set of DiffServ-enabled routers. In order to manage each DiffServ router, we have analyzed the DiffServ MIB and instrumented it in the router. Further, we propose monitoring behaviors of edge-to-edge traffic aggregates by combining topology and performance information from MIB II and DiffServ MIB. Construction procedures and graphical representation of the edge-to-edge traffic aggregates are explained in detail. We also extend our efforts to implement a DiffServ domain monitoring system that monitors a set of DiffServ-enabled routers and traffic aggregates between every edge router pair. We believe that the proposed monitoring methods can serve as useful building blocks for managing DiffServ networks. © 2001 Plenum Publishing Corporation.

关键词： End-to-End Qos Monitoring Internet QoS Management Network Management SNMP Manager and Agent

来源：评论

学校读者我要写书评

暂无评论

A Non-Stop Double Buffering Mechanism for Dataflow architecture

引用

Journal of computer science & technology 2018年第1期33卷 145-157页

作者： Xu Tan Xiao-Wei Shen Xiao-Chun Ye Da Wang Dong-Rui Fan Lunkai Zhang Wen-Ming Li Zhi-Min Zhang Zhi-Min Tang State Key Laboratory of Computer Architecture Institute of Computing Technology Chinese Academy of Sciences Beijing 100190 China School of Computer and Control Engineering University of Chinese Academy of Sciences Beijing 100049 China State Key Laboratory of Mathematical Engineering and Advanced Computing Wuxi 214125 China Department of Computer Science The University of Chicago Chicago IL 60637 U.S.A.

Double buffering is an effective mechanism to hide the latency of data transfers between on-chip and off-chip memory. However, in dataflow architecture, the swapping of two buffers during the execution of many tiles decreases the performance because of repetitive filling and draining of the dataflow accelerator. In this work, we propose a non-stop double buffering mechanism for dataflow architecture. The proposed non-stop mechanism assigns tiles to the processing element array without stopping the execution of processing elements through optimizing control logic in dataflow architecture. Moreover, we propose a work-flow program to cooperate with the non-stop double buffering mechanism. After optimizations both on control logic and on work-flow program, the filling and draining of the array needs to be done only once across the execution of all tiles belonging to the same dataflow graph. Experimental results show that the proposed double buffering mechanism for dataftow architecture achieves a 16.2% average efficiency improvement over that without the optimization.

关键词： non-stop double buffering dataflow architecture high-performance computing

来源：评论

学校读者我要写书评

暂无评论

Opposites attract: Complementary phenotype selection for crossover in genetic programming 7th

引用

7th International Conference on Parallel Problem Solving from Nature, PPSN 2002

作者： Dolin, Brad Arenas, M.G. Merelo, J.J. Computer Science Department Stanford University StanfordCA94305 United States Department of Architecture and Computer Technology University of Granada GranadaCP 18071 Spain

ISBN: (纸本)3540441395

Standard crossover in genetic programming (GP) selects two parents independently, based on fitness, and swaps randomly chosen portions of genetic material (subtrees). The mechanism by which the crossover operator achieves success in GP, and even whether crossover does in fact exhibit relative success compared to other operators such as mutation, is anything but clear [14]. An intuitive explanation for successful crossover would be that the operator produces fit offspring by combining the "strengths" of each parent. However, standard selection schemes choose each parent independently of the other, and with regard to overall fitness rather than more specific phenotypic traits. We present an algorithm for choosing parents which have complementary performance on a set of fitness cases, with an eye toward enabling the crossover operator to produce offspring which combine the distinct strengths of each parent. We test Complementary Phenotype Selection in three genetic programming domains: Boolean 6-Multiplexer, Intertwined Spirals Classification, and Sunspot Prediction. We demonstrate significant performance gains over the control methods in all of them and present a preliminary analysis of these results. © Springer-Verlag Berlin Heidelberg 2002.

关键词： Genetic programming

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：