Knowledge

Long-tail traffic

Source 📝

45:. The differences between these two phenomena are subtle. Heavy-tailed refers to a probability distribution, and long-range dependent refers to a property of a time series and so these should be used with care and a distinction should be made. The terms are distinct although superpositions of samples from heavy-tailed distributions aggregate to form long-range dependent time series. 1371:, including the selection of alternative protocols, for more effective data transport. For short files, which constitute the bulk of connection requests in heavy-tailed file size distributions of web servers, elaborate feedback control may be bypassed in favour of lightweight mechanisms in the spirit of optimistic control, which can result in improved bandwidth utilisation. 1295:
provisions in networks. To achieve a constant level of throughput or packet loss as self-similarity is increased, extremely large buffer capacity is needed. However, increased buffering leads to large queuing delays and thus self-similarity significantly steepens the trade-off curve between throughput/ packet loss and delay.
772:
the logarithm of both the range and the domain is taken, the tail of the long-tail distribution is approximately linear over many orders of magnitude. In the graph above left, the condition for the existence of a heavy-tail distribution, as previously presented, is not met by the curve labelled "Gamma-Exponential Tail".
38:. For example, if we consider the sizes of files transferred from a web server, then, to a good degree of accuracy, the distribution is heavy-tailed, that is, there are a large number of small files transferred but, crucially, the number of very large files transferred remains a major component of the volume downloaded. 771:
If the logarithm of the range of an exponential distribution is taken, the resulting plot is linear. In contrast, that of the heavy-tail distribution is still curvilinear. These characteristics can be clearly seen on the graph above to the right. A characteristic of long-tail distributions is that if
133:
Self-similarity in packetised data networks can be caused by the distribution of file sizes, human interactions and/or Ethernet dynamics. Self-similar and long-range dependent characteristics in computer networks present a fundamentally different set of problems to people doing analysis and/or design
1342:
Given the ubiquity of scale-invariant burstiness observed across diverse networking contexts, finding an effective traffic control algorithm capable of detecting and managing self-similar traffic has become an important problem. The problem of controlling self-similar network traffic is still in its
1326:
With respect to SLAs, the same level of service for heavy-tailed distributions requires a more powerful set of servers, compared with the case of independent light-tailed request traffic. To guarantee good performance, focus needs to be given to peak traffic duration because it is the huge bursts of
86:
if the series is averaged then the data begins to look smoother. However, with self-similar data, one is confronted with traces that are spiky and bursty, even at large scales. Such behaviour is caused by strong dependence in the data: large values tend to come in clusters, and clusters of clusters,
1049:
It has for long been realised that efficient and accurate modelling of various real-world phenomena needs to incorporate the fact that observations made on different scales each carry essential information. In most simple terms, representing data on large scales by its mean is often useful (such as
1021:
Second, is a transport layer cause which theorizes that the feedback between multiple TCP streams due to TCP's congestion avoidance algorithm in moderate to high packet loss situations causes self-similar traffic or at least allows it to propagate. However, this is believed only to be a significant
1001:
In general, there are three main theories for the causes of long-tail traffic (see a review of all three causes). First, is a cause based in the application layer which theorizes that user session durations vary with a long-tail distribution due to the file size distribution. If the distribution of
1374:
It was found that the simplest way to control packet traffic is to limit the length of queues. Long queues in the network invariably occur at hosts (entities that can transmit and receive packets). Congestion control can therefore be achieved by reducing the rate of packet production at hosts with
1045:
Since (unlike traditional telephony traffic) packetised traffic exhibits self-similar or fractal characteristics, conventional traffic models do not apply to networks that carry long-tail traffic. Previous analytic work done in Internet studies adopted assumptions such as exponentially-distributed
1355:
in nature, multiple time scale traffic control exploits the long-range correlation structure present in self-similar traffic. Congestion control can be exercised concurrently at multiple time scales, and by cooperatively engaging information extracted at different time scales, achieve significant
1061:
There is not an abundance of heavy-tailed models with rich sets of accompanying data-fitting techniques. A clear model for fractal traffic has not yet emerged, nor is there any definite direction towards a clear model. Deriving mathematical models which accurately represent long-tail traffic is a
1025:
Finally, is a theorized link layer cause which is predicated based on physics simulations of packet switching networks on simulated topologies. At a critical packet creation rate, the flow in a network becomes congested and exhibits 1/f noise and long-tail traffic characteristics. There have been
1350:
The resource provisioning approach seeks to identify the relative utility of the two principal network resource types – bandwidth and buffer capacity – with respect to their curtailing effects on self-similarity, and advocates a small buffer/ large bandwidth resource dimensioning policy. Whereas
1346:
Traffic control for self-similar traffic has been explored on two fronts: Firstly, as an extension of performance analysis in the resource provisioning context, and secondly, from the multiple time scale traffic control perspective where the correlation structure at large time scales is actively
1294:
declines gradually as self-similarity increases, queuing delay increases more drastically. When traffic is self-similar, we find that queuing delay grows proportionally to the buffer capacity present in the system. Taken together, these two observations have potentially dire implications for QoS
1192:
Traffic self-similarity negatively affects primary performance measures such as queue size and packet-loss rate. The queue length distribution of long-tail traffic decays more slowly than with Poisson sources. However, long-range dependence implies nothing about its short-term correlations which
767:
which is hyperbolic over its entire range. Complementary distribution functions for the exponential and Pareto distributions are shown below. Shown on the left is a graph of the distributions shown on linear axes, spanning a large domain. To its right is a graph of the complementary distribution
1029:
Simulation showed that long-range dependence could arise in the queue length dynamics at a given node (an entity that transfers traffic) within a communications network even when the traffic sources are free of long-range dependence. The mechanism for this is believed to relate to feedback from
1200:
The graph above right, taken from, presents a queueing performance comparison between traffic streams of varying degrees of self-similarity. Note how the queue size increases with increasing self-similarity of the data, for any given channel utilisation, thus degrading network performance.
1053:
With the convergence of voice and data, the future multi-service network will be based on packetised traffic, and models which accurately reflect the nature of long-tail traffic will be required to develop, design and dimension future multi-service networks. We seek an equivalent to the
1286:
For network queues with long-range dependent inputs, the sharp increase in queuing delays at fairly low levels of utilisation and slow decay of queue lengths implies that an incremental improvement in loss performance requires a significant increase in buffer size.
1298:
ATM can be employed in telecommunications networks to overcome second-order performance measure problems. The short fixed-length cell used in ATM reduces the delay and most significantly the jitter for delay-sensitive services such as voice and video.
1193:
affect performance in small buffers. For heavy-tailed traffic, extremely large bursts occur more frequently than with light-tailed traffic. Additionally, aggregating streams of long-tail traffic typically intensifies the self-similarity ("
1327:
requests that most degrade performance. That is why some busy sites require more headroom (spare capacity) to handle the volumes; for example, a high-volume online trading site reserves spare capacity with a ratio of three to one.
1315:. Without adaptive, optimal management and control of resources, SLAs based on response time are impossible. The capacity requirements on the site are increased while its ability to provide acceptable levels of performance and 275:
that explains how other types of random data will converge towards the form of these Tweedie distributions, and consequently express both the variance to mean power law and a power law decay in their autocorrelation functions.
879: 758: 1322:
The ability to accurately forecast request patterns is an important requirement of capacity planning. A practical consequence of burstiness and heavy-tailed and correlated arrivals is difficulty in capacity planning.
490: 284:
Before the heavy-tail distribution is introduced mathematically, the memoryless Poisson distribution, used to model traditional telephony networks, is briefly reviewed below. For more details, see the article on the
1277:
are met. The following subsection deals with the provisioning of standard network resources, and the subsection after that looks at provisioning web servers that carry a significant amount of long-tail traffic.
762:
This means that regardless of the distribution for small values of the random variable, if the asymptotic shape of the distribution is hyperbolic, it is heavy-tailed. The simplest heavy-tail distribution is the
375: 1227:) are best-effort services, so degraded performance, although undesirable, can be tolerated. However, since the connection is contracted, ATM networks need to keep delays and jitter within negotiated limits. 974: 64:
world. To achieve this goal, understanding the characteristics of Internet traffic plays a more and more critical role. Empirical studies of measured traffic traces have led to the wide recognition of
255:
Such power law scaling of the autocorrelation function can be shown to be biconditionally related to a power law relationship between the variance and the mean, when evaluated from sequences by the
530:, between call arrivals and departures are intervals between independent, identically distributed random events. It can be shown that these intervals have a negative exponential distribution, i.e.: 1189:
control is able to shape source traffic into an on-average constant output stream while conserving information. Congestion control of heavy-tailed traffic is discussed in the following section.
1185:
In some cases, an increase in the Hurst parameter can lead to a reduction in network performance. The extent to which heavy-tailedness degrades network performance is determined by how well
230: 595: 1177:-stable stochastic processes for modelling traffic in broadband networks are presented. The simulations are compared to a variety of empirical data (Ethernet, WWW, VBR Video). 1152: 1042:
based on accurate assumptions of the traffic that they carry. The dimensioning and provisioning of networks that carry long-tail traffic is discussed in the next section.
1861:
Park K., Future Directions and Open Problems in Performance Evaluation and Control of Self-Similar Network Traffic, Department of Computer Sciences, University of Purdue.
1753: 516: 1175: 1018:. This is currently the most popular explanation in the engineering literature and the one with the most empirical evidence through observed file size distributions. 1220:
variation are of import to provisioning user-specified QoS. Self-similar burstiness is expected to exert a negative influence on second-order performance measures.
1840: 1154:
process, is perhaps the most successful model to date. It is demonstrated to satisfy the basic requirements of a simple, but accurate, model of long-tail traffic.
1026:
criticisms on these sorts of models though as being unrealistic in that network traffic is long-tailed even in non-congested regions and at all levels of traffic.
401: 1266:, and peak loading is not sustained, so queues do not fill. With long-range order, peaks last longer and have greater impact: the equilibrium shifts for a while. 1378:
Long-range dependence and its exploitation for traffic control is best suited for flows or connections whose lifetime or connection duration is long lasting.
1996: 1363:
in the context of web client/ server interactions, the size of the file being transported (which is known at the server) is conveyed or made accessible to
1792:
Neame T., Characterisation and Modelling of Internet Traffic Streams, Department of Electrical and Electronic Engineering, University of Melbourne, 2003.
632:
is a measure of the level of self-similarity of a time series that exhibits long-range dependence, to which the heavy-tail distribution can be applied.
1491:
Kennedy I., Lecture Notes, ELEN5007 – Teletraffic Engineering, School of Electrical and Information Engineering, University of the Witwatersrand, 2005.
1359:
Another approach adopted in controlling long-tail traffic makes traffic controls cognizant of workload properties. For example, when TCP is invoked in
784: 671: 1046:
packet inter-arrivals, and conclusions reached under such assumptions may be misleading or incorrect in the presence of heavy-tailed distributions.
1954:
Tuan T., Park K., Multiple Time Scale Congestion Control for Self-Similar Network Traffic, Department of Computer Sciences, University of Purdue.
1509: 1241:
With long-tail traffic, the bursty behaviour may itself be bursty, which exacerbates the clustering phenomena, and degrades network performance.
417: 1006:
network environment will be long-range dependent. Additionally, this causal mechanism is robust with respect to changes in network resources (
1662: 1578: 134:
of networks, and many of the previous assumptions upon which systems have been built are no longer valid in the presence of self-similarity.
1269:
Due to the increased demands that long-tail traffic places on networks resources, networks need to be carefully provisioned to ensure that
1050:
an average income or an average number of clients per day) but can be inappropriate (e.g. in the context of buffering or waiting queues).
1771:
Arrowsmith D.K., Woolf M., Internet Packet Traffic Congestion in Networks, Mathematics Research Centre, Queen Mary, University of London.
302: 149:
In short-range dependent processes, the coupling between values at different times decreases rapidly as the time difference increases.
1935: 1640:
Park K.; Kim G.; Crovella M. (1996). "On the relationship between file sizes, transport protocols, and self-similar network traffic".
1130:
No unanimity exists about which of the competing models is appropriate, but the Poisson Pareto Burst Process (PPBP), which is an M/G/
1307:
Workload pattern complexities (for example, bursty arrival patterns) can significantly affect resource demands, throughput, and the
1039: 892: 618:
Heavy-tail distributions have properties that are qualitatively different from commonly used (memoryless) distributions such as the
636:
takes on values from 0.5 to 1. A value of 0.5 indicates the data is uncorrelated or has only short-range correlations. The closer
1558: 884: 1212:
sensitive traffic streams comprising a growing fraction of network traffic, second-order performance measures in the form of “
1084:
methods are used for producing packet traffic models which can replicate both short-range and long-range dependent streams.
1991: 1543:
Everything you always wanted to know about self-similar network traffic and long-range dependency, but were ashamed to ask
1245:
Many aspects of network quality of service depend on coping with traffic peaks that might cause network failures, such as
1068:, even long-range dependent Gaussian models, are unable to accurately model current Internet traffic. Classical models of 111: 94:
Heavy-tail distributions have been observed in many natural phenomena including both physical and sociological phenomena.
75:
traffic exhibits dependencies over a long range of time scales. This is to be contrasted with telephone traffic which is
1837: 60:
The design of robust and reliable networks and network services has become an increasingly challenging task in today's
1873: 1330:
Reference to additional information on the effect of long-range dependency on network performance can be found in the
127: 1011: 776: 23: 1595:
Smith R. (2011). "The Dynamics of Internet Traffic: Self-Similarity, Self-Organization, and Complex Phenomena".
1230:
Self-similar traffic exhibits the persistence of clustering which has a negative impact on network performance.
1087:
A number of models have been proposed for the task of modelling long-tail traffic. These include the following:
1080:, or at least weak dependence. Poisson and Markov related processes have, however, been used with some success. 30:
to regions far from the mean or median. A more formal mathematical definition is given below. In the context of
2001: 1392: 1077: 619: 190: 35: 27: 259:. This variance to mean power law is an inherent feature of a family of statistical distributions called the 1274: 107: 31: 1804:
Zukerman M., ARC Centre for Ultra Broadband Information Networks, EEE Dept., The University of Melbourne,
536: 115: 1747: 1397: 1308: 1124: 1007: 272: 264: 260: 256: 1505:
Neame T., ARC Centre for Ultra Broadband Information Networks, EEE Dept., The University of Melbourne,
1319:
diminishes. Techniques to control and manage long-tail traffic are discussed in the following section.
1986: 1699: 1506: 1364: 1352: 286: 95: 76: 1556:
Development of Procedures to Analyze Queuing Models with Heavy-Tailed Interarrival and Service Times
1542: 1133: 1055: 764: 268: 88: 1575: 1914: 1717: 1668: 1641: 1622: 1604: 1311:
encountered by user requests, in terms of higher average response times and higher response time
1270: 1209: 1186: 989:
Readers interested in a more rigorous mathematical treatment of the subject are referred to the
1820:
Park K., Kim G., Crovella M., On the Effect of Traffic Self-similarity on Network Performance.
1735: 1658: 1224: 501: 1160: 1932: 1906: 1725: 1707: 1650: 1614: 1263: 1065: 1015: 123: 1022:
factor at relatively short timescales and not the long-term cause of self-similar traffic.
243:, α is a parameter in the interval (0,1) and the ~ means asymptotically proportional to as 1939: 1877: 1844: 1582: 1562: 1513: 1368: 1098: 983: 626: 386: 180: 173: 161: 154: 65: 49: 606:
Information on the fundamentals of statistics and probability theory can be found in the
1703: 1458: 1891: 143: 103: 1730: 1687: 1555: 1223:
Packet-switching-based services, such as the Internet (and other networks that employ
168:
In long-range processes, the correlations at longer time scales are more significant.
1980: 1438: 1387: 1003: 1967: 1918: 1805: 1672: 1626: 411:
The number of call departures in a given time also has a Poisson distribution, i.e.:
1421:
Heavy-tailed distributions, generalised source coding and optimal web layout design
1316: 1256: 1081: 1073: 292:
Assuming pure-chance arrivals and pure-chance terminations leads to the following:
42: 1238:
networks), clustering occurs in the short term but smooths out over the long term.
1217: 1069: 874:{\displaystyle p(x)=\alpha k^{\alpha }x^{-\alpha -1},\ \alpha ,k>0,\ x\geq k} 753:{\displaystyle P\sim x^{-\alpha },\ {\text{as}}\ x\to \infty ,0<\alpha <2} 83: 1870: 1526: 1618: 1291: 1205: 1194: 1002:
file sizes is heavy-tailed then the superposition of many file transfers in a
1686:
Willinger, W., Govindan, R., Jamin, S., Paxson, V. & Shenker, S. (2002).
1654: 296:
The number of call arrivals in a given time has a Poisson distribution, i.e.:
1420: 1235: 1780:
Resnick S.I., Heavy Tail Modeling and Teletraffic Data, Cornell University.
1739: 1712: 1643:
Proceedings of 1996 International Conference on Network Protocols (ICNP-96)
1554:
School of Information Technology and Engineering, George Mason University,
1459:
Internet Control and Inference Tools at the Edge: Network Traffic Modelling
485:{\displaystyle P(d)=\left({\frac {\lambda ^{d}}{d!}}\right)e^{-\lambda },} 142:
Long-range and short-range dependent processes are characterised by their
1312: 640:
is to 1, the greater the degree of persistence or long-range dependence.
407:. For this reason, pure-chance traffic is also known as Poisson traffic. 267:
explains how certain types of random data converge towards the form of a
72: 61: 1721: 1507:
Performance Evaluation of a Queue Fed by a Poisson Pareto Burst Process
102:
phenomena, e.g. Stock markets, earthquakes, and the weather. Ethernet,
99: 1910: 1525:
Barford P., Floyd S., Computer Science Department, Boston University,
1688:"Scaling phenomena in the Internet: Critically examining Criticality" 1213: 119: 1457:
Department of Electrical and Computer Engineering, Rice University,
1038:
Modelling of long-tail traffic is necessary so that networks can be
98:
established the use of heavy-tail distributions to model real-world
1609: 1527:
The Self-similarity and Long Range Dependence in Networks Web site
1092: 370:{\displaystyle P(a)=\left({\frac {\mu ^{a}}{a!}}\right)e^{-\mu },} 251:
Long-range dependence as a consequence of mathematical convergence
1360: 1838:
Planning for growth: A proven methodology for capacity planning
768:
functions over a smaller domain, and with a logarithmic range.
183:
function is often assumed to have the specific functional form,
1892:"On the relevance of long-range dependence in network traffic" 969:{\displaystyle F(x)=P=1-\left({\frac {k}{x}}\right)^{\alpha }} 1419:
Zhu X., Yu J., Doyle J., California Institute of Technology,
34:
a number of quantities of interest have been shown to have a
1139: 126:
video (digitised video of the type that is transmitted over
41:
Many processes are technically long-range dependent but not
1437:
Medina A., Computer Science Department, Boston University,
164:
function of short-range dependent processes decays quickly.
1970:, Department of Computer Sciences, University of Purdue. 1574:
Air Force Research Laboratory, Information Directorate,
1933:
Introduction to ATM switching, RAD Data Communications
1197:") rather than smoothing it, compounding the problem. 1163: 1136: 895: 787: 674: 539: 504: 420: 389: 305: 193: 1262:
Poisson processes are well-behaved because they are
662:> 0.5 typically have a complex process structure. 52:
which is self-similar but not long-range dependent.
1169: 1146: 968: 873: 752: 589: 510: 484: 395: 369: 224: 87:etc. This can have far-reaching consequences for 138:Short-range dependence vs. long-range dependence 1806:Traffic Modelling and Related Queueing Problems 1692:Proceedings of the National Academy of Sciences 666:A distribution is said to be heavy-tailed if: 518:is the mean number of call departures in time 8: 1968:Self-Similar Network Traffic and its Control 1752:: CS1 maint: multiple names: authors list ( 1234:With Poisson traffic (found in conventional 403:is the mean number of call arrivals in time 1871:Jitter analysis of ATM self-similar traffic 1576:Heavy-tailed distributions and implications 1303:Web site provisioning for long-tail traffic 239:) is the autocorrelation function at a lag 1347:exploited to improve network performance. 1282:Network provisioning for long-tail traffic 1112:Markov Modulated Poisson Processes (MMPP) 779:of a heavy-tail distribution is given by: 176:function summed over all lags is infinite. 1729: 1711: 1608: 1162: 1157:Finally, results from simulations using 1138: 1137: 1135: 960: 946: 894: 820: 810: 786: 715: 700: 673: 568: 538: 503: 470: 446: 440: 419: 388: 355: 331: 325: 304: 225:{\displaystyle \rho (k)\sim k^{-\alpha }} 213: 192: 1409: 1252:Violation of delay bounds e.g. In video 1204:In the modern network environment with 643:Typical values of the Hurst parameter, 79:in its arrival and departure process. 1962: 1960: 1950: 1948: 1857: 1855: 1853: 1832: 1830: 1828: 1826: 1816: 1814: 1788: 1786: 1767: 1765: 1763: 1745: 1800: 1798: 1487: 1109:Poisson Pareto Burst Processes (PPBP) 1058:model for circuit switched networks. 498:is the number of call departures and 261:Tweedie exponential dispersion models 7: 1890:Grossglauser M.; Bolot J.C. (1999). 1541:Linington P.F., University of Kent, 1537: 1535: 1501: 1499: 1497: 1485: 1483: 1481: 1479: 1477: 1475: 1473: 1471: 1469: 1467: 1453: 1451: 1449: 1447: 1439:Appendix: Heavy-tailed distributions 1433: 1431: 1429: 1415: 1413: 590:{\displaystyle P=e^{\frac {-t}{h}},} 280:The Poisson distribution and traffic 271:there exists a related theorem, the 26:is one that assigns relatively high 1899:IEEE/ACM Transactions on Networking 1331: 1249:Cell/packet loss and queue overflow 1106:Infinite Markov Modulated Processes 1030:routing effects in the simulation. 990: 607: 383:is the number of call arrivals and 130:networks) traffic is self-similar. 1997:Tails of probability distributions 1076:rely heavily on the assumption of 982:represents the smallest value the 729: 14: 157:function over all lags is finite. 885:cumulative distribution function 603:is the Mean Holding Time (MHT). 1216:” such as delay variation and 1147:{\displaystyle {\mathcal {1}}} 997:What causes long-tail traffic? 929: 914: 905: 899: 797: 791: 726: 690: 678: 558: 543: 430: 424: 315: 309: 203: 197: 1: 1836:Chiu W., IBM DeveloperWorks, 1338:Controlling long-tail traffic 651:Any pure random process has 1597:Advances in Complex Systems 1255:Worst cases in statistical 1072:such as Poisson and finite 1034:Modelling long-tail traffic 614:The heavy-tail distribution 273:Tweedie convergence theorem 2018: 1062:fertile area of research. 160:As the lag increases, the 1619:10.1142/S0219525911003451 1351:resource provisioning is 777:probability mass function 24:heavy-tailed distribution 1655:10.1109/ICNP.1996.564935 1393:Traffic generation model 1275:service level agreements 620:exponential distribution 511:{\displaystyle \lambda } 257:method of expanding bins 36:long-tailed distribution 1170:{\displaystyle \alpha } 48:Additionally, there is 32:teletraffic engineering 1713:10.1073/pnas.012583099 1332:external links section 1171: 1148: 991:external links section 970: 875: 754: 608:external links section 591: 512: 486: 397: 371: 226: 1398:Tweedie distributions 1172: 1149: 1125:Tweedie distributions 1103:Iterated Chaotic Maps 971: 876: 755: 592: 513: 487: 398: 372: 265:central limit theorem 247:approaches infinity. 227: 1992:Stochastic processes 1649:. pp. 171–180. 1161: 1134: 1115:Multi-fractal models 893: 785: 672: 537: 502: 418: 396:{\displaystyle \mu } 387: 303: 287:Poisson distribution 191: 68:in network traffic. 1704:2002PNAS...99.2573W 1356:performance gains. 1181:Network performance 765:Pareto distribution 269:normal distribution 172:The area under the 89:network performance 1938:2004-12-04 at the 1876:2005-02-16 at the 1843:2012-10-23 at the 1581:2005-12-15 at the 1561:2005-03-15 at the 1512:2011-05-26 at the 1271:quality of service 1167: 1144: 966: 871: 750: 587: 508: 482: 393: 367: 222: 1911:10.1109/90.803379 1664:978-0-8186-7453-2 1121:Wavelet Modelling 954: 925: 861: 840: 722: 718: 714: 581: 554: 460: 345: 179:The decay of the 2009: 1971: 1964: 1955: 1952: 1943: 1929: 1923: 1922: 1896: 1887: 1881: 1868: 1862: 1859: 1848: 1834: 1821: 1818: 1809: 1802: 1793: 1790: 1781: 1778: 1772: 1769: 1758: 1757: 1751: 1743: 1733: 1715: 1683: 1677: 1676: 1648: 1637: 1631: 1630: 1612: 1592: 1586: 1572: 1566: 1552: 1546: 1539: 1530: 1523: 1517: 1503: 1492: 1489: 1462: 1455: 1442: 1435: 1424: 1417: 1176: 1174: 1173: 1168: 1153: 1151: 1150: 1145: 1143: 1142: 1074:Markov processes 1016:network topology 975: 973: 972: 967: 965: 964: 959: 955: 947: 923: 880: 878: 877: 872: 859: 838: 834: 833: 815: 814: 759: 757: 756: 751: 720: 719: 716: 712: 708: 707: 596: 594: 593: 588: 583: 582: 577: 569: 552: 517: 515: 514: 509: 491: 489: 488: 483: 478: 477: 465: 461: 459: 451: 450: 441: 402: 400: 399: 394: 376: 374: 373: 368: 363: 362: 350: 346: 344: 336: 335: 326: 231: 229: 228: 223: 221: 220: 2017: 2016: 2012: 2011: 2010: 2008: 2007: 2006: 2002:Autocorrelation 1977: 1976: 1975: 1974: 1965: 1958: 1953: 1946: 1940:Wayback Machine 1930: 1926: 1894: 1889: 1888: 1884: 1880:. utdallas.edu. 1878:Wayback Machine 1869: 1865: 1860: 1851: 1845:Wayback Machine 1835: 1824: 1819: 1812: 1803: 1796: 1791: 1784: 1779: 1775: 1770: 1761: 1744: 1685: 1684: 1680: 1665: 1646: 1639: 1638: 1634: 1594: 1593: 1589: 1583:Wayback Machine 1573: 1569: 1563:Wayback Machine 1553: 1549: 1540: 1533: 1524: 1520: 1514:Wayback Machine 1504: 1495: 1490: 1465: 1456: 1445: 1436: 1427: 1418: 1411: 1406: 1384: 1369:transport layer 1340: 1305: 1284: 1183: 1159: 1158: 1132: 1131: 1099:Brownian motion 1066:Gaussian models 1036: 999: 984:random variable 942: 941: 891: 890: 816: 806: 783: 782: 696: 670: 669: 658:Phenomena with 627:Hurst parameter 616: 570: 564: 535: 534: 526:The intervals, 500: 499: 466: 452: 442: 436: 416: 415: 385: 384: 351: 337: 327: 321: 301: 300: 282: 263:. Much as the 253: 209: 189: 188: 181:autocorrelation 174:autocorrelation 162:autocorrelation 155:autocorrelation 153:The sum of the 140: 66:self-similarity 58: 50:Brownian motion 12: 11: 5: 2015: 2013: 2005: 2004: 1999: 1994: 1989: 1979: 1978: 1973: 1972: 1956: 1944: 1924: 1905:(5): 629–640. 1882: 1863: 1849: 1822: 1810: 1794: 1782: 1773: 1759: 1698:(3): 2573–80. 1678: 1663: 1632: 1603:(6): 905–949. 1587: 1567: 1547: 1531: 1518: 1493: 1463: 1443: 1425: 1408: 1407: 1405: 1402: 1401: 1400: 1395: 1390: 1383: 1380: 1339: 1336: 1304: 1301: 1283: 1280: 1260: 1259: 1253: 1250: 1243: 1242: 1239: 1182: 1179: 1166: 1141: 1128: 1127: 1122: 1119: 1116: 1113: 1110: 1107: 1104: 1101: 1095: 1035: 1032: 1014:capacity) and 998: 995: 963: 958: 953: 950: 945: 940: 937: 934: 931: 928: 922: 919: 916: 913: 910: 907: 904: 901: 898: 870: 867: 864: 858: 855: 852: 849: 846: 843: 837: 832: 829: 826: 823: 819: 813: 809: 805: 802: 799: 796: 793: 790: 749: 746: 743: 740: 737: 734: 731: 728: 725: 711: 706: 703: 699: 695: 692: 689: 686: 683: 680: 677: 664: 663: 656: 615: 612: 586: 580: 576: 573: 567: 563: 560: 557: 551: 548: 545: 542: 532: 531: 507: 481: 476: 473: 469: 464: 458: 455: 449: 445: 439: 435: 432: 429: 426: 423: 413: 412: 392: 366: 361: 358: 354: 349: 343: 340: 334: 330: 324: 320: 317: 314: 311: 308: 298: 297: 281: 278: 252: 249: 233: 232: 219: 216: 212: 208: 205: 202: 199: 196: 185: 184: 177: 166: 165: 158: 144:autocovariance 139: 136: 57: 54: 13: 10: 9: 6: 4: 3: 2: 2014: 2003: 2000: 1998: 1995: 1993: 1990: 1988: 1985: 1984: 1982: 1969: 1963: 1961: 1957: 1951: 1949: 1945: 1941: 1937: 1934: 1928: 1925: 1920: 1916: 1912: 1908: 1904: 1900: 1893: 1886: 1883: 1879: 1875: 1872: 1867: 1864: 1858: 1856: 1854: 1850: 1846: 1842: 1839: 1833: 1831: 1829: 1827: 1823: 1817: 1815: 1811: 1807: 1801: 1799: 1795: 1789: 1787: 1783: 1777: 1774: 1768: 1766: 1764: 1760: 1755: 1749: 1741: 1737: 1732: 1727: 1723: 1719: 1714: 1709: 1705: 1701: 1697: 1693: 1689: 1682: 1679: 1674: 1670: 1666: 1660: 1656: 1652: 1645: 1644: 1636: 1633: 1628: 1624: 1620: 1616: 1611: 1606: 1602: 1598: 1591: 1588: 1584: 1580: 1577: 1571: 1568: 1564: 1560: 1557: 1551: 1548: 1544: 1538: 1536: 1532: 1528: 1522: 1519: 1515: 1511: 1508: 1502: 1500: 1498: 1494: 1488: 1486: 1484: 1482: 1480: 1478: 1476: 1474: 1472: 1470: 1468: 1464: 1460: 1454: 1452: 1450: 1448: 1444: 1440: 1434: 1432: 1430: 1426: 1422: 1416: 1414: 1410: 1403: 1399: 1396: 1394: 1391: 1389: 1388:Elephant Flow 1386: 1385: 1381: 1379: 1376: 1375:long queues. 1372: 1370: 1366: 1362: 1357: 1354: 1348: 1344: 1337: 1335: 1333: 1328: 1324: 1320: 1318: 1314: 1310: 1302: 1300: 1296: 1293: 1288: 1281: 1279: 1276: 1272: 1267: 1265: 1258: 1254: 1251: 1248: 1247: 1246: 1240: 1237: 1233: 1232: 1231: 1228: 1226: 1221: 1219: 1215: 1211: 1207: 1202: 1198: 1196: 1190: 1188: 1180: 1178: 1164: 1155: 1126: 1123: 1120: 1118:Matrix models 1117: 1114: 1111: 1108: 1105: 1102: 1100: 1096: 1094: 1090: 1089: 1088: 1085: 1083: 1079: 1075: 1071: 1067: 1063: 1059: 1057: 1051: 1047: 1043: 1041: 1033: 1031: 1027: 1023: 1019: 1017: 1013: 1009: 1005: 1004:client/server 996: 994: 992: 987: 985: 981: 976: 961: 956: 951: 948: 943: 938: 935: 932: 926: 920: 917: 911: 908: 902: 896: 888: 887:is given by: 886: 881: 868: 865: 862: 856: 853: 850: 847: 844: 841: 835: 830: 827: 824: 821: 817: 811: 807: 803: 800: 794: 788: 780: 778: 773: 769: 766: 760: 747: 744: 741: 738: 735: 732: 723: 709: 704: 701: 697: 693: 687: 684: 681: 675: 667: 661: 657: 654: 650: 649: 648: 646: 641: 639: 635: 631: 628: 623: 621: 613: 611: 609: 604: 602: 597: 584: 578: 574: 571: 565: 561: 555: 549: 546: 540: 529: 525: 524: 523: 521: 505: 497: 492: 479: 474: 471: 467: 462: 456: 453: 447: 443: 437: 433: 427: 421: 410: 409: 408: 406: 390: 382: 377: 364: 359: 356: 352: 347: 341: 338: 332: 328: 322: 318: 312: 306: 295: 294: 293: 290: 288: 279: 277: 274: 270: 266: 262: 258: 250: 248: 246: 242: 238: 217: 214: 210: 206: 200: 194: 187: 186: 182: 178: 175: 171: 170: 169: 163: 159: 156: 152: 151: 150: 147: 145: 137: 135: 131: 129: 125: 121: 117: 113: 109: 105: 101: 97: 92: 90: 85: 80: 78: 74: 71:Self-similar 69: 67: 63: 55: 53: 51: 46: 44: 39: 37: 33: 29: 28:probabilities 25: 21: 16: 1927: 1902: 1898: 1885: 1866: 1776: 1748:cite journal 1695: 1691: 1681: 1642: 1635: 1600: 1596: 1590: 1570: 1550: 1521: 1377: 1373: 1358: 1349: 1345: 1341: 1329: 1325: 1321: 1317:availability 1306: 1297: 1289: 1285: 1268: 1261: 1257:multiplexing 1244: 1229: 1222: 1203: 1199: 1191: 1184: 1156: 1129: 1086: 1078:independence 1064: 1060: 1052: 1048: 1044: 1037: 1028: 1024: 1020: 1000: 988: 979: 977: 889: 882: 781: 774: 770: 761: 668: 665: 659: 652: 644: 642: 637: 633: 629: 624: 617: 605: 600: 598: 533: 527: 519: 495: 493: 414: 404: 380: 378: 299: 291: 283: 254: 244: 240: 236: 234: 167: 148: 141: 132: 93: 81: 70: 59: 47: 43:self-similar 40: 19: 17: 15: 1987:Teletraffic 1218:packet loss 1097:Fractional 1091:Fractional 1070:time series 1040:provisioned 146:functions. 84:time-series 20:long-tailed 1981:Categories 1931:Biran G., 1404:References 1292:throughput 1208:and other 1206:multimedia 1195:burstiness 1187:congestion 986:can take. 96:Mandelbrot 82:With many 1966:Park K., 1610:0807.3374 1365:protocols 1353:open-loop 1343:infancy. 1264:stateless 1236:telephony 1165:α 1082:Nonlinear 1008:bandwidth 962:α 939:− 921:≤ 866:≥ 842:α 828:− 825:α 822:− 812:α 804:α 742:α 730:∞ 727:→ 705:α 702:− 694:∼ 572:− 550:≥ 506:λ 475:λ 472:− 444:λ 391:μ 360:μ 357:− 329:μ 218:α 215:− 207:∼ 195:ρ 1936:Archived 1919:27643981 1874:Archived 1841:Archived 1740:11875212 1673:13632261 1627:18937228 1579:Archived 1559:Archived 1510:Archived 1382:See also 1313:variance 883:and its 235:where ρ( 73:Ethernet 62:Internet 56:Overview 1722:3057595 1700:Bibcode 1367:in the 1309:latency 100:fractal 77:Poisson 1917:  1738:  1731:128578 1728:  1720:  1671:  1661:  1625:  1290:While 1214:jitter 1056:Erlang 1012:buffer 978:where 924:  860:  839:  721:  713:  599:where 553:  494:where 379:where 120:TELNET 1915:S2CID 1895:(PDF) 1718:JSTOR 1669:S2CID 1647:(PDF) 1623:S2CID 1605:arXiv 1093:ARIMA 655:= 0.5 1754:link 1736:PMID 1659:ISBN 1361:HTTP 1273:and 1010:and 851:> 775:The 745:< 739:< 685:> 625:The 122:and 1907:doi 1726:PMC 1708:doi 1651:doi 1615:doi 1210:QoS 128:ATM 124:VBR 116:FTP 112:TCP 108:SS7 104:WWW 22:or 1983:: 1959:^ 1947:^ 1913:. 1901:. 1897:. 1852:^ 1825:^ 1813:^ 1797:^ 1785:^ 1762:^ 1750:}} 1746:{{ 1734:. 1724:. 1716:. 1706:. 1696:99 1694:. 1690:. 1667:. 1657:. 1621:. 1613:. 1601:14 1599:. 1534:^ 1496:^ 1466:^ 1446:^ 1428:^ 1412:^ 1334:. 1225:IP 993:. 717:as 647:: 622:. 610:. 522:. 289:. 118:, 114:, 110:, 106:, 91:. 18:A 1942:. 1921:. 1909:: 1903:7 1847:. 1808:. 1756:) 1742:. 1710:: 1702:: 1675:. 1653:: 1629:. 1617:: 1607:: 1585:. 1565:. 1545:. 1529:. 1516:. 1461:. 1441:. 1423:. 1140:1 980:k 957:) 952:x 949:k 944:( 936:1 933:= 930:] 927:x 918:X 915:[ 912:P 909:= 906:) 903:x 900:( 897:F 869:k 863:x 857:, 854:0 848:k 845:, 836:, 831:1 818:x 808:k 801:= 798:) 795:x 792:( 789:p 748:2 736:0 733:, 724:x 710:, 698:x 691:] 688:x 682:X 679:[ 676:P 660:H 653:H 645:H 638:H 634:H 630:H 601:h 585:, 579:h 575:t 566:e 562:= 559:] 556:t 547:T 544:[ 541:P 528:T 520:T 496:d 480:, 468:e 463:) 457:! 454:d 448:d 438:( 434:= 431:) 428:d 425:( 422:P 405:T 381:a 365:, 353:e 348:) 342:! 339:a 333:a 323:( 319:= 316:) 313:a 310:( 307:P 245:k 241:k 237:k 211:k 204:) 201:k 198:(

Index

heavy-tailed distribution
probabilities
teletraffic engineering
long-tailed distribution
self-similar
Brownian motion
Internet
self-similarity
Ethernet
Poisson
time-series
network performance
Mandelbrot
fractal
WWW
SS7
TCP
FTP
TELNET
VBR
ATM
autocovariance
autocorrelation
autocorrelation
autocorrelation
autocorrelation
method of expanding bins
Tweedie exponential dispersion models
central limit theorem
normal distribution

Text is available under the Creative Commons Attribution-ShareAlike License. Additional terms may apply.