[Date Prev][Date Next][Thread Prev][Thread Next][Date Index][Thread Index]
Re: [RAM] The mapping problem: rendezvous points?
Ted,
On May 9, 2007, at 10:47 AM, Ted Hardie wrote:
Sorry, but I misunderstood you to be asking for what class of
applications have
this problem, and my reply was intended to answer that: those
which do codec
negotiation based on observed rate.
And how do those codec negotiations/ICE behave in the face of network
congestion today?
Are you looking for something that has source code available, so
you can see
what changes it would take to adjust the paradigm, or ubiquity, or
what?
Pointers to source code would be nice.
I guess where I'm seeing a disconnect is in the fact that the
Internet today is best effort, has congestion events, asymmetric
routing and non-deterministic performance patterns. If an
application works today, I'm having trouble understanding how the
introduction of additional O(10-100ms) latencies in the event of a
cache miss (which will likely only occur at the first packet in a
packet train) is going to have significant impact. In those odd
cases that there is an impact, how much work would it be to modify
the application operation to be more tolerant of network delays?
Clearly, some believe that pull simply won't work. I'm trying to
understand why. To be honest, it feels a bit like arguments I used
to hear from Bellheads explaining why real production data
communications could never work on datagram based networks...
Rgds,
-drc
_______________________________________________
RAM mailing list
RAM at iab.org
https://www1.ietf.org/mailman/listinfo/ram