An Efficient Routing Implementation for Irregular Networks

1
Chand Mal Samota
Chand Mal Samota
2
Naveen Choudhary
Naveen Choudhary
3
Dharm Singh
Dharm Singh
1 Maharana Pratap University of Agriculture and Technology

Send Message

To: Author

GJCST Volume 14 Issue E5

Article Fingerprint

ReserarchID

CSTNWSAN7J6

An Efficient Routing Implementation for Irregular Networks Banner
  • English
  • Afrikaans
  • Albanian
  • Amharic
  • Arabic
  • Armenian
  • Azerbaijani
  • Basque
  • Belarusian
  • Bengali
  • Bosnian
  • Bulgarian
  • Catalan
  • Cebuano
  • Chichewa
  • Chinese (Simplified)
  • Chinese (Traditional)
  • Corsican
  • Croatian
  • Czech
  • Danish
  • Dutch
  • Esperanto
  • Estonian
  • Filipino
  • Finnish
  • French
  • Frisian
  • Galician
  • Georgian
  • German
  • Greek
  • Gujarati
  • Haitian Creole
  • Hausa
  • Hawaiian
  • Hebrew
  • Hindi
  • Hmong
  • Hungarian
  • Icelandic
  • Igbo
  • Indonesian
  • Irish
  • Italian
  • Japanese
  • Javanese
  • Kannada
  • Kazakh
  • Khmer
  • Korean
  • Kurdish (Kurmanji)
  • Kyrgyz
  • Lao
  • Latin
  • Latvian
  • Lithuanian
  • Luxembourgish
  • Macedonian
  • Malagasy
  • Malay
  • Malayalam
  • Maltese
  • Maori
  • Marathi
  • Mongolian
  • Myanmar (Burmese)
  • Nepali
  • Norwegian
  • Pashto
  • Persian
  • Polish
  • Portuguese
  • Punjabi
  • Romanian
  • Russian
  • Samoan
  • Scots Gaelic
  • Serbian
  • Sesotho
  • Shona
  • Sindhi
  • Sinhala
  • Slovak
  • Slovenian
  • Somali
  • Spanish
  • Sundanese
  • Swahili
  • Swedish
  • Tajik
  • Tamil
  • Telugu
  • Thai
  • Turkish
  • Ukrainian
  • Urdu
  • Uzbek
  • Vietnamese
  • Welsh
  • Xhosa
  • Yiddish
  • Yoruba
  • Zulu

With the recent advancements in multi-core era, workstation clusters have emerged as a cost-effective approach to build a network of workstations (NOWs). NOWs connect the small groups of processors to a network of switching elements that form irregular topologies. Designing an efficient routing and a deadlock avoidance algorithm for irregular networks is quite complicated in terms of latency and area of the routing tables, thus impractical for scalability of On Chip Networks. Many deadlock free routing mechanisms have been proposed for regular networks, but they cannot be employed in irregular networks. In this paper a new methodology has been proposed for efficient routing scheme, called LBDR-UD, which save the average 64.59% routing tables in the switch for irregular networks as compare to up*/down* routing. The Basic concept of routing scheme is combination of up*/down* and Logic Based Distributed Routing. By simulation, it has been shown that the LBDR-UD is deadlock free and adaptive to all dynamic network traffic conditions.

16 Cites in Articles

