Self-similar traffic generation

A method for mimicking self-similar traffic in a telecommunications network, the method comprising

• providing values for at least one self-similarity parameter for plural streams, the self-similarity parameters including a Hurst parameter
• selecting at least one of the streams
• generating a self-similar traffic distribution for the selected streams based on the values of the self similarity parameters for the selected streams, wherein the self-similar traffic distribution is further based upon distributed sequences retrieved from a memory based upon the value of the Hurst parameter for the selected streams
• wherein the memory stores distributed sequences for self-similar traffic correlated to a range of values for the Hurst parameter
• wherein the distributed sequences are described by a formula having a shape parameter and a minimum value for the respective distributed sequence and a uniformly distributed random variable
• wherein the value for the shape parameter is fixed and the minimum value for the distributed sequences is fixed
• wherein the memory stores logarithms of values of the uniformly distributed random variable.

A method for mimicking self-similar traffic in a telecommunications network, the method comprising

• providing values for at least one self-similarity parameter for plural streams, the self-similarity parameters including a Hurst parameter
• selecting at least one of the streams
• generating self-similar traffic distributions for the selected streams based the values of on the self similarity parameters for the selected streams, wherein
• the self-similar traffic distribution is based upon distributed sequences described by a formula having a shape parameter, a minimum value for the respective distributed sequences and a uniformly distributed random variable
• the shape parameter has a fixed value
• the minimum value for the distributed sequences is fixed
• the distributed sequences are obtained from logarithms of values of the uniformly distributed random variable.

An apparatus for mimicking self-similar traffic in a telecommunications network, the apparatus comprising

• a buffer to receive values for at least one self-similarity parameter for plural streams, the self-similarity parameters including a Hurst parameter
• an arbitrator coupled to the buffer to select at least one of the streams
• a memory storing a table of distributed sequences for self-similar traffic
• a distribution calculator coupled to the memory, the distribution calculator to generate a self-similar traffic distribution for the selected streams based on the values of the self similarity parameters for the selected streams
• wherein the self-similar traffic distribution is further based upon distributed sequences retrieved from the table based upon the value of the Hurst parameter for the selected streams
• wherein the distributed sequences are described by a formula having a shape parameter and a minimum value for the respective distributed sequence and a uniformly distributed random variable
• wherein the value for the shape parameter is fixed and the minimum value for the distributed sequences is fixed
• wherein the table comprises logarithms of values of the uniformly distributed random variable
• a scheduler coupled to the distribution calculator to schedule transmission of data units for the selected streams.

An apparatus for mimicking self-similar traffic in a telecommunications network, the apparatus comprising

• a buffer to receive values for at least one self-similarity parameter for plural streams, the self-similarity parameters including a Hurst parameter
• an arbitrator coupled to the buffer to select at least one of the streams
• a memory storing distributed sequences for self-similar traffic correlated to a range of values for the Hurst parameter
• a distribution calculator coupled to the memory, the distribution calculator to generate a self-similar traffic distribution for the selected streams based on the values of the self similarity parameters for the selected streams
• wherein the self-similar traffic distribution is further based upon distributed sequences retrieved from the memory based upon the value of the Hurst parameter for the selected streams
• wherein the distributed sequences are described by a formula having a shape parameter and a minimum value for the respective distributed sequence and a uniformly distributed random variable
• wherein the value for the shape parameter is fixed and the minimum value for the distributed sequences is fixed
• wherein the memory stores logarithms of values of the uniformly distributed random variable
• a scheduler coupled to the distribution calculator to schedule transmission of data units for the selected streams.

An apparatus for mimicking self-similar traffic in a telecommunications network, the apparatus comprising

• a buffer to receive values for at least one self-similarity parameter for plural streams, the self-similarity parameters including a Hurst parameter
• an arbitrator coupled to the buffer to select at least one of the streams
• a memory storing distributed sequences for self-similar traffic correlated to a range of values for the Hurst parameter
• a distribution calculator coupled to the memory, the distribution calculator to generate self-similar traffic distributions for the selected streams based on the values of the self similarity parameters for the selected streams, wherein
• the self-similar traffic distribution is based upon distributed sequences described by a formula having a shape parameter, a minimum value for the respective distributed sequences and a uniformly distributed random variable
• the shape parameter has a fixed value
• the minimum value for the distributed sequences is fixed
• the distributed sequences are obtained from logarithms of values of the uniformly distributed random variable
• a scheduler coupled to the distribution calculator to schedule transmission of data units for the selected streams.

A computer-readable medium having computer readable program code embodied therein for mimicking self-similar traffic in a telecommunications network, the computer readable code which when executed by a computer causing the computer to perform:

• receive values for at least one self-similarity parameter for plural streams, the self-similarity parameters including a Hurst parameter
• select at least one of the streams
• generate a self-similar traffic distribution for the selected streams based on the values of the self similarity parameters for the selected streams
• wherein the self-similar traffic distribution is further based upon distributed sequences retrieved from a table based upon the value of the Hurst parameter for the selected streams
• wherein the table stores distributed sequences for self-similar traffic
• wherein the distributed sequences are described by a formula having a shape parameter and a minimum value for the respective distributed sequence and a uniformly distributed random variable
• wherein the value for the shape parameter is fixed and the minimum value for the distributed sequences is fixed
• wherein the table comprises logarithms of values of the uniformly distributed random variable.

A computer-readable medium having computer readable program code embodied therein for mimicking self-similar traffic in a telecommunications network, the computer readable code which when executed by a computer causing the computer to perform:

• receive values for at least one self-similarity parameter for plural streams, the self-similarity parameters including a Hurst parameter
• select at least one of the streams
• generate a self-similar traffic distribution for the selected streams based on the values of the self similarity parameters for the selected streams
• wherein the self-similar traffic distribution is further based upon distributed sequences retrieved from a memory based upon the value of the Hurst parameter for the selected streams
• wherein the memory stores distributed sequences for self-similar traffic correlated to a range of values for the Hurst parameter
• wherein the distributed sequences are described by a formula having a shape parameter and a minimum value for the respective distributed sequence and a uniformly distributed random variable
• wherein the value for the shape parameter is fixed and the minimum value for the distributed sequences is fixed
• wherein the memory stores logarithms of values of the uniformly distributed random variable.

A computer-readable medium having computer readable program code embodied therein for mimicking self-similar traffic in a telecommunications network, the computer readable code which when executed by a computer causing the computer to perform:

• receive values for at least one self-similarity parameter for plural streams, the self-similarity parameters including a Hurst parameter
• select at least one of the streams
• generate self-similar traffic distributions for the selected streams based on the values of the self similarity parameters for the selected streams, wherein
• the self-similar traffic distribution is based upon distributed sequences described by a formula having a shape parameter, a minimum value for the respective distributed sequences and a uniformly distributed random variable
• the shape parameter has a fixed value
• the minimum value for the distributed sequences is fixed
• the distributed sequences are obtained from logarithms of values of the uniformly distributed random variable.