检索结果-南通市图书馆

SGuard：A Lightweight SDN Safe-Guard Architecture for DoS Attacks

在线全文

同方期刊数据库

学校读者我要写书评

暂无评论

China Communications 2017年第6期14卷 113-125页

作者： Tao Wang hongchang chen National Digital Switching System Engineering and Technological Research Center Zhengzhou 450002 China

Software Defined Networking(SDN) is a revolutionary networking paradigm towards the future network,experiencing rapid development ***,its main characteristic,the separation of control plane and data plane,also brings about new security challenges,i.e.,Denial-of-Service(DoS) attacks specific to Open Flow SDN networks to exhaust the control plane bandwidth and overload the buffer memory of Open Flow *** mitigate the DoS attacks in the Open Flow networks,we design and implement SGuard,a security application on top of the NOX controller that mainly contains two modules:Access control module and Classification *** employ novel six-tuple as feature vector to classify traffic flows,meanwhile optimizing classification by feature ranking and selecting *** the modules will cooperate with each other to complete a series of tasks such as authorization,classification and so *** the end of this paper,we experimentally use Mininet to evaluate SGuard in a software *** results show that SGuard works efficiently and accurately without adding more overhead to the SDN networks.

关键词： sguard software defined networking denial-of-service attack security application

A Game-Theoretic Approach to Elastic Control in Software-Defined Networking

在线全文

学校读者我要写书评

暂无评论

China Communications 2016年第5期13卷 103-109页

作者： hongchang chen Guozhen cheng Zhiming Wang National Digital Switching System Engineering&Technological R&D Center Zhengzhou 450002China

Elastic control could balance the distributed control plane in Software-Defined Networking(SDN). Dynamic switch migration has been proposed to achieve it. However, existing schemes mainly focus on how to execute migration operation, but not why. This paper designs a decision-making mechanism based on zero-sum game theory to reelect a new controller as the master for migrated switches. It first chooses a switch for migration in the heavy controller which invites its neighbors as the game players to compete for the master role of this switch in the game-playing field(GPF) which is an occasional and loose domain for game-playing. Second, based on the concept of GPF, we design a decentralized strategy to play the game and determine which player as the final master. We implement it by extending the Open Flow protocol. Finally, numerical results demonstrate that our distributed strategy can approach elastic control plane with better performance.

关键词： software-defined networking master election game theory OpenFlow

Domain-Oriented Software Defined Computing Architecture

在线全文

学校读者我要写书评

暂无评论

China Communications 2019年第6期16卷 162-172页

作者： Ping Lv Qinrang Liu hongchang chen Ting chen National Digital Switching System Engineering and Technical R&D Center

With the introduction of software defined hardware by DARPA Electronics Resurgence Initiative,software definition will be the basic attribute of information *** from boundary certainty and algorithm aggregation of domain applications,domain-oriented computing architecture has become the technical direction that considers the high flexibility and efficiency of information *** at the characteristics of data-intensive computing in different scenarios such as Internet of Things(IoT),big data,artificial intelligence(AI),this paper presents a domain-oriented software defined computing architecture,discusses the hierarchical interconnection structure,hybrid granularity computing element and its computational kernel extraction method,finally proves the flexibility and high efficiency of this architecture by experimental comparison.

关键词： software defined hardware software defined computing architecture hierarchical interconnection mixed-granular computing element

Defending Against Link Failure in Virtual Network Embedding Using a Hybrid Scheme

在线全文

学校读者我要写书评

暂无评论

China Communications 2019年第1期16卷 129-138页

作者： Jianjian Ai hongchang chen Zehua Guo Guozhen cheng National Digital Switching System Engineering & Technological R&D Center University of Minnesota Twin Cities

Nowadays network virtualization is utterly *** a result,how to protect the virtual networks from attacking on the link is increasingly *** schemes are mainly backup-based,which suffer from data loss and are helpless to such attacks like data *** offer high security level,in this paper,we first propose a multipath and decision-making(MD) scheme which applies multipath simultaneously delivery and decision-making for protecting the virtual *** different security requirement for virtual link,we devise a hybrid scheme to protect the virtual *** the critical links,MD scheme is *** the other links,we adopt the Shared Backup *** simulation results indicate the proposed scheme can significantly increase the security level of the critical link high in the loss of less acceptance ratio.

关键词： network virtualization virtual link security multipath and decision-making hybrid scheme

Link Prediction Method Fusion with Local Structural Entropy for Directed Network

在线全文

学校读者我要写书评

暂无评论

Chinese Journal of Electronics 2024年第1期33卷 204-216页

作者： Shuxin LIU hongchang chen Lan WU Kai WANG Xing LI People’s Liberation Army Strategic Support Force Information Engineering University

Link prediction utilizes accessible network information to complement or predict the network *** is an important prerequisite for link prediction which means links more likely occurs between two similar nodes. Existing methods utilize the similarity of nodes but neglect of network structure. However the link direction leads to a far more complex structure and contains more information useful than the undirected networks. Most classic methods are difficult to depict the distribution of the network structure with incidental direction so the similarity characteristics of the network structure itself are lost. In this respect, a new method of local structure entropy is proposed to depict the directed structural distribution characteristics, which can be used to evaluate the degree of local structural similarity of nodes and then applied to link prediction methods. Experimental results on 8 real directed networks show that this method is effective for both area under the receiver operating characteristic curve(AUC)and ranking-score measures, and improved predictive capacity of the baseline methodology.

关键词： Correlation Current measurement Area measurement Prediction methods Receivers Benchmark testing Entropy

Toward a Scalable SDN Control Mechanism via Switch Migration

