The Experts below are selected from a list of 48 Experts worldwide ranked by ideXlab platform

Xiaohong Guan - One of the best experts on this subject based on the ideXlab platform.

  • A systematic method for network topology reConfiguration with limited link additions
    Journal of Network and Computer Applications, 2012
    Co-Authors: Qing-shan Jia, Hengtao Wang, Ruixi Yuan, Xiaohong Guan
    Abstract:

    As a promising approach to improve network survivability, reliability and flexibility, topology reConfiguration is extremely important for modern networked infrastructures. In particular, for an existing network and the limited link addition resources, it is valuable to determine how to optimally allocate the new link resources, such that the resulting network is the most robust and efficient. In this paper, we investigate the problem of network topology reConfiguration (NTR) optimization with limited link additions. A dynamic robustness metric is developed to quantitatively characterize the robust connectivity and the efficiency under either random or targeted attack. We show that the NTR optimization with limited link additions is NP-hard. Therefore, to approximately solve the problem, we develop a preferential Configuration Node-protecting cycle (PCNC) method for sequential link additions. Analysis showed that PCNC method provides an approximate optimal solution under the dynamic robustness metric when compared with the optimal solution found by exhaustive search. Simulation results also showed that PCNC method effectively improves the network robustness and communication efficiency at the cost of least added link resources.

  • Enhancing the Robustness and Efficiency of Scale-free Network with Limited Link Addition
    KSII Transactions on Internet and Information Systems, 2012
    Co-Authors: Qing-shan Jia, Xiaohong Guan, Hengtao Wang
    Abstract:

    The robustness of a network is usually measured by error tolerance and attack vulnerability. Significant research effort has been devoted to determining the network design with optimal robustness. However, little attention has been paid to the problem of how to improve the robustness of existing networks. In this paper, we investigate how to optimize attack tolerance and communication efficiency of an existing network under the limited link addition. A survival fitness metric is defined to measure both the attack tolerance and the communication efficiency of the network. We show that network topology reConfiguration optimization with limited link addition (NTRLA) problem is NP-hard. Two approximate solution methods are developed. First, we present a degree-fitness parameter to guide degree-based link addition method. Second, a preferential Configuration Node-protecting cycle (PCNC) method is developed to do trade-off between network robustness and efficiency. The performance of PCNC method is demonstrated by numerical experiments.

  • A near optimal solution for network topology reConfigurations with limited link resources
    2011 9th World Congress on Intelligent Control and Automation, 2011
    Co-Authors: Qing-shan Jia, Hengtao Wang, Ruixi Yuan, Xiaohong Guan
    Abstract:

    As a promising approach to improve network survivability, reliability and flexibility, topology reConfiguration is extremely important for modern networked infrastructures. In particular, for an existing network and a limited set of newly available resources, it is valuable to determine how to optimally allocate the new resources, such that the resulting network is the most robust and efficient. In this paper, we investigate the problem of network topology reConfiguration (NTR) optimization with limited link resources. A dynamic robustness metric is developed to quantitatively characterize the network robustness and efficiency. We show that the NTR optimization with limited link resources is NP-complete. Therefore, to approximately solve the problem, we develop a preferential Configuration Node-protecting cycle (PCNC) scheme for sequential link additions. Analysis showed that the PCNC scheme provide an approximate optimal solution under the dynamic robustness metric. Simulation results also showed that the PCNC scheme effectively improves the network robustness and efficiency at the cost of least added link resources.

