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

Hui Zhang - One of the best experts on this subject based on the ideXlab platform.

  • DBTA - Research of Wheat Organ Configuration Data Management System
    2010 2nd International Workshop on Database Technology and Applications, 2010
    Co-Authors: Qiang Wang, Hui Zhang, Yanna Ren
    Abstract:

    Wheat organs Database provides background Data support and Data validation in various studies of wheat growth virtual visualization. This paper has discussed Data modeling method of wheat organ Configuration,on this foundation we have designed and realized the wheat organ Configuration Data management system. Through organ Configuration Data structure design, wheat organ library model is built;through wheat organ Data Initialization in the Data management subsystem, the wheat organ Database structure is established, wheat organ Data is input in the Data Input subsystem; and the Data query and analysis subsystem provides the foundation and support for the related wheat experiments.

  • Structure preserving anonymization of router Configuration Data
    IEEE Journal on Selected Areas in Communications, 2009
    Co-Authors: David A. Maltz, Jibin Zhan, Gisli Hjalmtysson, Albert Greenberg, Jennifer Rexford, Geoffrey G. Xie, Hui Zhang
    Abstract:

    A repository of router Configuration files from production networks would provide the research community with a treasure trove of Data about network topologies, routing designs, and security policies. However, Configuration files have been largely unobtainable precisely because they provide detailed information that could be exploited by competitors and attackers. This paper describes a method for anonymizing router Configuration files by removing all information that connects the Data to the identity of the underlying network, while still preserving the structure of information that makes the Data valuable to networking researchers. Anonymizing Configuration files has unusual requirements, including preserving relationships between elements of Data, anonymizing regular expressions, and robustly coping with more than 200 versions of the Configuration language. Conventional tools and techniques are poorly suited to the problem. Our anonymization method has been validated with a major carrier, earning unprivileged researchers access to the Configuration files of thousands of routers in hundreds of networks. Through example analysis, we demonstrate that the anonymized Data retains the key properties of the network design. The paper sets out techniques that could be used in an attempt to break the anonymization, and it concludes our anonymization techniques are most applicable to enterprise networks, because the large number of enterprises and the difficulty of probing them from the outside make it hard to recognize an anonymized network based solely on publicly-available information about its topology or Configuration. When applied to backbone networks, which are few in number and many of whose properties can be publicly measured, the anonymization might be broken by fingerprinting techniques described in this paper.

  • Internet Measurement Conference - Structure preserving anonymization of router Configuration Data
    Proceedings of the 4th ACM SIGCOMM conference on Internet measurement - IMC '04, 2004
    Co-Authors: David A. Maltz, Hui Zhang, Jibin Zhan, Gisli Hjalmtysson, Albert Greenberg, Geoffrey G. Xie, Jennifer Rexford
    Abstract:

    A repository of router Configuration files from production networks would provide the research community with a treasure trove of Data about network topologies, routing designs, and security policies. However, Configuration files have been largely unobtainable precisely because they provide detailed information that could be exploited by competitors and attackers. This paper describes a method for anonymizing router Configuration files by removing all information that connects the Data to the identity of the originating network, while still preserving the structure of information that makes the Data valuable to networking researchers. Anonymizing Configuration files has unusual requirements, including preserving relationships between elements of Data, anonymizing regular expressions, and robustly coping with more than 200 versions of the Configuration language, that mean conventional tools and techniques are poorly suited to the problem. Our anonymization method has been validated with a major carrier, earning unprivileged researchers access to the Configuration files of more than 7600 routers in 31 networks. Through example analysis, we demonstrate that the anonymized Data retains the key properties of the network design. We believe that applying our single-blind methodology to a large number of production networks from different sources would be of tremendous value to both the research and operations communities.

