- Subscribe to this page:
- RSS
- Email Alert
network management
(2340 results)Search the Library
Mission Statement
TechRepublic's ITPapers is the Web's largest library of free technical IT white papers, webcasts, and case studies. Covering IT categories including Data Management, IT Management, Networking, Communications, Enterprise Applications, Storage, Security and much more, TechRepublic's White Paper Directory is the best source for technical white papers and IT information.
-
White Papers
Scalable Network Virtualization Using FPGAs
Feb 2010
Recent virtual network implementations have shown the capability to implement multiple network data planes using a shared hardware substrate. In this project, a new scalable virtual networking...
Provided by Association for Computing Machinery
-
White Papers
Fault Tolerant Scalable Support for Network Portability and Traffic Engineering
Sep 2008
The P-SHIM6 architecture provides ISP independence to IPv6 sites without compromising scalability. This architecture is based on a middle-box, the P-SHIM6, which manages the SHIM6 protocol...
Provided by Universidad Carlos III Madrid
-
White Papers
Scalable Network Distance Browsing in Spatial Databases
Jun 2008
An algorithm is presented for finding the k nearest neighbors in a spatial network in a best-first manner using network distance. The algorithm is based on precomputing the shortest paths between...
Provided by Association for Computing Machinery
-
White Papers
Scalable Hybrid Wireless Network-on-Chip Architectures for Multi-Core Systems
Aug 2010
Multi-core platforms are emerging trends in the design of Systems-on-Chip (SoCs). Interconnect fabrics for these multi-core SoCs play a crucial role in achieving the target performance. The...
Provided by Institute of Electrical and Electronics Engineers
-
White Papers
Combining Events and Threads for Scalable Network Services: Implementation and Evaluation of Monadic, Application-Level Concurrency Primitives
Oct 2008
This paper proposes to combine two seemingly opposed programming models for building massively concurrent network services: the event-driven model and the multithreaded model. The result is a...
Provided by University of Pennsylvania
-
White Papers
A Scalable, Robust Network for Parallel Computing
Jan 2010
CX, a network-based computational exchange, is presented. The system's design integrates variations of ideas from other researchers, such as work stealing, non-blocking tasks, eager scheduling,...
Provided by Association for Computing Machinery
-
White Papers
An Architecture for Scalable Network Defense
Aug 2009
This paper describes a novel architecture for network defense designed for scaling to very high data rates (100 Gb/s) and very large user populations. Scaling requires both efficient attack...
Provided by Honeywell
-
White Papers
Scalability of Network Simulators Revisited
Jan 2010
As interest in the networking community turns to increasingly complicated networks run over increasingly long simulation times, performance differences in network simulators increasingly matter....
Provided by Dartmouth College
-
White Papers
ETTM: A Scalable Network Operating System
May 2010
In this paper, authors design, implement, and evaluate a new scalable and fault tolerant network operating system, called ETTM, for securely and efficiently managing network resources at a packet...
Provided by University of Washington
-
White Papers
Scalable Network-Layer Defense Against Internet Bandwidth-Flooding Attacks
Aug 2009
In a bandwidth-flooding attack, compromised sources send high-volume traffic to the target with the purpose of causing congestion in its tail circuit and disrupting its legitimate communications....
Provided by Institute of Electrical and Electronics Engineers
-
White Papers
Load Balancing and Fault-Tolerance for Scalable Network File Systems Using by Web Services
Jul 2009
Due to the rapid growth of World Wide Web and the popularization of personal computer, the number of World Wide Web users is increasing in an incredible speed. It makes the need of disk space for...
Provided by Chang Gung University
-
White Papers
A Hypercube-Based Scalable Interconnection Network for Massively Parallel Computing
Oct 2008
An important issues in the design of interconnection networks for massively parallel computers is scalability. A new scalable interconnection network topology, called Double-Loop Hypercube (DLH),...
Provided by Xidian University
-
White Papers
Myth: An Accurate and Scalable Network Coordinate System Under High Node Churn Rate
Dec 2007
Network Coordinate (NC) system is an efficient mechanism to predict Internet distance (latency) with limited times of measurement. In this paper, authors focus on the node churn problem in...
Provided by Institute of Electrical and Electronics Engineers
-
White Papers
Analysis and Comparison of Torus Embedded Hypercube Scalable Interconnection Network for Parallel Architecture
Jan 2009
This paper analyzes an embedded architecture of torus network with the hypercube pertinent to parallel architecture. The product generated from torus and hypercube networks show how good...
Provided by Seoul National University
-
White Papers
Introducing Innovations at 28 nm to Move Beyond Moore's Law
Jul 2010
In addition to processing techniques, FPGA innovations allow Altera to move beyond Moore's Law to meet higher bandwidth requirements while meeting cost and power budgets. Altera's Stratix V FPGAs...
Provided by Altera
-
White Papers
Fair Energy-Efficient Network Design for Multihop Communications
May 2010
The authors consider the energy-efficient network resource allocation that minimizes a cost function of average user powers for multi-hop wireless networks. A class of fair cost functions is...
Provided by Institute of Electrical and Electronics Engineers
-
White Papers
Activity and Register Placement Aware Gated Clock Network Design
Apr 2008
Clock gating is one of the most effective techniques to reduce clock network power dissipation. Although it has already been studied considerably, most of the previous works are restricted to...
Provided by Association for Computing Machinery
-
White Papers
Dynamic Queuing Sharing Mechanism for Per-Flow Quality of Service Control
Oct 2009
To achieve satisfying user experiences of diverse applications, Quality of Service (QoS) guaranteed mechanisms such as per-flow queuing are required in routers. However, deployment of per-flow...
Provided by Institution of Engineering and Technology
-
White Papers
Quality-of-Service Specific Information Retrieval for Densely Deployed Sensor Networks
Jan 2010
A new MAC protocol is proposed for the reachback operation in large scale, densely deployed sensor networks. Referred to as Quality-of-service specific Information REtrieval (QUIRE), the proposed...
Provided by Cornell University
-
Whitepapers
Involutional Block Cipher for Limited Resources
Oct 2008
The authors propose a scalable block cipher which is an involutional SPN. They use one S-box which is an involution and a bit permutation which also is an involution. As a result they received a...
Provided by Institute of Electrical & Electronic Engineers
-
Whitepapers
Adaptive Distributed Network-Channel Coding for Cooperative Multiple Access Channel
Apr 2011
In this paper, the authors propose an adaptive distributed network-channel coding for a cooperative multiple access channel where M users cooperatively communicate with a common base station. The...
Provided by Institute of Electrical & Electronic Engineers
-
Whitepapers
Business Continuity With the Cisco Unified Computing System and EMC Symmetrix VMAX
May 2010
EMC and Cisco recently completed a joint project to demonstrate the High Availability (HA), scaling and Disaster Recovery (DR) capabilities of a combined compute and storage architecture. The...
Provided by Cisco
-
White Papers
Hardness of Robust Network Design
Jan 2010
The authors settle the complexity status of the robust network design problem in undirected graphs. The fact that the flow-cut gap in general graphs can be large, poses some difficulty in...
Provided by Bell Labs
-
White Papers
Degree Bounded Network Design With Metric Costs
Aug 2008
Given a complete undirected graph, a cost function on edges and a degree bound B, the degree bounded network design problem is to find a minimum cost simple subgraph with maximum degree B...
Provided by Chinese University of Hong Kong
-
White Papers
Robust Dynamic Continuous Network Design Problem
Jan 2008
A robust optimization model is presented for the dynamic traffic assignment - based continuous network design problem, which accounts for a bi-level objective and long-term origin - destination...
Provided by University of Texas at Austin (McCombs)
-
White Papers
On Generalizations of Network Design Problems With Degree Bounds
Jun 2010
Iterative rounding and relaxation have arguably become the method of choice in dealing with unconstrained and constrained network design problems. This paper extends the scope of the iterative...
Provided by University of Waterloo
-
White Papers
Algorithms for a Network Design Problem With Crossing Supermodular Demands
Jan 2010
This paper presents algorithms for a class of directed network design problems. The network design problem is to find a minimum cost sub graph such that for each vertex set S there are at least...
Provided by Ohio University
-
White Papers
Statistics for a Random Network Design Problem
Sep 2009
This paper investigate a random network design problem specified by a complete graph with n nodes whose edges have associated fixed costs that are independent random variables, and variable costs...
Provided by Dowling College
-
White Papers
Place Prioritization for Biodiversity Reserve Network Design: A Comparison of the SITES and ResNet Software Packages for Coverage and Efficiency
Jul 2007
A new class of network design problems was introduced by Fingerhut et al. and independently by Duffield et al. to address, among other things, the issue of uncertainty in the demand matrix. The...
Provided by University of Illinois
-
White Papers
Routing and Network Design With Robustness to Changing or Uncertain Traffic Demands
Jul 2007
A new class of network design problems was introduced by Fingerhut et al. and independently by Duffield et al, to address, among other things, the issue of uncertainty in the demand matrix. The...
Provided by University of Illinois at Urbana-Champaign
-
White Papers
Maximizing the Spread of Cascades Using Network Design
Jun 2010
This paper introduces a new optimization framework to maximize the expected spread of cascades in networks. The model allows a rich set of actions that directly manipulate cascade dynamics by...
Provided by Cornell University
-
White Papers
Effect of Variable Bus Speeds on Bus Network Design
Jul 2010
This paper provides a methodology for solving the bus network design problem, covering network design and frequency setting and taking into consideration that commercial speeds of buses vary...
Provided by University of South Florida
-
White Papers
Price of Stability in Survivable Network Design
Jul 2009
This paper studies the survivable version of the game theoretic network formation model known as the Connection Game, originally introduced in. In this model, players attempt to connect to a...
Provided by Rensselaer Polytechnic Institute
-
White Papers
Shared Protection Network Design: Valid Inequalities and a Decomposition Approach
Jan 2010
Shared Protection is a technique that can reduce the cost of backup resources in survivable networks, if it is suitably considered at the design level. This paper presents a model and two families...
Provided by Politecnico di Milano
-
White Papers
On the Approximability of Some Network Design Problems
Jan 2010
Approximation algorithms have had much success in the area of network design, with both combinatorial and linear-programming based techniques leading to many constant factor approximation...
Provided by Carnegie Mellon University
-
White Papers
A Holistic Sensor Network Design for Energy Conservation and Efficient Data Dissemination
Nov 2009
Link and node failures are two common fundamental problems that affect operational networks. Hence, protection of communication networks against such failures is essential for maintaining network...
Provided by New Jersey Institute of Technology
-
White Papers
Network Design and Protection Using Network Coding
Nov 2009
Link and node failures are two common fundamental problems that affect operational networks. Hence, protection of communication networks against such failures is essential for maintaining network...
Provided by New Jersey Institute of Technology
-
White Papers
New Method for Sensor Network Design and Upgrade for Optimal Process Monitoring
Nov 2007
Previous methods on nonlinear sensor network design minimize cost subject to a variety of constraints linked to the network performance: precision, residual precision, error detectability and...
Provided by Reed Elsevier
-
White Papers
Two-Edge Disjoint Survivable Network Design Problem With Relays
Mar 2010
This paper explores the network design problem with relays considering network survivability. This problem arises in telecommunications and logistic systems. The design problem involves selecting...
Provided by Springer Science+Business Media
-
White Papers
Software Accuracy-Based Sensor Network Design and Upgrade in Process Plants
Mar 2010
This paper present a new method for linear and nonlinear sensor network design with applications to variable estimation based on the use of accuracy and residual accuracy. Accuracy has been shown...
Provided by University of Oklahoma
-
Whitepapers
A Finite-Length Algorithm for LDPC Codes Without Repeated Edges on the Binary Erasure Channel
Aug 2008
A Low-Density Parity-Check (LDPC) code is a block code defined by a sparse parity-check matrix, H. LDPC codes are typically decoded iteratively with message-passing decoding. The Tanner graph, T,...
Provided by Institute of Electrical & Electronic Engineers
-
Whitepapers
Maximum Likelihood Estimation of State Space Models From Frequency Domain Data
Apr 2008
This paper addresses the problem of estimating linear time invariant models from observed frequency domain data. Here an emphasis is placed on deriving numerically robust and efficient methods...
Provided by University of New York in Prague
-
Whitepapers
Burst Erasure Correcting LDPC Codes
Apr 2008
In this paper Low-Density Parity-Check (LDPC) codes are designed for burst erasure channels. Firstly, lower bounds for the maximum length erasure burst that can always be corrected with...
Provided by University of New York in Prague
-
Whitepapers
Nonlinear Model Predictive Control of an Inverted Pendulum
Mar 2009
Non-linear Model Predictive Control (NMPC) is an attractive strategy for controlling complex systems. It has been used for decades within process control industries, because it offers good dynamic...
Provided by University of New York in Prague
-
Whitepapers
On Robust Stability of the Belief Propagation Algorithm for LDPC Decoding
May 2010
The exact nonlinear loop gain of the Belief Propagation Algorithm (BPA) in its Log-Likelihood Ratio (LLR) formulation is computed. The nonlinear gains for regular Low-Density Parity-Check (LDPC)...
Provided by University of Medicine and Pharmacy
-
Whitepapers
Irregular Repeat-Accumulate-Like Codes with Improved Error Floor Performance
Jul 2010
In this paper, the authors present a new class of iteratively decoded error correction codes. These codes, which are a modification of Irregular Repeat-Accumulate (IRA) codes, are termed...
Provided by Institute of Electrical & Electronic Engineers
-
Whitepapers
Joint Channel-Network Coding Strategies for Networks With Low Complexity Relays
Oct 2011
The authors investigate joint network and channel coding schemes for networks when relay nodes are not capable of performing channel coding operations. Rather, channel encoding is performed at the...
Provided by University of New York in Prague
-
Whitepapers
Fast Linear Model Predictive Control Via Custom Integrated Circuit Architecture
Jan 2012
Model Predictive Control (MPC) has emerged as a highly attractive control strategy due to its ability to explicitly accommodate all of the multivariable (multiple-input, multiple-output) and...
Provided by Institute of Electrical & Electronic Engineers
-
Whitepapers
Anatomy of a Large European IXP
Aug 2012
The largest IXPs carry on a daily basis traffic volumes in the petabyte range, similar to what some of the largest global ISPs reportedly handle. This little-known fact is due to a few hundreds of...
Provided by Association for Computing Machinery
-
Whitepapers
Quantifying the Impact of Efficient Cross-Layer Jamming Attacks Via Network Traffic Flows
Jan 2012
The authors investigate a class of coordinated jamming attacks in which multiple jammers collaboratively apply knowledge about the network layer functionality to efficiently reduce the throughput...
Provided by University of Warwick Library
-
Whitepapers
Efficient Computation and Optimization of the Free Distance of Variable-Length Finite-State Joint Source-Channel Codes
Aug 2010
This paper considers the optimization of a class of joint source-channel codes described by Finite-State Encoders (FSEs) generating variable-length codes. It focuses on FSEs associated to...
Provided by Institute of Electrical & Electronic Engineers
-
Whitepapers
Low-Complexity List-Based Frame Synchronization for LDPC Coded Transmission
Feb 2009
In this paper, the authors propose a simple and efficient two-stage list synchronizer for frame synchronization of Low-Density Parity-Check (LDPC) coded data transmitted over the Additive White...
Provided by University of Nottingham
-
Whitepapers
Raptor Packets: A Packet-Centric Approach to Distributed Raptor Code Design
May 2009
In this paper, the authors address the problem of distributed Raptor code design over information packets located across the network nodes. They propose a novel approach to this problem that...
Provided by University of Nottingham
-
Whitepapers
Blind Time-Period Synchronization for LDPC Convolutionally Coded Transmission
May 2009
In this paper, the authors propose a scheme for blind time-period synchronization of Low-Density Parity-Check Convolutional Codes (LDPC CC) over the AWGN channel. Reliable time-period...
Provided by University of Nottingham
-
Whitepapers
Precoded EWF Codes for Unequal Error Protection of Scalable Video
Jul 2009
Rateless codes are Forward Error Correcting (FEC) codes of linear encoding-decoding complexity and asymptotically capacity-approaching performance over erasure channels with any erasure...
Provided by University of Brighton
-
Whitepapers
On Distributed LDGM and LDPC Code Design for Networked Systems
Aug 2009
Recent advances in modern coding theory resulted in a number of different ensembles of error-correcting codes with capacity-approaching performance and linear encoding/decoding complexity. Codes...
Provided by University of Nottingham
-
Whitepapers
Generalized ACE Constrained Progressive Edge-Growth LDPC Code Design
May 2009
This paper addresses the problem of irregular LDPC code design with good minimum pseudo-distance properties. In particular, for Binary Erasure Channels (BEC), the problem is to design irregular...
Provided by Institute of Electrical & Electronic Engineers
-
Whitepapers
Evaluation and Design of Irregular LDPC Codes Using ACE Spectrum
Dec 2008
The construction of finite-length irregular LDPC codes with low error floors is currently an attractive research problem. In particular, for the Binary Erasure Channel (BEC), the problem is to...
Provided by Institute of Electrical & Electronic Engineers
-
Whitepapers
Expanding Window Fountain Codes for Unequal Error Protection
Jul 2008
A novel approach to provide Unequal Error Protection (UEP) using rateless codes over erasure channels, named Expanding Window Fountain (EWF) codes, is developed and discussed. EWF codes use a...
Provided by University of Brighton
-
Whitepapers
A Novel Incrementally-Deployable Multi-Granularity Multihoming Framework for the Future Internet
Dec 2012
Multihoming practice in the current Internet is limited to hosts and Autonomous Systems (ASs). It is "Connectivity-oriented" without support for user or data multihoming. However, the swift...
Provided by Washington Trust Bank
-
Whitepapers
SAR Imagery Classification in Extended Feature Space by Collective Network of Binary Classifiers
Sep 2011
Polari metric SAR image classification has been an active research field where several features and classifiers have been proposed in the past. Using numerous features can be a desirable option so...
Provided by EURASIP
-
Whitepapers
Pairwise Check Decoding for LDPC Coded Two-Way Relay Block Fading Channels
Aug 2012
Partial decoding has the potential to achieve a larger capacity region than full decoding in Two-Way Relay (TWR) channels. Existing partial decoding realizations are however designed for Gaussian...
Provided by Institute of Electrical & Electronic Engineers
-
Whitepapers
Automatic Application Signature Construction From Unknown Traffic
Jul 2010
Identifying applications and classifying network traffic flows according to their source applications are critical for a broad range of network activities. Such classifications can be based on...
Provided by Institute of Electrical & Electronic Engineers
-
Whitepapers
An Automatic Application Signature Construction System for Unknown Traffic
Jun 2010
Identifying applications and classifying network traffic flows according to their source applications are critical for a broad range of network activities. Such a decision can be based on packet...
Provided by John Wiley & Sons
-
Whitepapers
A Microscopic Competition Model and Its Dynamics Analysis on Network Attacks
Sep 2009
Modeling network traffic has been a critical task in the development of Internet. Attacks and defense are prevalent in the current Internet. Traditional network models such as Poisson-related...
Provided by John Wiley & Sons
-
Whitepapers
Lattices Are Everywhere
Feb 2009
As bees and crystals (and people selling oranges in the market) know it for many years, lattices provide efficient structures for packing, covering, quantization and channel coding. In the recent...
Provided by Tekyz Inc.
-
Whitepapers
MBMS With User Cooperation and Network Coding
Jul 2011
In this paper user cooperation with network coding is applied to MBMS (Multimedia Broadcast/Multicast Service) where Raptor codes are currently used. User cooperation together with network coding...
Provided by Aarhus University
-
Whitepapers
Pasture: Secure Offline Data Access Using Commodity Trusted Hardware
Sep 2012
This paper presents Pasture, a secure messaging and logging library that enables rich mobile experiences by providing secure offline data access. Without trusting users, applications, operating...
Provided by Microsoft Research
-
Whitepapers
Compressing Intermediate Keys Between Mappers and Reducers in SciHadoop
Nov 2011
In Hadoop mappers send data to reducers in the form of key/value pairs. The default design of Hadoop's process for transmitting this intermediate data can cause a very high overhead, especially...
Provided by University of Calgary
-
Whitepapers
The Topology of P2P Network
Aug 2012
The P2P network is a logical overlay network built up by the application software on the basis of IP network. The topology of P2P network refers to the physical or logical interconnection between...
Provided by Journal of Computing
-
Whitepapers
Evaluating Quality of Experience for Streaming Video in Real Time
Mar 2010
The authors present a scalable, lightweight, no-reference framework to infer video QoE. Their framework revolves around a onetime offline construction of a k-dimensional space, which they call the...
Provided by University of Central England in Birmingham
-
Whitepapers
On the Maximum Number of Linearly Independent Cycles and Paths in a Network
Aug 2012
The term network tomography, coined by Vardi, refers to the inference of certain internal characteristics of networks based on end-to-end measurements. The authors consider the problem of...
Provided by University of Applied Sciences Rapperswil
-
Whitepapers
Selective Relative Best Scheduling for Best-Effort Downlink Packet Data
Feb 2009
A scheduling scheme to compromise between Pure Opportunistic (PO) and Relative Best (RB) is proposed for downlink packet-based data transmission. For this, an instantaneous channel gain is...
Provided by Institute of Electrical & Electronic Engineers
-
Whitepapers
Spectral Characteristics of M-Ary Code Shift Keying Based Impulse Radios: Effects of Code Design
Feb 2009
This paper analyzes the Power Spectral Density (PSD) characteristics of Ultra WideBand (UWB) signals modulated by M-ary Code Shift Keying (MCSK) that can be combined with Binary Pulse Position...
Provided by Institute of Electrical & Electronic Engineers
-
Whitepapers
Symbol Rate Upper-Bound on Distributed STBC With Channel Phase Information
Mar 2011
Recently, single-symbol Maximum-Likelihood (ML) decodable Distributed Space-Time Block Coding (DSTBC) has been developed for use in cooperative diversity networks. However, the symbol rate of the...
Provided by Institute of Electrical & Electronic Engineers
-
Whitepapers
Energy Efficient MAC Protocol for Low-Energy Critical Infrastructure Monitoring Networks Using Wakeup Radio
Feb 2012
Critical infrastructure monitoring applications are rapidly increasing. Application requirements include reliable data transfer, energy efficiency, and long deployment lifetime. In this paper, the...
Provided by Hindawi Publishing
-
Whitepapers
Routing with Congestion Control in Computer Network Using Neural Networks
Nov 2012
The neural networks are widely used to solve the routing problem and to manage the congestion in the computer networks. In this paper, two methods are proposed to solve this problem. In the first...
Provided by International Journal of Computer Applications
-
Webcasts
C 2012: Why Architecture Matters
Sep 2012
In this webcast, the presenters will explains about why architecture matters. The presenter also explains about how to build the working software and secret for the high scalability for good data...
Provided by Oleksiy Kovyrin
-
Whitepapers
A Review on Empirical Data Collection and Analysis of Bertoni's Model at 1.8 GHz
Oct 2012
In any kind of network planning it is the central task to estimate and thus analyze propagation characteristics of a radio system through a medium in order to state accuracy in signal parameters...
Provided by International Journal of Computer Applications
-
Whitepapers
Multipath Global Rerouting for Fault Tolerant Overlay Network (FTON) in Labeled Optical Burst-Switching
Nov 2012
In this paper, mainly concentrate on reduce the burst loss and Non-availability of wavelength in network; proposed an overlay model known as Fault Tolerant Overlay Network (FTON) which improves...
Provided by International Journal of Computer Applications
-
White Papers
Myth: An Accurate and Scalable Network Coordinate System Under High Node Churn Rate
Dec 2007
Network Coordinate (NC) system is an efficient mechanism to predict Internet distance (latency) with limited times of measurement. In this paper, authors focus on the node churn problem in...
Provided by Institute of Electrical and Electronics Engineers
-
White Papers
Analysis and Comparison of Torus Embedded Hypercube Scalable Interconnection Network for Parallel Architecture
Jan 2009
This paper analyzes an embedded architecture of torus network with the hypercube pertinent to parallel architecture. The product generated from torus and hypercube networks show how good...
Provided by Seoul National University
-
White Papers
Introducing Innovations at 28 nm to Move Beyond Moore's Law
Jul 2010
In addition to processing techniques, FPGA innovations allow Altera to move beyond Moore's Law to meet higher bandwidth requirements while meeting cost and power budgets. Altera's Stratix V FPGAs...
Provided by Altera
-
White Papers
Fair Energy-Efficient Network Design for Multihop Communications
May 2010
The authors consider the energy-efficient network resource allocation that minimizes a cost function of average user powers for multi-hop wireless networks. A class of fair cost functions is...
Provided by Institute of Electrical and Electronics Engineers
-
White Papers
Activity and Register Placement Aware Gated Clock Network Design
Apr 2008
Clock gating is one of the most effective techniques to reduce clock network power dissipation. Although it has already been studied considerably, most of the previous works are restricted to...
Provided by Association for Computing Machinery
-
White Papers
Dynamic Queuing Sharing Mechanism for Per-Flow Quality of Service Control
Oct 2009
To achieve satisfying user experiences of diverse applications, Quality of Service (QoS) guaranteed mechanisms such as per-flow queuing are required in routers. However, deployment of per-flow...
Provided by Institution of Engineering and Technology
-
White Papers
Quality-of-Service Specific Information Retrieval for Densely Deployed Sensor Networks
Jan 2010
A new MAC protocol is proposed for the reachback operation in large scale, densely deployed sensor networks. Referred to as Quality-of-service specific Information REtrieval (QUIRE), the proposed...
Provided by Cornell University
-
Whitepapers
Involutional Block Cipher for Limited Resources
Oct 2008
The authors propose a scalable block cipher which is an involutional SPN. They use one S-box which is an involution and a bit permutation which also is an involution. As a result they received a...
Provided by Institute of Electrical & Electronic Engineers
-
Whitepapers
Adaptive Distributed Network-Channel Coding for Cooperative Multiple Access Channel
Apr 2011
In this paper, the authors propose an adaptive distributed network-channel coding for a cooperative multiple access channel where M users cooperatively communicate with a common base station. The...
Provided by Institute of Electrical & Electronic Engineers
-
Whitepapers
Business Continuity With the Cisco Unified Computing System and EMC Symmetrix VMAX
May 2010
EMC and Cisco recently completed a joint project to demonstrate the High Availability (HA), scaling and Disaster Recovery (DR) capabilities of a combined compute and storage architecture. The...
Provided by Cisco
-
White Papers
Hardness of Robust Network Design
Jan 2010
The authors settle the complexity status of the robust network design problem in undirected graphs. The fact that the flow-cut gap in general graphs can be large, poses some difficulty in...
Provided by Bell Labs
-
White Papers
Degree Bounded Network Design With Metric Costs
Aug 2008
Given a complete undirected graph, a cost function on edges and a degree bound B, the degree bounded network design problem is to find a minimum cost simple subgraph with maximum degree B...
Provided by Chinese University of Hong Kong
-
White Papers
Robust Dynamic Continuous Network Design Problem
Jan 2008
A robust optimization model is presented for the dynamic traffic assignment - based continuous network design problem, which accounts for a bi-level objective and long-term origin - destination...
Provided by University of Texas at Austin (McCombs)
-
White Papers
On Generalizations of Network Design Problems With Degree Bounds
Jun 2010
Iterative rounding and relaxation have arguably become the method of choice in dealing with unconstrained and constrained network design problems. This paper extends the scope of the iterative...
Provided by University of Waterloo
-
White Papers
Algorithms for a Network Design Problem With Crossing Supermodular Demands
Jan 2010
This paper presents algorithms for a class of directed network design problems. The network design problem is to find a minimum cost sub graph such that for each vertex set S there are at least...
Provided by Ohio University
-
White Papers
Statistics for a Random Network Design Problem
Sep 2009
This paper investigate a random network design problem specified by a complete graph with n nodes whose edges have associated fixed costs that are independent random variables, and variable costs...
Provided by Dowling College
-
White Papers
Place Prioritization for Biodiversity Reserve Network Design: A Comparison of the SITES and ResNet Software Packages for Coverage and Efficiency
Jul 2007
A new class of network design problems was introduced by Fingerhut et al. and independently by Duffield et al. to address, among other things, the issue of uncertainty in the demand matrix. The...
Provided by University of Illinois
-
White Papers
Routing and Network Design With Robustness to Changing or Uncertain Traffic Demands
Jul 2007
A new class of network design problems was introduced by Fingerhut et al. and independently by Duffield et al, to address, among other things, the issue of uncertainty in the demand matrix. The...
Provided by University of Illinois at Urbana-Champaign
-
White Papers
Maximizing the Spread of Cascades Using Network Design
Jun 2010
This paper introduces a new optimization framework to maximize the expected spread of cascades in networks. The model allows a rich set of actions that directly manipulate cascade dynamics by...
Provided by Cornell University
-
White Papers
Effect of Variable Bus Speeds on Bus Network Design
Jul 2010
This paper provides a methodology for solving the bus network design problem, covering network design and frequency setting and taking into consideration that commercial speeds of buses vary...
Provided by University of South Florida
-
White Papers
Price of Stability in Survivable Network Design
Jul 2009
This paper studies the survivable version of the game theoretic network formation model known as the Connection Game, originally introduced in. In this model, players attempt to connect to a...
Provided by Rensselaer Polytechnic Institute
-
White Papers
Shared Protection Network Design: Valid Inequalities and a Decomposition Approach
Jan 2010
Shared Protection is a technique that can reduce the cost of backup resources in survivable networks, if it is suitably considered at the design level. This paper presents a model and two families...
Provided by Politecnico di Milano
-
White Papers
On the Approximability of Some Network Design Problems
Jan 2010
Approximation algorithms have had much success in the area of network design, with both combinatorial and linear-programming based techniques leading to many constant factor approximation...
Provided by Carnegie Mellon University
-
White Papers
A Holistic Sensor Network Design for Energy Conservation and Efficient Data Dissemination
Nov 2009
Link and node failures are two common fundamental problems that affect operational networks. Hence, protection of communication networks against such failures is essential for maintaining network...
Provided by New Jersey Institute of Technology
-
White Papers
Network Design and Protection Using Network Coding
Nov 2009
Link and node failures are two common fundamental problems that affect operational networks. Hence, protection of communication networks against such failures is essential for maintaining network...
Provided by New Jersey Institute of Technology
-
White Papers
New Method for Sensor Network Design and Upgrade for Optimal Process Monitoring
Nov 2007
Previous methods on nonlinear sensor network design minimize cost subject to a variety of constraints linked to the network performance: precision, residual precision, error detectability and...
Provided by Reed Elsevier
-
White Papers
Two-Edge Disjoint Survivable Network Design Problem With Relays
Mar 2010
This paper explores the network design problem with relays considering network survivability. This problem arises in telecommunications and logistic systems. The design problem involves selecting...
Provided by Springer Science+Business Media
-
White Papers
Software Accuracy-Based Sensor Network Design and Upgrade in Process Plants
Mar 2010
This paper present a new method for linear and nonlinear sensor network design with applications to variable estimation based on the use of accuracy and residual accuracy. Accuracy has been shown...
Provided by University of Oklahoma
-
White Papers
Parallel Computing Approaches to Sensor Network Design Using the Value Paradigm
Dec 2009
One previous paradigm was based on sensor positioning selection to allow key variable observability. Later, the problem was posed as a minimum cost problem subject to sensor network performance...
Provided by University of Oklahoma
-
White Papers
Empirical Evaluation of Techniques for Measuring Available Bandwidth
Jan 2010
The ability to measure end-to-end Available Bandwidth (AB) on a network path is useful in several domains, including overlay-routing infrastructure, network monitoring, and design of transport...
Provided by University of North Carolina at Chapel Hill
-
White Papers
A Wide-Bandwidth 2.4 GHz ISM Band Fractional-N PLL With Adaptive Phase Noise Cancellation
Dec 2007
A fast-settling adaptive calibration technique is presented that makes phase noise cancelling ∆?" fractional-N PLLs practical for the low reference frequencies commonly used in wireless...
Provided by Institute of Electrical and Electronics Engineers
-
White Papers
A Market-Based Bandwidth Charging Framework
Mar 2009
The increasing demand for high-bandwidth applications such as video-on-demand and grid computing is reviving interest in bandwidth reservation schemes. Earlier attempts did not catch on for a...
Provided by Columbia University
-
White Papers
Reliable Adaptive Multipath Provisioning With Bandwidth and Differential Delay Constraints
Apr 2010
Robustness and reliability are critical issues in network management. To provide resiliency, a popular protection scheme against network failures is the simultaneous routing along multiple...
Provided by Institute of Electrical and Electronics Engineers
-
White Papers
pathChirp: A Light-Weight Available Bandwidth Estimation Tool for Network-Aware Applications
Jan 2010
Many grid computing applications require massive data transfers for distributed analysis. Knowledge of network properties like the available bandwidth along the communication paths between grid...
Provided by Rice University
-
White Papers
Bandwidth Allocation for Iterative Data-Dependent e-Science Applications
Feb 2010
The authors develop a novel framework for supporting e-Science applications that require streaming of information between sites. Using a Synchronous DataFlow (SDF) model, the framework...
Provided by University Of Florida, Gainesville
-
White Papers
An Optimization Based Approach for QoS Routing in High-Bandwidth Networks
Jan 2010
This paper proposes an optimization based approach for Quality of Service routing in high-bandwidth networks. The authors view a network that employs QoS routing as an entity that distributive...
Provided by Purdue University
-
White Papers
On the Treeness of Internet Latency and Bandwidth
Jun 2009
Existing empirical studies of Internet structure and path properties indicate that the Internet is tree-like. This work quantifies the degree to which at least two important Internet measures -...
Provided by Association for Computing Machinery
-
White Papers
Optimal Bandwidth Choice for Interval Estimation in GMM Regression
May 2008
In time series regression with nonparametric ally auto correlated errors, it is now standard empirical practice to construct confidence intervals for regression coefficients on the basis of...
Provided by Yale University
-
White Papers
Techniques for Bandwidth-Efficient Prefetching of Linked Data Structures in Hybrid Prefetching Systems
Feb 2009
This paper proposes a low-cost hardware/software cooperative technique that enables bandwidth-efficient prefetching of linked data structures. The solution has two new components: a compiler...
Provided by Carnegie Mellon University
-
White Papers
Bandwidth Exchange as an Incentive for Relaying
Feb 2008
Relay cooperation has been recognized as an important mechanism to enhance connectivity and throughput in multi-hop wireless networks, especially under varying channel conditions. One major...
Provided by WINLAB
