North Dakota State University

Displaying 1-40 of 41 results

  • White Papers // Oct 2013

    Green Data Center Networks: Challenges and Opportunities

    The concerns about environmental impacts, electricity cost, and energy needs of data centers are mounting. These concerns have given significant impetus to consider energy efficiency as one of the major data center design parameters for researchers and IT executives. Tremendous growth in the size and computing demands of data centers...

    Provided By North Dakota State University

  • White Papers // Jul 2013

    Investigating Techniques for Automating the Selection of Cloud Infrastructure Services

    The cloud infrastructure services landscape advances steadily leaving users in the agony of choice. As a result, Cloud service identification and discovery remains a hard problem due to different service descriptions, non-standardized naming conventions and heterogeneous types and features of cloud services. In this paper, analysis the research challenges and...

    Provided By North Dakota State University

  • White Papers // Jul 2013

    Application-aware Workload Consolidation to Minimize both Energy Consumption and Network Load in Cloud Environments

    In this paper, the authors tackle the problem of Virtual Machine (VM) placement onto physical servers to jointly optimize two objective functions. The first objective is to minimize the total energy spent within a cloud due to the servers that are commissioned to satisfy the computational demands of VMs. The...

    Provided By North Dakota State University

  • White Papers // Jul 2013

    A Study of Incremental Cryptography for Security Schemes in Mobile Cloud Computing Environments

    While using the cloud storage services on resource constraint mobile device, the mobile user needs to ensure the confidentiality of the critical data before uploading on the cloud storage. The resource limitation of mobile devices restricts mobile users for executing complex security operations using computational power of mobile devices. To...

    Provided By North Dakota State University

  • White Papers // Dec 2012

    A Review of Data Intensive Computing

    Data intensive computing is a common research problem in science, industry and computer academia. In recent twenty years, the explosive growth of science data has appeared all over the world. Typical data intensive computing applications include Internet text data processing, scientific research data processing, large scale graph computing, inverse and...

    Provided By North Dakota State University

  • White Papers // Nov 2012

    Scalable, Low Complexity, and Fast Greedy Scheduling Heuristics for Highly Heterogeneous Distributed Computing Systems

    For heterogeneous distributed computing systems, important design issues are scalability and system optimization. Given such systems, it is crucial to develop low computational complexity algorithms to schedule tasks in a manner that exploits the heterogeneity of the resources and applications. In this paper, the authors report three scalable, and fast...

    Provided By North Dakota State University

  • White Papers // Sep 2012

    Mitigating Eavesdropping Attack Using Secure Key Management Scheme in Wireless Mesh Networks

    Wireless Mesh Network (WMN) is a rapid deployed, self organized and multi-hop wireless networks. However, the wireless and distributed natures of WMN make it subject to various kinds of malicious attacks, which raise a great challenge in securing these networks. Most existing security mechanisms are based on cryptographic keys where...

    Provided By North Dakota State University

  • White Papers // Jul 2012

    Efficient High-speed Current-mode Links for Network-on-Chip Performance Optimization

    The authors propose a novel cost-effective long-range NoC interconnect design based on current-mode signaling. The proposed CMOS based long-range link reduces the communication delay of long wires significantly without using traditional pipelined repeaters, making it a cost efficient alternative to wireless and optical interconnects. Spice simulations are performed to verify...

    Provided By North Dakota State University

  • White Papers // Jul 2012

    Server Replication in Multicast Networks

    In this paper, the authors study and propose heuristic algorithms to solve the problem of Replicated Server Placement (RSP) with Quality of Service (QoS) constraints. Although there has been much work on RSP in multicast networks, in most of them a simplified replication model is used; therefore, their proposed solutions...

    Provided By North Dakota State University

  • White Papers // Jul 2012

    A New Reliability Evaluation Methodology and its Application to Network-on-Chip Routers

    In this paper, the authors propose a new circuit level reliability evaluation methodology. The proposed methodology is based on a divide and conquer approach, which enjoys the benefits of device level accuracy and of block level efficiency. At the core of the reliability estimation engine lies a Monte Carlo algorithm...

    Provided By North Dakota State University

  • White Papers // Feb 2012

    MapReduce Across Distributed Clusters for Data-Intensive Applications

    Recently, the computational requirements for large-scale data-intensive analysis of scientific data have grown significantly. In High Energy Physics (HEP) for example, the Large Hadron Collider (LHC) produced 13 petabytes of data in 2010. This huge amount of data are processed on more than 140 computing centers distributed across 34 countries....

    Provided By North Dakota State University

  • White Papers // Jan 2012

    Data Scheduling in Data Grids and Data Centers: A Short Taxonomy of Problems and Intelligent Resolution Techniques

    Data-aware scheduling in today's large-scale heterogeneous environments has become a major research issue. Data Grids (DGs) and Data Centers arise quite naturally to support needs of scientific communities to share, access, process, and manage large data collections geographically distributed. Data scheduling, although similar in nature with grid scheduling, is given...

    Provided By North Dakota State University

  • White Papers // Dec 2011

    Semantics-Enhanced Privacy Recommendation for Social Networking Sites

    Privacy protection is a vital issue for safe social interactions within Social Networking Sites (SNS). Although SNSs such as MySpace and Facebook allow users to configure their privacy settings, it is not a simple task for normal users with hundreds of online friends. In this paper, the authors propose an...

    Provided By North Dakota State University

  • White Papers // Nov 2011

    Decentralized Self-Management of Trust for Mobile Ad Hoc Social Networks

    The construction of social networks over mobile devices in the events or at locations has emerged as a new network paradigm. These new mobile social networks enable people to communicate and share their experiences without the need to have Internet access and with minimum required infrastructure. However, the functionality and...

    Provided By North Dakota State University

  • White Papers // Oct 2011

    Improving Fault Tolerance of Network-on-Chip Links via Minimal Redundancy and Reconfiguration

    The authors propose to partition links in a network-on-chip into multiple segments and use spare wires at the level of each segment to address permanent errors due to manufacturing or wearout defects. Because different segments of the spare wires address different errors from different segments, the proposed reconfigurable link structure...

    Provided By North Dakota State University

  • White Papers // Oct 2011

    Energy-Efficient Resource Utilization in Cloud Computing

    In cloud computing systems, the energy consumption of the under-utilized resources accounts for a substantial amount of the actual energy use. Inherently, a resource allocation strategy that considers the resource utilization would increase the energy efficiency of the system. Task consolidation is an effective technique that increase the system resource...

    Provided By North Dakota State University

  • White Papers // Jul 2011

    Genetic Algorithms for Energy-Aware Scheduling in Computational Grids

    Because of its sheer size, Computational Grids (CGs) require advanced methodologies and strategies to efficiently schedule user's tasks and applications to resources. Scheduling becomes even more challenging when energy efficiency, classical makespan criterion and user perceived Quality of Service (QoS) are treated as first-class objectives in CG resource allocation methodologies....

    Provided By North Dakota State University

  • White Papers // Jun 2011

    On a Game Theoretical Methodology for Data Replication in Ad Hoc Networks

    In this paper, a mathematical model for data object replication in ad hoc networks is formulated. The derived model is general, flexible and adaptable to cater for various applications in ad hoc networks. The authors propose a game theoretical technique in which players (mobile hosts) continuously compete in a non-cooperative...

    Provided By North Dakota State University

  • White Papers // Jun 2011

    A Frugal Auction Technique for Data Replication in Large Distributed Computing Systems

    Fine-grained data replication over the Internet allows duplication of frequently accessed data objects, as opposed to entire sites, to certain locations so as to improve the performance of large-scale content distribution systems. In a distributed system, agents representing their sites try to maximize their own benefit since they are driven...

    Provided By North Dakota State University

  • White Papers // Jun 2011

    A Game Theoretical Energy Efficient Resource Allocation Technique for Large Distributed Computing Systems

    The problem of mapping tasks onto a computational grid with the aim to minimize the power consumption and the makespan subject to the constraints of deadlines and architectural requirements is considered in this paper. To solve this problem, the authors propose a solution from cooperative game theory based on the...

    Provided By North Dakota State University

  • White Papers // Jun 2011

    Community-Based Cloud for Emergency Management

    In this paper, the authors have proposed a cloud computing platform to maximally utilize all of the available information and human power from within and outside of a community to make information available to heterogeneous user groups. This enhances current information and communication systems to better manage natural and man-made...

    Provided By North Dakota State University

  • White Papers // Apr 2011

    Energy-Efficient Computing Using Agent-Based Multi-Objective Dynamic Optimization

    Nowadays distributed systems face a new challenge, almost nonexistent a decade ago: energy-efficient computing. Due to the rising environmental and economical concerns and with trends driving operational costs beyond the acquisition ones, green computing is of more actuality than never before. The aspects to deal with, e.g. dynamic systems, stochastic...

    Provided By North Dakota State University

  • White Papers // Mar 2011

    On Reconfiguring Embedded Application Placement on Smart Sensing and Actuating Environments

    In a smart home environment appliances and objects have sensing, actuating and wireless communication capabilities. Recent embedded middleware initiatives aim at providing an easy to use programming framework for developing applications that require the cooperation of sensing and actuating nodes. To achieve this, the mobile agent paradigm is adopted under...

    Provided By North Dakota State University

  • White Papers // Feb 2011

    Reciprocity, Conscientiousness, And Employee Layoff Decision In Firm-Employee Relationships

    Firm-Employee Relationships (FERs) have always been one of the most important stakeholder relationships for firms. Due to various reasons, firms have to lay off employees from time to time. Since layoff affects the laid-off employees, the survivors, and the performance of firms, it is an important decision in managing FERs....

    Provided By North Dakota State University

  • White Papers // Feb 2011

    Efficient Data Sharing Over Large-Scale Distributed Communities

    Data sharing in large-scale Peer Data Management Systems (PDMS) is challenging due to the excessive number of data sites, their autonomous nature, and the heterogeneity of their schema. Existing PDMS query applications have difficulty to simultaneously achieve high recall rate and scalability. In this paper, the authors propose an ontology-based...

    Provided By North Dakota State University

  • White Papers // Jan 2011

    A New Fault-tolerant and Congestion-aware Adaptive Routing Algorithm for Regular Networks-on-Chip

    In this paper, the authors propose a new fault-tolerant and congestion-aware adaptive routing algorithm for Network-on-Chips (NoCs). The proposed algorithm is based on the ball-and-string model and employs a distributed approach based on partitioning of the regular NoC architecture into regions controlled by local monitoring units. Each local monitoring unit...

    Provided By North Dakota State University

  • White Papers // Jan 2011

    A Weighted Sum Technique for the Joint Optimization of Performance and Power Consumption in Data Centers

    With data centers, end-users can realize the pervasiveness of services that will be one day the cornerstone of the lives. However, data centers are often classified as computing systems that consume the most amounts of power. To circumvent such a problem, the authors propose a self-adaptive weighted sum methodology that...

    Provided By North Dakota State University

  • White Papers // Nov 2010

    Efficient Congestion-Oriented Custom Network-on-Chip Topology Synthesis

    The authors propose a new custom Network-on-Chip (NoC) topology synthesis methodology consisting of floorplanning, routers assignment, and routing paths calculation steps. The proposed heuristic methodology integrates fast algorithms based on the B-tree representation for floorplanning, on bipartite matching for the routers assignment step, and on multicommodity flow for congestion minimization...

    Provided By North Dakota State University

  • White Papers // Sep 2010

    A Fast Replica Placement Methodology for Large-Scale Distributed Computing Systems

    Fine-grained data replication over the Internet allows duplication of frequently accessed data object, as opposed to entire sites, to certain locations so as to improve the performance of large-scale content distribution systems. In a distributed system, agents representing their sites try to maximize their own benefit since they are driven...

    Provided By North Dakota State University

  • White Papers // Sep 2010

    A Competitive Replica Placement Methodology for Ad Hoc Networks

    In this paper, a mathematical model for data object replication in ad hoc networks is formulated. The derived model is general, flexible and adaptable to cater for various applications in ad hoc networks. The authors propose a game theoretical technique in which players (mobile hosts) continuously compete in a non-cooperative...

    Provided By North Dakota State University

  • White Papers // Sep 2010

    Interference-Aware Robust Wireless Mesh Network Design

    Interference has been proven to have an effect on the performance in Wireless Mesh Networks (WMN). Using multichannel can improve the performance of WMNs by reducing interference influence. This paper explores how to design a robust WMN for a set of mesh nodes, each with Q Networking Interface Cards (NICs)...

    Provided By North Dakota State University

  • White Papers // Jul 2010

    Memory-Aware Green Scheduling on Multi-Core Processors

    Contention on shared resources such as cache and main memory slows down the execution of the applications affecting not only application performance, but also induces inefficient use of energy. Therefore, in this paper, the authors deal with the contention problem and energy optimization on shared resources multi-core-based machines. Their main...

    Provided By North Dakota State University

  • White Papers // Apr 2010

    Time Synchronization in Wireless Sensor Networks: A Survey

    Time synchronization is a critical piece of infrastructure for any distributed system. Wireless sensor networks have emerged as an important and promising research area in the recent years. Time synchronization is important for many sensor network applications that require very precise mapping of gathered sensor data with the time of...

    Provided By North Dakota State University

  • White Papers // Mar 2010

    Migrating Autonomic Self-Testing to the Cloud

    The cloud computing model continues to gain much attention from software industry practitioners. As such, leading companies are investing in the development, packaging and delivery of cloud services over the Internet. However, although much work is being done to model and build cloud applications and services, there is significantly less...

    Provided By North Dakota State University

  • White Papers // Oct 2009

    Energy Efficient Resource Allocation in Distributed Computing Systems

    The problem of mapping tasks onto a computational grid with the aim to minimize the power consumption and the makespan subject to the constraints of deadlines and architectural requirements is considered in this paper. To solve this problem, the authors propose a solution from cooperative game theory based on the...

    Provided By North Dakota State University

  • White Papers // Sep 2009

    On the Joint Optimization of Performance and Power Consumption in Data Centers

    The authors model the process of a data center as a multi-objective problem of mapping independent tasks onto a set of data center machines that simultaneously minimizes the energy consumption and response time (makespan) subject to the constraints of deadlines and architectural requirements. A simple technique based on multi-objective goal...

    Provided By North Dakota State University

  • White Papers // Sep 2009

    A Multi-Objective Programming Approach for Resource Allocation in Data Centers

    The authors model the process of a data center as a multi-objective problem of mapping independent tasks onto a set of data center machines that simultaneously minimizes the energy consumption and response time (makespan) subject to the constraints of deadlines and architectural requirements. A simple technique based on multi-objective goal...

    Provided By North Dakota State University

  • White Papers // Jul 2009

    A Self-Adaptive Weighted Sum Technique for the Joint Optimization of Performance and Power Consumption in Data Centers

    With data centers, end-users can realize the pervasiveness of services that will be one day the cornerstone of the people lives. However, data centers are often classified as computing systems that consume the most amounts of power. To circumvent such a problem, the authors propose a self-adaptive weighted sum methodology...

    Provided By North Dakota State University

  • White Papers // Feb 2009

    Security Test Generation Using Threat Trees

    Software security issues have been a major concern to the cyberspace community, so a great deal of research on security testing has been performed, and various security testing techniques have been developed. Most of these techniques, however, have focused on testing software systems after their implementation is completed. To build...

    Provided By North Dakota State University

  • White Papers // Feb 2009

    Achieving Network on Chip Fault Tolerance by Adaptive Remapping

    In this paper, the authors investigate achieving fault tolerance by adaptive remapping in the context of Network-on-Chip (NoC). The problem of dynamic application remapping is formulated and an efficient algorithm is proposed to address single and multiple PE failures. The new algorithm can be used to dynamically react and recover...

    Provided By North Dakota State University

  • White Papers // Jan 2009

    The Financial Performance Of North Dakota Grain Marketing And Farm Supply Cooperatives

    The objective of this paper is to assess the financial performance of North Dakota farm supply and grain handling cooperatives between 2002 and 2006. Audited financial statements from 120 cooperatives were used. Various financial variables are tested as determinants of profitability. Financial ratio analysis is used to observe trends in...

    Provided By North Dakota State University

  • White Papers // Feb 2011

    Reciprocity, Conscientiousness, And Employee Layoff Decision In Firm-Employee Relationships

    Firm-Employee Relationships (FERs) have always been one of the most important stakeholder relationships for firms. Due to various reasons, firms have to lay off employees from time to time. Since layoff affects the laid-off employees, the survivors, and the performance of firms, it is an important decision in managing FERs....

    Provided By North Dakota State University

  • White Papers // Nov 2010

    Efficient Congestion-Oriented Custom Network-on-Chip Topology Synthesis

    The authors propose a new custom Network-on-Chip (NoC) topology synthesis methodology consisting of floorplanning, routers assignment, and routing paths calculation steps. The proposed heuristic methodology integrates fast algorithms based on the B-tree representation for floorplanning, on bipartite matching for the routers assignment step, and on multicommodity flow for congestion minimization...

    Provided By North Dakota State University

  • White Papers // Nov 2011

    Decentralized Self-Management of Trust for Mobile Ad Hoc Social Networks

    The construction of social networks over mobile devices in the events or at locations has emerged as a new network paradigm. These new mobile social networks enable people to communicate and share their experiences without the need to have Internet access and with minimum required infrastructure. However, the functionality and...

    Provided By North Dakota State University

  • White Papers // Jan 2012

    Data Scheduling in Data Grids and Data Centers: A Short Taxonomy of Problems and Intelligent Resolution Techniques

    Data-aware scheduling in today's large-scale heterogeneous environments has become a major research issue. Data Grids (DGs) and Data Centers arise quite naturally to support needs of scientific communities to share, access, process, and manage large data collections geographically distributed. Data scheduling, although similar in nature with grid scheduling, is given...

    Provided By North Dakota State University

  • White Papers // Oct 2011

    Energy-Efficient Resource Utilization in Cloud Computing

    In cloud computing systems, the energy consumption of the under-utilized resources accounts for a substantial amount of the actual energy use. Inherently, a resource allocation strategy that considers the resource utilization would increase the energy efficiency of the system. Task consolidation is an effective technique that increase the system resource...

    Provided By North Dakota State University

  • White Papers // Feb 2012

    MapReduce Across Distributed Clusters for Data-Intensive Applications

    Recently, the computational requirements for large-scale data-intensive analysis of scientific data have grown significantly. In High Energy Physics (HEP) for example, the Large Hadron Collider (LHC) produced 13 petabytes of data in 2010. This huge amount of data are processed on more than 140 computing centers distributed across 34 countries....

    Provided By North Dakota State University

  • White Papers // Feb 2011

    Efficient Data Sharing Over Large-Scale Distributed Communities

    Data sharing in large-scale Peer Data Management Systems (PDMS) is challenging due to the excessive number of data sites, their autonomous nature, and the heterogeneity of their schema. Existing PDMS query applications have difficulty to simultaneously achieve high recall rate and scalability. In this paper, the authors propose an ontology-based...

    Provided By North Dakota State University

  • White Papers // Mar 2011

    On Reconfiguring Embedded Application Placement on Smart Sensing and Actuating Environments

    In a smart home environment appliances and objects have sensing, actuating and wireless communication capabilities. Recent embedded middleware initiatives aim at providing an easy to use programming framework for developing applications that require the cooperation of sensing and actuating nodes. To achieve this, the mobile agent paradigm is adopted under...

    Provided By North Dakota State University

  • White Papers // Apr 2011

    Energy-Efficient Computing Using Agent-Based Multi-Objective Dynamic Optimization

    Nowadays distributed systems face a new challenge, almost nonexistent a decade ago: energy-efficient computing. Due to the rising environmental and economical concerns and with trends driving operational costs beyond the acquisition ones, green computing is of more actuality than never before. The aspects to deal with, e.g. dynamic systems, stochastic...

    Provided By North Dakota State University

  • White Papers // Jun 2011

    Community-Based Cloud for Emergency Management

    In this paper, the authors have proposed a cloud computing platform to maximally utilize all of the available information and human power from within and outside of a community to make information available to heterogeneous user groups. This enhances current information and communication systems to better manage natural and man-made...

    Provided By North Dakota State University

  • White Papers // Jul 2010

    Memory-Aware Green Scheduling on Multi-Core Processors

    Contention on shared resources such as cache and main memory slows down the execution of the applications affecting not only application performance, but also induces inefficient use of energy. Therefore, in this paper, the authors deal with the contention problem and energy optimization on shared resources multi-core-based machines. Their main...

    Provided By North Dakota State University

  • White Papers // Sep 2009

    A Multi-Objective Programming Approach for Resource Allocation in Data Centers

    The authors model the process of a data center as a multi-objective problem of mapping independent tasks onto a set of data center machines that simultaneously minimizes the energy consumption and response time (makespan) subject to the constraints of deadlines and architectural requirements. A simple technique based on multi-objective goal...

    Provided By North Dakota State University

  • White Papers // Jun 2011

    On a Game Theoretical Methodology for Data Replication in Ad Hoc Networks

    In this paper, a mathematical model for data object replication in ad hoc networks is formulated. The derived model is general, flexible and adaptable to cater for various applications in ad hoc networks. The authors propose a game theoretical technique in which players (mobile hosts) continuously compete in a non-cooperative...

    Provided By North Dakota State University

  • White Papers // Jun 2011

    A Frugal Auction Technique for Data Replication in Large Distributed Computing Systems

    Fine-grained data replication over the Internet allows duplication of frequently accessed data objects, as opposed to entire sites, to certain locations so as to improve the performance of large-scale content distribution systems. In a distributed system, agents representing their sites try to maximize their own benefit since they are driven...

    Provided By North Dakota State University

  • White Papers // Jun 2011

    A Game Theoretical Energy Efficient Resource Allocation Technique for Large Distributed Computing Systems

    The problem of mapping tasks onto a computational grid with the aim to minimize the power consumption and the makespan subject to the constraints of deadlines and architectural requirements is considered in this paper. To solve this problem, the authors propose a solution from cooperative game theory based on the...

    Provided By North Dakota State University

  • White Papers // Sep 2009

    On the Joint Optimization of Performance and Power Consumption in Data Centers

    The authors model the process of a data center as a multi-objective problem of mapping independent tasks onto a set of data center machines that simultaneously minimizes the energy consumption and response time (makespan) subject to the constraints of deadlines and architectural requirements. A simple technique based on multi-objective goal...

    Provided By North Dakota State University

  • White Papers // Oct 2009

    Energy Efficient Resource Allocation in Distributed Computing Systems

    The problem of mapping tasks onto a computational grid with the aim to minimize the power consumption and the makespan subject to the constraints of deadlines and architectural requirements is considered in this paper. To solve this problem, the authors propose a solution from cooperative game theory based on the...

    Provided By North Dakota State University

  • White Papers // Jul 2009

    A Self-Adaptive Weighted Sum Technique for the Joint Optimization of Performance and Power Consumption in Data Centers

    With data centers, end-users can realize the pervasiveness of services that will be one day the cornerstone of the people lives. However, data centers are often classified as computing systems that consume the most amounts of power. To circumvent such a problem, the authors propose a self-adaptive weighted sum methodology...

    Provided By North Dakota State University

  • White Papers // Apr 2010

    Time Synchronization in Wireless Sensor Networks: A Survey

    Time synchronization is a critical piece of infrastructure for any distributed system. Wireless sensor networks have emerged as an important and promising research area in the recent years. Time synchronization is important for many sensor network applications that require very precise mapping of gathered sensor data with the time of...

    Provided By North Dakota State University

  • White Papers // Mar 2010

    Migrating Autonomic Self-Testing to the Cloud

    The cloud computing model continues to gain much attention from software industry practitioners. As such, leading companies are investing in the development, packaging and delivery of cloud services over the Internet. However, although much work is being done to model and build cloud applications and services, there is significantly less...

    Provided By North Dakota State University

  • White Papers // Sep 2010

    Interference-Aware Robust Wireless Mesh Network Design

    Interference has been proven to have an effect on the performance in Wireless Mesh Networks (WMN). Using multichannel can improve the performance of WMNs by reducing interference influence. This paper explores how to design a robust WMN for a set of mesh nodes, each with Q Networking Interface Cards (NICs)...

    Provided By North Dakota State University

  • White Papers // Jan 2011

    A Weighted Sum Technique for the Joint Optimization of Performance and Power Consumption in Data Centers

    With data centers, end-users can realize the pervasiveness of services that will be one day the cornerstone of the lives. However, data centers are often classified as computing systems that consume the most amounts of power. To circumvent such a problem, the authors propose a self-adaptive weighted sum methodology that...

    Provided By North Dakota State University

  • White Papers // Sep 2010

    A Fast Replica Placement Methodology for Large-Scale Distributed Computing Systems

    Fine-grained data replication over the Internet allows duplication of frequently accessed data object, as opposed to entire sites, to certain locations so as to improve the performance of large-scale content distribution systems. In a distributed system, agents representing their sites try to maximize their own benefit since they are driven...

    Provided By North Dakota State University

  • White Papers // Sep 2010

    A Competitive Replica Placement Methodology for Ad Hoc Networks

    In this paper, a mathematical model for data object replication in ad hoc networks is formulated. The derived model is general, flexible and adaptable to cater for various applications in ad hoc networks. The authors propose a game theoretical technique in which players (mobile hosts) continuously compete in a non-cooperative...

    Provided By North Dakota State University

  • White Papers // Feb 2009

    Security Test Generation Using Threat Trees

    Software security issues have been a major concern to the cyberspace community, so a great deal of research on security testing has been performed, and various security testing techniques have been developed. Most of these techniques, however, have focused on testing software systems after their implementation is completed. To build...

    Provided By North Dakota State University

  • White Papers // Sep 2012

    Mitigating Eavesdropping Attack Using Secure Key Management Scheme in Wireless Mesh Networks

    Wireless Mesh Network (WMN) is a rapid deployed, self organized and multi-hop wireless networks. However, the wireless and distributed natures of WMN make it subject to various kinds of malicious attacks, which raise a great challenge in securing these networks. Most existing security mechanisms are based on cryptographic keys where...

    Provided By North Dakota State University

  • White Papers // Oct 2011

    Improving Fault Tolerance of Network-on-Chip Links via Minimal Redundancy and Reconfiguration

    The authors propose to partition links in a network-on-chip into multiple segments and use spare wires at the level of each segment to address permanent errors due to manufacturing or wearout defects. Because different segments of the spare wires address different errors from different segments, the proposed reconfigurable link structure...

    Provided By North Dakota State University

  • White Papers // Jan 2011

    A New Fault-tolerant and Congestion-aware Adaptive Routing Algorithm for Regular Networks-on-Chip

    In this paper, the authors propose a new fault-tolerant and congestion-aware adaptive routing algorithm for Network-on-Chips (NoCs). The proposed algorithm is based on the ball-and-string model and employs a distributed approach based on partitioning of the regular NoC architecture into regions controlled by local monitoring units. Each local monitoring unit...

    Provided By North Dakota State University

  • White Papers // Feb 2009

    Achieving Network on Chip Fault Tolerance by Adaptive Remapping

    In this paper, the authors investigate achieving fault tolerance by adaptive remapping in the context of Network-on-Chip (NoC). The problem of dynamic application remapping is formulated and an efficient algorithm is proposed to address single and multiple PE failures. The new algorithm can be used to dynamically react and recover...

    Provided By North Dakota State University

  • White Papers // Jul 2012

    Efficient High-speed Current-mode Links for Network-on-Chip Performance Optimization

    The authors propose a novel cost-effective long-range NoC interconnect design based on current-mode signaling. The proposed CMOS based long-range link reduces the communication delay of long wires significantly without using traditional pipelined repeaters, making it a cost efficient alternative to wireless and optical interconnects. Spice simulations are performed to verify...

    Provided By North Dakota State University

  • White Papers // Jul 2012

    A New Reliability Evaluation Methodology and its Application to Network-on-Chip Routers

    In this paper, the authors propose a new circuit level reliability evaluation methodology. The proposed methodology is based on a divide and conquer approach, which enjoys the benefits of device level accuracy and of block level efficiency. At the core of the reliability estimation engine lies a Monte Carlo algorithm...

    Provided By North Dakota State University

  • White Papers // Dec 2012

    A Review of Data Intensive Computing

    Data intensive computing is a common research problem in science, industry and computer academia. In recent twenty years, the explosive growth of science data has appeared all over the world. Typical data intensive computing applications include Internet text data processing, scientific research data processing, large scale graph computing, inverse and...

    Provided By North Dakota State University

  • White Papers // Jul 2012

    Server Replication in Multicast Networks

    In this paper, the authors study and propose heuristic algorithms to solve the problem of Replicated Server Placement (RSP) with Quality of Service (QoS) constraints. Although there has been much work on RSP in multicast networks, in most of them a simplified replication model is used; therefore, their proposed solutions...

    Provided By North Dakota State University

  • White Papers // Jul 2011

    Genetic Algorithms for Energy-Aware Scheduling in Computational Grids

    Because of its sheer size, Computational Grids (CGs) require advanced methodologies and strategies to efficiently schedule user's tasks and applications to resources. Scheduling becomes even more challenging when energy efficiency, classical makespan criterion and user perceived Quality of Service (QoS) are treated as first-class objectives in CG resource allocation methodologies....

    Provided By North Dakota State University

  • White Papers // Jul 2013

    A Study of Incremental Cryptography for Security Schemes in Mobile Cloud Computing Environments

    While using the cloud storage services on resource constraint mobile device, the mobile user needs to ensure the confidentiality of the critical data before uploading on the cloud storage. The resource limitation of mobile devices restricts mobile users for executing complex security operations using computational power of mobile devices. To...

    Provided By North Dakota State University

  • White Papers // Jul 2013

    Application-aware Workload Consolidation to Minimize both Energy Consumption and Network Load in Cloud Environments

    In this paper, the authors tackle the problem of Virtual Machine (VM) placement onto physical servers to jointly optimize two objective functions. The first objective is to minimize the total energy spent within a cloud due to the servers that are commissioned to satisfy the computational demands of VMs. The...

    Provided By North Dakota State University

  • White Papers // Oct 2013

    Green Data Center Networks: Challenges and Opportunities

    The concerns about environmental impacts, electricity cost, and energy needs of data centers are mounting. These concerns have given significant impetus to consider energy efficiency as one of the major data center design parameters for researchers and IT executives. Tremendous growth in the size and computing demands of data centers...

    Provided By North Dakota State University

  • White Papers // Nov 2012

    Scalable, Low Complexity, and Fast Greedy Scheduling Heuristics for Highly Heterogeneous Distributed Computing Systems

    For heterogeneous distributed computing systems, important design issues are scalability and system optimization. Given such systems, it is crucial to develop low computational complexity algorithms to schedule tasks in a manner that exploits the heterogeneity of the resources and applications. In this paper, the authors report three scalable, and fast...

    Provided By North Dakota State University

  • White Papers // Jul 2013

    Investigating Techniques for Automating the Selection of Cloud Infrastructure Services

    The cloud infrastructure services landscape advances steadily leaving users in the agony of choice. As a result, Cloud service identification and discovery remains a hard problem due to different service descriptions, non-standardized naming conventions and heterogeneous types and features of cloud services. In this paper, analysis the research challenges and...

    Provided By North Dakota State University