Performance analysis of an integrated voice/data cut-through switching network
Computer Networks and ISDN Systems
Classification Categories and Historical Development of Circuit Switching Topologies
ACM Computing Surveys (CSUR)
Principles of Computer Communication Network Design
Principles of Computer Communication Network Design
Computer Communications Network Design and Analysis
Computer Communications Network Design and Analysis
New line tariffs and their impact on network design
AFIPS '74 Proceedings of the May 6-10, 1974, national computer conference and exposition
On Bandwidth Adjusted Multicast Communications in Pipeline Router Architecture
The Journal of Supercomputing
On bandwidth adjusted multicast in pipelined routing architecture for mobile environment
ICCSA'03 Proceedings of the 2003 international conference on Computational science and its applications: PartII
| Hi-index | 0.00 |
A simulation package containing a class of five adaptive routing algorithms has been used to investigate the performance of the virtual cut through switching technique. The five algorithms are: the shortest path, the learning automata, the deterministic rule, the distributed computations and the relaxation principle routing algorithms. Performance criteria include: the average delay, average transit time, average retransmission probability and network utilization. These parameters are intimately related to each other. They are compared with that of the packet switching using the same routing algorithms. Efficient switching techniques guarantee the best value for these performance parameters. The results obtained will be an aid in comparing the two switching techniques under different routing algorithms with the objective of determining the robust technique and/or algorithm for computer network.