Learn More
Effective engineering of the Internet is predicated upon a detailed understanding of issues such as the large-scale structure of its underlying physical topology, the manner in which it evolves over time, and the way in which its constituent components contribute to its overall function. Unfortunately, developing a deep understanding of these issues has(More)
In the emerging area of sensor-based systems, a significant challenge is to develop scalable, fault-tolerant methods to extract useful information from the data the sensors collect. An approach to this data management problem is the use of sensor database systems, exemplified by TinyDB and Cougar, which allow users to perform aggregation queries such as(More)
Effective engineering of the Internet is predicated upon a detailed understanding of issues such as the large-scale structure of its underlying physical topology, the manner in which it evolves over time, and the way in which its constituent components contribute to its overall function. Unfortunately, developing a deep understanding of these issues has(More)
We describe Fair Layered Increase/Decrease with Dynamic Layering (FLID-DL), a new multi-rate congestion control algorithm for layered multicast sessions. FLID-DL generalizes the receiver-driven layered congestion (RLC) control protocol introduced by Vicisano, Rizzo, and Crowcroft, ameliorating the problems associated with large IGMP leave latencies and(More)
Goal: Discover the Internet Router Graph • Vertices represent routers, • Edges connect routers that are one IP hop apart Measurement Primitive: traceroute Reports the IP path from A to B i.e., how IP paths are overlaid on the router graph Computer Science • k sources: Few active sources, strategically located. • m destinations: Many passive destinations,(More)
Recent empirical studies [6] have shown that Internet topologies exhibit power laws of the form <i>y</i> = <i>x</i> <sup>&alpha;</sup> for the following relationships: (P1) outdegree of node (domain or router) versus rank; (P2) number of nodes versus outdegree; (P3) number of node pairs within a neighborhood versus neighborhood size (in hops); and (P4)(More)
—The proliferation of applications that must reliably distribute large, rich content to a vast number of autonomous receivers motivates the design of new multicast and broadcast protocols. We describe an ideal, fully scalable protocol for these applications that we call a digital fountain. A digital fountain allows any number of heterogeneous receivers to(More)
— A significant impediment to deployment of multicast services is the daunting technical complexity of developing , testing and validating congestion control protocols fit for wide-area deployment. Protocols such as pgmcc and TFMCC have recently made considerable progress on the single rate case, i.e. where one dynamic reception rate is maintained for all(More)
Overlay networks have emerged as a powerful and highly flexible method for delivering content. We study how to optimize throughput of large transfers across richly connected, adaptive overlay networks, focusing on the potential of collaborative transfers between peers to supplement ongoing downloads. First, we make the case for an erasure-resilient encoding(More)
Motivated by limitations in today's host-centric IP network , recent studies have proposed clean-slate network architectures centered around alternate first-class principals , such as content, services, or users. However, much like the host-centric IP design, elevating one principal type above others hinders communication between other principals and(More)