Flow Splitting with Fate Sharing in a Next Generation Transport Services Architecture

Computer Science – Networking and Internet Architecture

Scientific paper

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

12 pages, 11 figures, 1 table

Scientific paper

The challenges of optimizing end-to-end performance over diverse Internet paths has driven widespread adoption of in-path optimizers, which can destructively interfere with TCP's end-to-end semantics and with each other, and are incompatible with end-to-end IPsec. We identify the architectural cause of these conflicts and resolve them in Tng, an experimental next-generation transport services architecture, by factoring congestion control from end-to-end semantic functions. Through a technique we call "queue sharing", Tng enables in-path devices to interpose on, split, and optimize congestion controlled flows without affecting or seeing the end-to-end content riding these flows. Simulations show that Tng's decoupling cleanly addresses several common performance problems, such as communication over lossy wireless links and reduction of buffering-induced latency on residential links. A working prototype and several incremental deployment paths suggest Tng's practicality.

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

Flow Splitting with Fate Sharing in a Next Generation Transport Services Architecture 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 Flow Splitting with Fate Sharing in a Next Generation Transport Services Architecture, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Flow Splitting with Fate Sharing in a Next Generation Transport Services Architecture will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFWR-SCP-O-421124

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