Designing Connection Oriented Networks for Multi-Domain Path Resilience.
Saved in:
| Title: | Designing Connection Oriented Networks for Multi-Domain Path Resilience. |
|---|---|
| Authors: | Lenis, Angelos1 anglen@netmode.ntua.gr, Merekoulias, Vasilis1 merek@netmode.ntua.gr, Maglaris, Vasilis1 maglaris@netmode.ntua.gr |
| Source: | Journal of Network & Systems Management. Dec2010, Vol. 18 Issue 4, p374-394. 21p. |
| Subjects: | Computer network design & construction, Genetic algorithms, Ferromagnetic materials, Magnetic domain, Electric network topology, Scalability, Simulation methods & models |
| Abstract: | challenge in network management and control is the ability to account for multi-domain requirements in the network planning process. Especially in Connection Oriented Networks where multi-domain path finding is a critical issue, networks need to be designed in such a manner as to restrict the possibility of erroneous inter-domain path selection. In this paper we propose per-domain topology design considerations that would leverage accurate disjoint path computations in a multi-domain environment, covering requirements of end-to-end path resiliency. In multi-domain environments state information between domains is heavily aggregated, hiding internal topology details dictated by scalability concerns, but also by restrictive domain administration policies for privacy, and security. Disjoint path finding is strongly affected by the aggregation techniques, since they do not provide information on path overlap. To handle this issue we introduce a metric, the Overlap Factor ( OF), that quantifies path overlap in domains. The OF can be passed as an additional parameter of the inter-domain information exchange model to evaluate disjoint end-to-end paths. Alternatively, if domains were appropriately designed, this additional parameter might not be needed in evaluating resilient pairs of inter-domain paths. We based our recommended topology design algorithm on exploiting locally known OF values within the context of Genetic Algorithms. Extensive simulations confirm that domains designed using our proposed algorithm, result into accurate multi-domain disjoint path identification, with a high success ratio compared to networks that are designed without inter-domain considerations. [ABSTRACT FROM AUTHOR] |
| Copyright of Journal of Network & Systems Management is the property of Springer Nature and its content may not be copied or emailed to multiple sites without the copyright holder's express written permission. Additionally, content may not be used with any artificial intelligence tools or machine learning technologies. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.) | |
| Database: | Engineering Source |
| FullText | Links: – Type: pdflink Text: Availability: 0 |
|---|---|
| Header | DbId: egs DbLabel: Engineering Source An: 54097672 AccessLevel: 6 PubType: Academic Journal PubTypeId: academicJournal PreciseRelevancyScore: 0 |
| IllustrationInfo | |
| Items | – Name: Title Label: Title Group: Ti Data: Designing Connection Oriented Networks for Multi-Domain Path Resilience. – Name: Author Label: Authors Group: Au Data: <searchLink fieldCode="AR" term="%22Lenis%2C+Angelos%22">Lenis, Angelos</searchLink><relatesTo>1</relatesTo><i> anglen@netmode.ntua.gr</i><br /><searchLink fieldCode="AR" term="%22Merekoulias%2C+Vasilis%22">Merekoulias, Vasilis</searchLink><relatesTo>1</relatesTo><i> merek@netmode.ntua.gr</i><br /><searchLink fieldCode="AR" term="%22Maglaris%2C+Vasilis%22">Maglaris, Vasilis</searchLink><relatesTo>1</relatesTo><i> maglaris@netmode.ntua.gr</i> – Name: TitleSource Label: Source Group: Src Data: <searchLink fieldCode="JN" term="%22Journal+of+Network+%26+Systems+Management%22">Journal of Network & Systems Management</searchLink>. Dec2010, Vol. 18 Issue 4, p374-394. 21p. – Name: Subject Label: Subjects Group: Su Data: <searchLink fieldCode="DE" term="%22Computer+network+design+%26+construction%22">Computer network design & construction</searchLink><br /><searchLink fieldCode="DE" term="%22Genetic+algorithms%22">Genetic algorithms</searchLink><br /><searchLink fieldCode="DE" term="%22Ferromagnetic+materials%22">Ferromagnetic materials</searchLink><br /><searchLink fieldCode="DE" term="%22Magnetic+domain%22">Magnetic domain</searchLink><br /><searchLink fieldCode="DE" term="%22Electric+network+topology%22">Electric network topology</searchLink><br /><searchLink fieldCode="DE" term="%22Scalability%22">Scalability</searchLink><br /><searchLink fieldCode="DE" term="%22Simulation+methods+%26+models%22">Simulation methods & models</searchLink> – Name: Abstract Label: Abstract Group: Ab Data: challenge in network management and control is the ability to account for multi-domain requirements in the network planning process. Especially in Connection Oriented Networks where multi-domain path finding is a critical issue, networks need to be designed in such a manner as to restrict the possibility of erroneous inter-domain path selection. In this paper we propose per-domain topology design considerations that would leverage accurate disjoint path computations in a multi-domain environment, covering requirements of end-to-end path resiliency. In multi-domain environments state information between domains is heavily aggregated, hiding internal topology details dictated by scalability concerns, but also by restrictive domain administration policies for privacy, and security. Disjoint path finding is strongly affected by the aggregation techniques, since they do not provide information on path overlap. To handle this issue we introduce a metric, the Overlap Factor ( OF), that quantifies path overlap in domains. The OF can be passed as an additional parameter of the inter-domain information exchange model to evaluate disjoint end-to-end paths. Alternatively, if domains were appropriately designed, this additional parameter might not be needed in evaluating resilient pairs of inter-domain paths. We based our recommended topology design algorithm on exploiting locally known OF values within the context of Genetic Algorithms. Extensive simulations confirm that domains designed using our proposed algorithm, result into accurate multi-domain disjoint path identification, with a high success ratio compared to networks that are designed without inter-domain considerations. [ABSTRACT FROM AUTHOR] – Name: AbstractSuppliedCopyright Label: Group: Ab Data: <i>Copyright of Journal of Network & Systems Management is the property of Springer Nature and its content may not be copied or emailed to multiple sites without the copyright holder's express written permission. Additionally, content may not be used with any artificial intelligence tools or machine learning technologies. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract.</i> (Copyright applies to all Abstracts.) |
| PLink | https://search.ebscohost.com/login.aspx?direct=true&site=eds-live&db=egs&AN=54097672 |
| RecordInfo | BibRecord: BibEntity: Identifiers: – Type: doi Value: 10.1007/s10922-009-9155-z Languages: – Code: eng Text: English PhysicalDescription: Pagination: PageCount: 21 StartPage: 374 Subjects: – SubjectFull: Computer network design & construction Type: general – SubjectFull: Genetic algorithms Type: general – SubjectFull: Ferromagnetic materials Type: general – SubjectFull: Magnetic domain Type: general – SubjectFull: Electric network topology Type: general – SubjectFull: Scalability Type: general – SubjectFull: Simulation methods & models Type: general Titles: – TitleFull: Designing Connection Oriented Networks for Multi-Domain Path Resilience. Type: main BibRelationships: HasContributorRelationships: – PersonEntity: Name: NameFull: Lenis, Angelos – PersonEntity: Name: NameFull: Merekoulias, Vasilis – PersonEntity: Name: NameFull: Maglaris, Vasilis IsPartOfRelationships: – BibEntity: Dates: – D: 01 M: 12 Text: Dec2010 Type: published Y: 2010 Identifiers: – Type: issn-print Value: 10647570 Numbering: – Type: volume Value: 18 – Type: issue Value: 4 Titles: – TitleFull: Journal of Network & Systems Management Type: main |
| ResultId | 1 |
