Boston University

Displaying 1-40 of 173 results

  • White Papers // Feb 2013

    Intra-Car Wireless Sensors Data Collection: A Multi-Hop Approach

    The authors experimentally investigate the benefits of multi-hop networking for intra-car data aggregation under the current state-of-the-art Collection Tree Protocol (CTP). They show how this protocol actively adjusts collection routes according to channel dynamics in various practical car environments, resulting in performance gains over single-hop aggregation. Throughout their experiments, they...

    Provided By Boston University

  • White Papers // Jan 2013

    CCM: Scalable, On-Demand Compute Capacity Management for Cloud Datacenters

    Multi-tenant cloud computing datacenters run diverse workloads with time varying resource demands. This continuously leads to areas of high and low resource utilization throughout the cloud infrastructure. The authors present CCM (Cloud Capacity Manager) - a prototype system, and, methods for dynamically multiplexing the compute capacity of cloud datacenters at...

    Provided By Boston University

  • White Papers // Jan 2013

    Probabilistic Indoor Tracking of Mobile Wireless Nodes Relative to Landmarks

    The profile-based approach is known to be advantageous when it comes to inferring positions of mobile wireless devices in complex indoor environments. The past decade has seen a significant body of work that explores different implementations of this approach, with varying degrees of success. Here, the authors cast the profile-based...

    Provided By Boston University

  • White Papers // Jan 2013

    Spatio-Temporal Network Anomaly Detection by Assessing Deviations of Empirical Measures

    The authors introduce an Internet traffic anomaly detection mechanism based on large deviations results for empirical measures. Using past traffic traces they characterize network traffic during various time-of-day intervals, assuming that it is anomaly-free. They present two different approaches to characterize traffic: a model-free approach based on the method of...

    Provided By Boston University

  • White Papers // Dec 2012

    Verifying Search Results Over Web Collections

    Web searching accounts for one of the most frequently performed computations over the Internet as well as one of the most important applications of outsourced computing, producing results that critically affect users' decision-making behaviors. As such, verifying the integrity of Internet-based searches over vast amounts of web contents is essential....

    Provided By Boston University

  • White Papers // Sep 2012

    A Two Phase Hybrid RSS/AoA Algorithm for Indoor Device Localization Using Visible Light

    A two phase hybrid algorithm for estimating the location of a mobile node, which has the capability of measuring signal strength, azimuth, and elevation, in a smart space environment over the visible light channel is proposed. In contrast to conventional triangulation approaches which are performed in a simplified plane, the...

    Provided By Boston University

  • White Papers // Sep 2012

    Dynamic Pricing of Preemptive Service for Elastic Demand

    The authors consider a service provider that accommodates two classes of users: Primary Users (PUs) and Secondary Users (SUs). SU demand is elastic to price whereas PU demand is inelastic. When a PU arrives to the system and finds all channels busy, it preempts an SU unless there are no...

    Provided By Boston University

  • White Papers // Aug 2012

    Scheduling Mobile Nodes for Cooperative Data Transport in Sensor Networks

    Message Ferrying has been shown to be an effective approach to support routing in sparse ad hoc or sensor networks. Considering a generic network model where each node in the network wishes to send data to some (or possibly all) other nodes with known (and possibly different) rates, the authors...

    Provided By Boston University

  • White Papers // Aug 2012

    Optimal Admission Control in Two-Class Preemptive Loss Systems

    The authors study optimal admission control in a two-class preemptive loss system. A class-1 customer arrival aborts service of a class-2 customer if the system is full upon arrival. Each successfully serviced class-2 customer leads to a reward, whereas each aborted class-2 customer incurs a cost. Using dynamic programming, they...

    Provided By Boston University

  • White Papers // Aug 2012

    Online Pricing of Secondary Spectrum Access With Unknown Demand Function

    The authors consider a wireless provider who caters to two classes of customers, namely Primary Users (PUs) and Secondary Users (SUs). PUs has long term contracts while SUs are admitted and priced according to current availability of excess spectrum. The average rate at which SUs attempt to access the spectrum...

    Provided By Boston University

  • White Papers // Aug 2012

    Competition in Secondary Spectrum Markets: Price War or Market Sharing?

    Recent initiatives allow cellular providers to offer spot service of their licensed spectrum, paving the way to dynamic secondary spectrum markets. This paper characterizes market outcomes when multiple providers are drawn into competition for secondary demand. The authors study a game-theoretic model in which each provider aims to enhance its...

    Provided By Boston University

  • White Papers // Aug 2012

    Prioritized Data Synchronization for Disruption Tolerant Networks

    The authors consider the problem of synchronizing prioritized data on two distinct hosts in Disruption-Tolerant Networks (DTNs). To this effect, they propose and analyze a new interactive protocol for priority-oriented synchronization, called P-CPI that is especially efficient in terms of bandwidth usage. This middleware protocol has features that are particularly...

    Provided By Boston University

  • White Papers // Jul 2012

    Profit-Robust Policies for Dynamic Sharing of Radio Spectrum

    The authors investigate profitability from secondary spectrum provision under unknown relationships between price charged for spectrum use and demand drawn at the given price. They show that profitability is governed by the applied admission policy and the price charged to secondary users. They explicitly identify a critical price (market entry...

    Provided By Boston University

  • White Papers // Jul 2012

    Economic Viability of Private Commons: Framework and Guidelines for Profitability

    Ongoing regulatory reforms have led to several novel spectrum sharing models under the general umbrella of dynamic spectrum sharing. The private commons model introduced by FCC in 2004 allows spectrum licensees to provide secondary access to spectrum on an opportunistic basis while retaining ownership. Since wireless communication systems are typically...

    Provided By Boston University

  • White Papers // Jul 2012

    Jamming-Resistant Rate Control in Wi-Fi Networks

    Recent experimental studies reveal that several well-known and widely deployed Rate Adaptation Algorithms (RAAs) in 802.11 WLANs are vulnerable to selective jamming attacks. However, previous work resorts to complex jamming strategies that are hard to implement and does not provide applicable solutions to this problem. In this paper, the authors...

    Provided By Boston University

  • White Papers // Jun 2012

    Posit: A Lightweight Approach for IP Geolocation

    Location-specific Internet services are predicated on the ability to identify the geographic position of IP hosts accurately. Fundamental to current state-of-the-art geolocation techniques is reliance on heavyweight traceroute-like probes that put a significant traffic load on networks. In this paper, the authors introduce a new lightweight approach to IP geolocation...

    Provided By Boston University

  • White Papers // Apr 2012

    Optimal Admission Control of Secondary Users in Preemptive Cognitive Radio Networks

    The authors study optimal admission control of Secondary Users (SUs) in Cognitive Radio (CR) networks in presence of preemption. In this model, when a Primary User (PU) arrives to the system and finds all the channels busy, it preempts an SU unless all the users in the system are PUs....

    Provided By Boston University

  • White Papers // Apr 2012

    Universally Composable Security With Local Adversaries

    The traditional approach to formalizing ideal-model based definitions of security for multi-party protocols model adversaries (both real and ideal) as centralized entities that control all parties that deviate from the protocol. While this centralized-adversary modeling suffices for capturing basic security properties such as secrecy of local inputs and correctness of...

    Provided By Boston University

  • White Papers // Apr 2012

    On Delay-Minimized Data Harvesting With Mobile Elements in Wireless Sensor Networks

    The authors consider the problem of routing and scheduling a set of mobile elements that act as mechanical carriers of data, harvesting them from sensor nodes and delivering them to a sink. The objective is to minimize the data delivery latency. Most of the existing work has focused on designing...

    Provided By Boston University

  • White Papers // Mar 2012

    Connected Identifying Codes

    The authors consider the problem of generating a connected identifying code for an arbitrary graph. After a brief motivation, they show that the decision problem regarding the existence of such a code is NP-complete, and they propose a novel polynomial-time approximation ConnectID that transforms any identifying code into a connected...

    Provided By Boston University

  • White Papers // Feb 2012

    Reliable Rateless Wireless Broadcasting With Near-Zero Feedback

    The authors examine the problem of minimizing feedback in reliable wireless broadcasting, by pairing rateless coding with extreme value theory. Their key observation is that, in a broadcast environment, this problem resolves into estimating the maximum number of packets dropped among many receivers rather than for each individual receiver. With...

    Provided By Boston University

  • White Papers // Feb 2012

    Scheduling Algorithms and Bounds for Rateless Data Dissemination in Dense Wireless Networks

    Many applications in wireless cellular networks rely on the ability of the network to reliably and efficiently disseminate data to a large client audience. The stochastic nature of packet loss across receivers and channel interference constraints between cells complicate this task, however. In this paper, the authors analyze the problem...

    Provided By Boston University

  • White Papers // Feb 2012

    Non-Adaptive Group Testing: Explicit Bounds and Novel Algorithms

    The authors present computationally efficient and provably correct algorithms with near-optimal sample-complexity for noisy non-adaptive group testing. Group testing involves grouping arbitrary subsets of items into pools. Each pool is then tested to identify the defective items, which are usually assumed to be sparsely distributed. They consider random non-adaptive pooling...

    Provided By Boston University

  • White Papers // Jan 2012

    A Unified Approach to Deterministic Encryption: New Constructions and a Connection to Computational Entropy

    Public-key cryptosystems require randomness: indeed, if the encryption operation is deterministic, the adversary can simply use the public key to verify that the ciphertext c corresponds to its guess of the plaintext m by encrypting m. However, such an attack requires the adversary to have a reasonably likely guess for...

    Provided By Boston University

  • White Papers // Jan 2012

    A Least Squares Temporal Difference Actor-Critic Algorithm With Applications to Warehouse Management

    This paper develops a new approximate dynamic programming algorithm for Markov decision problems and applies it to a vehicle dispatching problem arising in warehouse management. The algorithm is of the actor-critic type and uses a least squares temporal difference learning method. It operates on a sample-path of the system and...

    Provided By Boston University

  • White Papers // Dec 2011

    Slice Embedding Solutions for Distributed Service Architectures

    Network virtualization provides a novel approach to run multiple concurrent virtual networks over a common physical network infrastructure. From a research perspective, this enables the networking community to concurrently experiment with new Internet architectures and protocols. From a market perspective, on the other hand, this paradigm is appealing as it...

    Provided By Boston University

  • White Papers // Dec 2011

    Hybrid Vehicular Communications Based on V2V-V2I Protocol Switching

    In this paper, a hybrid communication paradigm for vehicular networking is presented in which connectivity is provided by both existing network infrastructure (e.g., wireless network access points) through a vehicle-to-infrastructure protocol and traditional vehicle-to-vehicle networking. Preexisting infrastructure can provide seamless connectivity, especially when vehicles are sparse or traveling in disconnected...

    Provided By Boston University

  • White Papers // Oct 2011

    A Framework for the Evaluation and Management of Network Centrality

    Network-analysis literature is rich in node-centrality measures that quantify the centrality of a node as a function of the (shortest) paths of the network that go through it. Existing work focuses on defining instances of such measures and designing algorithms for the specific combinatorial problems that arise for each instance....

    Provided By Boston University

  • White Papers // Oct 2011

    Handover in VLC Systems With Cooperating Mobile Devices

    Visible Light Communications (VLC) is emerging as viable means to overcome the crowded radio spectrum for highly-localized communications systems. With such an approach, luminaires can be adopted for supporting data communication in addition to illumination in what the authors call Cellular Lighting. However, in these systems, the directionality of light...

    Provided By Boston University

  • White Papers // Sep 2011

    Energy Optimized Topologies for Distributed Averaging in Wireless Sensor Networks

    The authors study the energy efficient implementation of averaging/consensus algorithms in wireless sensor networks. For static, time-invariant topologies they start from the recent result that a bidirectional spanning tree is preferable in terms of convergence time. They formulate the combinatorial optimization problem of selecting such a minimal energy tree as...

    Provided By Boston University

  • White Papers // Sep 2011

    Lights-Off Visible Light Communications

    In order to implement Visible Light Communications (VLC) through indoor lighting, a set of challenges arise due to conflicting requirements from the two missions. In this paper, the authors examine one of these challenges: how to communicate when the lights are "Off ." They investigate VLC with limits on transmit...

    Provided By Boston University

  • White Papers // Sep 2011

    Position and Movement Detection of Wireless Sensor Network Devices Relative to a Landmark Graph

    The authors present a novel probabilistic framework for reliable indoor positioning of mobile sensor network devices. Compared to existing approaches, ours adopts complex computations in exchange for high localization accuracy while needing low hardware investment and moderate set-up cost. To that end, they use full distributional information on signal measurements...

    Provided By Boston University

  • White Papers // Sep 2011

    A Hybrid Radio Frequency and Broadcast Visible Light Communication System

    Wireless network data consumption is experiencing drastic increases due to growing demands of mobile services and applications. Deployed networks using Radio Frequency (RF) communications are characterized by a shared medium, limited available spectrum and limited ability to scale with increasing demand. Directional communications, including Visible Light Communications (VLC), can limit...

    Provided By Boston University

  • White Papers // Aug 2011

    Phase Transition of Message Propagation Speed in Delay Tolerant Vehicular Networks

    Delay Tolerant Network (DTN) architectures have recently been proposed as a means to enable efficient routing of messages in Vehicular Area NETworks (VANETs), which are characterized by alternating periods of connectivity and disconnection. Under such architectures, when multi-hop connectivity is available, messages propagate at the speed of radio over connected...

    Provided By Boston University

  • White Papers // Aug 2011

    Efficient Network Tomography for Internet Topology Discovery

    Accurate and timely identification of the router-level topology of the Internet is one of the major unresolved problems in Internet research. Topology recovery via tomographic inference is potentially an attractive complement to standard methods that use TTL-limited probes. Unfortunately, limitations of prior tomographic techniques make timely resolution of large-scale topologies...

    Provided By Boston University

  • White Papers // Jul 2011

    A V2X-Based Approach for Reduction of Delay Propagation in Vehicular Ad-Hoc Networks

    In this paper, the authors investigate the time delay propagation rates in a Vehicular Ad-Hoc Network, where vehicular connectivity is supported by both Vehicle-To-Vehicle (V2V) and Vehicle-To-Infrastructure (V2I) protocols. In their vision, seamless connectivity issues in a VANET with nearby network infrastructure, can be fixed by an opportunistic choice of...

    Provided By Boston University

  • White Papers // Jul 2011

    The Denotational and Static Semantics of a Domain-Specific Language for Flow-Network Design

    Flow networks are inductively defined, assembled from small network modules to produce arbitrarily large ones, with interchangeable and expanding functionally-equivalent parts. The authors carry out this induction formally using a Domain-Specific Language (DSL). Associated with their DSL is a typing system (or static semantics), a system of formal annotations that...

    Provided By Boston University

  • White Papers // Jul 2011

    A Domain-Specific Language for Incremental and Modular Design of Large-Scale Verifiably-Safe Flow Networks

    The authors define a Domain-Specific Language (DSL) to inductively assemble flow networks from small networks or modules to produce arbitrarily large ones, with interchangeable functionally-equivalent parts. Their small networks or modules are "Small" only as the building blocks in this inductive definition (there is no limit on their size). Associated...

    Provided By Boston University

  • White Papers // Jul 2011

    Posit: An Adaptive Framework for Lightweight IP Geolocation

    Location-specific Internet services are predicated on the ability to identify the geographic position of IP hosts accurately. Fundamental to prior geolocation techniques is their reliance on landmarks with known coordinates whose distance from target hosts is intrinsically tied to the ability to make accurate location estimates. In this paper, the...

    Provided By Boston University

  • White Papers // Jul 2011

    Gait-Based User Classification Using Phone Sensors

    The authors investigate whether smartphones can be used to distinguish different users based on their gait, the rhythmical body movements of human beings as they walk. To this end, they propose, describe, and experimentally evaluate a system that classifies peoples' gait patterns using the tri-axial accelerometer of the Motorola Droid...

    Provided By Boston University

  • White Papers // Aug 2012

    Competition in Secondary Spectrum Markets: Price War or Market Sharing?

    Recent initiatives allow cellular providers to offer spot service of their licensed spectrum, paving the way to dynamic secondary spectrum markets. This paper characterizes market outcomes when multiple providers are drawn into competition for secondary demand. The authors study a game-theoretic model in which each provider aims to enhance its...

    Provided By Boston University

  • White Papers // Apr 2012

    Optimal Admission Control of Secondary Users in Preemptive Cognitive Radio Networks

    The authors study optimal admission control of Secondary Users (SUs) in Cognitive Radio (CR) networks in presence of preemption. In this model, when a Primary User (PU) arrives to the system and finds all the channels busy, it preempts an SU unless all the users in the system are PUs....

    Provided By Boston University

  • White Papers // Feb 2012

    Scheduling Algorithms and Bounds for Rateless Data Dissemination in Dense Wireless Networks

    Many applications in wireless cellular networks rely on the ability of the network to reliably and efficiently disseminate data to a large client audience. The stochastic nature of packet loss across receivers and channel interference constraints between cells complicate this task, however. In this paper, the authors analyze the problem...

    Provided By Boston University

  • White Papers // Feb 2010

    Distributed Advance Network Reservation With Delay Guarantees

    New architectures have recently been proposed and deployed to support end-to-end advance reservation of network resources. These architectures rely on the use a centralized scheduler, which may be unpractical in large or administratively heterogeneous networks. In this paper, the authors explore and demonstrate the feasibility of implementing distributed solutions for...

    Provided By Boston University

  • White Papers // Jan 2009

    Rateless Coding With Feedback

    The erasure resilience of rateless codes, such as Luby-Transform (LT) codes, makes them particularly suitable to a wide variety of loss-prone wireless and sensor network applications, ranging from digital video broadcast to software updates. Yet, traditional rateless codes usually make no use of a feedback communication channel, a feature available...

    Provided By Boston University

  • White Papers // Nov 2008

    Path Switching and Grading Algorithms for Advance Channel Reservation Architectures

    As a result of perceived limitations of TCP/IP in supporting high throughput applications, significant efforts have recently been devoted to develop alternative architectures based on the concept of advance channel reservation. In this paper, the authors develop a polynomial-time algorithmic framework, called Graded Channel Reservation (GCR), to support the implementation...

    Provided By Boston University

  • White Papers // Dec 2009

    Extreme Value FEC for Reliable Broadcasting in Wireless Networks

    The advent of practical rateless codes enables implementation of highly efficient packet-level Forward Error Correction (FEC) strategies for reliable data broadcasting in loss-prone wireless networks, such as sensor networks. Yet, the critical question of accurately quantifying the proper amount of redundancy has remained largely unsolved. In this paper, the authors...

    Provided By Boston University

  • White Papers // Aug 2011

    Efficient Network Tomography for Internet Topology Discovery

    Accurate and timely identification of the router-level topology of the Internet is one of the major unresolved problems in Internet research. Topology recovery via tomographic inference is potentially an attractive complement to standard methods that use TTL-limited probes. Unfortunately, limitations of prior tomographic techniques make timely resolution of large-scale topologies...

    Provided By Boston University

  • White Papers // Jun 2012

    Posit: A Lightweight Approach for IP Geolocation

    Location-specific Internet services are predicated on the ability to identify the geographic position of IP hosts accurately. Fundamental to current state-of-the-art geolocation techniques is reliance on heavyweight traceroute-like probes that put a significant traffic load on networks. In this paper, the authors introduce a new lightweight approach to IP geolocation...

    Provided By Boston University

  • White Papers // Sep 2011

    Energy Optimized Topologies for Distributed Averaging in Wireless Sensor Networks

    The authors study the energy efficient implementation of averaging/consensus algorithms in wireless sensor networks. For static, time-invariant topologies they start from the recent result that a bidirectional spanning tree is preferable in terms of convergence time. They formulate the combinatorial optimization problem of selecting such a minimal energy tree as...

    Provided By Boston University

  • White Papers // Apr 2009

    Optimized Scheduled Multiple Access Control for Wireless Sensor Networks

    The authors consider wireless sensor networks with multiple sensor modalities that capture data to be transported over multiple frequency channels to potentially multiple gateways. They study a general problem of maximizing a utility function of achievable transmission rates between communicating nodes. Decisions involve routing, transmission scheduling, power control, and channel...

    Provided By Boston University

  • White Papers // Jan 2012

    A Least Squares Temporal Difference Actor-Critic Algorithm With Applications to Warehouse Management

    This paper develops a new approximate dynamic programming algorithm for Markov decision problems and applies it to a vehicle dispatching problem arising in warehouse management. The algorithm is of the actor-critic type and uses a least squares temporal difference learning method. It operates on a sample-path of the system and...

    Provided By Boston University

  • White Papers // Sep 2011

    Position and Movement Detection of Wireless Sensor Network Devices Relative to a Landmark Graph

    The authors present a novel probabilistic framework for reliable indoor positioning of mobile sensor network devices. Compared to existing approaches, ours adopts complex computations in exchange for high localization accuracy while needing low hardware investment and moderate set-up cost. To that end, they use full distributional information on signal measurements...

    Provided By Boston University

  • White Papers // Nov 2009

    A Distributed Actor-Critic Algorithm and Applications to Mobile Sensor Network Coordination Problems

    The authors introduce and establish the convergence of a distributed actor-critic method that orchestrates the coordination of multiple agents solving a general class of a Markov decision problem. The method leverages the centralized single-agent actor-critic algorithm of and uses a consensus-like algorithm for updating agents' policy parameters. As an application...

    Provided By Boston University

  • White Papers // Jan 2013

    Spatio-Temporal Network Anomaly Detection by Assessing Deviations of Empirical Measures

    The authors introduce an Internet traffic anomaly detection mechanism based on large deviations results for empirical measures. Using past traffic traces they characterize network traffic during various time-of-day intervals, assuming that it is anomaly-free. They present two different approaches to characterize traffic: a model-free approach based on the method of...

    Provided By Boston University

  • White Papers // Aug 2012

    Scheduling Mobile Nodes for Cooperative Data Transport in Sensor Networks

    Message Ferrying has been shown to be an effective approach to support routing in sparse ad hoc or sensor networks. Considering a generic network model where each node in the network wishes to send data to some (or possibly all) other nodes with known (and possibly different) rates, the authors...

    Provided By Boston University

  • White Papers // Jan 2013

    Probabilistic Indoor Tracking of Mobile Wireless Nodes Relative to Landmarks

    The profile-based approach is known to be advantageous when it comes to inferring positions of mobile wireless devices in complex indoor environments. The past decade has seen a significant body of work that explores different implementations of this approach, with varying degrees of success. Here, the authors cast the profile-based...

    Provided By Boston University

  • White Papers // Apr 2012

    On Delay-Minimized Data Harvesting With Mobile Elements in Wireless Sensor Networks

    The authors consider the problem of routing and scheduling a set of mobile elements that act as mechanical carriers of data, harvesting them from sensor nodes and delivering them to a sink. The objective is to minimize the data delivery latency. Most of the existing work has focused on designing...

    Provided By Boston University

  • White Papers // May 2011

    Mining a Web Security Portal - A Case Study

    Vast amount of information is available on the web which could help an instructor when teaching an information technology course. Various online publishers provide this knowledge in the form of RSS feeds which could be subscribed by individual users through various RSS aggregators. In this paper, the authors present on...

    Provided By Boston University

  • White Papers // Aug 2010

    International Risk Cycles

    This paper presents a two-country real business cycle model with two novel features: exogenous shocks to worldwide uncertainty, heterogeneous exposures to the world aggregate shock. The authors show that these two features lead to significant progress in tackling international finance puzzles. When world risk increases, investment decreases and a worldwide...

    Provided By Boston University

  • White Papers // Jun 2009

    CSR: Constrained Selfish Routing in Ad-Hoc Networks

    Routing protocols for ad-hoc networks assume that the nodes forming the network are either under a single authority, or else that they would be altruistically forwarding data for other nodes with no expectation of a return. These assumptions are unrealistic since in ad-hoc networks, nodes are likely to be autonomous...

    Provided By Boston University

  • White Papers // Jan 2011

    A Geometric Approach to Slot Alignment in Wireless Sensor Networks

    Traditionally, slotted communication protocols have employed guard times to delineate and align slots. These guard times may expand the slot duration significantly, especially when clocks are allowed to drift for longer time to reduce clock synchronization overhead. Recently, a new class of lightweight protocols for statistical estimation in wireless sensor...

    Provided By Boston University

  • White Papers // Aug 2009

    PreDA: Predicate Routing for DTN Architectures Over MANET

    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 constraints on how "Content" should be routed. For example, content can be directed through an intermediary DTN node for the purposes of...

    Provided By Boston University

  • White Papers // Dec 2010

    Assessing the Security of a Clean-Slate Internet Architecture

    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 them. The investigations into the fundamental principles of networking have shown that carefully following an abstract model of Inter-Process Communication...

    Provided By Boston University

  • White Papers // Jan 2009

    Hyperbolic Embedding and Routing for Dynamic Graphs

    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 communication networks, routing elements can join or leave during network operation or exhibit intermittent failures. They present an algorithm for online greedy graph embedding...

    Provided By Boston University

  • White Papers // Oct 2009

    Safe Compositional Network Sketches: Tool & Use Cases

    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 integrators in two types of activities: modeling and design. As a modeling tool, it enables the of an existing system while retaining sufficient information...

    Provided By Boston University

  • White Papers // May 2008

    NETEMBED: A Network Resource Mapping Service for Distributed Applications

    Emerging configurable infrastructures (large-scale overlays, grids, distributed testbeds, and sensor networks among others) comprise diverse sets of computing resources and network conditions. The distributed applications to be deployed on these infrastructures exhibit increasingly complex constraints and requirements on the resources they require. Thus, a common problem facing the efficient deployment...

    Provided By Boston University

  • White Papers // Jan 2011

    An Information Theoretic Framework for Field Monitoring Using Autonomously Mobile Sensors

    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 efficiently answer queries with a known probability distribution over the spatial dimension. First, they propose a novel distributed information theoretic approach...

    Provided By Boston University

  • White Papers // Jan 2011

    A Typed Model for Encoding-Based Protocol Interoperability

    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 are stated in English prose; while this makes the document more intuitively accessible, it makes any sort of formal claims of correctness...

    Provided By Boston University

  • White Papers // Jan 2011

    MORPHOSYS: Efficient Colocation of QoS-Constrained Workloads in the Cloud

    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 capacities that must be allocated for unencumbered use for proper operation. Arbitrary colocation of applications with different SLAs on a single host may...

    Provided By Boston University

  • White Papers // Feb 2011

    Safe Compositional Network Sketches: NetSketch Tool Implementation

    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 integrators in two types of activities: Modeling and design. As a modeling tool, it enables an existing system so as to retain sufficient enough...

    Provided By Boston University

  • White Papers // Feb 2010

    A Type-Theoretic Framework for Efficient and Safe Colocation of Periodic Real-Time Systems

    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 unencumbered use by the application. The mapping between what constitutes desirable performance and SLAs is not unique: multiple SLA expressions might be functionally equivalent....

    Provided By Boston University

  • White Papers // Feb 2009

    Safe Compositional Network Sketches: Reasoning With Automated Assistance

    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 modeling and design. It provides compositional analysis capabilities based on a strongly-typed domain-specific language (DSL) for describing and reasoning about CFNs and relevant invariants....

    Provided By Boston University

  • White Papers // Aug 2010

    Angels in the Cloud a Peer-Assisted Bulk-Synchronous Content Distribution Service

    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, however, are limited by the disparity between client upload and download speeds, especially in scenarios requiring a Minimum Distribution Time (MDT) of a piece of...

    Provided By Boston University

  • White Papers // Oct 2009

    Safe Compositional Network Sketches: The Formal Framework

    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 in two types of activities: Modeling and design. As a modeling tool, it enables the of an existing system while retaining sufficient information about...

    Provided By Boston University

  • White Papers // Aug 2009

    Angels: In-Network Support for Minimum Distribution Time in P2P Overlays

    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 of leechers - nodes who are interested in downloading the file. An Angel...

    Provided By Boston University

  • White Papers // Jul 2008

    The EGOIST Overlay Routing System

    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 overlay, and rewiring to cope with changing network conditions. Previous work has considered the problem from two perspectives: devising practical heuristics for specific...

    Provided By Boston University

  • White Papers // Aug 2009

    Principles of Safe Policy Routing Dynamics

    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 causation chains where the route flap at one node causes a flap at the next node along the chain. Using DPR,...

    Provided By Boston University

  • White Papers // Jan 2011

    Authenticated Index Structures for Outsourced Databases

    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 data more efficiently. As servers might be untrusted or can be compromised, query authentication becomes an...

    Provided By Boston University

  • White Papers // Apr 2010

    Virtualization and Programming Support for Video Sensor Networks With Application to Wireless and Physical Security

    Network Security Systems are heavily anchored in the digital plane of "Cyber Space" and hence cannot be used effectively to derive the physical identity of an intruder in order to prevent further malicious wireless broadcasts (i.e., Escorting an Intruder off the Premises Based on Physical Evidence). Embedded Sensor Networks (SNs)...

    Provided By Boston University