References

  1. Rajendra Boppana,Suresh Chalasani (1993). A comparison of adaptive wormhole routing algorithms.
  2. A Chien,J Kim (1995). Planar-Adaptive Routing: Low-Cost Adaptive Networks for Multiprocessors.
  3. N Choudhary (2013). Principles of on-chip Interconnection Networks.
  4. Dally,Seitz (1987). Deadlock-Free Message Routing in Multiprocessor Interconnection Networks.
  5. J Duato (1000). A new theory of deadlock-free adaptive routing in wormhole networks.
  6. (null). Table 6: Comparison of average total training and scoring times (in seconds) and average model size in memory (in kB)..
  7. J Flich,J Duato (2008). Logic based distributed routing for NOCs.
  8. C Glass,L Ni (1992). The Turn Model for Adaptive Routing.
  9. A Jouraku,A Funahashi,H Amano,M Koibuchi (2001). L-turn routing: an adaptive routing in irregular networks.
  10. L Ni,P Mckinley (1993). A Survey of Wormhole Routing Techniques in Direct Networks.
  11. J Sancho,A Robles,J Duato (2001). A new methodology to compute deadlock free routing tables for irregular networks.
  12. M Schroeder,A Birrell,M Burrows,H Murray,R Needham,T Rodeheffer,E Satterthwaite,C Thacker (1991). Autonet: a high-speed, self-configuring local area network using point-to-point links.
  13. F Silla,Duato (2000). High-performance routing in networks of workstations with irregular topology.
  14. F Silla,M Malumbres,A Robles,P López,J Duato (1997). Efficient adaptive routing in networks of workstations with irregular topology.
  15. Y Sun,C Yang,Y Chung,T Hang (2004). An efficient deadlock-free tree-based routing algorithm for irregular wormhole-routed networks based on turn model.
  16. Jie Wu,L Sheng (1999). DEADLOCK-FREE ROUTING IN IRREGULAR NETWORKS USING PREFIX ROUTING.

Funding

No external funding was declared for this work.

Conflict of Interest

The authors declare no conflict of interest.

Ethical Approval

No ethics committee approval was required for this article type.

Data Availability

Not applicable for this article.

Chand Mal Samota. 2014. \u201cAn Efficient Routing Implementation for Irregular Networks\u201d. Global Journal of Computer Science and Technology - E: Network, Web & Security GJCST-E Volume 14 (GJCST Volume 14 Issue E5): .

Download Citation

Issue Cover
GJCST Volume 14 Issue E5
Pg. 71- 76
Journal Specifications

Crossref Journal DOI 10.17406/gjcst

Print ISSN 0975-4350

e-ISSN 0975-4172

Classification
Not Found
Version of record

v1.2

Issue date

September 18, 2014

Language

English

Experiance in AR

The methods for personal identification and authentication are no exception.

Read in 3D

The methods for personal identification and authentication are no exception.

Article Matrices
Total Views: 8677
Total Downloads: 2254
2026 Trends
Research Identity (RIN)
Related Research

Published Article

With the recent advancements in multi-core era, workstation clusters have emerged as a cost-effective approach to build a network of workstations (NOWs). NOWs connect the small groups of processors to a network of switching elements that form irregular topologies. Designing an efficient routing and a deadlock avoidance algorithm for irregular networks is quite complicated in terms of latency and area of the routing tables, thus impractical for scalability of On Chip Networks. Many deadlock free routing mechanisms have been proposed for regular networks, but they cannot be employed in irregular networks. In this paper a new methodology has been proposed for efficient routing scheme, called LBDR-UD, which save the average 64.59% routing tables in the switch for irregular networks as compare to up*/down* routing. The Basic concept of routing scheme is combination of up*/down* and Logic Based Distributed Routing. By simulation, it has been shown that the LBDR-UD is deadlock free and adaptive to all dynamic network traffic conditions.

Our website is actively being updated, and changes may occur frequently. Please clear your browser cache if needed. For feedback or error reporting, please email [email protected]
×

This Page is Under Development

We are currently updating this article page for a better experience.

Request Access

Please fill out the form below to request access to this research paper. Your request will be reviewed by the editorial or author team.
X

Quote and Order Details

Contact Person

Invoice Address

Notes or Comments

This is the heading

Lorem ipsum dolor sit amet, consectetur adipiscing elit. Ut elit tellus, luctus nec ullamcorper mattis, pulvinar dapibus leo.

High-quality academic research articles on global topics and journals.

An Efficient Routing Implementation for Irregular Networks

Chand Mal Samota
Chand Mal Samota Maharana Pratap University of Agriculture and Technology
Naveen Choudhary
Naveen Choudhary
Dharm Singh
Dharm Singh

Research Journals