• Corpus ID: 18496766

Overcast: reliable multicasting with on overlay network

  title={Overcast: reliable multicasting with on overlay network},
  author={John Jannotti and David Kenneth Gifford and Kirk L. Johnson and M. Frans Kaashoek and James W. O'Toole},
  booktitle={USENIX Symposium on Operating Systems Design and Implementation},
Overcast is an application-level multicasting system that can be incrementally deployed using today's Internet infrastructure. [] Key MethodOvercast provides scalable and reliable single-source multicast using a simple protocol for building efficient data distribution trees that adapt to changing network conditions. To support fast joins, Overcast implements a new protocol for efficiently tracking the global status of a changing distribution tree. Results based on simulations confirm that Overcast provides…

Figures from this paper

Building and maintaining overlay networks for bandwidth-demanding applications

A distributed algorithm to build an overlay multicast tree is proposed for streaming media distribution and shows that for paths with a common synchronization point, DCW provides faster convergence and higher accuracy while using fewer packets than previous techniques.

Multicasting in Overlays with Network Layer Support # 355

  • Computer Science
  • 2007
This work presents two router-based primitives that help end-hosts alleviate inefficiencies in overlay networks and indicates that when all routers support the proposed primitives, the system incurs less than 5% overhead (in terms of link usage and latency).

Performance and functionality in overlay networks

This thesis presents an overlay approach that can substantially decrease the number of delayed packets in wide area reliable communication and increase the delivery ratio of best effort communication, leading to improved performance in time-sensitive applications such as Voice over IP.

Bullet: high bandwidth data dissemination using an overlay mesh

This paper presents Bullet, a scalable and distributed algorithm that enables nodes spread across the Internet to self-organize into a high bandwidth overlay mesh, and finds that, relative to tree-based solutions, Bullet reduces the need to perform expensive bandwidth probing.

Scalable Overlay Multicast Tree Construction for Media Streaming

This paper compares various methods to construct multicast trees between end-systems, that vary in terms of implementation costs and their quality of mapping from logical overlay to physical network.

Routing in overlay multicast networks

  • S. ShiJ. Turner
  • Computer Science, Business
    Proceedings.Twenty-First Annual Joint Conference of the IEEE Computer and Communications Societies
  • 2002
This paper introduces several routing algorithms that are suitable for overlay multicast networks and evaluates their performance, and proposes several heuristic algorithms that seek to optimize the end-to-end delay and the interface bandwidth usage at the routing sites within the overlay network.

Overlay Tree Maintenance in Large-Scale Dynamic Networks

It is shown that the efficiency of a tree overlay can instead be exploited directly in dynamic networks, achieving efficient communication with low overhead for tree maintenance.

A dynamically adaptive, unstructured multicast overlay

This work introduces a new unstructured multi-source multicast (UMM) overlay approach that it is argued is less complex than, but as efficient as, current state-of-the-art solutions based either on structured overlays or on running full routing protocols at the overlay level.

UMM : A dynamically adaptive , unstructured multicast overlay

This work introduces a new unstructured multi-source multicast (UMM) overlay approach that it is argued is less complex than, but as efficient as, current state-of-the-art solutions based either on structured overlays or on running full routing protocols at the overlay level.

Application-layer multicasting with Delaunay triangulation overlays

An application-layer multicast solution that uses a Delaunay triangulation as an overlay network topology that allows each application to locally derive next-hop routing information without requiring a routing protocol in the overlay.



RMX: reliable multicast for heterogeneous networks

  • Y. ChawatheS. McCanneE. Brewer
  • Computer Science, Business
    Proceedings IEEE INFOCOM 2000. Conference on Computer Communications. Nineteenth Annual Joint Conference of the IEEE Computer and Communications Societies (Cat. No.00CH37064)
  • 2000
A radical departure from the traditional end-to-end model for reliable multicast is proposed and instead a hybrid approach that leverages the successes of unicast reliability protocols such as TCP while retaining the efficiency of IP multicast for multi-point data delivery is proposed.

Multicast routing in a datagram internetwork

This work presents a new service model for multicasting in a datagram (or connectionless) internetwork, and a set of new store-and-forward multicast routing algorithms to support that service model.

A case for end system multicast

The potential benefits of transferring multicast functionality from end systems to routers significantly outweigh the performance penalty incurred and the results indicate that the performance penalties are low both from the application and the network perspectives.

An active service framework and its application to real-time multimedia transcoding

The initial experience indicates that the active services prototype provides a very flexible and programmable platform for intra-network computation that strikes a good balance between the flexibility of the active networks architecture and the practical constraints of incremental deployment in the current Internet.

IP multicast channels: EXPRESS support for large-scale single-source applications

This paper proposes an extension to IP multicast to support the channel model of multicast and describes a specific realization called EXPlicitly REquested Single-Source (EXPRESS) multicast, which supports both channel subscription and efficient collection of channel information such as subscriber count.

Seamlessly Selecting the Best Copy from Internet-Wide Replicated Web Servers

This paper presents a new approach to web replication, where each of the replicas resides in a different part of the network, and the browser is automatically and transparently directed to the “best” server.

A survey of active network research

It is illustrated how the routers of an IP network could be augmented to perform such customized processing on the datagrams flowing through them, and these active routers could also interoperate with legacy routers, which transparently forwarddatagrams in the traditional manner.

A case for caching file objects inside internetworks

Evidence is presented that several, judiciously placed file caches could reduce the volume of FTP traffic by 42%, and hence theVolume of all NSFNET backbone traffic by 21%, and if FTP client and server software automatically compressed data, this savings could increase to 27%.

Speculative data dissemination and service to reduce server load, network traffic and service time in distributed information systems

  • Azer Bestavros
  • Computer Science
    Proceedings of the Twelfth International Conference on Data Engineering
  • 1996
Two server-initiated protocols to improve the performance of distributed information systems (e.g. WWW) are presented, whereby a request for a document is serviced by sending, in addition to the document requested, a number of other documents that the server speculates will be requested in the near future.

FLIP: an internetwork protocol for supporting distributed systems

By using FLIP, a new protocol is designed that provides both point-to-point communication and multicast communication, and requires almost no network management, and enhanced support for process migration and security.