Please use this identifier to cite or link to this item:
                
    
    http://www.ir.juit.ac.in:8080/jspui/jspui/handle/123456789/9115Full metadata record
| DC Field | Value | Language | 
|---|---|---|
| dc.contributor.author | Nitin | - | 
| dc.contributor.author | Garhwal, Shruti | - | 
| dc.contributor.author | Srivastava, Neha | - | 
| dc.date.accessioned | 2023-01-11T11:10:41Z | - | 
| dc.date.available | 2023-01-11T11:10:41Z | - | 
| dc.date.issued | 2009 | - | 
| dc.identifier.uri | http://ir.juit.ac.in:8080/jspui/jspui/handle/123456789/9115 | - | 
| dc.description.abstract | Multi-stage Interconnection Networks (MINs) are designed to achieve fault-tolerance and collision solving by providing a set of disjoint paths. Ching-Wen Chen and Chung-Ping Chung had proposed a fault-tolerant network called Combining Switches Multi-stage Interconnection Network (CSMIN) and an inaccurate algorithm that provided two correct disjoint paths only for some source-destination pairs. This paper provides a more comprehensive and accurate algorithm that always generate correct routing-tags for two disjoint paths for every source-destination pair in the CSMIN. The 1-fault tolerant CSMIN causes the two disjoint paths to have regular distances at each stage. Moreover, our algorithm backtracks a packet to the previous stage and takes the other disjoint path in the event of a fault or a collision in the net- | en_US | 
| dc.language.iso | en | en_US | 
| dc.publisher | Jaypee University of Information Technology, Solan, H.P. | en_US | 
| dc.subject | Disjoint Paths | en_US | 
| dc.subject | Fault-tolerant | en_US | 
| dc.title | Designing a Fault-tolerant Fully-Chained Combining Switches Multi-stage Interconnection Network with Disjoint Paths | en_US | 
| dc.type | Article | en_US | 
| Appears in Collections: | Journal Articles | |
Files in This Item:
| File | Description | Size | Format | |
|---|---|---|---|---|
| s11227-009-0336-z.pdf | 1.66 MB | Adobe PDF | View/Open | 
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.