Andersen DG, Balakrishnan H, Kaashoek F, Morris R. The case for resilient overlay networks. In 8th Workshop on Hot Topics in Operating Systems, Elmau/Oberbayern, Germany, May 2001.  Home/Search   Document Details and Download   Summary   Related Articles   Check

....video streaming over conventional approach. B. Path Diversity for Single Sender Case Since multiple sender architecture cannot be used in interactive and live streaming applications, in this section, we describe the path diversity (PD) system in which multiple paths are created via relay nodes [14]. The system consists a set of participating nodes. At any instance, a node can act simultaneously as a receiver, a sender, or a relay node. A sender can send video packets to the receiver using the default Internet path or via a relay node which then forwards the video packets to the receiver. By ....

....selecting redundant path. In particular, we argue that finding two paths with absolute lowest loss rates for the proposed PD system may not be needed in practice due to two reasons: a) an active monitoring of probing packets and maintaining the link state information associated with all the paths [14] increase complexity and hence is not scalable; b) sending packets on two paths with the absolute lowest loss rates may not be necessary to achieve reasonable performance in a PD system with appropriate FEC protection level [9] Using router s names and round trip link delay between two nodes ....

D.G. Andersen, H. Balakrishnan, M.F. Kaashoek, and R. Morris, "The case for resilient overlay networks," in Proceeding of HotOS VIII,May 2001.

....is quite effective. In this paper, we extend our previous work to propose a single sender, single receiver, Path Diversification system with Forward error correction (PDF) over packet switched networks such as the Internet. Our proposed PDF system is similar to Resilient Overlay Network (RON) [11] in that it consists of a set of participating nodes that receive and forward packets to other nodes. Unlike RON however, our PDF system forwards packets simultaneously over multiple redundant paths rather than selecting an optimal path to send all the packets on. As we have shown previously ....

....a pair of senders and receivers on the Internet to result in uncorrelated loss patterns between paths. If the paths are not entirely disjoint, then the probability of congestion on the shared links between the paths must be small in order to minimize the overall end to end loss. Recent work [11] using RON, has shown how to route packets around all the observed outages between any pair of senders and receivers in an experimental network. This suggests the existence of path redundancy between nodes on the Internet. Many Internet topological models such as Albert Barabasi [12] also exhibit ....

[Article contains additional citation context not shown here]

D.G. Andersen, H. Balakrishnan, M.F. Kaashoek, and R. Morris, "The case for resilient overlay networks," in Proceeding of HotOS VIII,May 2001.

....relatively static in topology, recent overlays are built and managed with self organizing algorithms. These algorithms adapt the overlay network topology to changes in node membership and to changes in the physical network, such as the onset of congestion. Topology aware algorithms, such as RON [10], Narada [5] and RMX [11] use active measurements to infer network properties and to make an informed choice in overlay topology. Topology agnostic overlays, such as CAN [1] Chord [2] Tapestry [8] and Pastry [9] use other criteria to form overlays, such as embedded the overlay in a virtual ....

David G. Andersen, Hari Balakrishnan, M. Frans Kaashoek, and Robert Morris, \The Case for Resilient Overlay Networks," in HotOS VIII, May 2001.

....path for a packet is largely unsupported in today s infrastructure. As discussed in [2] IPv4 source routing is usually turned off within the Internet for security reasons. It would be more promising to implement path diversity by means of an overlay network that consists of relay nodes [2] [1]. Here, packets can be sent along different routes by encapsulating them into IP packets that have the addresses of different relay nodes as their destination. At the relay nodes, packets are forwarded to other relay nodes such that the packets travel along as few common links as possible. With ....

D. G. Andersen, H. Balakrishnan, M. F. Kaashoek, and R. Morris, "The case for resilient overlay networks, " Proc. of the 8th Annual Workshop on Hot Topics in Operating Systems (HotOS-VIII), May 2001.

....necessitate low and multi layer solutions. CRATO s Supranet [13] extends this multi layer notion with multi layer optimizations. Columbia s Virtual Active Networks (VANs) are part of the Netscript project [37] and deploy link layer virtual networks MIT s Resilient Overlay Network project (RON) [5] focuses on the application of overlay network technology to the problem of Internet congestion, similar to the Detour project at University of Washington [31] and to a less degree to the distributed denial of service problem. Berkeley s Sahara project [22] also attempts to apply the overlay ....

David G. Andersen, Hari Balakrishnan, M. Frans Kaashoek, and Robert Morris "The Case for Resilient Overlay Networks," Proc. HotOS VIII, Schloss Elmau, Germany, May 2001.

