Abstract
This paper analyzes the performance of a switching architecture. The performance measures include the elapsed time of packet transfer and the waiting time to begin transfer. The architecture is partitioned depending on the type of network used and the expected traffic in the network. Every partition has a switch with a buffer that can absorb surges of bursty traffic within the network partition. The buffer size depends on the type of the network and incoming traffic. The partition size depends on the network bandwidth, network traffic, packet size and buffer size. Examples of different networks are used to show the applications of the model. The results show that the elapsed time of packet switch transfer depends exponentially on the number of partitions in the network.
Similar content being viewed by others
References
A. Hać, Congestion Control and Switch Buffer Allocation in High-Speed Networks,Proc. IEEE INFOCOM'91 pp. 314–322, April 9–11, 1991.
G. Ramamurthy, and R. S. Dighe, Integration of High Speed Continuous Stream Data Traffic in a Broadband Packet Network,Proc. IEEE INFOCOM'89 pp. 1063–1071, 1989.
J. Filipiak, Structure of Traffic Flow in Multiservice Network,Proc. IEEE GLOBECOM'88 pp. 425–429, November 28–December 1, 1988.
L. Dittmann, and S. B. Jacobsen, Statistical Multiplexing of Identical Bursty Sources in an ATM NetworkProc. IEEE GLOBECOM'88 pp. 1293–1297, November 28–December 1, 1988.
I. W. Habib, and T. N. Saadawi, Controlling Flow and Avoiding Congestion in Broadband Networks,IEEE Comm. Mag., Vol. 29, No. 10, pp. 46–53, October 1991.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Hać, A. An algorithm for architecture partitioning in high-speed networks with bursty traffic. J Netw Syst Manage 2, 49–62 (1994). https://doi.org/10.1007/BF02141604
Issue Date:
DOI: https://doi.org/10.1007/BF02141604