×

Method and apparatus for the assessment and optimization of network traffic

  • US 7,773,536 B2
  • Filed: 11/30/2007
  • Issued: 08/10/2010
  • Est. Priority Date: 10/17/2000
  • Status: Expired due to Fees
First Claim
Patent Images

1. A method of optimizing traffic in an internetwork, the method comprising:

  • selecting, by one or more network devices, a subset of flows in the internetwork for monitoring, wherein the subset of flows includes one of one flow, some flows, and all flows;

    measuring performance characteristics of the subset of flows in at least a portion of the internetwork, the performance characteristics including a plurality of one or more round trip measurements for each of the subset of flows and a plurality of one or more one-way measurements for each of the subset of flows, the measuring performance characteristics including;

    encoding material within a first plurality of one or more flows, causing a second plurality of one or more flows to be generated, wherein the first plurality of one or more flows traverses a first path of the internetwork, and the second plurality of one or more flows traverses a second path of the internetwork, wherein at least a portion of the first path of the internetwork and at least a portion of the second path of the internetwork are equal, and measuring a subset of the second plurality of one or more flows;

    calculating at least one performance metric for the subset of flows in the at least a portion of the internetwork, the at least one performance metric at least partly determined from the measured performance characteristics, the at least one performance metric computed according to an exponentially moving average; and

    in response to calculating the at least one performance metric, rearchitecting the internetwork to optimize one or more of the least one performance metric wherein the at least one performance metric is at least one of;

    an average delay d computed according to;

    d=u*d+(1−

    u)*mwhere d is the exponentially moving average of delay, m is tile last delay sample, and, u is the weight of the moving average;

    an average jitter v computed according to;

    v=u*v+(1−

    u)*ld−

    m lwhere v is the exponentially moving average of jitter, ld−

    m] is the last sample of jitter, and, u is the weight of the average;

    an average jitter v computed according to;

    v=u*v+(1−

    u)*lm−

    m ′

    lwhere v is the exponentially moving average of jiuer, lm−

    m ′

    l is the last sample of jitter, m is the last delay sample, m ′

    is the previous delay sample, and /1 is the weight of the average;

    an average loss p-hat computed according to;

    p-hat=u*p-hat+(1−

    u)*pwhere p-hat is the moving average of the loss, p={0 if packet is received, l is the packet is declared lost}, and, u is the weight of the exponentially moving average.

View all claims
  • 15 Assignments
Timeline View
Assignment View
    ×
    ×