Achieving Flexible Multipath Routing through DAGas

§ Mallareddy Institute of Engineering and Technology

Send Message

To: Author

Achieving Flexible Multipath Routing through DAGas

Article Fingerprint

ReserarchID

CSTM9J51

Achieving Flexible Multipath Routing through DAGas Banner

Key Research Insights

Synthesized scholarly intelligence & interactive research assistant
  • 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
Reading Preferences
Font Size
Line Spacing
Background
This converted HTML version may contain rendering inconsistencies. Please refer to the PDF for the authoritative version, or click here to provide feedback.

Abstract

With a specific end goal to realize versatile multipath steering, we present the notion of free regulated non-cyclic charts (IDAG’s) in this paper. Join autonomous (hub free) DAG’s fulfil the property that any way from a source to the root on one DAG’s is connection disjoint (hub disjoint) with any way from the source to the root on the other DAG. Given a system, we advance polynomial time calculations to process join free and hub autonomous DAG’s. The calculation advanced in this paper furnishes multipath tracking, uses all conceivable edges, ensures recuperation from single connection inadequacy and accomplishes all these with at most one touch for every bundle as overhead when steering is dependent upon terminus address and approaching edge. We indicate the viability of the proposed IDAG’s approach by contrasting key execution lists with that of the autonomous trees and various combines of free trees strategies through broad recreations.

References

10 Cites in Article
  1. M Medard,S Finn,R Barry,R Gallager (1999). Redundant trees for preplanned recovery in arbitrary vertex-redundant or edge-redundant graphs.
  2. G Xue,L Chen,K Thulasiraman (2003). Quality-ofservice and quality-of-protection issues in preplanned recovery schemes using redundanttrees.
  3. S Ramasubramanian,M Harkara,M Krunz (2007). Linear time distributed construction of colored trees for disjoint multipath routing.
  4. P Phamand,S Perreau (2003). Performance analysis of reactive shortest pathandmulti-pathrouting mechanism with load balance.
  5. Jack Tsai,Tim Moors (2006). Minimum interference multipath routing using multiple gateways in wireless mesh networks.
  6. S Murthy,J Garcia-Luna-Aceves (1996). Congestionoriented shortest multipath routing.
  7. A Kvalbein,A Hansen,T Ĉiĉić,S Gjessing,O Lysne (2004). Fast IP network recovery using multiple routing con figurations.
  8. Srihari Nelakuditi,Sanghwan Lee,Yinzhe Yu,Zhi-Li Zhang (2003). Failure Insensitive Routing for Ensuring Service Availability.
  9. G Jayavelu,S Ramasubramanian,O Younis (2008). Maintaining Colored Trees for Disjoint Multipath Routing Under Node Failures.
  10. A Huck (1994). Independent trees in graphs.

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

chmacha48. 2013. "Achieving Flexible Multipath Routing through DAGas". Global Journal of Computer Science and Technology - C: Software & Data Engineering GJCST-C Volume 13 (GJCST Volume 13 Issue C11).

Download Citation

Journal Specifications

Crossref Journal DOI 10.17406/gjcst

Print ISSN 0975-4350

e-ISSN 0975-4172

Keywords
Classification
GJCST-C Classification C.2.2
Version of record

v1.2

Issue date
November 5, 2013

Language
English
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: 3.1K
Total Downloads: 203
All Trends

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

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.

Achieving Flexible Multipath Routing through DAGas

Mallareddy Institute of Engineering and Technology