Designing connection oriented networks for multi-domain path resilience

Lenis, A; Merekoulias, V; Maglaris, V

dc.contributor.author	Lenis, A	en
dc.contributor.author	Merekoulias, V	en
dc.contributor.author	Maglaris, V	en
dc.date.accessioned	2014-03-01T01:33:07Z
dc.date.available	2014-03-01T01:33:07Z
dc.date.issued	2010	en
dc.identifier.issn	1064-7570	en
dc.identifier.uri	https://dspace.lib.ntua.gr/xmlui/handle/123456789/20335
dc.subject	Disjoint path finding	en
dc.subject	Genetic algorithms	en
dc.subject	Multi-domain	en
dc.subject	Network design	en
dc.subject	Topology aggregation	en
dc.subject.classification	Computer Science, Information Systems	en
dc.subject.classification	Telecommunications	en
dc.subject.other	Administration policy	en
dc.subject.other	Connection oriented networks	en
dc.subject.other	Critical issues	en
dc.subject.other	Disjoint paths	en
dc.subject.other	Domain topology	en
dc.subject.other	End-to-end path	en
dc.subject.other	Extensive simulations	en
dc.subject.other	In-network management	en
dc.subject.other	Inter-domain	en
dc.subject.other	Inter-domain information exchange	en
dc.subject.other	Multi domains	en
dc.subject.other	Network design	en
dc.subject.other	Network planning process	en
dc.subject.other	Path finding	en
dc.subject.other	Path selection	en
dc.subject.other	State information	en
dc.subject.other	Success ratio	en
dc.subject.other	Topology aggregation	en
dc.subject.other	Topology design	en
dc.subject.other	Computer simulation	en
dc.subject.other	Design	en
dc.subject.other	Genetic algorithms	en
dc.subject.other	Planning	en
dc.subject.other	Security of data	en
dc.subject.other	Topology	en
dc.subject.other	Wireless sensor networks	en
dc.subject.other	Network management	en
dc.title	Designing connection oriented networks for multi-domain path resilience	en
heal.type	journalArticle	en
heal.identifier.primary	10.1007/s10922-009-9155-z	en
heal.identifier.secondary	http://dx.doi.org/10.1007/s10922-009-9155-z	en
heal.language	English	en
heal.publicationDate	2010	en
heal.abstract	A 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. © 2010 Springer Science+Business Media, LLC.	en
heal.publisher	SPRINGER	en
heal.journalName	Journal of Network and Systems Management	en
dc.identifier.doi	10.1007/s10922-009-9155-z	en
dc.identifier.isi	ISI:000282514800003	en
dc.identifier.volume	18	en
dc.identifier.issue	4	en
dc.identifier.spage	374	en
dc.identifier.epage	394	en