On Apr 2, 2014, at 11:14 AM, Joe Abley wrote:
> Hi all,
>
> It's common wisdom that a datagram that needs to be fragmented between
> endpoints (because it is bigger than the path MTU) will demonstrate less
> reliable delivery and reassembly than a datagram that doesn't need to be
> fragmented
Hi, Joe,
On 04/02/2014 03:14 PM, Joe Abley wrote:
> Is anybody aware of any wide-scale studies that examine the
> probability of fragmentation of datagrams of different sizes?
We're in the process of measuring some (kind of related stuff). If
you're interested in this data, we might be able to pr
This isn't a direct answer to the question, but I find this paper pretty useful
(even though it is dated now):
Beyond Folklore: Observations on Fragmented Traffic
by Colleen Shannon, David Moore, and k claffy
IEEE/ACM Transactions on Networking, December 2002
http://www.caida.org/publicat
I can send you a copy of an invited presentation at AINTEC from 2009.
/bill
On Wed, Apr 02, 2014 at 02:14:22PM -0400, Joe Abley wrote:
> Hi all,
>
> It's common wisdom that a datagram that needs to be fragmented between
> endpoints (because it is bigger than the path MTU) will demonstrate les
Hi all,
It's common wisdom that a datagram that needs to be fragmented between
endpoints (because it is bigger than the path MTU) will demonstrate less
reliable delivery and reassembly than a datagram that doesn't need to be
fragmented, because math, firewall, other, take your pick.
Is anybody
5 matches
Mail list logo