Simulation of Network Delays
Abstract: We compare performance of two types of queuing networks: First-Come-First-Served (FCFS) and Processor Sharing (PS). Both have Poisson arrivals; both have deterministic (constant time) servers. However, in the first type the service order is FCFS, and in the second it is PS. We investigate which factors affect the relationship between the average delay of packets in the FCFS and the PS networks. Knowing how to calculate the average delay in a PS network, we try to come up with a systematic way to estimate the delay of packets in the corresponding network with FCFS servers.