The Case for Redundant Arrays of Internet Links (RAIL)

Computer Science – Networking and Internet Architecture

Scientific paper

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

Scientific paper

It is well-known that wide-area networks face today several performance and reliability problems. In this work, we propose to solve these problems by connecting two or more local-area networks together via a Redundant Array of Internet Links (or RAIL) and by proactively replicating each packet over these links. In that sense, RAIL is for networks what RAID (Redundant Array of Inexpensive Disks) was for disks. In this paper, we describe the RAIL approach, present our prototype (called the RAILedge), and evaluate its performance. First, we demonstrate that using multiple Internet links significantly improves the end-to-end performance in terms of network-level as well as application-level metrics for Voice-over-IP and TCP. Second, we show that a delay padding mechanism is needed to complement RAIL when there is significant delay disparity between the paths. Third, we show that two paths provide most of the benefit, if carefully managed. Finally, we discuss a RAIL-network architecture, where RAILedges make use of path redundancy, route control and application-specific mechanisms, to improve WAN performance.

No associations

LandOfFree

Say what you really think

Search LandOfFree.com for scientists and scientific papers. Rate them and share your experience with other people.

Rating

The Case for Redundant Arrays of Internet Links (RAIL) does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with The Case for Redundant Arrays of Internet Links (RAIL), we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and The Case for Redundant Arrays of Internet Links (RAIL) will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFWR-SCP-O-375317

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.