Princeton University

Displaying 1-40 of 219 results

  • White Papers // Mar 2012

    Serval: An End-Host Stack for Service-Centric Networking

    Internet services run on multiple servers in different locations, serving clients that are often mobile and multi-homed. This does not match well with today's network stack, designed for communication between fixed hosts with topology-dependent addresses. As a result, online service providers resort to clumsy and management intensive work-arounds - forfeiting...

    Provided By Princeton University

  • White Papers // Mar 2012

    An Analytical Approach to the Adoption of Asymmetric Bidirectional Firewalls: Need for Regulation?

    Recent incidents of cyber-security violations have revealed the importance of having firewalls and other intrusion detection systems to monitor traffic entering and leaving access networks. But the adoption of such security measures is often stymied by 'Free-riding' effects and 'Shortsightedness' among Internet Service Providers (ISPs). In this paper, the authors...

    Provided By Princeton University

  • White Papers // Feb 2012

    Network Formation Games Among Relay Stations in Next Generation Wireless Networks

    The introduction of Relay Station (RS) nodes is a key feature in next generation wireless networks such as 3GPP's Long Term Evolution Advanced (LTE-Advanced), or the forthcoming IEEE 802.16j WiMAX standard. This paper presents, using game theory, a novel approach for the formation of the tree architecture that connects the...

    Provided By Princeton University

  • White Papers // Jan 2012

    Commensal Cuckoo: Secure Group Partitioning for Large-Scale Services

    The authors present commensal cuckoo, a secure group partitioning scheme for large-scale systems that maintains the correctness of many small groups, despite a Byzantine adversary that controls a constant (global) fraction of all nodes. In particular, the adversary is allowed to repeatedly rejoin faulty nodes to the system in an...

    Provided By Princeton University

  • White Papers // Jan 2012

    ILC: A Foundation for Automated Reasoning About Pointer Programs

    This paper shows how to use Girard's intuitionistic linear logic extended with a classical sublogic to reason about pointer programs. More specifically, first, the paper defines the proof theory for ILC (Intuitionistic Linear logic with Constraints) and shows it is well-defined via a proof of cut elimination. Second, inspired by...

    Provided By Princeton University

  • White Papers // Jan 2012

    A Distributed Sorting Framework for Ad Hoc Wireless Sensor Networks

    Wireless Sensor Networks (WSN) are distributed, self-organizing, pervasive systems, which perform collaborative computations to provide useful information about the underlying stochastic phenomenon. In this paper, the authors explore the ranking and sorting problems in distributed sensor networks which provide perspectives in understanding certain fundamental issues in WSN, as well as...

    Provided By Princeton University

  • White Papers // Dec 2011

    Multi-Resource Allocation: Fairness-Efficiency Tradeoffs in a Unifying Framework

    Quantifying the notion of fairness is under-explored when users request different ratios of multiple distinct resource types. A typical example is datacenters processing jobs with heterogeneous resource requirements on CPU, memory, etc. A generalization of max-min fairness to multiple resources was recently proposed in, but may suffer from significant loss...

    Provided By Princeton University

  • White Papers // Dec 2011

    Language Abstractions for Software-Defined Networks

    For the past 30 years, networks have been built the same way: out of special-purpose devices running distributed algorithms that provide functionality such as topology discovery, routing, traffic monitoring, and access control. Recent years, however, have seen growing interest in a new kind of network architecture in which a logically-centralized...

    Provided By Princeton University

  • White Papers // Nov 2011

    LearnPADS++ Incremental Inference of Ad Hoc Data Formats

    An ad hoc data source is any semi-structured, non-standard data source. The format of such data sources is often evolving and frequently lacking documentation. Consequently, off-the-shelf tools for processing such data often do not exist, forcing analysts to develop their own tools, a costly and time-consuming process. In this paper,...

    Provided By Princeton University

  • White Papers // Oct 2011

    Pricing by Timing: Innovating Broadband Data Plans

    Wireless Internet data usage is doubling every year. Users are consuming more of high-bandwidth data applications, with usage concentrated on several peak hours in a day. The authors review many of the pricing schemes in practice today and analyze why they do not solve this problem of growing data traffic....

    Provided By Princeton University

  • White Papers // Aug 2011

    The Diversity-Multiplexing-Delay Tradeoff in MIMO Multihop Networks With ARQ

    The authors study the tradeoff between reliability, data rate, and delay for half-duplex MIMO multi-hop networks that utilize the Automatic-Retransmission-reQuest (ARQ) protocol both in the asymptotic high Signal-to-Noise Ratio (SNR) regime and in the finite SNR regime. They propose novel ARQ protocol designs that optimize these tradeoffs. In particular, they...

    Provided By Princeton University

  • White Papers // Aug 2011

    Toward a Lightweight Model of BGP Safety

    For the past ten years, researchers have used the Stable Paths Problem (SPP) to analyze the stability properties of the Border Gateway Protocol (BGP). Analysis of SPP has revealed several combinations of topologies and routing configurations (or gadgets) where BGP cannot converge to a unique stable solution. Researchers typically analyze...

    Provided By Princeton University

  • White Papers // Aug 2011

    Fair Greening of Broadband Access: Spectrum Management for Energy-Efficient DSL Networks

    Dynamic Spectrum Management (DSM) is recognized as a promising technology to reduce power consumption in DSL access networks. However, the correct formulation of power-aware DSM problem statements requires a proper understanding of greening, i.e., reducing power consumption. In this paper, the authors therefore investigate greening and show that it can...

    Provided By Princeton University

  • White Papers // Aug 2011

    Commensal Cuckoo: Secure Group Partitioning for LargeScale Services

    The authors present commensal cuckoo, a secure group partitioning scheme for large-scale systems that maintains the correctness of many small groups, despite a Byzantine adversary that controls a constant (global) fraction of all nodes. In particular, the adversary is allowed to repeatedly rejoin faulty nodes to the system in an...

    Provided By Princeton University

  • White Papers // Aug 2011

    ARIADNE: Agnostic Reconfiguration in a Disconnected Network Environment

    Extreme transistor technology scaling is causing increasing concerns in device reliability: the expected lifetime of individual transistors in complex chips is quickly decreasing, and the problem is expected to worsen at future technology nodes. With complex designs increasingly relying on Networks-on-Chip (NoCs) for on-chip data transfers, a NoC must continue...

    Provided By Princeton University

  • White Papers // Jul 2011

    Hiding Amongst the Clouds: A Proposal for Cloud-Based Onion Routing

    Internet censorship and surveillance have made anonymity tools increasingly critical for free and open Internet access. Tor, and its associated ecosystem of volunteer traffic relays, provides one of the most secure and widely-available means for achieving Internet anonymity today. Unfortunately, Tor has limitations, including poor performance, inadequate capacity, and a...

    Provided By Princeton University

  • White Papers // Jun 2011

    Coercing Clients Into Facilitating Failover for Object Delivery

    Application-level protocols used for object delivery, such as HTTP, are built atop TCP/IP and inherit its host-to-host abstraction. Given that these services are replicated for scalability, this unnecessarily exposes failures of individual servers to their clients. While changes to both client and server applications can be used to mask such...

    Provided By Princeton University

  • White Papers // May 2011

    Levels of Awareness: Design Considerations for Web Crawlers and Censorware Detection

    Search engines are tremendous force-multipliers for end-hosts trying to discover content on the Web. As the amount of content online grows, so does dependence on web crawlers to discover content. The desire for adversaries to censor search engines from detecting content on the Internet has scaled accordingly. Web crawlers, programs...

    Provided By Princeton University

  • White Papers // Apr 2011

    Identifying Performance Bottlenecks in CDNs Through TCP-Level Monitoring

    Content Distribution Networks (CDNs) need to make decisions, such as server selection and routing, to improve performance for their clients. The performance may be limited by various factors such as packet loss in the network, a small receive buffer at the client, or constrained server CPU and disk resources. Conventional...

    Provided By Princeton University

  • White Papers // Apr 2011

    A List-Machine Benchmark for Mechanized Metatheory

    The authors propose a benchmark to compare theorem-proving systems on their ability to express proofs of compiler correctness. In contrast to the first POPL-mark, they emphasize the connection of proofs to compiler implementations, and they point out that much can be done without binders or alpha-conversion. They propose specific criteria...

    Provided By Princeton University

  • White Papers // Apr 2011

    Modular Protections Against Non-Control Data Attacks

    This paper introduces YARRA, a conservative extension to C to protect applications from non-control data attacks. YARRA programmers specify their data integrity requirements by declaring critical data types and ascribing these critical types to important data structures. YARRA guarantees that such critical data is only written through pointers with the...

    Provided By Princeton University

  • White Papers // Mar 2011

    Frenetic: A Network Programming Language

    Modern networks provide a variety of interrelated services including routing, traffic monitoring, load balancing, and access control. Unfortunately, the languages used to program today's networks lack modern features they are usually defined at the low level of abstraction supplied by the underlying hardware and they fail to provide even rudimentary...

    Provided By Princeton University

  • White Papers // Mar 2011

    Time-Dependent Broadband Pricing: Feasibility and Benefits

    Charging different prices for Internet access at different times induces users to spread out their bandwidth consumption across times of the day. Potential impact on ISP revenue, congestion management, and consumer behavior can be significant, yet some fundamental questions remain: is it feasible to operate time dependent pricing and how...

    Provided By Princeton University

  • White Papers // Mar 2011

    Profiling Network Performance for Multi-Tier Data Center Applications

    Network performance problems are notoriously tricky to diagnose, and this is magnified when applications are often split into multiple tiers of application components spread across thousands of servers in a data center. Problems often arise in the communication between the tiers, where either the application or the network (or both!)...

    Provided By Princeton University

  • White Papers // Mar 2011

    SSDAlloc: Hybrid SSD/RAM Memory Management Made Easy

    The authors introduce SSDAlloc, a hybrid main memory management system that allows developers to treat Solid-State Disk (SSD) as an extension of the RAM in a system. SSDAlloc moves the SSD upward in the memory hierarchy, usable as a larger, slower form of RAM instead of just a cache for...

    Provided By Princeton University

  • White Papers // Feb 2011

    A Macroeconomic Model With A Financial Sector

    This paper studies the full equilibrium dynamics of an economy with financial frictions. Due to highly non-linear amplification effects, the economy is prone to instability and occasionally enters volatile episodes. Risk is endogenous and asset price correlations are high in down turns. In an environment of low exogenous risk experts...

    Provided By Princeton University

  • White Papers // Feb 2011

    Investing In Schooling In Chile: The Role Of Information About Financial Aid For Higher Education

    Recent economic research shows that imperfect information about Mincer returns to education (in developing countries) or about financial aid (in the US) may undermine investments in schooling and exacerbate inequalities in access to education. The authors extend this literature by presenting the results of an experiment that provided children and...

    Provided By Princeton University

  • White Papers // Feb 2011

    Let the Market Drive Deployment: A Strategy for Transitioning to BGP Security

    With a cryptographic root-of-trust for Internet routing (RPKI) on the horizon, the authors can finally start planning the deployment of one of the secure interdomain routing protocols proposed over a decade ago (Secure BGP, secure origin BGP). However, if experience with IPv6 is any indicator, this will be no easy...

    Provided By Princeton University

  • White Papers // Feb 2011

    A Survey of Virtual LAN Usage in Campus Networks

    VLANs are widely used in today's enterprise networks to improve Ethernet scalability and support network policies. However, manuals and textbooks offer very little information about how VLANs are actually used in practice. Through discussions with network administrators and analysis of configuration data, the authors describe how three university campuses and...

    Provided By Princeton University

  • White Papers // Jan 2011

    A Service Access Layer, at Your Service

    Historically, Internet services provided clients with access to the resources of a particular host. However, today's services are no longer defined by a single host or confined to a fixed location. Yet, the network architecture continues to impose an unfortunate coupling between hosts and services by binding connections to topology-dependent...

    Provided By Princeton University

  • White Papers // Jan 2011

    Is There Learning By Exporting: Evidence From The Automobile Industry In China

    Do exporters learn from their exporting experience? While this question seems to have been proven in theory, it nevertheless needs to be tested empirically. In this paper, the author uses an approach, suggested by De Loecker, which corrects for econometric and consistency problems, to estimate productivity. Using data from the...

    Provided By Princeton University

  • White Papers // Jan 2011

    There's Something About MRAI: Timing Diversity May Exponentially Worsen BGP Convergence

    To better support interactive applications, individual network operators are decreasing the timers that affect BGP convergence, leading to greater diversity in the timer settings across the Internet. While decreasing timers is intended to improve routing convergence, the authors show that, ironically, the resulting timer heterogeneity can make routing convergence substantially...

    Provided By Princeton University

  • White Papers // Jan 2011

    BGP Safety With Spurious Updates

    The authors explore BGP safety, the question of whether a BGP system converges to a stable routing, in light of several BGP implementation features that have not been fully included in the previous theoretical analyses. They show that Route Flap Damping, MRAI timers, and other intra-router features can cause a...

    Provided By Princeton University

  • White Papers // Jan 2011

    Job Search And Job Finding In A Period Of Mass Unemployment: Evidence From High-Frequency Longitudinal Data

    Several findings in this paper shed light on job search behavior in a depressed job market. Some findings are consistent with the Mortensen (1977) sequential job search model and others are inconsistent with it. In contrast to the prediction of sequential, stationary job search model, the authors find that the...

    Provided By Princeton University

  • White Papers // Jan 2011

    Routing as a Service

    In Internet routing, there is a fundamental tussle between the end users who want control over the end-to-end paths and the Autonomous Systems (ASes) who want control over the flow of traffic through their infrastructure. To resolve this tussle and offer flexible routing control across multiple routing domains, the authors...

    Provided By Princeton University

  • White Papers // Jan 2011

    Optimality Certificate of Dynamic Spectrum Management in Multi-Carrier Interference Channels

    The multi-carrier interference channel where interference is treated as additive white Gaussian noise, is a very active topic of research, particularly important in the area of Dynamic Spectrum Management (DSM) for Digital Subscriber Lines (DSL). Here, multiple users optimize their transmit power spectra so as to maximize the total weighted...

    Provided By Princeton University

  • White Papers // Jan 2011

    A General and Flexible Access-Control System for the Web

    The authors describe the design, implementation, and performance of a new system for access control on the web. To achieve greater flexibility in forming access-control policies-in particular, to allow better interoperability across administrative boundaries-the authors base the system on the ideas of Proof-Carrying Authorization (PCA). The authors extend PCA with...

    Provided By Princeton University

  • White Papers // Jan 2011

    Power-Driven Design of Router Microarchitectures in On-Chip Networks

    As demand for bandwidth increases in systems-on-a-chip and chip multiprocessors, networks are fast replacing buses and dedicated wires as the pervasive interconnect fabric for on-chip communication. The tight delay requirements faced by on-chip networks have resulted in prior microarchitectures being largely performance-driven. While performance is a critical metric, on-chip networks...

    Provided By Princeton University

  • White Papers // Jan 2011

    Viewpoint-Coded Structured Light

    The authors introduce a theoretical framework and practical algorithms for replacing time-coded structured light patterns with viewpoint codes, in the form of additional camera locations. Current structured light methods typically use log (N) light patterns, encoded over time, to unambiguously reconstruct N unique depths. They demonstrate that each additional camera...

    Provided By Princeton University

  • White Papers // Jan 2011

    A Planar-Reflective Symmetry Transform for 3D Shapes

    Symmetry is an important cue for many applications, including object alignment, recognition, and segmentation. In this paper, the authors describe a Planar Reflective Symmetry Transform (PRST) that captures a continuous measure of the reflectional symmetry of a shape with respect to all possible planes. This transform combines and extends previous...

    Provided By Princeton University

  • White Papers // Apr 2008

    Sum-Capacity of Ergodic Fading Interference and Compound Multiaccess Channels

    The problem of resource allocation is studied for two-sender two-receiver fading Gaussian InterFerence Channels (IFCs) and Compound Multi-Access Channels (C-MACs). The senders in an IFC communicate with their own receiver (unicast) while those in a C-MAC communicate with both receivers (multicast). The instantaneous fading state between every transmit-receive pair in...

    Provided By Princeton University

  • White Papers // Jun 2008

    Lossy Source Transmission Over the Relay Channel

    Lossy transmission over a relay channel in which the relay has access to correlated side information is considered. First, a joint source-channel decode-and-forward scheme is proposed for general discrete memoryless sources and channels. Then the Gaussian relay channel where the source and the side information are jointly Gaussian is analyzed....

    Provided By Princeton University

  • White Papers // Jun 2008

    Lossless Compression With Security Constraints

    Secure distributed data compression in the presence of an eavesdropper is explored. Two correlated sources that need to be reliably transmitted to a legitimate receiver are available at separate encoders. Noise-free, limited rate links from the encoders to the legitimate receiver, one of which can also be perfectly observed by...

    Provided By Princeton University

  • White Papers // Sep 2008

    Ergodic Two-User Interference Channels: Is Separability Optimal?

    The optimality of separable encoding and decoding over parallel channels (fading states) for ergodic fading two-user InterFerence Channels (IFCs) is studied using a one-sided IFC as a model. For an ergodic fading one-sided IFC with non-fading direct links and a fading cross-channel link, it is shown that separability can be...

    Provided By Princeton University

  • White Papers // Mar 2012

    An Analytical Approach to the Adoption of Asymmetric Bidirectional Firewalls: Need for Regulation?

    Recent incidents of cyber-security violations have revealed the importance of having firewalls and other intrusion detection systems to monitor traffic entering and leaving access networks. But the adoption of such security measures is often stymied by 'Free-riding' effects and 'Shortsightedness' among Internet Service Providers (ISPs). In this paper, the authors...

    Provided By Princeton University

  • White Papers // Dec 2011

    Multi-Resource Allocation: Fairness-Efficiency Tradeoffs in a Unifying Framework

    Quantifying the notion of fairness is under-explored when users request different ratios of multiple distinct resource types. A typical example is datacenters processing jobs with heterogeneous resource requirements on CPU, memory, etc. A generalization of max-min fairness to multiple resources was recently proposed in, but may suffer from significant loss...

    Provided By Princeton University

  • White Papers // Mar 2011

    Time-Dependent Broadband Pricing: Feasibility and Benefits

    Charging different prices for Internet access at different times induces users to spread out their bandwidth consumption across times of the day. Potential impact on ISP revenue, congestion management, and consumer behavior can be significant, yet some fundamental questions remain: is it feasible to operate time dependent pricing and how...

    Provided By Princeton University

  • White Papers // Feb 2012

    Network Formation Games Among Relay Stations in Next Generation Wireless Networks

    The introduction of Relay Station (RS) nodes is a key feature in next generation wireless networks such as 3GPP's Long Term Evolution Advanced (LTE-Advanced), or the forthcoming IEEE 802.16j WiMAX standard. This paper presents, using game theory, a novel approach for the formation of the tree architecture that connects the...

    Provided By Princeton University

  • White Papers // Apr 2011

    A List-Machine Benchmark for Mechanized Metatheory

    The authors propose a benchmark to compare theorem-proving systems on their ability to express proofs of compiler correctness. In contrast to the first POPL-mark, they emphasize the connection of proofs to compiler implementations, and they point out that much can be done without binders or alpha-conversion. They propose specific criteria...

    Provided By Princeton University

  • White Papers // Mar 2012

    Serval: An End-Host Stack for Service-Centric Networking

    Internet services run on multiple servers in different locations, serving clients that are often mobile and multi-homed. This does not match well with today's network stack, designed for communication between fixed hosts with topology-dependent addresses. As a result, online service providers resort to clumsy and management intensive work-arounds - forfeiting...

    Provided By Princeton University

  • White Papers // Jan 2012

    Commensal Cuckoo: Secure Group Partitioning for Large-Scale Services

    The authors present commensal cuckoo, a secure group partitioning scheme for large-scale systems that maintains the correctness of many small groups, despite a Byzantine adversary that controls a constant (global) fraction of all nodes. In particular, the adversary is allowed to repeatedly rejoin faulty nodes to the system in an...

    Provided By Princeton University

  • White Papers // Jan 2012

    ILC: A Foundation for Automated Reasoning About Pointer Programs

    This paper shows how to use Girard's intuitionistic linear logic extended with a classical sublogic to reason about pointer programs. More specifically, first, the paper defines the proof theory for ILC (Intuitionistic Linear logic with Constraints) and shows it is well-defined via a proof of cut elimination. Second, inspired by...

    Provided By Princeton University

  • White Papers // Jan 2012

    A Distributed Sorting Framework for Ad Hoc Wireless Sensor Networks

    Wireless Sensor Networks (WSN) are distributed, self-organizing, pervasive systems, which perform collaborative computations to provide useful information about the underlying stochastic phenomenon. In this paper, the authors explore the ranking and sorting problems in distributed sensor networks which provide perspectives in understanding certain fundamental issues in WSN, as well as...

    Provided By Princeton University

  • White Papers // Oct 2008

    Interference Alignment for Secrecy

    This paper studies the frequency/time selective K-user Gaussian interference channel with secrecy constraints. Two distinct models, namely the interference channel with confidential messages and the one with an external eavesdropper, are analyzed. The key difference between the two models is the lack of Channel State Information (CSI) about the external...

    Provided By Princeton University

  • White Papers // Jun 2008

    Authentication Over Noisy Channels

    An authentication counterpart of Wyner's study of the wiretap channel is developed in this paper. More specifically, message authentication over noisy channels is studied while impersonation and substitution attacks are investigated for both single and multiple message scenarios. For each scenario, information theoretic lower and upper bounds on the opponent's...

    Provided By Princeton University

  • White Papers // Aug 2011

    ARIADNE: Agnostic Reconfiguration in a Disconnected Network Environment

    Extreme transistor technology scaling is causing increasing concerns in device reliability: the expected lifetime of individual transistors in complex chips is quickly decreasing, and the problem is expected to worsen at future technology nodes. With complex designs increasingly relying on Networks-on-Chip (NoCs) for on-chip data transfers, a NoC must continue...

    Provided By Princeton University

  • White Papers // Apr 2008

    Rateless Coding for MIMO Block Fading Channels

    In this paper the performance limits and design principles of rateless codes over fading channels are studied. The Diversity-Multiplexing Tradeoff (DMT) is used to analyze the system performance for all possible transmission rates. It is revealed from the analysis that the design of such rateless codes follows the design principle...

    Provided By Princeton University

  • White Papers // Dec 2011

    Language Abstractions for Software-Defined Networks

    For the past 30 years, networks have been built the same way: out of special-purpose devices running distributed algorithms that provide functionality such as topology discovery, routing, traffic monitoring, and access control. Recent years, however, have seen growing interest in a new kind of network architecture in which a logically-centralized...

    Provided By Princeton University

  • White Papers // Jun 2009

    Some Consequences of Paper Fingerprinting for Elections

    Recent research has demonstrated that individual pieces of paper can be fingerprinted and re-identified later at low cost, using commodity scanners. The authors consider the consequences of this fact for electronic voting. The most obvious consequence is negative: the ability to fingerprint paper endangers the secrecy of ballots in any...

    Provided By Princeton University

  • White Papers // Mar 2010

    P2P Streaming Capacity Under Node Degree Bound

    Two of the fundamental problems in Peer-To-Peer (P2P) streaming are as follows: what is the maximum streaming rate that can be sustained for all receivers, and what peering algorithms can achieve close to this maximum? These problems of computing and approaching the P2P streaming capacity are often challenging because of...

    Provided By Princeton University

  • White Papers // Nov 2009

    P2P Streaming Capacity: Survey and Recent Results

    Peer-To-Peer (P2P) systems provide a scalable way to stream content to multiple receivers over the Internet and has become a major type of application traffic. The maximum rate achievable by all receivers is the capacity of a P2P streaming session. The authors provide a taxonomy of the problem formulations. In...

    Provided By Princeton University

  • White Papers // Aug 2011

    Toward a Lightweight Model of BGP Safety

    For the past ten years, researchers have used the Stable Paths Problem (SPP) to analyze the stability properties of the Border Gateway Protocol (BGP). Analysis of SPP has revealed several combinations of topologies and routing configurations (or gadgets) where BGP cannot converge to a unique stable solution. Researchers typically analyze...

    Provided By Princeton University

  • White Papers // Aug 2011

    Commensal Cuckoo: Secure Group Partitioning for LargeScale Services

    The authors present commensal cuckoo, a secure group partitioning scheme for large-scale systems that maintains the correctness of many small groups, despite a Byzantine adversary that controls a constant (global) fraction of all nodes. In particular, the adversary is allowed to repeatedly rejoin faulty nodes to the system in an...

    Provided By Princeton University

  • White Papers // Jun 2011

    Coercing Clients Into Facilitating Failover for Object Delivery

    Application-level protocols used for object delivery, such as HTTP, are built atop TCP/IP and inherit its host-to-host abstraction. Given that these services are replicated for scalability, this unnecessarily exposes failures of individual servers to their clients. While changes to both client and server applications can be used to mask such...

    Provided By Princeton University

  • White Papers // Mar 2010

    Experiences With CoralCDN: A Five-Year Operational View

    CoralCDN is a self-organizing web content distribution network (CDN). Publishing through CoralCDN is as simple as making a small change to a URL's hostname; a decentralized DNS layer transparently directs browsers to nearby participating cache nodes, which in turn cooperate to minimize load on the origin webserver. CoralCDN has been...

    Provided By Princeton University

  • White Papers // Apr 2009

    Secrecy Throughput of MANETs With Malicious Nodes

    MANETs represent one of the most innovative emerging networking technologies, with broad potential applications in personal area networks, emergency and rescue operations, military battlefield applications, etc. The unique features of MANETs, such as mobility and wireless communication, make MANETs a very flexible technology for establishing communication in areas with limited...

    Provided By Princeton University

  • White Papers // Nov 2011

    LearnPADS++ Incremental Inference of Ad Hoc Data Formats

    An ad hoc data source is any semi-structured, non-standard data source. The format of such data sources is often evolving and frequently lacking documentation. Consequently, off-the-shelf tools for processing such data often do not exist, forcing analysts to develop their own tools, a costly and time-consuming process. In this paper,...

    Provided By Princeton University

  • White Papers // Jul 2009

    Maximizing Sum Rate and Minimizing MSE on Multiuser Downlink: Optimality, Fast Algorithms and Equivalence Via Max-Min SIR

    Maximizing the minimum weighted SIR, minimizing the weighted sum MSE and maximizing the weighted sum rate in a multiuser downlink system are three important performance objectives in joint transceiver and power optimization, where all the users have a total power constraint. The authors show that, through connections with the nonlinear...

    Provided By Princeton University

  • White Papers // Aug 2011

    Fair Greening of Broadband Access: Spectrum Management for Energy-Efficient DSL Networks

    Dynamic Spectrum Management (DSM) is recognized as a promising technology to reduce power consumption in DSL access networks. However, the correct formulation of power-aware DSM problem statements requires a proper understanding of greening, i.e., reducing power consumption. In this paper, the authors therefore investigate greening and show that it can...

    Provided By Princeton University

  • White Papers // May 2009

    Fair Greening for DSL Broadband Access

    Given that broadband access networks are an integral part of the ICT infrastructure and that DSL is the most widely deployed broadband access technology, greening DSL has become important. The authors' recent work demonstrated a promising trade-off between data rate performance and energy conservation. However, more greening still implies possibly...

    Provided By Princeton University

  • White Papers // Jan 2011

    Optimality Certificate of Dynamic Spectrum Management in Multi-Carrier Interference Channels

    The multi-carrier interference channel where interference is treated as additive white Gaussian noise, is a very active topic of research, particularly important in the area of Dynamic Spectrum Management (DSM) for Digital Subscriber Lines (DSL). Here, multiple users optimize their transmit power spectra so as to maximize the total weighted...

    Provided By Princeton University

  • White Papers // Jun 2009

    Scheduling and Resource Allocation for SVC Streaming Over OFDM Downlink Systems

    The authors consider the problem of scheduling and resource allocation for multi-user video streaming over downlink OFDM channels. The video streams are precoded using the SVC scheme which offers both quality and temporal scalabilities. The OFDM technology provides the maximum flexibility of resource allocation in terms of time, frequency, and...

    Provided By Princeton University

  • White Papers // Jun 2008

    Implementation of Provably Stable MaxNet

    MaxNet TCP is a congestion control protocol that uses explicit multi-bit signalling from routers to achieve desirable properties such as high throughput and low latency. In this paper, the authors present an implementation of an extended version of MaxNet. Their contributions are threefold. First, they extend the original algorithm to...

    Provided By Princeton University

  • White Papers // Oct 2009

    Implementing Utility-Optimal CSMA

    Hundreds of papers over the last two decades have studied the theory of distributed scheduling in wireless networks, including a number of them on stability or utility maximizing random access. Several publications in 2008 studied an adaptive CSMA that in theory can approach utility optimality without any message passing under...

    Provided By Princeton University

  • White Papers // Oct 2011

    Pricing by Timing: Innovating Broadband Data Plans

    Wireless Internet data usage is doubling every year. Users are consuming more of high-bandwidth data applications, with usage concentrated on several peak hours in a day. The authors review many of the pricing schemes in practice today and analyze why they do not solve this problem of growing data traffic....

    Provided By Princeton University

  • White Papers // Jan 2010

    Partial Information Capacity for Interference Channels

    In distributed wireless networks, nodes often do not know the complete channel gain information of the network. Thus, they have to compute their transmission and reception parameters in a distributed fashion. In this paper, the authors consider the cases when each transmitter knows the channel gain to its intended receiver...

    Provided By Princeton University

  • White Papers // Mar 2009

    Multiple-Input Multiple-Output Gaussian Broadcast Channels With Confidential Messages

    This paper considers the problem of secret communication over a two-receiver Multiple-Input Multiple-Output (MIMO) Gaussian broadcast channel. The transmitter has two independent messages, each of which is intended for one of the receivers but needs to be kept asymptotically perfectly secret from the other. It is shown that, surprisingly, under...

    Provided By Princeton University

  • White Papers // Aug 2009

    Ergodic Layered Erasure One-Sided Interference Channels

    The capacity region of InterFerence Channels (IFCs), comprised of two or more interfering links (transmitter-receiver pairs), remains an open problem. The sum capacity of a non-fading two-user IFC is known only when the interference is either stronger or much weaker at the unintended than at the intended receiver. Recently, the...

    Provided By Princeton University

  • White Papers // Sep 2008

    A Comparison of Bilateral and Multilateral Exchanges for Peer-Assisted Content Distribution

    Peer-assisted content distribution matches user demand for content with available supply at other peers in the network. Inspired by this supply-and-demand interpretation of the nature of content sharing, the authors employ price theory to study peer-assisted content distribution. In this approach, the market-clearing prices are those which exactly align supply...

    Provided By Princeton University

  • White Papers // Mar 2010

    Prophecy: Using History for High-Throughput Fault Tolerance

    Byzantine Fault-Tolerant (BFT) replication has enjoyed a series of performance improvements, but remains costly due to its replicated work. The authors eliminate this cost for read-mostly workloads through Prophecy, a system that interposes itself between clients and any replicated service. At Prophecy's core is a trusted sketcher component, designed to...

    Provided By Princeton University