Qing-shan Jia - One of the best experts on this subject based on the ideXlab platform.

  • A systematic method for network topology reConfiguration with limited link additions
    Journal of Network and Computer Applications, 2012
    Co-Authors: Qing-shan Jia, Hengtao Wang, Ruixi Yuan, Xiaohong Guan
    Abstract:

    As a promising approach to improve network survivability, reliability and flexibility, topology reConfiguration is extremely important for modern networked infrastructures. In particular, for an existing network and the limited link addition resources, it is valuable to determine how to optimally allocate the new link resources, such that the resulting network is the most robust and efficient. In this paper, we investigate the problem of network topology reConfiguration (NTR) optimization with limited link additions. A dynamic robustness metric is developed to quantitatively characterize the robust connectivity and the efficiency under either random or targeted attack. We show that the NTR optimization with limited link additions is NP-hard. Therefore, to approximately solve the problem, we develop a preferential Configuration Node-protecting cycle (PCNC) method for sequential link additions. Analysis showed that PCNC method provides an approximate optimal solution under the dynamic robustness metric when compared with the optimal solution found by exhaustive search. Simulation results also showed that PCNC method effectively improves the network robustness and communication efficiency at the cost of least added link resources.

  • Enhancing the Robustness and Efficiency of Scale-free Network with Limited Link Addition
    KSII Transactions on Internet and Information Systems, 2012
    Co-Authors: Qing-shan Jia, Xiaohong Guan, Hengtao Wang
    Abstract:

    The robustness of a network is usually measured by error tolerance and attack vulnerability. Significant research effort has been devoted to determining the network design with optimal robustness. However, little attention has been paid to the problem of how to improve the robustness of existing networks. In this paper, we investigate how to optimize attack tolerance and communication efficiency of an existing network under the limited link addition. A survival fitness metric is defined to measure both the attack tolerance and the communication efficiency of the network. We show that network topology reConfiguration optimization with limited link addition (NTRLA) problem is NP-hard. Two approximate solution methods are developed. First, we present a degree-fitness parameter to guide degree-based link addition method. Second, a preferential Configuration Node-protecting cycle (PCNC) method is developed to do trade-off between network robustness and efficiency. The performance of PCNC method is demonstrated by numerical experiments.

  • A near optimal solution for network topology reConfigurations with limited link resources
    2011 9th World Congress on Intelligent Control and Automation, 2011
    Co-Authors: Qing-shan Jia, Hengtao Wang, Ruixi Yuan, Xiaohong Guan
    Abstract:

    As a promising approach to improve network survivability, reliability and flexibility, topology reConfiguration is extremely important for modern networked infrastructures. In particular, for an existing network and a limited set of newly available resources, it is valuable to determine how to optimally allocate the new resources, such that the resulting network is the most robust and efficient. In this paper, we investigate the problem of network topology reConfiguration (NTR) optimization with limited link resources. A dynamic robustness metric is developed to quantitatively characterize the network robustness and efficiency. We show that the NTR optimization with limited link resources is NP-complete. Therefore, to approximately solve the problem, we develop a preferential Configuration Node-protecting cycle (PCNC) scheme for sequential link additions. Analysis showed that the PCNC scheme provide an approximate optimal solution under the dynamic robustness metric. Simulation results also showed that the PCNC scheme effectively improves the network robustness and efficiency at the cost of least added link resources.

Thomas W. Shinder - One of the best experts on this subject based on the ideXlab platform.

  • chapter 7 isa 2006 stateful inspection and application layer filtering
    Dr. Tom Shinder's ISA Server 2006 Migration Guide, 2007
    Co-Authors: Thomas W. Shinder
    Abstract:

    Publisher Summary This chapter describes ISA 2006 stateful inspection and application layer filtering. The ISA firewall's Simple Mail Transfer Protocol (SMTP) filter Configuration interface can be accessed by opening the Microsoft Internet Security and Acceleration Server 2006 management console, expanding the server name and then, expanding the Configuration Node. The Post Office Protocol (POP) Intrusion Detection filter protects POP3 servers published by the ISA firewall using Server Publishing Rules from POP services buffer overflow attacks. There is no Configuration interface for the POP Intrusion Detection filter. The Firewall client is a generic Winsock Proxy client application. All applications designed to the Windows Sockets specification will automatically use the Firewall client. The Maximum headers length option allows you to configure the maximum length of all headers included in a request Hypertext Transfer Protocol (HTTP) communication. This setting applies to all rules that use the HTTP Security filter. The Allow only specified methods option allows you to specify the exact methods you want to allow through the ISA firewall. It is found that an HTTP policy can be exported from or imported into an Access Rule that uses the HTTP protocol, or a Web Publishing Rule.

  • Chapter 7 – ISA 2006 Stateful Inspection and Application Layer Filtering
    Dr. Tom Shinder's ISA Server 2006 Migration Guide, 2007
    Co-Authors: Thomas W. Shinder
    Abstract:

    Publisher Summary This chapter describes ISA 2006 stateful inspection and application layer filtering. The ISA firewall's Simple Mail Transfer Protocol (SMTP) filter Configuration interface can be accessed by opening the Microsoft Internet Security and Acceleration Server 2006 management console, expanding the server name and then, expanding the Configuration Node. The Post Office Protocol (POP) Intrusion Detection filter protects POP3 servers published by the ISA firewall using Server Publishing Rules from POP services buffer overflow attacks. There is no Configuration interface for the POP Intrusion Detection filter. The Firewall client is a generic Winsock Proxy client application. All applications designed to the Windows Sockets specification will automatically use the Firewall client. The Maximum headers length option allows you to configure the maximum length of all headers included in a request Hypertext Transfer Protocol (HTTP) communication. This setting applies to all rules that use the HTTP Security filter. The Allow only specified methods option allows you to specify the exact methods you want to allow through the ISA firewall. It is found that an HTTP policy can be exported from or imported into an Access Rule that uses the HTTP protocol, or a Web Publishing Rule.

