Stories
Slash Boxes
Comments

News for nerds, stuff that matters

Slashdot Log In

Log In

Create Account  |  Retrieve Password

New Algorithm Boosts Network Efficiency

Posted by Soulskill on Thu Aug 28, 2008 09:35 AM
from the more-is-better dept.
palegray.net writes "Researchers at the University of California have developed a new network routing algorithm that has the potential to significantly boost Internet traffic routing efficiency. This new approach focuses on the needs of dynamic networks, where connections are frequently transient. From the article: 'What the team did with their new routing algorithm, according to Savage's student Kirill Levchenko, was to reduce the "communication overhead" of route computation — by an order of magnitude.' For the technically inclined, the full research publication (PDF) is available."
+ -
story

Related Stories

This discussion has been archived. No new comments can be posted.
The Fine Print: The following comments are owned by whoever posted them. We are not responsible for them in any way.
 Full
 Abbreviated
 Hidden
More
Loading... please wait.
  • by LiquidCoooled (634315) on Thursday August 28 2008, @09:37AM (#24779261) Homepage Journal

    if($hostname==slashdot.org)
        connection.drop();

  • by BitterOldGUy (1330491) on Thursday August 28 2008, @09:38AM (#24779265)
    If( traffic == P2P || traffic == porn)
    {
    route_to_local_garbage()
    }
    else{
    on_its_way()
    }
    • Actually, I bet spam outnumbers even the pr0n. Imagine a world without spam! All the pretty butterflies playing tag, and cute puppies rolling in the sunshine! Ahhh :)

      • Re: (Score:3, Interesting)

        I take the occasion for asking : Does anyone here know of a serious study about the importance of porn traffic vs something else ? I hear often this internet meme that 90% of the traffic is porn. Once the joke is made, I find this hard to believe. Chat applications, legitimate web surfing, games, P2P, VoIP, spam, I don't see porn surpassing these in total demand.
  • fp (Score:5, Funny)

    by bigfatwill (708524) on Thursday August 28 2008, @09:39AM (#24779275) Homepage
    Amazing! I've never been able to get first post before, but with faster routing to slashdot.org, it was a sinch.
  • nearly as good? (Score:4, Interesting)

    by amnezick (1253408) * on Thursday August 28 2008, @09:40AM (#24779297) Homepage

    so if my packets don't make it I know why. Not a skeptic but the Internet is already barely holding together and I'm not confident that "nearly as good" routing info can help. Of course if trying 2-3 times using this is still faster than first time hit using the old one then sure, why not?

    • Does "not as good" mean "not as reliable" or "not as short/fast".

      Ex: the time-to transmit and/or path length, removing time to calculate path, is 10-15% longer, on average, would be not as good, even if it is just as reliable.
  • Is this really new? (Score:5, Interesting)

    by Mezoth (555557) on Thursday August 28 2008, @09:50AM (#24779423)
    So, from reading the article, I see that the great leap forward here is "smaller routing domain in a link-state protocol leads to faster routing updates". But, looking at the existing link-state protocols, they were designed from the ground up with the ability to limit your routing domain manually so increase the convergence time and decrease memory footprint.

    I guess that means the achievement here is to have a link-state protocol that automatically limits your routing domain by limiting propagation of routes. This however seems like it could lead to seriously suboptimal routing which is probably a bad idea in most network environments today.
    • by Pysslingen (544910) on Thursday August 28 2008, @10:10AM (#24779739)
      The central point of the algorithm is to define bounds on when a routing change should be propagated. The point being that only an increase in routing efficiency above a certain threshold should be propagated. This disallows small fluctuations to have an impact on the wider network. He also shows that the impact of the propagation changes will be limited with respect to total network speed.
      • by Mezoth (555557) on Thursday August 28 2008, @10:39AM (#24780121)
        After reading a portion of the PDF supplied, I am actually far more satisfied that this is new research and not a restatement of fundamental network principles. The PDF has the equations where he proves a few simple criteria can define the scope of any network topology changes based on the difference in cost of the new route. This allows you to limit the recalculation of routes, blocking them from most of the routers where the recalculation would have provided no change in the actual routing topology.

        The challenges he states are real challenges, and many modern networks are defined by the limits of the link-state protocols. In essence, this is like auto-summarization of prefixes in bgp, only applied to links in the link-state database - a possible slight loss in accuracy for a large boost in routing performance. This would allow the (faster converging) link-state protocols to scale to larger networks, rather then having to divide them into areas or use BGP to route between different sections of the network (resulting in loss of convergence time).

        To the end user, this would mean that the internet would respond faster to outages, and better route around congestion on any one link.
        • I'm so sorry, Mezoth. I just moderated this redundant, when I meant to moderate it interesting.

          Please, someone compensate for my mouse-slip.

          • Re: (Score:3, Informative)

            By posting, you have removed your moderation, so you already did it yourself ;)

            You can't post and moderate in the same story, otherwise you could post and then mod yourself, or mod down people who disagree with you etc.

        • To the end user, this would mean that the internet would respond faster to outages, and better route around congestion on any one link.

          Thank you. That's the statement that I came in here for.

    • by nine-times (778537) <nine.times@gmail.com> on Thursday August 28 2008, @11:04AM (#24780487) Homepage

      Ok, you seem to know what the hell is going on, so I'll ask you.

      The summary talks about it being a huge boost to network efficiency and how it cuts overhead, but it seems like that wouldn't necessarily make a huge difference for most people's network use unless overhead is large and networks are hugely inefficient. I mean, if overhead is .0001%, then cutting it in half isn't going to give you too much of a boost in your ability to transmit data unless you're pushing around huge amounts of data and really need to squeeze every last bit of bandwidth. Right?

      So I trust I'll get yelled at by someone if that logic is wrong, but just let me ask, what kind of benefit would this improvement actually yield? Do I get much better bandwidth, much lower latency, both? Or is it the sort of improvement than only a real network guru could love?

      • Re: (Score:3, Informative)

        by Anonymous Coward

        I think you're looking at this in the wrong way. If the network is stable then this work is completely irrelevant. Its when the network changes (i.e., links going up and down) that you care about routing protocols. In this case you care how long it takes to converge on a new set of consistent forwarding tables (why? because you may find your packets dropped on the floor in the mean-time)

      • Re: (Score:3, Informative)

        Network performance, in this context, is actually discussing the ability of the network to respond to change. This does nothing for the throughput of a non-congested link, but link-state protocols today can assign costs for links based on many factors, including availability and utilization. To the normal person on the street, this would not seem to matter, but in reality outages happen pretty often on large networks. The design of the networks today is often dictated by the limits of the link-state data
  • Patent? (Score:5, Interesting)

    by jc42 (318812) on Thursday August 28 2008, @09:52AM (#24779465) Homepage Journal

    So has the team applied for a patent? We wouldn't want just any ISP to be able to use this algorithm, would we? And if they don't patent it, one of the many patent-troll companies will, denying the researchers the right to use the results of their own work.

    • Re: (Score:3, Insightful)

      And unless they have millions to fight it out in court this is perfectly possible.

    • Prior art wouldn't apply?

    • This cannot happen. Once something is published, nobody can claim a patent on it at a later date... Even for the authors to apply for a patent, the application has to predate the publication.
      • Re:Patent? (Score:5, Funny)

        by wattrlz (1162603) on Thursday August 28 2008, @11:02AM (#24780465)
        You must be new here.
        Redundant, I know, but when has the law ever stopped a patent troll?
      • Re: (Score:3, Interesting)

        This cannot happen. Once something is published, nobody can claim a patent on it at a later date... Even for the authors to apply for a patent, the application has to predate the publication.

        Except in the US, where you have up to 1 year to file after initial public disclosure. Of course, the problem is that you can't get a foreign patent (because while the initial filing date is recognized by them, the fact it was published potentially nullifies any foreign patent. However, there are probably tons of except

  • by farker haiku (883529) on Thursday August 28 2008, @09:58AM (#24779579) Journal

    Finally, we argue that existing link-state protocols, such as OSPF, can incorporate XL routing in a backwards compatible and incrementally deployable fashion.

    My first question upon reading the summary was, but is it backwards compatable... and they appear to answer that in the thesis statement. Looks like some good lunch reading here.

    • by Anonymous Coward on Thursday August 28 2008, @10:10AM (#24779751)

      They meet the âoecentral challengeâ of determining which updates are important and which can be suppressed by using three rules for update propagation, said team member Ramamohan Paturi.

      1. The routing algorithm may not injure the network or, through inaction, allow the network to come to harm.
      2. The routing algorithm must obey orders given to it by human beings, except where such orders would conflict with the First Rule.
      3. The routing algorithm must protect its own existence as long as such protection does not conflict with the First or Second Rules.

      Seems pretty foolproof to me.

      • Seems pretty foolproof to me.

        Nah, you just present it with a situation where acting will harm one human and failing to act will harm another. Then it jams up and starts vibrating and sparks shoot out of its ears. (Or at least that's how it works for robots. To be honest I don't know where a routing algorithm's ears are, but this seems as good a way as any to find out.)

  • Just for the record, it looks like this was developed at UCSD. I'm no Californian, but I wasn't aware of a "University of California" school..I'm pretty sure they're all UC-something-something. Just giving credit where credit is due...
    • Errr you might not know [wikipedia.org], but that doesn't mean it doesn't exist [university...fornia.edu].

      I like to think of the University of California as a sort of Oxford/Cambridge college system on steroids. So yes its at UCSD, also writers of a very fine version of Pascal, but its still UC.

    • The name "University of California", when unqualified, refers to the Berkeley campus.

      It's just a convention. Other examples:
      1) University of Michigan -> Ann Arbor campus
      2) University of Wisconsin -> Madison campus
      3) University of Illinois -> Urbana-Champaign campus
      4) University of Maryland -> College Park campus

      • In my experience, "University of California" refers to the system, while "Cal" refers to Berkeley. Not having attended either, I defer to those with first-hand experience.
    • I'm a San Diegan, though I don't know much about UCSD. However all the University of California schools are affiliated [university...fornia.edu]. I don't think it's wrong to refer to the University of California, but it's not that common. Probably since UCSD is quicker to say by 1/3 and is also more specific.

  • The CVP could be further improved. Producing the CVP is an expensive operation when the stated purpose is to support networking with transient connections. It can be improved by parameterizing the XL with d instead of e. I think further research is needed in this area.
  • by sokoban (142301) on Thursday August 28 2008, @12:25PM (#24781761) Homepage

    A new and improved Al Gore rhythm would dramatically boost network efficiency. Since he invented the internets, and actually routes every single packet on the internets by hand, if he learned how to work in a syncopated rhythm the efficiency of the network would nearly double.

    Check and mate!