Performance analysis of a cut-through vs. packet-switching techniques

Abstract

siiriirlatioii package contaiiiirig CI class 0fjh.e adaptive ri)uhi,g n1goritliin.r has heeii itsed 10 hve.Ytigde the perf(wiiiaiice of tlie virii~l cui-tliroiigli,nvilching iecliiiitpe?‘lie jive algorithiiis are: ihe shortest path, the lenriiiiig nitioiitnln, the deterininistic rule, the distributed coiiipulalions mid the relaxation principle roirtiiig nlgoriiliriis 1’erfi)riiiniice criierin iiiclucle the average clelq, overage trnnnsii time, average reea’ansiiiission prohnhrlitv ciiitl iieiwork utilization. These paraiiieters ore iiitirnate!v rekited to each other They are cornpared uitli thai c ftlie packet switching using the saiiie rouirrig algoritkms 1:flcient switching lechniques puariiiitee die hest value.for iliese performance pnrmiicters. The resirlts obtained will he an aid iri conipnriiig ihe hvo.nuiicl?ing techiiiqires uiider diflererit roil tirip nlpo~ithnis. 1

Similar works

This paper was published in CiteSeerX.

Having an issue?

Is data on this page outdated, violates copyrights or anything else? Report the problem now and we will take corresponding actions after reviewing your request.