Skip to main content

Pareto On/Off Traffic Generator

 The Pareto On/Off Traffic Generator (POO_Traffic) is a traffic generator (an application) embodied in the OTcl class Application/Traffic/Pareto. POO_Traffic generates traffic according to a Pareto On/Off distribution. Packets are sent at a fixed rate during on periods, and no packets are sent during off periods. Both on and off periods are taken from a Pareto distribution with constant size packets. These sources can be used to generate aggregate traffic that exhibits long range dependency. For other traffic generators, refer to the NS manual.


  • Usage Example

    • A new Pareto On/Off traffic generator can be created as follows:

            set p [new Application/Traffic/Pareto]
        $p set burst_time_ 500ms
        $p set idle_time_ 500ms
        $p set rate_ 200k
        $p set packetSize_ 210
        $p set shape_ 1.5


  • Detailed Explanation
    1. Input parameters:
      2.   burst_time_ : Mean On (burst) time
  idle_time_  : Mean Off (idle) time
  rate_       : Send rate during burst
  packetSize_ : Packet size (fixed application frame size)
  shape_      : Pareto shape parameter
    2. Initial computation:
      3.   interval = packetSize_ * 8 / rate_
  burstlen = burst_time_ / interval (in packets of given packetSize_)
    3. In each On/Off round, the following two (independent) Pareto random variables are computed:
        next_burstlen  : # of packets to be transmitted in the next burst period
                   (ex: next Web object size in packets of given packetSize_)
  next_idle_time : next idle period length in seconds
                   (ex: next think time)
    4. Pareto Traffic Generator algorithm:
       
      1. Compute next_burstlen given the mean burstlen and the Pareto shape_ parameter.
      2. Send all next_burstlen packets (each packet transmission interval is interval seconds).
      3. Compute the next_idle_time using the mean idle_time_ and the Pareto shape_ parameter.
      4. Go to sleep for next_idle_time and go back to step 1.
         
    5. Pareto Distribution:



      6. In general, if X is a random variable from a Pareto distribution
      (let f be the pdf, and E be the expected value)

        f(x) = a *ba / xa + 1 for x ≥ b

        E(X) = b *a / (a − 1) if a > 1

      where, a is called the Pareto "shape parameter" (shape_) and b is called the Pareto "scale parameter".

    6. How Pareto is used in the Pareto Traffic Generator:
      (The Pareto shape_ parameter is denoted as a in the following equations.)

        7. burstlen    = E(X) = b1 *a / (a − 1)
        idle_time_ = E(Y) = b2 *a / (a − 1)

      Therefore:

        b1 = burstlen * (a − 1) / a
        b2 = idle_time_ * (a − 1) / a

      NS has a Pareto random number generator that takes the scale and shape parameter:

            double pareto(double scale, double shape)
      When the Pareto traffic generator needs to compute next_burstlen, it does:
            int next_burstlen = int(pareto(b1, a) + 0.5);
      /* next_burstlen should be at least 1 packet */
      if(next_burstlen == 0) next_burstlen = 1;
      When the Pareto traffic generator needs to compute next_idle_time, it does:
            double next_idle_time = pareto(b2, a);

  • Discussion

    • The Pareto traffic generator can be used as a Web traffic generator assuming that Web object sizes form a Pareto distribution. The NS default Pareto shape_ parameter (or a) is 1.5. However, it is uncertain if that 1.5 makes sense for Web object size distribution.

    To find a reasonable Pareto shape_ parameter for Web object sizes, one should sample Web object sizes during transmissions (or borrow the results other research), draw the pdf of the samples and compute the mean object size (i.e., E(X)). Since E(X) can be computed from the collected data, the theoretical f(x) should be:

      f(x) = g(x, a)

    Then, one should be able to find a that makes the f(x) closest to the pdf of the measured Web object samples.

    Labels:

    Comments

    Post a Comment

    Popular posts from this blog

    Link State Routing Protocol

    Link state routing is a method in which each router shares its neighborhood’s knowledge with every other router on the internetwork. In this algorithm, each router in the network understands the network topology and then makes a routing table depending on this topology. Each router will share data about its connection to its neighbor, who will, consecutively, reproduce the data to its neighbors, etc. This appears just before all routers have constructed a topology of the network. In LSP, each node transmits its IP address and the MAC to its neighbor with its signature. Neighbors determine the signature and maintain a record of the combining IP address and the MAC. The Neighbor Lookup Protocol (NLP) of LSP derives and maintains the MAC and IP address of every network frame accepted by a node. The extracted data can support the mapping of MACs and IP addresses. The link-state flooding algorithm prevents the general issues of broadcast in the existence of loops by having every node mainta...
    Post a Comment
    Read more

    Matter: A next generation home standard

    The smart home is evolving. To date, if you've wanted to get into developing a smart home, you've had to deal with the multitude of smart home ecosystems, and making sure that each device you buy is compatible. That, however, may soon change — thanks to new smart home standard called Matter. Matter isn't available just yet, but when it is finally released, it could completely change how you buy smart home products, for the better. All of the best smart home devices could soon support the standard, helping them all work together nicely, and ensuring that no matter what products you buy, you'll be able to use them. Matter is basically the name of a new smart home connectivity standard . But this standard is a little unlike others. That's because of the fact that it's being developed by the Connectivity Standards Alliance, which counts hundreds of companies as members. That includes the likes of Google, Alexa, and Apple. So, whether you prefer to use Google Assista...
    1 comment
    Read more

    New interactive stickers for Stories

    Instagram has introduced several new features to Stories, offering interactive ways to share music, photos, and videos. One of the most interesting additions is a feature called Reveal , which blurs the content of a story post and requires viewers to DM the person who shared it in order to see it. Instagram's head, Adam Mosseri, has emphasized the importance of direct messages on the platform, with stories and DMs driving most of Instagram's growth. Requiring a DM to view content represents the next step in boosting engagement, and creators are likely to use it as a tactic to increase their stories' engagement. Another new feature, Frames, adds a Polaroid overlay to images that initially appear gray. Users can shake their phone to reveal the photo, resembling the process many people associate with Polaroid pictures, despite the fact that shaking Polaroids is not recommended by the company during development. Instagram has also introduced a music-based template feature calle...
    Post a Comment
    Read more