Hengtao Wang - One of the best experts on this subject based on the ideXlab platform.

  • A systematic method for network topology reConfiguration with limited link additions
    Journal of Network and Computer Applications, 2012
    Co-Authors: Qing-shan Jia, Hengtao Wang, Ruixi Yuan, Xiaohong Guan
    Abstract:

    As a promising approach to improve network survivability, reliability and flexibility, topology reConfiguration is extremely important for modern networked infrastructures. In particular, for an existing network and the limited link addition resources, it is valuable to determine how to optimally allocate the new link resources, such that the resulting network is the most robust and efficient. In this paper, we investigate the problem of network topology reConfiguration (NTR) optimization with limited link additions. A dynamic robustness metric is developed to quantitatively characterize the robust connectivity and the efficiency under either random or targeted attack. We show that the NTR optimization with limited link additions is NP-hard. Therefore, to approximately solve the problem, we develop a preferential Configuration Node-protecting cycle (PCNC) method for sequential link additions. Analysis showed that PCNC method provides an approximate optimal solution under the dynamic robustness metric when compared with the optimal solution found by exhaustive search. Simulation results also showed that PCNC method effectively improves the network robustness and communication efficiency at the cost of least added link resources.

  • Enhancing the Robustness and Efficiency of Scale-free Network with Limited Link Addition
    KSII Transactions on Internet and Information Systems, 2012
    Co-Authors: Qing-shan Jia, Xiaohong Guan, Hengtao Wang
    Abstract:

    The robustness of a network is usually measured by error tolerance and attack vulnerability. Significant research effort has been devoted to determining the network design with optimal robustness. However, little attention has been paid to the problem of how to improve the robustness of existing networks. In this paper, we investigate how to optimize attack tolerance and communication efficiency of an existing network under the limited link addition. A survival fitness metric is defined to measure both the attack tolerance and the communication efficiency of the network. We show that network topology reConfiguration optimization with limited link addition (NTRLA) problem is NP-hard. Two approximate solution methods are developed. First, we present a degree-fitness parameter to guide degree-based link addition method. Second, a preferential Configuration Node-protecting cycle (PCNC) method is developed to do trade-off between network robustness and efficiency. The performance of PCNC method is demonstrated by numerical experiments.

  • A near optimal solution for network topology reConfigurations with limited link resources
    2011 9th World Congress on Intelligent Control and Automation, 2011
    Co-Authors: Qing-shan Jia, Hengtao Wang, Ruixi Yuan, Xiaohong Guan
    Abstract:

    As a promising approach to improve network survivability, reliability and flexibility, topology reConfiguration is extremely important for modern networked infrastructures. In particular, for an existing network and a limited set of newly available resources, it is valuable to determine how to optimally allocate the new resources, such that the resulting network is the most robust and efficient. In this paper, we investigate the problem of network topology reConfiguration (NTR) optimization with limited link resources. A dynamic robustness metric is developed to quantitatively characterize the network robustness and efficiency. We show that the NTR optimization with limited link resources is NP-complete. Therefore, to approximately solve the problem, we develop a preferential Configuration Node-protecting cycle (PCNC) scheme for sequential link additions. Analysis showed that the PCNC scheme provide an approximate optimal solution under the dynamic robustness metric. Simulation results also showed that the PCNC scheme effectively improves the network robustness and efficiency at the cost of least added link resources.

Ruixi Yuan - One of the best experts on this subject based on the ideXlab platform.

  • A systematic method for network topology reConfiguration with limited link additions
    Journal of Network and Computer Applications, 2012
    Co-Authors: Qing-shan Jia, Hengtao Wang, Ruixi Yuan, Xiaohong Guan
    Abstract:

    As a promising approach to improve network survivability, reliability and flexibility, topology reConfiguration is extremely important for modern networked infrastructures. In particular, for an existing network and the limited link addition resources, it is valuable to determine how to optimally allocate the new link resources, such that the resulting network is the most robust and efficient. In this paper, we investigate the problem of network topology reConfiguration (NTR) optimization with limited link additions. A dynamic robustness metric is developed to quantitatively characterize the robust connectivity and the efficiency under either random or targeted attack. We show that the NTR optimization with limited link additions is NP-hard. Therefore, to approximately solve the problem, we develop a preferential Configuration Node-protecting cycle (PCNC) method for sequential link additions. Analysis showed that PCNC method provides an approximate optimal solution under the dynamic robustness metric when compared with the optimal solution found by exhaustive search. Simulation results also showed that PCNC method effectively improves the network robustness and communication efficiency at the cost of least added link resources.

  • A near optimal solution for network topology reConfigurations with limited link resources
    2011 9th World Congress on Intelligent Control and Automation, 2011
    Co-Authors: Qing-shan Jia, Hengtao Wang, Ruixi Yuan, Xiaohong Guan
    Abstract:

    As a promising approach to improve network survivability, reliability and flexibility, topology reConfiguration is extremely important for modern networked infrastructures. In particular, for an existing network and a limited set of newly available resources, it is valuable to determine how to optimally allocate the new resources, such that the resulting network is the most robust and efficient. In this paper, we investigate the problem of network topology reConfiguration (NTR) optimization with limited link resources. A dynamic robustness metric is developed to quantitatively characterize the network robustness and efficiency. We show that the NTR optimization with limited link resources is NP-complete. Therefore, to approximately solve the problem, we develop a preferential Configuration Node-protecting cycle (PCNC) scheme for sequential link additions. Analysis showed that the PCNC scheme provide an approximate optimal solution under the dynamic robustness metric. Simulation results also showed that the PCNC scheme effectively improves the network robustness and efficiency at the cost of least added link resources.