David A. Maltz - One of the best experts on this subject based on the ideXlab platform.

  • Structure preserving anonymization of router Configuration Data
    IEEE Journal on Selected Areas in Communications, 2009
    Co-Authors: David A. Maltz, Jibin Zhan, Gisli Hjalmtysson, Albert Greenberg, Jennifer Rexford, Geoffrey G. Xie, Hui Zhang
    Abstract:

    A repository of router Configuration files from production networks would provide the research community with a treasure trove of Data about network topologies, routing designs, and security policies. However, Configuration files have been largely unobtainable precisely because they provide detailed information that could be exploited by competitors and attackers. This paper describes a method for anonymizing router Configuration files by removing all information that connects the Data to the identity of the underlying network, while still preserving the structure of information that makes the Data valuable to networking researchers. Anonymizing Configuration files has unusual requirements, including preserving relationships between elements of Data, anonymizing regular expressions, and robustly coping with more than 200 versions of the Configuration language. Conventional tools and techniques are poorly suited to the problem. Our anonymization method has been validated with a major carrier, earning unprivileged researchers access to the Configuration files of thousands of routers in hundreds of networks. Through example analysis, we demonstrate that the anonymized Data retains the key properties of the network design. The paper sets out techniques that could be used in an attempt to break the anonymization, and it concludes our anonymization techniques are most applicable to enterprise networks, because the large number of enterprises and the difficulty of probing them from the outside make it hard to recognize an anonymized network based solely on publicly-available information about its topology or Configuration. When applied to backbone networks, which are few in number and many of whose properties can be publicly measured, the anonymization might be broken by fingerprinting techniques described in this paper.

  • Internet Measurement Conference - Structure preserving anonymization of router Configuration Data
    Proceedings of the 4th ACM SIGCOMM conference on Internet measurement - IMC '04, 2004
    Co-Authors: David A. Maltz, Hui Zhang, Jibin Zhan, Gisli Hjalmtysson, Albert Greenberg, Geoffrey G. Xie, Jennifer Rexford
    Abstract:

    A repository of router Configuration files from production networks would provide the research community with a treasure trove of Data about network topologies, routing designs, and security policies. However, Configuration files have been largely unobtainable precisely because they provide detailed information that could be exploited by competitors and attackers. This paper describes a method for anonymizing router Configuration files by removing all information that connects the Data to the identity of the originating network, while still preserving the structure of information that makes the Data valuable to networking researchers. Anonymizing Configuration files has unusual requirements, including preserving relationships between elements of Data, anonymizing regular expressions, and robustly coping with more than 200 versions of the Configuration language, that mean conventional tools and techniques are poorly suited to the problem. Our anonymization method has been validated with a major carrier, earning unprivileged researchers access to the Configuration files of more than 7600 routers in 31 networks. Through example analysis, we demonstrate that the anonymized Data retains the key properties of the network design. We believe that applying our single-blind methodology to a large number of production networks from different sources would be of tremendous value to both the research and operations communities.

