An algorithm for Architecture Partioning in High-Speed Networks with [Vol. 2, No. 1, 1994]

An algorithm for Architecture Partioning in High-Speed Networks with

Anna Hac
Department of Electrical Engineering
University of Hawaii at Manoa
Honolulu, Hawaii 96822

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 application of the model. The results show that the elapsed time of packet switch transfer depends exponentially on the number of partitions in the network.

Keywords: High-speed networks; bursty traffic; performance analysis; partition; congestion.

JNSM: Vol. 2, No. 1, 1994 An algorithm for Architecture Partioning in High-Speed Networks with [Vol. 2, No. 1, 1994]

NOTE: only abstract of paper available on-line

Back to JNSM main page