Abstract
A general cut-through switching (GCTS) technique is proposed and analyzed. In GCTS, a message may cut through a node if the node becomes free before the message is completely received there. Under the GCTS mechanism, a message may cut through a node even though the node has more than one message in it. This results in minimizing the end-to-end delay time of messages as compared to the other cut-through mechanisms. Moreover, GCTS is more susceptible to exact mathematical treatment.
Published Version
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
