Boston University

Displaying 1-40 of 185 results

  • White Papers // Jun 2014

    Distributed Real-Time Fault Tolerance on a Virtualized Multi-Core System

    In this paper, the authors present different approaches for real-time fault tolerance using redundancy methods for multi-core systems. Using hardware virtualization, a distributed system on a chip is created, where the cores are isolated from one another except through explicit communication channels. Using this system architecture, redundant tasks that would...

    Provided By Boston University

  • 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 // Mar 2014

    Profiling EEMBC MultiBench Programs Using Full-System Simulations

    In this paper, the authors present the profiling of EEMBC parallel benchmark programs that is designed for the evaluation and future development of scalable SMP architectures. Modern Multi-Processor System-on-Chip (MPSoC) includes tens of IP blocks, such as CPUs, memories, input/output devices, and HW accelerators,. Figure 1 shows an example of...

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

    Quest-V: A Virtualized Multikernel for High-Confidence Systems

    In this paper, the authors outline the design of 'Quest-V', which is implemented as a collection of separate kernels operating together as a distributed system on a chip. Quest-V uses virtualization techniques to isolate kernels and prevent local faults from affecting remote kernels. This leads to a high-confidence multikernel approach,...

    Provided By Boston University

  • White Papers // Jan 2014

    On the Integration of Real-time Asynchronous Event Handling Mechanisms with Existing Operating System Services

    In this paper, the authors present an asynchronous event handling mechanism for real-time applications that leverages existing system services in COTS systems. In their implementation, event dispatching is initiated within bottom-half interrupt handling routines, in order to support predictable, safe, and efficient event handling functionality at user-level. They compare their...

    Provided By Boston University

  • White Papers // Jan 2014

    Mutable Protection Domains: Towards a Component-based System for Dependable and Predictable Computing

    The increasing complexity of software poses significant challenges for real-time and embedded systems beyond those based purely on timeliness. With embedded systems and applications running on everything from mobile phones, PDAs, to automobiles, aircraft and beyond, an emerging challenge is to ensure both the functional and timing correctness of complex...

    Provided By Boston University

  • White Papers // Oct 2013

    The Quest-V Separation Kernel for Mixed Criticality Systems

    Embedded systems are increasingly featuring multi and many-core processors, due in part to their power, performance and price benefits. These processors offer new opportunities for an increasingly significant class of mixed criticality systems. In mixed criticality systems, there is a combination of application and system components with different safety and...

    Provided By Boston University

  • White Papers // Sep 2013

    Optimizing Communication and Cooling Costs in HPC Data Centers via Intelligent Job Allocation

    Nearly half of the energy in the computing clusters today is consumed by the cooling infrastructure. It is possible to reduce the cooling cost by allowing the data center temperatures to rise; however, component reliability constraints impose thermal thresholds as failure rates are exponentially dependent on the processor temperatures. Existing...

    Provided By Boston University

  • White Papers // Aug 2013

    Autonomous Resource Sharing for Multi-Threaded Workloads in Virtualized Servers

    Multi-threaded applications from many application domains have started to appear on the cloud resources. Multi-threaded applications bring additional challenges to the management of the cloud resources, due to characteristics such as inter/intra-thread communication. In tandem, as the energy spent on computing continues to increase, the ability to provide energy-performance tradeoffs...

    Provided By Boston University

  • White Papers // Aug 2013

    Dynamic Server Power Capping for Enabling Data Center Participation in Power Markets

    Today's US power markets offer new opportunities for the energy consumers to reduce their energy costs by first promising an average consumption rate for the next hour and then by following a regulation signal broadcast by the Independent System Operators (ISOs), who need to match supply and demand in real...

    Provided By Boston University

  • White Papers // Jul 2013

    Dynamic Cache Pooling for Improving Energy Efficiency in 3D Stacked Multicore Processors

    Resource pooling, where multiple architectural components are shared among multiple cores, is a promising technique for improving the system energy efficiency and reducing the total chip area. 3D stacked multicore processors enable efficient pooling of cache resources owing to the short interconnect latency between vertically stacked layers. This paper introduces...

    Provided By Boston University

  • White Papers // Jun 2013

    vCap: Adaptive Power Capping for Virtualized Servers

    Power capping on server nodes has become an essential feature in data centers for controlling energy costs and peak power consumption. More than half of the server nodes are virtualized in today's data centers; thus, providing a practical power capping technique for consolidated virtual environments is a significant research problem....

    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

    Real-Time USB Communication in the Quest Operating System

    In this paper, the authors describe a real-time USB 2 subsystem for the quest operating system. Quest is designed for real-time embedded systems. Such systems need to interact with their environment using sensors and actuators. On many embedded platforms today there is support for basic serial, USB 2.0 and 100...

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

    Adaptive Energy-Efficient Resource Sharing for Multi-threaded Workloads in Virtualized Systems

    Computational demand on today's data centers is continuously increasing, as computing trends are shifting towards the cloud. The corresponding increases in energy consumption and management complexity remain as major challenges for data centers. Server virtualization provides opportunities to improve energy efficiency by reducing the number of physical servers through workload...

    Provided By Boston University

  • White Papers // Jun 2012

    Time Management in the Quest-V RTOS

    Quest-V is a new system currently under development for multicore processors. It comprises a collection of separate kernels operating together as a distributed system on a chip. Each kernel is isolated from others using virtualization techniques, so that faults do not propagate throughout the entire system. This multikernel design supports...

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

    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 fresh piece...

    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 // Oct 2009

    On Fair Sharing of Spectrum Via CSMA

    The authors contrast CSMA and TDMA schemes for medium access in spatially dispersed wireless networks under the primary interference model. CSMA is based on random access via dynamically tuned parameters, whereas TDMA involves periodic bursts that are offset in time so as to avoid packet collisions. They study TDMA in...

    Provided By Boston University

  • White Papers // Mar 2009

    On Spectrum Sharing in Narrowband Cellular Wireless Networks

    The authors study secondary spectrum sharing in narrow-band cellular networks in which calls in neighboring cells need to be assigned different channels. Analysis of such networks are in general difficult due to large state spaces and lack of closed form expressions. Here they consider linear topologies and show that they...

    Provided By Boston University

  • White Papers // Feb 2011

    Profitability of Dynamic Spectrum Provision for Secondary Use

    The authors characterize policies and prices for secondary spectrum provision whose profitability is insensitive to the demand curve. In more explicit terms, the paper provides a critical price value such that if secondary access is priced above that value then allowing secondary access is profitable for the licensee as long...

    Provided By Boston University

  • White Papers // Aug 2009

    Pricing Strategies for Spectrum Lease in Secondary Markets

    The authors develop analytical models to characterize pricing of spectrum rights in cellular CDMA networks. Specifically, they consider a primary license holder that aims to lease its spectrum within a certain geographic sub-region of its network. Such a transaction has two contrasting economic implications: On the one hand the lessor...

    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 // 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 // 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 // May 2010

    On the Cost of Supporting Mobility and Multihoming

    As the Internet has evolved and grown, an increasing number of nodes (hosts or autonomous systems) have become multihomed, i.e., a node is connected to more than one network. Multihoming can be viewed as a special case of Mobility - as a node moves, it unsubscribes from one network and...

    Provided By Boston University

  • White Papers // Oct 2010

    On Supporting Mobility and Multihoming in Recursive Internet Architectures

    As the Internet has evolved and grown, an increasing number of nodes (hosts or autonomous systems) have become multihomed, i.e., a node is connected to more than one network. Mobility can be viewed as a special case of multihoming - as a node moves, it unsubscribes from one network and...

    Provided By Boston University

  • White Papers // Apr 2009

    Seed Scheduling for Peer-to-Peer Networks

    The initial phase in a content distribution (file sharing) scenario is a delicate phase due to the lack of global knowledge and the dynamics of the overlay. An unwise distribution of the pieces in this phase can cause delays in reaching steady state, thus increasing file download times. The authors...

    Provided By Boston University

  • White Papers // Apr 2009

    On the Performance and Robustness of Managing Reliable Transport Connections

    The authors revisit the problem of connection management for reliable transport. At one extreme, a pure Soft-State (SS) approach safely removes the state of a connection at the sender and receiver once the state timers expire without the need for explicit removal messages. And new connections are established without an...

    Provided By Boston University

  • White Papers // Jan 2011

    Swarming on Optimized Graphs for N-Way Broadcast

    In this paper, the authors showed that swarming protocols for bulk data transfers perform much better when operating over optimized overlay topologies that take into consideration the end-to-end performance characteristics of the underlying network. Such topologies improve the aggregate transmission capacity of nodes, but where they make a huge difference...

    Provided By Boston University

  • White Papers // Feb 2010

    Mixture Models of Endhost Network Traffic

    In recent years there has been much interest in modeling internet traffic that comes from inside large networks, such as at routers or gateways. In this paper, the authors focus on modeling a little studied type of traffic - namely the network traffic generated from end-hosts. They study traffic data...

    Provided By Boston University

  • White Papers // Aug 2010

    A Modality for Safe Resource Sharing and Code Reentrancy

    The potential of linear logic in facilitating reasoning on resource usage has long been recognized. However, convincing uses of linear types in practical programming are still rather rare. In this paper, the authors present a general design to effectively support practical programming with linear types. In particular, they introduce and...

    Provided By Boston University