- Subscribe to this page:
- RSS
- Email Alert
Boston University
(283 results)-
White Papers
Hyperbolic Embedding and Routing for Dynamic Graphs
January 21, 2009, 12:00am PST
The authors propose an embedding and routing scheme for arbitrary network connectivity graphs, based on greedy routing and utilizing virtual node coordinates. In dynamic multihop packet-switching...
Provided by Boston University
-
White Papers
Safe Compositional Network Sketches: Tool & Use Cases
October 29, 2009, 12:00am PDT
NetSketch is a tool that enables the specification of network-flow applications and the certification of desirable safety properties imposed thereon. NetSketch is conceived to assist system...
Provided by Boston University
-
White Papers
NETEMBED: A Network Resource Mapping Service for Distributed Applications
May 29, 2008, 12:00am PDT
Emerging configurable infrastructures (large-scale overlays, grids, distributed testbeds, and sensor networks among others) comprise diverse sets of computing resources and network conditions. The...
Provided by Boston University
-
White Papers
An Information Theoretic Framework for Field Monitoring Using Autonomously Mobile Sensors
January 1, 2011, 12:00am PST
The authors consider a mobile sensor network monitoring a spatio-temporal field. Given limited caches at the sensor nodes, the goal is to develop a distributed cache management algorithm to...
Provided by Boston University
-
White Papers
The Cache Inference Problem and Its Application to Content and Request Routing
May 22, 2007, 12:00am PDT
In many networked applications, independent caching agents cooperate by servicing each other's miss streams, without revealing the operational details of the caching mechanisms they employ....
Provided by Boston University
-
White Papers
A Typed Model for Encoding-Based Protocol Interoperability
January 1, 2011, 12:00am PST
Documentation of the HTTP protocol includes precise descriptions of the syntax of the protocol, but lacks similarly precise specification of the semantics of messages and message bodies. Semantics...
Provided by Boston University
-
White Papers
MORPHOSYS: Efficient Colocation of QoS-Constrained Workloads in the Cloud
January 27, 2011, 12:00am PST
In hosting environments such as IaaS clouds, desirable application performance is usually guaranteed through the use of Service Level Agreements (SLAs), which specify minimal fractions of resource...
Provided by Boston University
-
White Papers
Safe Compositional Network Sketches: NetSketch Tool Implementation
February 9, 2011, 12:00am PST
NetSketch is a tool that enables the specification of network-flow applications and the certification of desirable safety properties imposed thereon. NetSketch is conceived to assist system...
Provided by Boston University
-
White Papers
A Type-Theoretic Framework for Efficient and Safe Colocation of Periodic Real-Time Systems
February 12, 2010, 12:00am PST
Desirable application performance is typically guaranteed through the use of Service Level Agreements (SLAs) that specify fixed fractions of resource capacities that must be allocated for...
Provided by Boston University
-
White Papers
Safe Compositional Network Sketches: Reasoning With Automated Assistance
February 4, 2009, 12:00am PST
NetSketch is a tool for the specification of Constrained-Flow Networks (CFNs) and the certification of desirable safety properties imposed thereon, conceived to assist system integrators in...
Provided by Boston University
-
White Papers
Angels in the Cloud a Peer-Assisted Bulk-Synchronous Content Distribution Service
August 12, 2010, 12:00am PDT
Leveraging client upload capacity through peer-assisted content distribution was shown to decrease the load on content providers, while also improving average distribution times. These benefits,...
Provided by Boston University
-
White Papers
Safe Compositional Network Sketches: The Formal Framework
October 30, 2009, 12:00am PDT
NetSketch is a tool for the specification of constrained-flow applications and the certification of desirable safety properties imposed thereon. NetSketch is conceived to assist system integrators...
Provided by Boston University
-
White Papers
Angels: In-Network Support for Minimum Distribution Time in P2P Overlays
August 6, 2009, 12:00am PDT
This paper proposes the use of in-network caches (which the authors call Angels) to reduce the Minimum Distribution Time (MDT) of a file from a seeder - a node that possesses the file - to a set...
Provided by Boston University
-
White Papers
Detour-Based Mobility Coordination in DTNs
February 15, 2008, 12:00am PST
Commonly, research work in routing for Delay Tolerant Networks (DTN) assumes that node encounters are predestined, in the sense that they are the result of unknown, exogenous processes that...
Provided by Boston University
-
White Papers
The EGOIST Overlay Routing System
July 1, 2008, 12:00am PDT
A foundational issue underlying many overlay network applications ranging from routing to peer-to-peer file sharing is that of connectivity management, i.e., folding new arrivals into an existing...
Provided by Boston University
-
White Papers
Improving the Performance of Overlay Routing and P2P File Sharing Using Selfish Neighbor Selection
October 12, 2007, 12:00am PDT
A foundational issue underlying many overlay network applications ranging from routing to P2P file sharing is that of connectivity management, i.e., folding new arrivals into the existing mesh and...
Provided by Boston University
-
White Papers
Principles of Safe Policy Routing Dynamics
August 31, 2009, 12:00am PDT
This paper introduces the Dynamic Policy Routing (DPR) model that captures the propagation of route updates under arbitrary changes in topology or path preferences. DPR introduces the notion of...
Provided by Boston University
-
White Papers
Authenticated Index Structures for Outsourced Databases
January 1, 2011, 12:00am PST
In an Outsourced DataBase (ODB) system the database owner publishes data through a number of remote servers, with the goal of enabling clients at the edge of the network to access and query the...
Provided by Boston University
-
White Papers
Characterizing and Exploiting Reference Locality in Data Stream Applications
January 1, 2011, 12:00am PST
In this paper, the authors investigate a new approach to process queries in data stream applications. They show that reference locality characteristics of data streams could be exploited in the...
Provided by Boston University
-
White Papers
Trade & Cap: A Customer-Managed, Market-Based System for Trading Bandwidth Allowances at a Shared Link
September 8, 2010, 12:00am PDT
This paper proposes Trade & Cap (T&C), an economics-inspired mechanism that incentivizes users to voluntarily coordinate their consumption of the bandwidth of a shared network link so as to...
Provided by Boston University
-
White Papers
Programming With Dependently Typed Data Structures
January 1, 2011, 12:00am PST
The mechanism for declaring datatypes in functional programming languages such as ML and Haskell is of great use in practice. This mechanism, however, often suffers from its imprecision in...
Provided by Boston University
-
White Papers
Dependent Types for Program Termination Verification
January 1, 2011, 12:00am PST
Program termination verification is a challenging research subject of significant practical importance. While there is already a rich body of literature on this subject, it is still undeniably a...
Provided by Boston University
-
White Papers
Dependent ML: An Approach to Practical Programming With Dependent Types
January 1, 2011, 12:00am PST
The authors present an approach to enriching the type system of ML with a restricted form of dependent types, where type index terms are required to be drawn from a given type index language that...
Provided by Boston University
-
White Papers
Distributed Detection in Sensor Networks With Limited Range Sensors
March 18, 2008, 12:00am PDT
The authors consider a multi-object detection problem over a Sensor Network (SNET) with limited range sensors. This problem complements the widely considered decentralized detection problem where...
Provided by Boston University
-
White Papers
One-Bit Distributed Sensing and Coding for Field Estimation in Sensor Networks
July 26, 2007, 12:00am PDT
This paper formulates and studies a general distributed field reconstruction problem using a dense network of noisy one - bit randomized scalar quantizers in the presence of additive observation...
Provided by Boston University
-
White Papers
A Token Based Approach to Distributed Computation in Sensor Networks
March 11, 2011, 12:00am PST
The authors consider distributed algorithms for data aggregation and function computation in sensor networks. The algorithms perform pairwise computations along edges of an underlying...
Provided by Boston University
-
White Papers
Throughput Optimal On-Line Algorithms for Advanced Resource Reservation in Ultra High-Speed Networks
November 2, 2007, 12:00am PDT
Advanced channel reservation is emerging as an important feature of ultra high-speed networks requiring the transfer of large files. Applications include scientific data transfers and database...
Provided by Boston University
-
White Papers
Bounding the Bias of Tree-Like Sampling in IP Topologies
February 1, 2008, 12:00am PST
It is widely believed that the Internet's AS-graph degree distribution obeys a power-law form. Most of the evidence showing the power-law distribution is based on BGP data. However, it was...
Provided by Boston University
-
White Papers
Bootstrapped Oblivious Transfer and Secure Two-Party Function Computation
February 4, 2009, 12:00am PST
The authors propose an information theoretic framework for the Secure two-party Function Computation (SFC) problem and introduce the notion of SFC capacity. They study and extend string Oblivious...
Provided by Boston University
-
White Papers
Using Lightweight Formal Methods for JavaScript Security
May 3, 2010, 12:00am PDT
The goal of this investigation was to apply lightweight formal methods to the study of the security of the JavaScript language. Previous work has shown that lightweight formal methods present a...
Provided by Boston University
-
White Papers
Learning Actions From The Web
July 6, 2010, 12:00am PDT
This paper proposes a generic method for action recognition in uncontrolled videos. The idea is to use images collected from the Web to learn representations of actions and use this knowledge to...
Provided by Boston University
-
White Papers
Formal Verification of SLA Transformations
February 24, 2011, 12:00am PST
Desirable application performance is typically guaranteed through the use of Service Level Agreements (SLAs) that specify fixed fractions of resource capacities that must be allocated for...
Provided by Boston University
-
White Papers
On the Detection of Policy Conflicts in Interdomain Routing
April 16, 2010, 12:00am PDT
The Dynamic Policy Routing model (DPR) was recently introduced to explicitly model the dynamics of policy routing. DPR extends the formalism of the stable paths problem with discrete synchronous...
Provided by Boston University
-
White Papers
A Green Distributed Cooperation for Network and Content Management
March 31, 2010, 12:00am PDT
The authors propose a distributed approach in which an Internet Service Provider (ISP) and a Content Provider (CP) cooperate to minimize total power consumption. The authors solution is...
Provided by Boston University
-
White Papers
Colocation as a Service: Strategic and Operational Services for Cloud Colocation
March 23, 2010, 12:00am PDT
By colocating with other tenants of an Infrastructure as a Service (IaaS) offering, IaaS users could reap significant cost savings by judiciously sharing their use of the fixed-size instances...
Provided by Boston University
-
White Papers
Is a Detector Only Good for Detection?
September 1, 2009, 12:00am PDT
A common design of an object recognition system has two steps, a detection step followed by a foreground within class classification step. For example, consider face detection by a boosted cascade...
Provided by Boston University
-
White Papers
On Unconditionally Secure Computation With Vanishing Communication Cost
October 5, 2010, 12:00am PDT
The authors propose a novel distortion-theoretic approach to a secure three-party computation problem. Alice and Bob have deterministic sequences, and Charlie wishes to compute a normalized...
Provided by Boston University
-
White Papers
A Novel Web-Based Approach for Balancing Usability and Security Requirements of Text Passwords
July 1, 2010, 12:00am PDT
Many Internet applications, for example e-commerce or email services require that users create a username and password which serves as an authentication mechanism. Though text passwords have been...
Provided by Boston University
-
White Papers
Tracking a Large Number of Objects From Multiple Views
September 1, 2009, 12:00am PDT
The authors propose a multi-object multi-camera framework for tracking large numbers of tightly-spaced objects that rapidly move in three dimensions. They formulate the problem of finding...
Provided by Boston University
-
White Papers
Active Hidden Models for Tracking With Kernel Projections
September 21, 2009, 12:00am PDT
The authors introduce Active Hidden Models (AHM) that utilize kernel methods traditionally associated with classification. They use AHMs to track deformable objects in video sequences by...
Provided by Boston University
-
White Papers
A Novel Web-Based Approach for Balancing Usability and Security Requirements of Text Passwords
July 1, 2010, 12:00am PDT
Many Internet applications, for example e-commerce or email services require that users create a username and password which serves as an authentication mechanism. Though text passwords have been...
Provided by Boston University
-
White Papers
On Unconditionally Secure Computation With Vanishing Communication Cost
October 5, 2010, 12:00am PDT
The authors propose a novel distortion-theoretic approach to a secure three-party computation problem. Alice and Bob have deterministic sequences, and Charlie wishes to compute a normalized...
Provided by Boston University
-
White Papers
Is a Detector Only Good for Detection?
September 1, 2009, 12:00am PDT
A common design of an object recognition system has two steps, a detection step followed by a foreground within class classification step. For example, consider face detection by a boosted cascade...
Provided by Boston University
-
White Papers
Colocation as a Service: Strategic and Operational Services for Cloud Colocation
March 23, 2010, 12:00am PDT
By colocating with other tenants of an Infrastructure as a Service (IaaS) offering, IaaS users could reap significant cost savings by judiciously sharing their use of the fixed-size instances...
Provided by Boston University
-
White Papers
A Green Distributed Cooperation for Network and Content Management
March 31, 2010, 12:00am PDT
The authors propose a distributed approach in which an Internet Service Provider (ISP) and a Content Provider (CP) cooperate to minimize total power consumption. The authors solution is...
Provided by Boston University
-
White Papers
On the Detection of Policy Conflicts in Interdomain Routing
April 16, 2010, 12:00am PDT
The Dynamic Policy Routing model (DPR) was recently introduced to explicitly model the dynamics of policy routing. DPR extends the formalism of the stable paths problem with discrete synchronous...
Provided by Boston University
-
White Papers
Formal Verification of SLA Transformations
February 24, 2011, 12:00am PST
Desirable application performance is typically guaranteed through the use of Service Level Agreements (SLAs) that specify fixed fractions of resource capacities that must be allocated for...
Provided by Boston University
-
White Papers
Learning Actions From The Web
July 6, 2010, 12:00am PDT
This paper proposes a generic method for action recognition in uncontrolled videos. The idea is to use images collected from the Web to learn representations of actions and use this knowledge to...
Provided by Boston University
-
White Papers
Using Lightweight Formal Methods for JavaScript Security
May 3, 2010, 12:00am PDT
The goal of this investigation was to apply lightweight formal methods to the study of the security of the JavaScript language. Previous work has shown that lightweight formal methods present a...
Provided by Boston University
-
White Papers
Bootstrapped Oblivious Transfer and Secure Two-Party Function Computation
February 4, 2009, 12:00am PST
The authors propose an information theoretic framework for the Secure two-party Function Computation (SFC) problem and introduce the notion of SFC capacity. They study and extend string Oblivious...
Provided by Boston University
-
White Papers
Bounding the Bias of Tree-Like Sampling in IP Topologies
February 1, 2008, 12:00am PST
It is widely believed that the Internet's AS-graph degree distribution obeys a power-law form. Most of the evidence showing the power-law distribution is based on BGP data. However, it was...
Provided by Boston University
-
White Papers
Throughput Optimal On-Line Algorithms for Advanced Resource Reservation in Ultra High-Speed Networks
November 2, 2007, 12:00am PDT
Advanced channel reservation is emerging as an important feature of ultra high-speed networks requiring the transfer of large files. Applications include scientific data transfers and database...
Provided by Boston University
-
White Papers
A Token Based Approach to Distributed Computation in Sensor Networks
March 11, 2011, 12:00am PST
The authors consider distributed algorithms for data aggregation and function computation in sensor networks. The algorithms perform pairwise computations along edges of an underlying...
Provided by Boston University
-
White Papers
One-Bit Distributed Sensing and Coding for Field Estimation in Sensor Networks
July 26, 2007, 12:00am PDT
This paper formulates and studies a general distributed field reconstruction problem using a dense network of noisy one - bit randomized scalar quantizers in the presence of additive observation...
Provided by Boston University
-
White Papers
Distributed Detection in Sensor Networks With Limited Range Sensors
March 18, 2008, 12:00am PDT
The authors consider a multi-object detection problem over a Sensor Network (SNET) with limited range sensors. This problem complements the widely considered decentralized detection problem where...
Provided by Boston University
-
White Papers
Dependent ML: An Approach to Practical Programming With Dependent Types
January 1, 2011, 12:00am PST
The authors present an approach to enriching the type system of ML with a restricted form of dependent types, where type index terms are required to be drawn from a given type index language that...
Provided by Boston University
-
White Papers
Dependent Types for Program Termination Verification
January 1, 2011, 12:00am PST
Program termination verification is a challenging research subject of significant practical importance. While there is already a rich body of literature on this subject, it is still undeniably a...
Provided by Boston University
-
White Papers
Programming With Dependently Typed Data Structures
January 1, 2011, 12:00am PST
The mechanism for declaring datatypes in functional programming languages such as ML and Haskell is of great use in practice. This mechanism, however, often suffers from its imprecision in...
Provided by Boston University
-
White Papers
Trade & Cap: A Customer-Managed, Market-Based System for Trading Bandwidth Allowances at a Shared Link
September 8, 2010, 12:00am PDT
This paper proposes Trade & Cap (T&C), an economics-inspired mechanism that incentivizes users to voluntarily coordinate their consumption of the bandwidth of a shared network link so as to...
Provided by Boston University
-
White Papers
Characterizing and Exploiting Reference Locality in Data Stream Applications
January 1, 2011, 12:00am PST
In this paper, the authors investigate a new approach to process queries in data stream applications. They show that reference locality characteristics of data streams could be exploited in the...
Provided by Boston University
-
White Papers
Authenticated Index Structures for Outsourced Databases
January 1, 2011, 12:00am PST
In an Outsourced DataBase (ODB) system the database owner publishes data through a number of remote servers, with the goal of enabling clients at the edge of the network to access and query the...
Provided by Boston University
-
White Papers
Principles of Safe Policy Routing Dynamics
August 31, 2009, 12:00am PDT
This paper introduces the Dynamic Policy Routing (DPR) model that captures the propagation of route updates under arbitrary changes in topology or path preferences. DPR introduces the notion of...
Provided by Boston University
-
White Papers
Improving the Performance of Overlay Routing and P2P File Sharing Using Selfish Neighbor Selection
October 12, 2007, 12:00am PDT
A foundational issue underlying many overlay network applications ranging from routing to P2P file sharing is that of connectivity management, i.e., folding new arrivals into the existing mesh and...
Provided by Boston University
-
White Papers
The EGOIST Overlay Routing System
July 1, 2008, 12:00am PDT
A foundational issue underlying many overlay network applications ranging from routing to peer-to-peer file sharing is that of connectivity management, i.e., folding new arrivals into an existing...
Provided by Boston University
-
White Papers
Detour-Based Mobility Coordination in DTNs
February 15, 2008, 12:00am PST
Commonly, research work in routing for Delay Tolerant Networks (DTN) assumes that node encounters are predestined, in the sense that they are the result of unknown, exogenous processes that...
Provided by Boston University
-
White Papers
Angels: In-Network Support for Minimum Distribution Time in P2P Overlays
August 6, 2009, 12:00am PDT
This paper proposes the use of in-network caches (which the authors call Angels) to reduce the Minimum Distribution Time (MDT) of a file from a seeder - a node that possesses the file - to a set...
Provided by Boston University
-
White Papers
Safe Compositional Network Sketches: The Formal Framework
October 30, 2009, 12:00am PDT
NetSketch is a tool for the specification of constrained-flow applications and the certification of desirable safety properties imposed thereon. NetSketch is conceived to assist system integrators...
Provided by Boston University
-
White Papers
Angels in the Cloud a Peer-Assisted Bulk-Synchronous Content Distribution Service
August 12, 2010, 12:00am PDT
Leveraging client upload capacity through peer-assisted content distribution was shown to decrease the load on content providers, while also improving average distribution times. These benefits,...
Provided by Boston University
-
White Papers
Safe Compositional Network Sketches: Reasoning With Automated Assistance
February 4, 2009, 12:00am PST
NetSketch is a tool for the specification of Constrained-Flow Networks (CFNs) and the certification of desirable safety properties imposed thereon, conceived to assist system integrators in...
Provided by Boston University
-
White Papers
A Type-Theoretic Framework for Efficient and Safe Colocation of Periodic Real-Time Systems
February 12, 2010, 12:00am PST
Desirable application performance is typically guaranteed through the use of Service Level Agreements (SLAs) that specify fixed fractions of resource capacities that must be allocated for...
Provided by Boston University
-
White Papers
Safe Compositional Network Sketches: NetSketch Tool Implementation
February 9, 2011, 12:00am PST
NetSketch is a tool that enables the specification of network-flow applications and the certification of desirable safety properties imposed thereon. NetSketch is conceived to assist system...
Provided by Boston University
-
White Papers
MORPHOSYS: Efficient Colocation of QoS-Constrained Workloads in the Cloud
January 27, 2011, 12:00am PST
In hosting environments such as IaaS clouds, desirable application performance is usually guaranteed through the use of Service Level Agreements (SLAs), which specify minimal fractions of resource...
Provided by Boston University
-
White Papers
A Typed Model for Encoding-Based Protocol Interoperability
January 1, 2011, 12:00am PST
Documentation of the HTTP protocol includes precise descriptions of the syntax of the protocol, but lacks similarly precise specification of the semantics of messages and message bodies. Semantics...
Provided by Boston University
-
White Papers
The Cache Inference Problem and Its Application to Content and Request Routing
May 22, 2007, 12:00am PDT
In many networked applications, independent caching agents cooperate by servicing each other's miss streams, without revealing the operational details of the caching mechanisms they employ....
Provided by Boston University
-
White Papers
An Information Theoretic Framework for Field Monitoring Using Autonomously Mobile Sensors
January 1, 2011, 12:00am PST
The authors consider a mobile sensor network monitoring a spatio-temporal field. Given limited caches at the sensor nodes, the goal is to develop a distributed cache management algorithm to...
Provided by Boston University
-
White Papers
NETEMBED: A Network Resource Mapping Service for Distributed Applications
May 29, 2008, 12:00am PDT
Emerging configurable infrastructures (large-scale overlays, grids, distributed testbeds, and sensor networks among others) comprise diverse sets of computing resources and network conditions. The...
Provided by Boston University
-
White Papers
Safe Compositional Network Sketches: Tool & Use Cases
October 29, 2009, 12:00am PDT
NetSketch is a tool that enables the specification of network-flow applications and the certification of desirable safety properties imposed thereon. NetSketch is conceived to assist system...
Provided by Boston University
-
White Papers
Hyperbolic Embedding and Routing for Dynamic Graphs
January 21, 2009, 12:00am PST
The authors propose an embedding and routing scheme for arbitrary network connectivity graphs, based on greedy routing and utilizing virtual node coordinates. In dynamic multihop packet-switching...
Provided by Boston University
-
White Papers
Assessing the Security of a Clean-Slate Internet Architecture
December 1, 2010, 12:00am PST
The TCP/IP architecture was originally designed without taking security measures into consideration. Over the years, it has been subjected to many attacks, which has led to many patches to counter...
Provided by Boston University
-
White Papers
PreDA: Predicate Routing for DTN Architectures Over MANET
August 14, 2009, 12:00am PDT
The authors consider a Delay Tolerant Network (DTN) whose users (Nodes) are connected by an underlying Mobile Ad hoc NETwork (MANET) substrate. Users can declaratively express high-level policy...
Provided by Boston University
Keep Up with TechRepublic
Submit a Paper
Get your content listed in our directory!
Our directory is the largest library of vendor-supplied technical content on the Web. It’s also the first place IT decision makers turn to when researching technology solutions. Our members are already finding your competitors’ papers here - shouldn’t they find yours, too? It's FREE so click here and submit your white paper, case study, data sheet, research report, or other document today!
