Queuing models create lot of interest due to their ready applicability in the analysis of several congestion control systems. In this paper, we develop and analyze K-parallel and series queuing systems which is connected in a single network. Here, it is assumed that there are 'K' queues Q 1 , Q 2 , …, Q k which are connected in parallel and connected in series to another queue Q k?1 . Here the arrivals are in bulk and follows a compound Poisson process. It is assumed that the service completions in K nodes is load dependent and follow Poisson processes. Using the difference differential equations the joint probability generating function of number of customers in each queue is derived. The system performance measures such as average number of customers in each queue, the probability of the system emptiness, the average waiting time of a customer, throughput of the queues and the variability of system size distribution in each queue are derived and analyzed through numerical illustrations. The utility of this model in queue line control is demonstrated through applying it at Tirumala Tirupati Devasthanam which deals with pilgrims is also discussed. It is observed that the load dependent strategy reduces the congestion in queues and mean delays.