....indicate that the performance of these applications can be significantly improved by even the rather coarse grained knowledge of topology offered by our binning scheme. I. INTRODUCTION Several ongoing projects make use of application level or overlay networks [1] 2] 3] 4] 5] 6] [7], 8] 9] In these applications, each participating end host node is logically connected to a small subset of the other participant nodes (we call this subset the node s neighbors) to form an overlay network. A path on the overlay network then consists of a series of application level, not ....

D. Andersen, H. Balakrishnan, F. Kaashoek, and R. Morris, "The case for resilient overlay networks," in HotOS VIII, Oberbayern, May 2001.

....approach is bulk data transfer, not real time video. On the other hand, our paper focus on streaming media with MDC. Another interesting, though more distant work, is Resilient Overlay Networks (RON) which provide resilience to network failures by using an overlay to re route around failures [32]. VII. SUMMARY The combination of multiple description coding and path diversity provide improved error resilience for streaming media over best effort networks. In this work, we use CDNs to explicitly provide multiple paths over which to deliver complementary descriptions from different edge ....

D.G. Andersen, H. Balakrishnan, M.F. Kaashoek, and R. Morris, "The case for resilient overlay networks," Proc. HotOS VIII, May 2001.

....a specific path for a packet is largely unsupported in today s infrastructure. As discussed in [2] IPv4 source routing is usually turned o# within the Internet for security reasons. More promising is to implement path diversity by means of an overlay network that consists of relay nodes [2] [1]. Here, packets can be sent along di#erent routes as being encapsulated into IP packets that have the addresses of di#erent relay nodes as their destination. At the relay nodes, packets are forwarded to other relay nodes such that the packets from di#erent description streams travel along as few ....

D. G. Andersen, H. Balakrishnan, M. F. Kaashoek, and R. Morris. The case for resilient overlay networks. In Proceedings of the 8th Annual Workshop on Hot Topics in Operating Systems (HotOS-VIII), May 2001. Online at: http://nms.lcs.mit.edu/projects/ron/.

....path for a packet is largely unsupported in today s infrastructure. As discussed in [2] IPv4 source routing is usually turned off within the Internet for security reasons. It would be more promising to implement path diversity by means of an overlay network that consists of relay nodes [2] [1]. Here, packets can be sent along different routes by encapsulating them into IP packets that have the addresses of different relay nodes as their destination. At the relay nodes, packets are forwarded to other relay nodes such that the PPD node Client and PPD node Path 1 Path 2 N1 N2 N3 N4 ....

D. G. Andersen, H. Balakrishnan, M. F. Kaashoek, and R. Morris, The case for resilient overlay networks, Proceedings of the 8th Annual Workshop on Hot Topics in Operating Systems (HotOSVIII) , May 2001. http://nms.lcs.mit.edu/projects/ron/

No context found.

D. Andersen, H. Balakrishnan, M. Kaashoek, and R. Morris. The case for resilient overlay networks. In Proceedings of the 8th Annual Workshop on Hot Topics in Operating Systems (HotOSVIII), 2001.

No context found.

Andersen DG, Balakrishnan H, Kaashoek F, Morris R. The case for resilient overlay networks. In 8th Workshop on Hot Topics in Operating Systems, Elmau/Oberbayern, Germany, May 2001.

No context found.

D. G. Andersen, H. Balakrishnan, M. F. Kaashoek, and R. Morris, "The Case for Resilient Overlay Networks", In Proceedings of HotOS--VIII, Schloss Elmau, Germany, May 2001.

No context found.

D.G. Andersen, H. Balakrishnan, M.F. Kaashoek, and R. Morris, "The case for resilient overlay networks," in Proceeding of HotOS VIII, May 2001.

No context found.

D. Andersen, H. Balakrishnan, M. Kaashoek, and R. Morris, "The case for resilient overlay networks," in Proceedings of the 8th Annual Workshop on Hot Topics in Operating Systems (HotOSVIII), May 2001.

No context found.

D. G. Andersen, H. Balakrishnan, M. F. Kaashoek, and R. Morris, "The Case for Resilient Overlay Networks", In Proceedings of HotOS--VIII, Schloss Elmau, Germany, May 2001.

No context found.

D. G. Andersen, H. Balakrishnan, M. F. Kaashoek, and R. Morris, \The Case for Resilient Overlay Networks", In Proceedings of HotOS{VIII, Schloss Elmau, Germany, May 2001.

No context found.

D. Andersen, H. Balakrishnan, F. Kaashoek, and R. Morris, "The case for resilient overlay networks," in HotOS VIII, Oberbayern, May 2001.

Online articles have much greater impact   More about CiteSeer.IST   Add search form to your site   Submit documents   Feedback  

CiteSeer.IST - Copyright Penn State and NEC