在线全文

同方期刊数据库

学校读者我要写书评

暂无评论

China Communications 2017年第1期14卷 111-123页

作者： Guozhen cheng hongchang chen Hongchao Hu Zhiming Wang National Digital Switching System Engineering & Technological R&D Center Zhengzhou 450002 China

Dynamic Controller Provisioning Problem(DCPP) is a key problem for scalable SDN. Previously, the solution to this problem focused on adapting the number of controllers and their locations with changing network conditions, but ignored balancing control loads via switch migration. In this paper, we study a scalable control mechanism to decide which switch and where it should be migrated for more balanced control plane, and we define it as Switch Migration Problem(SMP). The main contributions of this paper are as follows. First, we define a SDN model to describe the relation between controllers and switches from the view of loads. Based on this model, we form SMP as a Network Utility Maximization(NUM) problem with the objective of serving more requests under available control resources. Second, we design a synthesizing distributed algorithm for SMP--- Distributed Hopping Algorithm(DHA), by approximating our optimal objective via Log-Sum-Exp function. In DHA, individual controller performs algorithmic procedure independently. With the solution space F, we prove that the optimal gap caused by approximation is at most 1/βlog|F|, and DHA procedure is equal to implementation of a time-reversible Markov Chain process. Finally, the results are corroborated by several numerical simulations.

关键词： software-defined networking scalability switch migrations Markov chain

SecIngress:An API Gateway Framework to Secure Cloud Applications Based on N-Variant System

在线全文

学校读者我要写书评

暂无评论

China Communications 2021年第8期18卷 17-34页

作者： Dacheng Zhou hongchang chen Guozhen cheng Weizhen He Lingshu Li National Digital Switching System Engineering and Technological R&D Center ZhengzhouHenan 450002China

Based on the diversified technology and the cross-validation mechanism,the N-variant system provides a secure service architecture for cloud providers to protect the cloud applications from attacks by executing multiple variants of a single software in parallel and then checking their behaviors’***,it is complex to upgrade current Software as a Service(SaaS)applications to adapt N-variant system *** arise from the inability of tenants to adjust the application architecture in the cloud environment,and the difficulty for cloud service providers to implement N-variant systems using existing API *** paper proposes SecIngress,an API gateway framework,to overcome the challenge that it is hard in the cloud environment to upgrade the applications based on N-variants *** design a two-stage timeout processing method to lessen the service latency and an Analytic Hierarchy Process Voting under the Metadata mechanism(AHPVM)to enhance voting *** implement a prototype in a testbed environment and analyze the security and performance metrics before and after deploying the prototype to show the effectiveness of *** results reveal that SecIngress enhances the reliability of cloud applications with acceptable performance degradation.

关键词： N-variant system API gateway cloud security analytic hierarchy process

Uncovering network traffic anomalies based on their sparse distributions

在线全文

学校读者我要写书评

暂无评论

Science China(Information Sciences) 2014年第9期57卷 256-266页

作者： chenG GuoZhen chen hongchang chenG DongNian ZHANG Zhen LAN JuLong National Digital Switching System Engineering and Technological Research Center

Characterizing network traffic with higher-dimensional features results in increased complexity of most detectors and classifiers for identifying traffic *** key observations from existing studies confirm that network anomalies are typically distributed in a sparse way,with each anomaly essentially characterized by its lower-dimensional *** on this important finding,we exploit sparsity in designing a novel detection method for anomalies that ignores redundancies that are dynamically filtered from the feature sets and accurately classifies *** of our method with three well known techniques shows a10%improvement in accuracy with an O(n)complexity of the classifier.

关键词： anomaly detection feature filtering multi-resolution analysis sparse distribution

Cluster-preserving sampling algorithm for large-scale graphs

在线全文

同方期刊数据库

学校读者我要写书评

暂无评论

Science China. Information Sciences 2023年第1期66卷 112103页

作者： Zhang, Jianpeng chen, hongchang Yu, Dingjiu Pei, Yulong Deng, Yingjun Information Engineering University National Digital Switching System E&T Research Center Zhengzhou China (GRID:grid.440606.0) Network Systems Department of the Strategic Support Force Beijing China (GRID:grid.440606.0) Information Engineering University National Digital Switching System E&T Research Center Zhengzhou China (GRID:grid.440606.0) Eindhoven University of Technology School of Computer Science and Technology Eindhoven the Netherlands (GRID:grid.6852.9) (ISNI:0000 0004 0398 8763) Tianjin University Center for Applied Mathematics Tianjin China (GRID:grid.33763.32) (ISNI:0000 0004 1761 2484)

Graph sampling is a very effective method to deal with scalability issues when analyzing large-scale graphs. Lots of sampling algorithms have been proposed, and sampling qualities have been quantified using explicit properties (e.g., degree distribution) of the sample. However, the existing sampling techniques are inadequate for the current sampling task: sampling the clustering structure, which is a crucial property of the current networks. In this paper, using different expansion strategies, two novel top-leader sampling methods (i.e., TLS-e and TLS-i) are proposed to obtain representative samples, and they are capable of effectively preserving the clustering structure. The rationale behind them is to select top-leader nodes of most clusters into the sample and then heuristically incorporate peripheral nodes into the sample using specific expansion strategies. Extensive experiments are conducted to investigate how well sampling techniques preserve the clustering structure of graphs. Our empirical results show that the proposed sampling algorithms can preserve the population’s clustering structure well and provide feasible solutions to sample the clustering structure from large-scale graphs.

关键词： graph sampling clustering structure top-leader nodes expansion strategies large-scale graphs