Boston University

Displaying 1-40 of 168 results

  • White Papers // May 2014

    Learning Modular Structures from Network Data and Node Variables

    A standard technique for understanding underlying dependency structures among a set of variables posits a shared conditional probability distribution for the variables measured on individuals within a group. This approach is often referred to as module networks, where individuals are represented by nodes in a network, groups are termed modules,...

    Provided By Boston University

  • White Papers // Jan 2014

    Strategies for Anticipating Risk in Heterogeneous System Design

    Heterogeneous design presents an opportunity to improve energy efficiency but raises a challenge in resource management. Prior design methodologies aim for performance and efficiency, yet a deployed system may miss these targets due to run-time effects, which the authors denote as risk. They propose design strategies that explicitly aim to...

    Provided By Boston University

  • White Papers // Jun 2013

    Navigating Heterogeneous Processors with Market Mechanisms

    As datacenters proliferate and access to them is democratized, increasingly diverse cloud applications will demand computation. To accommodate the rise in demand, traditional datacenter servers have relied on Moore's Law. This strategy is insufficient as Dennard scaling ends and constrains the power efficiency of processor servers. Instead of relying on...

    Provided By Boston University

  • 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

    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 // 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 // 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 // Mar 2012

    Performance and Power Analysis of RCCE Message Passing on the Intel Single-Chip Cloud Computer

    The number of cores integrated on a single chip increases with each generation of computers. Traditionally, a single Operating System (OS) manages all the cores and resource allocation on a multi-core chip. Intel's Single-chip Cloud Computer (SCC), a manycore processor built for research use with 48 cores, is an implementation...

    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 2010

    Camera-Based Interfaces and Assistive Software for People With Severe Motion Impairments

    Intelligent assistive technology can greatly improve the daily lives of people with severe paralysis, who have limited communication abilities. People with motion impairments often prefer camera-based communication interfaces, because these are customizable, comfortable, and do not require user-borne accessories that could draw attention to their disability. The authors present an...

    Provided By Boston University

  • White Papers // Feb 2009

    Movement and Recovery Analysis of a Mouse-Replacement Interface for Users With Severe Disabilities

    The Camera Mouse is a mouse-replacement interface for users with movement impairments. It tracks a selected body feature, such as the nose, eyebrow or finger, through a web camera and translates the user's movements to movements of the mouse pointer. Occasionally, the Camera Mouse loses the feature being tracked, when...

    Provided By Boston University

  • White Papers // May 2009

    RefLink: An Interface That Enables People With Motion Impairments to Analyze Web Content and Dynamically Link to References

    In this paper, the authors present RefLink, an interface that allows users to analyze the content of web page by dynamically linking to an online encyclopedia such as Wikipedia. Upon opening a webpage, RefLink instantly provides a list of terms extracted from the webpage and annotates each term by the...

    Provided By Boston University

  • White Papers // Jul 2010

    Towards a Multi-Camera Mouse-Replacement Interface

    The authors present the efforts towards a multi-camera mouse-replacement system for computer users with severe motion impairments. They have worked with individuals with cerebral palsy or multiple sclerosis who use a publicly available interface that tracks the user's head movements with a single video camera and translates them into mouse...

    Provided By Boston University

  • White Papers // Jan 2011

    Basis Token Consistency: Supporting Strong Web Cache Consistency

    With web caching and cache-related services like CDNs and edge services playing an increasingly significant role in the modern Internet, the problem of the weak consistency and coherence provisions in current web protocols is drawing increasing attention. Toward this end, the authors differentiate definitions of consistency and coherence for web-like...

    Provided By Boston University

  • White Papers // Feb 2011

    Quantifying And Modeling Long-range Cross-correlations In Multiple Time Series With Applications To World Stock Indices

    The authors propose a modified time lag random matrix theory in order to study time lag cross-correlations in multiple time series. They apply the method to 48 world indices, one for each of 48 different countries. They find long-range power-law cross-correlations in the absolute values of returns that quantify risk,...

    Provided By Boston University

  • White Papers // Mar 2011

    A Copula Approach On The Dynamics Of Statistical Dependencies In The US Stock Market

    The authors analyze the statistical dependency structure of the S&P 500 constituents in the 4-year period from 2007 to 2010 using intraday data from the New York Stock Exchange's TAQ database. With a copula-based approach, they find that the statistical dependencies are very strong in the tails of the marginal...

    Provided By Boston University

  • White Papers // Nov 2010

    Bankruptcy Risk Model And Empirical Tests

    The authors analyze the size-dependence and temporal stability of firm bankruptcy risk in the US economy by applying Zipf scaling techniques. They focus on a single risk factor - the debt-to-asset ratio R - in order to study the stability of the Zipf distribution of R over time. They find...

    Provided By Boston University

  • White Papers // May 2011

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

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

    Provided By Boston University

  • White Papers // Feb 2011

    The Filter-Placement Problem and Its Application to Content De-Duplication

    In many information networks, data items - such as updates in social networks, news flowing through interconnected RSS feeds and blogs, measurements in sensor networks, route updates in ad-hoc networks, etc. - propagate in an uncoordinated manner: nodes often relay information they receive to neighbors, independent of whether or not...

    Provided By Boston University

  • White Papers // Oct 2010

    Communicating Technical Knowledge

    In patent theory, the cost of communicating technical knowledge is small. In human capital theory, it is large. But evidence suggests that these costs are actually endogenous. Firms invest in reducing communication costs, but only when technology is sufficiently advanced. This can make competition different for early stage technologies: patents...

    Provided By Boston University

  • White Papers // Feb 2010

    Scale Invariant Properties Of Public Debt Growth

    Public debt is one of the important economic variables that quantitatively describe a nation's economy. Because bankruptcy is a risk faced even by institutions as large as governments (e.g. Iceland), national debt should be strictly controlled with respect to national wealth. Also, the problem of eliminating extreme poverty in the...

    Provided By Boston University

  • White Papers // Dec 2009

    The Structure And Growth Of Weighted Networks

    The authors develop a simple theoretical framework for the evolution of weighted networks that is consistent with a number of stylized features of real-world data. In the framework, the Barabasi-Albert model of network evolution is extended by assuming that link weights evolve according to a geometric Brownian motion. The model...

    Provided By Boston University

  • White Papers // Dec 2008

    Influence Of Corruption On Economic Growth Rate And Foreign Investments

    In order to investigate whether government regulations against corruption can affect the economic growth of a country, the authors analyze the dependence between Gross Domestic Product (GDP) per capita growth rates and changes in the Corruption Perceptions Index (CPI). For the period 1999-2004 on average for all countries in the...

    Provided By Boston University

  • White Papers // Jan 2011

    iJoin: Importance-Aware Join Approximation Over Data Streams

    The authors consider approximate join processing over data streams when memory limitations cause incoming tuples to overflow the available space, precluding exact processing. Selective eviction of tuples (load-shedding) is needed, but is challenging since data distributions and arrival rates are unknown a priori. Also, in many real-world applications such as...

    Provided By Boston University

  • White Papers // Jun 2010

    On The Dynamics Of Unemployment And Wage Distributions

    Postel-Vinay and Robin's (2002) sequential auction model is extended to allow for aggregate productivity shocks. Workers exhibit permanent differences in ability while firms are identical. Negative aggregate productivity shocks induce job destruction by driving the surplus of matches with low ability workers to negative values. Endogenous job destruction coupled with...

    Provided By Boston University

  • White Papers // Sep 2010

    Credit Risk And Business Cycles

    The authors incorporate long-term defaultable corporate bonds and credit risk in a dynamic stochastic general equilibrium business cycle model. Credit risk amplifies aggregate technology shocks. The debt-capital ratio is a new state variable and its endogenous movements provide a propagation mechanism. The model can match the persistence and volatility of...

    Provided By Boston University

  • White Papers // Jan 2010

    Does Lumpy Investment Matter For Business Cycles?

    The authors present an analytically tractable general equilibrium business cycle model that features micro-level investment lumpiness. They prove an exact irrelevance proposition which provides sufficient conditions on preferences, technology, and the fixed cost distribution such that any positive upper support of the fixed cost distribution yields identical equilibrium dynamics of...

    Provided By Boston University

  • White Papers // Oct 2009

    Impact of Asymmetric Traffic Densities on Delay Tolerant Vehicular Ad Hoc Networks

    Vehicular networking can be achieved with short, medium, or long-range communication technologies. However, there are trade-offs in the adoption of these technologies including data capacity, continuity of connections, energy use and contention with other users. The authors focus on short range technologies that support both near-neighbor communication, for safety applications,...

    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 // 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 // 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 // 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 // Jan 2011

    Cross Layer Design to Multi-Thread a Data-Pipelining Application on a Multi-Processor on Chip

    Data-Pipelining is a widely used model to represent streaming applications. Incremental decomposition and optimization of a data-pipelining application onto a multi-processor platform spans multiple design layers, including the application layer, the system software layer, the architecture layer and the micro-architecture layer. For best results, designers have to consider multiple design...

    Provided By Boston University