System and method for simulating traffic loads in packetized communication networks

• US 20040240387A1
• Filed: 05/28/2003
• Published: 12/02/2004
• Est. Priority Date: 05/28/2003
• Status: Active Grant

• Current Assignee: Alcatel-Lucent USA, Inc. (Nokia Corporation)
• Original Assignee: Lucent Technologies, Inc. (Nokia Corporation)
• Inventors: Nuzman, Carl J., Weiss, Alan A., Saniee, Iraj
• Granted Patent: US 7,885,803 B2
• Time in Patent Office: Days
• US Class Current: 370/252
• CPC Class Codes: H04L 41/145 involving simulating, designing, planning or modelling of a network
• CPC Class Codes: H04L 41/24 using dedicated network management hardware

Abstract

A system for, and method of, simulating traffic loads in a packetized communication network. In one embodiment, the system includes: (1) an initial arrival generator that generates an initial arrival for a simulated user session at an independent time from a previous user session arrival and (2) a subsequent arrival generator, associated with the initial arrival generator, that generates a number of connections to be associated with the simulated user session as an independent variable and, if the number of connections is greater than one, generates a mean connection interarrival time for the simulated user session and a plurality of timings of subsequent arrivals.

Claims

1. A system for simulating traffic loads in a packetized communication network, comprising:

an initial arrival generator that generates an initial arrival for a simulated user session at an independent time from a previous user session arrival; and

a subsequent arrival generator, associated with said initial arrival generator, that generates a number of connections to be associated with said simulated user session as an independent variable and, if said number of connections is greater than one, generates a mean connection interarrival time for said simulated user session and a plurality of timings of subsequent arrivals.

2. The system as recited in claim 1 wherein said time is an exponentially distributed time.

3. The system as recited in claim 1 wherein said subsequent arrival generator generates said number of connections as an independent random biPareto variable.

4. The system as recited in claim 1 wherein said plurality of timings numbers one less than said number of connections.

5. The system as recited in claim 1 wherein said plurality of timings are independent Weibull random variables.

6. The system as recited in claim 1 wherein said plurality of timings are scaled to conform to a period of time.

7. The system as recited in claim 1 wherein said subsequent arrival generator generates subsequent arrivals based on a sorted list of said plurality of timings.

8. A method of simulating traffic loads in a packetized communication network, comprising:

generating an initial arrival for a simulated user session at an independent time from a previous user session arrival;

generating a number of connections to be associated with said simulated user session as an independent variable; and

generating a mean connection interarrival time for said simulated user session and a plurality of timings of subsequent arrivals if said number of connections is greater than one.

9. The method as recited in claim 8 wherein said time is an exponentially distributed time.

10. The method as recited in claim 8 wherein said generating said number of connections comprises generating said number of connections as an independent random biPareto variable.

11. The method as recited in claim 8 wherein said plurality of timings numbers one less than said number of connections.

12. The method as recited in claim 8 wherein said plurality of timings are independent Weibull random variables.

13. The method as recited in claim 8 wherein said plurality of timings are scaled to conform to a period of time.

14. The method as recited in claim 8 further comprising generating subsequent arrivals based on a sorted list of said plurality of timings.

15. A system for simulating traffic loads in a packetized communication network, comprising:

an initial arrival generator that generates an initial arrival for a simulated user session at an independent, exponentially distributed time from a previous user session arrival; and

a subsequent arrival generator, associated with said initial arrival generator, that generates a number of connections to be associated with said simulated user session as an independent variable and, if said number of connections is greater than one, generates a mean connection interarrival time for said simulated user session and a plurality of timings of subsequent arrivals, said subsequent arrival generator generating subsequent arrivals based on a sorted list of said plurality of timings.

16. The system as recited in claim 15 wherein said subsequent arrival generator generates said number of connections as an independent random biPareto variable.

17. The system as recited in claim 15 wherein said plurality of timings numbers one less than said number of connections.

18. The system as recited in claim 15 wherein said plurality of timings are independent Weibull random variables.

19. The system as recited in claim 15 wherein said plurality of timings are scaled to conform to a specified period of time.

20. The system as recited in claim 15 wherein said system incorporates an algorithm that generates a point process of events for modeling Transmission Control Protocol (TCP) connections.