You can refer to this link for detailed procedure to simulte general queues- https://github.com/shivankgarg98/NetSim-Experiments/blob/master/General_Queuing_System_in_NetSim.md

Good Luck!

Thank you Shivank and Akash

The M before the first slash (denoting “Markov”) denotes the Poisson Process of instants at which packets enter the buffer. The G between the two slashes (denoting “General”) denotes the fixed time taken to serve each queued packet

The 1 after the second slash denotes that there is just a single server (Link 1 in our example). This way of describing a single server queueing system is called Kendall’s Notation.

Let us suppose that, from such an application, the packets arrive at the points of a Poisson process of rate Lambda, and that the randomly varying packet transmission times can be modelled as independent and identically distributed random variables, B1, B2, B3, ... with mean B and second moment B(2) , i.e., variance. Such a model is denoted by M/G/1.

In NetSim if you set the inter-packet arrival time as exponential and the packet sizes as exponential, you will get an M/G/1 distribution. The reason it is G is because to these exponential packet sizes a constant overhead is added.

Such an M/G/1 system can be solved using the Pollacek-Khinchine formula or P-K formula, after the researchers who first obtained it