C. M. Harris, P. H. Brill, and M. J. Fischer. Internet-type queues with power-tailed interarrival times and computational methods for their analysis. INFORMS Journal on Computing, pages 261--271, 2000.  Home/Search   Document Not in Database   Summary   Related Articles

....a load scale factor (sometimes abbreviated as LSF ) 5.3 Link latency functions As shown in [30] link latency functions play an important role in determining the effectiveness of selfish routing. In our evaluations, we use five representative latency functions: M M 1, M D 1 [18] P M 1, P D 1 [19], and BPR [9] We also implement piecewiselinear, increasing, convex functions to approximate any other latency functions. In all latency functions, we include a term for propagation delay (Section 5.1 shows how we determine its value for each physical link) Our first two latency functions ....

....times. Here P stands for Pareto. We set the shape parameter # = 1.5 so that the resulting distribution has infinite variance. Since there is no closed form expression for either P M 1 or P D 1, we approximate each of them using a piecewise linear, increasing, convex function. We use the results in [19] to approximate P M 1. For P D 1, we derive a linear approximation of its shape using ns 2 [27] simulations. Specifically, we generate Pareto traffic to compete for a single bottleneck link with a large FIFO drop tail queue and observe the latency as we vary the load. For comparison purposes, we ....

[Article contains additional citation context not shown here]

C. M. Harris, P. H. Brill, and M. J. Fischer. Internet-type queues with power-tailed interarrival times and computational methods for their analysis. INFORMS Journal on Computing, pages 261--271, 2000.

Online articles have much greater impact   More about CiteSeer.IST   Add search form to your site   Submit documents   Feedback  

CiteSeer.IST - Copyright Penn State and NEC