UP-DOWN ROUTING BASED DEADLOCK FREE DYNAMIC RECONFIGURATION IN HIGH SPEED LOCAL AREA NETWORKS

α
Naresh Kumar
Naresh Kumar
σ
Renu Vig
Renu Vig
ρ
Deepak Bagai
Deepak Bagai
α Kurukshetra University

Send Message

To: Author

UP-DOWN ROUTING BASED DEADLOCK FREE DYNAMIC RECONFIGURATION IN HIGH SPEED LOCAL AREA NETWORKS

Article Fingerprint

ReserarchID

7H470

UP-DOWN ROUTING BASED DEADLOCK FREE DYNAMIC RECONFIGURATION IN HIGH SPEED LOCAL AREA NETWORKS Banner

AI TAKEAWAY

Connecting with the Eternal Ground
  • 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

Abstract

Dynamic reconfiguration of high speed switched network is the process of changing from one routing function to another while the network remains in running mode. Current distributed switch-based interconnected systems require high performance, reliability and availability. These systems changes their topologies due to hot expansion of components, link or node activation and deactivation. Therefore, in order to support hard real-time and distributed multimedia applications over a high speed network we need to avoid discarding packets when the topology changes. Thus, a dynamic reconfiguration algorithm updates the routing tables of these interconnected switches according to new changed topology without stopping the traffic. Here, we propose an improved deadlock-free partial progressive reconfiguration (PPR) technique based on UP/DOWN routing algorithm that assigns the directions to various links of high-speed switched networks based on pre-order traversal of computed spanning tree. This improved technique gives better performance as compared to traditional PPR by minimizing the path length of packets to be transmitted. Moreover, the proposed reconfiguration strategy makes the optimize use of all operational links and reduces the traffic congestion in the network. The simulated results are compared with traditional PPR.

References

8 Cites in Article
  1. (2006). References Références Referencias Protocols.
  2. A Robles-Gómez,A Bermúdez,R Casado,F Quiles,T Skeie,J Duato (2008). A proposal for managing ASI fabrics.
  3. Thomas Rodeheffer,Michael Schroeder (1991). Automatic reconfiguration in Autonet.
  4. J Sancho,A Robles,J Duato (2000). A new methodology to compute deadlock-free routing tables for irregular networks.
  5. 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.
  6. Dimiter Avresky (2000). Dependable Network Computing.
  7. D Avresky,Y Varoglu,M Marinov (2004). Dynamically scaling system area networks.
  8. Guillermo Lbanez,Alberto Garcia -Martinez,Juan Carral,Pedro Gonzalez,Arturo Azcorra,Jose Arco (2010). HURP/HURBA: Zero-configuration hierarchical Up/Down routing and bridging architecture for Ethernet backbones and campus networks‖.

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.

How to Cite This Article

Naresh Kumar. 1970. \u201cUP-DOWN ROUTING BASED DEADLOCK FREE DYNAMIC RECONFIGURATION IN HIGH SPEED LOCAL AREA NETWORKS\u201d. Unknown Journal GJCST Volume 11 (GJCST Volume 11 Issue 7): .

Download Citation

Journal Specifications
Keywords
Version of record

v1.2

Issue date

May 6, 2011

Language
en
Experiance in AR

Explore published articles in an immersive Augmented Reality environment. Our platform converts research papers into interactive 3D books, allowing readers to view and interact with content using AR and VR compatible devices.

Read in 3D

Your published article is automatically converted into a realistic 3D book. Flip through pages and read research papers in a more engaging and interactive format.

Article Matrices
Total Views: 20285
Total Downloads: 10952
2026 Trends
Related Research

Published Article

Dynamic reconfiguration of high speed switched network is the process of changing from one routing function to another while the network remains in running mode. Current distributed switch-based interconnected systems require high performance, reliability and availability. These systems changes their topologies due to hot expansion of components, link or node activation and deactivation. Therefore, in order to support hard real-time and distributed multimedia applications over a high speed network we need to avoid discarding packets when the topology changes. Thus, a dynamic reconfiguration algorithm updates the routing tables of these interconnected switches according to new changed topology without stopping the traffic. Here, we propose an improved deadlock-free partial progressive reconfiguration (PPR) technique based on UP/DOWN routing algorithm that assigns the directions to various links of high-speed switched networks based on pre-order traversal of computed spanning tree. This improved technique gives better performance as compared to traditional PPR by minimizing the path length of packets to be transmitted. Moreover, the proposed reconfiguration strategy makes the optimize use of all operational links and reduces the traffic congestion in the network. The simulated results are compared with traditional PPR.

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]

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.

UP-DOWN ROUTING BASED DEADLOCK FREE DYNAMIC RECONFIGURATION IN HIGH SPEED LOCAL AREA NETWORKS

Naresh Kumar
Naresh Kumar Kurukshetra University
Renu Vig
Renu Vig
Deepak Bagai
Deepak Bagai

Research Journals