We analyze some queueing models to discuss capacity dimensioning of access links of a LAN interworking unit connected to the Inernet backbone network. We assume that thw IWU has a processor sharing scheduling algorithm to transmit WWW documents to the...
We analyze some queueing models to discuss capacity dimensioning of access links of a LAN interworking unit connected to the Inernet backbone network. We assume that thw IWU has a processor sharing scheduling algorithm to transmit WWW documents to the Internet. In order to analyze the LAN IWU with PS schedule, we use G/M/1/PS, M/M/1/PS and M/G/1/PS queueing models. But we use both the heavy-tailed input and service time models and the Karkovian input and service time models in numerical examples for simple performance comparisons. As performance measures, we obtain the mean sojourn times and varian. We present some numerical results to show the effect of heavy-tail characteristics on the mean sojourn time and the access link capacity.