In this research, we concentrate on the effects of dependencies in arrival processes on queueing measures. In particular, we use a specific form of arrival process which has the advantage of allowing us to change dependency properties without at the same time changing one dimensional distributional conditions. It is shown that the mean queue length can be made arbitrarily large with the same interarrival distributions and the same service time distributions with fixed smaller than one traffic intensity.