Hideharu Amano - One of the best experts on this subject based on the ideXlab platform.

  • AINA Workshops - Research of PE Array Connection Network for Cool Mega-Array
    2013 27th International Conference on Advanced Information Networking and Applications Workshops, 2013
    Co-Authors: Rie Uno, Nobuaki Ozaki, Hideharu Amano
    Abstract:

    A Cool Mega Array or CMA is a low power reconfigurable processor array for battery driven mobile devices. We developed a prototype chip CMA-1. It is consisting of the 8 x 8 PE array, μ-controller for controlling Data alignment and Data memory. We just borrowed the PE array network of a dynamically reconfigurable processor for theCMA-1, and sufficient examination about it has not been carried out so far. The overhead of the Configuration Data transfer time to the CMA-1 also appeared to bottleneck the system performance. It means that the quantity of Configuration Data for the PE array should be as small as possible. In this paper, we proposed and evaluated three types of the CMA which PE array networks are different respectively in order to clarify the PE array network which is the most suitable for the CMA. As a result, in the CMA-cons which has island-style interconnection and dedicated links for sending constants, we could reduce the number of steps for transferring Configuration Data by 44.4% on average, 53.8%at most without a negative influence on performance and power consumption of the CMA.

  • ERSA - Configuration with Self-Configured Datapath: A High Speed Configuration Method for Dynamically Reconfigurable Processors.
    2009
    Co-Authors: Toru Sano, Yoshiki Saito, Hideharu Amano
    Abstract:

    Configuration with Self-configured Data Path (CSDP) is a high speed Configuration Data loading method for Dynamically Reconfigurable Processors (DRPs). By using a prepared Configuration Data, a network for computation in DRPs can be used as a Configuration Data path when the computation is stalled and the controller requires the Configuration Data transfer. Design and implementation of a DRP called MuCCRA-3.32b with CSDP demonstrates that the time for computation can be reduced to a half with only 1.3% hardware overhead. Energy consumption for Configuration Data loading can be also reduced.

  • FPT - Exploring the optimal size for multicasting Configuration Data of dynamically reconfigurable processors
    2008 International Conference on Field-Programmable Technology, 2008
    Co-Authors: T. Nakamura, Vasutan Tunbunheng, Toru Sano, Y. Hasegawa, S. Tsutsumi, Hideharu Amano
    Abstract:

    The Configuration Data transfer time of a dynamically reconfigurable processor often bottlenecks the hardware context switching time and degrades its computation performance. In order to reduce Data transferring time from a central memory to hardware context memory modules in all processing elements (PEs) and switching elements (SEs), a multicasting mechanism called RoMultiC (row-muticast Configuration) was proposed. However, the original Ro-MultiC used the whole PE or SE as a unit of multicast, the reduction of transfers is limited. Here, the trade-off between the granularity of multicast and hardware increase are evaluated, and the best way to make the multicast bit-map is explored. Evaluation results show that time for transfer is reduced up to 42% compared with the original RoMultiC with only 2% hardware overhead.

  • Data Multicasting Procedure for Increasing Configuration Speed of Coarse Grain Reconfigurable Devices
    IEICE Transactions on Information and Systems, 2007
    Co-Authors: Vasutan Tunbunheng, Masayasu Suzuki, Hideharu Amano
    Abstract:

    A novel Configuration method called Row Multicast Configuration (RoMultiC) is proposed for high speed Configuration of coarse grain reconfigurable systems. The same Configuration Data can be transferred in multicast fashion to configure many Processing Elements (PEs) by using a multicast bit-map provided in row and column directions of PE array. Evaluation results using practical applications show that a model reconfigurable system that incorporates this scheme can reduce Configuration clock cycles by up to 73.1% compared with traditional Configuration delivery scheme. Amount of required memory to store the Configuration Data at external memory is also reduced by omitting the duplicated Configuration Data.

  • FPL - Software Environment for WASMII: a Data Driven Machine with a Virtual Hardware
    Field-Programmable Logic Architectures Synthesis and Applications, 1994
    Co-Authors: Xiao-yu Chen, Xiao Ping Ling, Hideharu Amano
    Abstract:

    A Data driven computer WASMII which exploits dynamically reconfigurable FPGAs based on a virtual hardware has been developed. This paper presents a software system which automatically generates a Configuration Data for FPGAs used in the WASMII. In this system, an application program is edited as a Dataflow graph with a user interface, and divided into a set of subgraphs each of them is corresponding to the Configuration Data of an FPGA chip. These subgraphs are translated into program modules described in a hardware description language called the SFL. From the SFL programs, a logic synthesis tool PARTHENON generates a net-list of logic circuits for the subgraphs. Finally, the net-list is translated again for the Xiliux's CAD system, and the Configuration Data is generated. Here, the ordinary differential equation solver is presented as an example, and the number of gates is evaluated.

