Controller vulnerabilities allow malicious actors to disrupt or hijack the Software-Defined Networking. Traditionally, it is static mappings between the control plane and data plane. Adversaries have plenty of time to...Controller vulnerabilities allow malicious actors to disrupt or hijack the Software-Defined Networking. Traditionally, it is static mappings between the control plane and data plane. Adversaries have plenty of time to exploit the controller's vulnerabilities and launch attacks wisely. We tend to believe that dynamically altering such static mappings is a promising approach to alleviate this issue, since a moving target is difficult to be compromised even by skilled adversaries. It is critical to determine the right time to conduct scheduling and to balance the overhead afforded and the security levels guaranteed. Little previous work has been done to investigate the economical time in dynamic-scheduling controllers. In this paper, we take the first step to both theoretically and experimentally study the scheduling-timing problem in dynamic control plane. We model this problem as a renewal reward process and propose an optimal algorithm in deciding the right time to schedule with the objective of minimizing the long-term loss rate. In our experiments, simulations based on real network attack datasets are conducted and we demonstrate that our proposed algorithm outperforms given scheduling schemes.展开更多
For ill-posed bilevel programming problem,the optimistic solution is always the best decision for the upper level but it is not always the best choice for both levels if the authors consider the model's satisfacto...For ill-posed bilevel programming problem,the optimistic solution is always the best decision for the upper level but it is not always the best choice for both levels if the authors consider the model's satisfactory degree in application.To acquire a more satisfying solution than the optimistic one to realize the two levels' most profits,this paper considers both levels' satisfactory degree and constructs a minimization problem of the two objective functions by weighted summation.Then,using the duality gap of the lower level as the penalty function,the authors transfer these two levels problem to a single one and propose a corresponding algorithm.Finally,the authors give an example to show a more satisfying solution than the optimistic solution can be achieved by this algorithm.展开更多
In many auctions,buyers know beforehand little about objects to be sold in the future.Whether and how to reveal information about future objects is an important decision problem for sellers.In this paper,two objects a...In many auctions,buyers know beforehand little about objects to be sold in the future.Whether and how to reveal information about future objects is an important decision problem for sellers.In this paper,two objects are sold sequentially and each buyer's valuation for the second object is k times that for the first one,and the true value of k is sellers' private information.The authors identify three factors which affect sellers' revelation strategies: The market's competition intensity which is characterized by the number of buyers,buyers' prior information about the second object,and the difference degree between two objects which is characterized by k.The authors give not only conditions under which revealing information about the second object in advance benefits the seller,but also the optimal releasing amount of information in the market with two sellers and one seller,respectively.展开更多
The authors present a semi-definite relaxation algorithm for the scheduling problem with controllable times on a single machine. Their approach shows how to relate this problem with the maximum vertex-cover problem wi...The authors present a semi-definite relaxation algorithm for the scheduling problem with controllable times on a single machine. Their approach shows how to relate this problem with the maximum vertex-cover problem with kernel constraints (MKVC).The established relationship enables to transfer the approximate solutions of MKVCinto the approximate solutions for the scheduling problem. Then, they show how to obtain an integer approximate solution for MKVC based on the semi-definite relaxation and randomized rounding technique.展开更多
基金supported by the Foundation for Innovative Research Groups of the National Natural Science Foundation of China (No. 61521003)The National Key R&D Program of China (No.2016YFB0800101)+1 种基金the National Science Foundation for Distinguished Young Scholars of China (No.61602509)Henan Province Key Technologies R&D Program of China(No.172102210615)
文摘Controller vulnerabilities allow malicious actors to disrupt or hijack the Software-Defined Networking. Traditionally, it is static mappings between the control plane and data plane. Adversaries have plenty of time to exploit the controller's vulnerabilities and launch attacks wisely. We tend to believe that dynamically altering such static mappings is a promising approach to alleviate this issue, since a moving target is difficult to be compromised even by skilled adversaries. It is critical to determine the right time to conduct scheduling and to balance the overhead afforded and the security levels guaranteed. Little previous work has been done to investigate the economical time in dynamic-scheduling controllers. In this paper, we take the first step to both theoretically and experimentally study the scheduling-timing problem in dynamic control plane. We model this problem as a renewal reward process and propose an optimal algorithm in deciding the right time to schedule with the objective of minimizing the long-term loss rate. In our experiments, simulations based on real network attack datasets are conducted and we demonstrate that our proposed algorithm outperforms given scheduling schemes.
基金supported by the National Science Foundation of China under Grant No.71171150the National Natural Science Foundation of ChinaTian Yuan Foundation under Grant No.11226226
文摘For ill-posed bilevel programming problem,the optimistic solution is always the best decision for the upper level but it is not always the best choice for both levels if the authors consider the model's satisfactory degree in application.To acquire a more satisfying solution than the optimistic one to realize the two levels' most profits,this paper considers both levels' satisfactory degree and constructs a minimization problem of the two objective functions by weighted summation.Then,using the duality gap of the lower level as the penalty function,the authors transfer these two levels problem to a single one and propose a corresponding algorithm.Finally,the authors give an example to show a more satisfying solution than the optimistic solution can be achieved by this algorithm.
基金supported by the National Natural Science Foundation of China under Grant Nos.61273206 and 71471069
文摘In many auctions,buyers know beforehand little about objects to be sold in the future.Whether and how to reveal information about future objects is an important decision problem for sellers.In this paper,two objects are sold sequentially and each buyer's valuation for the second object is k times that for the first one,and the true value of k is sellers' private information.The authors identify three factors which affect sellers' revelation strategies: The market's competition intensity which is characterized by the number of buyers,buyers' prior information about the second object,and the difference degree between two objects which is characterized by k.The authors give not only conditions under which revealing information about the second object in advance benefits the seller,but also the optimal releasing amount of information in the market with two sellers and one seller,respectively.
文摘The authors present a semi-definite relaxation algorithm for the scheduling problem with controllable times on a single machine. Their approach shows how to relate this problem with the maximum vertex-cover problem with kernel constraints (MKVC).The established relationship enables to transfer the approximate solutions of MKVCinto the approximate solutions for the scheduling problem. Then, they show how to obtain an integer approximate solution for MKVC based on the semi-definite relaxation and randomized rounding technique.
