PERFORMANCE ANALYSIS OF THE N × N NON-BLOCKING PACKET SWITCH WITH M/M/C PATH AT HEAD-OF-LINE

✍ Scribed by WEERACHAI CHAOKUMNERD; PRASIT PRAPINMONGKOLKARN

• Book ID: 101287297
• Publisher: John Wiley and Sons
• Year: 1996
• Tongue: English
• Weight: 372 KB
• Volume: 9
• Category: Article
• ISSN: 1074-5351
• DOI: 10.1002/(sici)1099-1131(199607)9:4<223::aid-dac302>3.0.co;2-t

✦ Synopsis

This paper focuses on a general model MIMIC queue for the switch path application, solving the case when packets at the head-of-line position have the same destination. These packets can pass through C paths to the same output port simultaneously. There are two types of service: the first in first out (FIFO) and the random order of service (ROS). Research concludes that among three switching paths, the response time of the FIFO type, under 70 per cent load condition, is better than that of the ROS type by 10 per cent. The theory of the binary hypercube is also used as a model for finding the steadystate probability (Pmo) in the case of zero packets in the system. Using P , to determine performance, the authors' proposed approach is shown to be superior to previously suggested methods.