Performance analysis of integrated data/voice star topology circuit-switched networks

The authors consider integrated data/voice circuit-switched networks which assume a star topology consisting of local area networks (LANs) interconnected through a backbone metropolitan area network (MAN). The stations are classified into two categories: data and voice stations. They are characterized by different arrival rate and session-length (holding time) statistics. A data (voice) session connection between a LAN-i station and a LAN-j station requires the allocation of a dedicated circuit (m circuits for voice) in the underlying LANs (i and j) and an interconnecting circuit (m circuits) in the backbone MAN. End-to-end blocking probabilities are calculated in terms of three components: circuit blocking probability, destination busy probability, and concurrent busy probability. For larger size systems, the authors develop an iterative algorithm that provides a computationally efficient method for the calculation of the end-to-end blocking probabilities. They incorporate into this algorithm the effects of the destination busy events, demonstrating that such events could provide a significant contribution to the end-to-end blocking performance when network conditions induce pronounced destination busy probabilities for all or some stations