Stephen Leggett - One of the best experts on this subject based on the ideXlab platform.

  • PAM - Extracting Network-Wide Correlated Changes from Longitudinal Configuration Data
    Lecture Notes in Computer Science, 2009
    Co-Authors: Yu-wei Eric Sung, Sanjay Rao, Subhabrata Sen, Stephen Leggett
    Abstract:

    IP network operators face the challenge of making and managing router Configuration changes to serve rapidly evolving user and organizational needs. Changes are expressed in low-level languages, and often impact multiple parts of a Configuration file and multiple routers. These dependencies make Configuration changes difficult for operators to reason about, detect problems in, and troubleshoot. In this paper, we present a methodology to extract network-wide correlations of changes. From longitudinal snapshots of low-level router Configuration Data, our methodology identifies syntactic Configuration blocks that changed, applies Data mining techniques to extract correlated changes, and highlights changes of interest via operator feedback. Employing our methodology, we analyze an 11-month archive of router Configuration Data from 5 different large-scale enterprise Virtual Private Networks (VPNs). Our study shows that our techniques effectively extract correlated Configuration changes, within and across individual routers, and shed light on the prevalence and causes of system-wide and intertwined change operations. A deeper understanding of correlated changes has potential applications in the design of an auditing system that can help operators proactively detect errors during change management. To demonstrate this, we conduct an initial study analyzing the prevalence and causes of anomalies in system-wide changes.

Jennifer Rexford - One of the best experts on this subject based on the ideXlab platform.

  • Structure preserving anonymization of router Configuration Data
    IEEE Journal on Selected Areas in Communications, 2009
    Co-Authors: David A. Maltz, Jibin Zhan, Gisli Hjalmtysson, Albert Greenberg, Jennifer Rexford, Geoffrey G. Xie, Hui Zhang
    Abstract:

    A repository of router Configuration files from production networks would provide the research community with a treasure trove of Data about network topologies, routing designs, and security policies. However, Configuration files have been largely unobtainable precisely because they provide detailed information that could be exploited by competitors and attackers. This paper describes a method for anonymizing router Configuration files by removing all information that connects the Data to the identity of the underlying network, while still preserving the structure of information that makes the Data valuable to networking researchers. Anonymizing Configuration files has unusual requirements, including preserving relationships between elements of Data, anonymizing regular expressions, and robustly coping with more than 200 versions of the Configuration language. Conventional tools and techniques are poorly suited to the problem. Our anonymization method has been validated with a major carrier, earning unprivileged researchers access to the Configuration files of thousands of routers in hundreds of networks. Through example analysis, we demonstrate that the anonymized Data retains the key properties of the network design. The paper sets out techniques that could be used in an attempt to break the anonymization, and it concludes our anonymization techniques are most applicable to enterprise networks, because the large number of enterprises and the difficulty of probing them from the outside make it hard to recognize an anonymized network based solely on publicly-available information about its topology or Configuration. When applied to backbone networks, which are few in number and many of whose properties can be publicly measured, the anonymization might be broken by fingerprinting techniques described in this paper.

  • Internet Measurement Conference - Structure preserving anonymization of router Configuration Data
    Proceedings of the 4th ACM SIGCOMM conference on Internet measurement - IMC '04, 2004
    Co-Authors: David A. Maltz, Hui Zhang, Jibin Zhan, Gisli Hjalmtysson, Albert Greenberg, Geoffrey G. Xie, Jennifer Rexford
    Abstract:

    A repository of router Configuration files from production networks would provide the research community with a treasure trove of Data about network topologies, routing designs, and security policies. However, Configuration files have been largely unobtainable precisely because they provide detailed information that could be exploited by competitors and attackers. This paper describes a method for anonymizing router Configuration files by removing all information that connects the Data to the identity of the originating network, while still preserving the structure of information that makes the Data valuable to networking researchers. Anonymizing Configuration files has unusual requirements, including preserving relationships between elements of Data, anonymizing regular expressions, and robustly coping with more than 200 versions of the Configuration language, that mean conventional tools and techniques are poorly suited to the problem. Our anonymization method has been validated with a major carrier, earning unprivileged researchers access to the Configuration files of more than 7600 routers in 31 networks. Through example analysis, we demonstrate that the anonymized Data retains the key properties of the network design. We believe that applying our single-blind methodology to a large number of production networks from different sources would be of tremendous value to both the research and operations communities.