NDLI: Critical regions and region-disjoint paths in a network

Content Provider	IEEE Xplore Digital Library
Author	Trajanovski, S. Kuipers, F.A. Van Mieghem, P. Ilic, A. Crowcroft, J.
Copyright Year	2013
Description	Author affiliation: Univ. of Cambridge, Cambridge, UK (Crowcroft, J.) \|\| Delft Univ. of Technol., Delft, Netherlands (Trajanovski, S.; Kuipers, F.A.; Van Mieghem, P.) \|\| Facebook Inc., Menlo Park, CA, USA (Ilic, A.)
Abstract	Due to the importance of communication networks to society, it is pertinent that these networks can withstand failures. Improving the robustness of a network usually requires installing redundant resources, which is very costly. Network providers are consequently less inclined to take robustness measures against failures that are unlikely to manifest, like several failures coinciding simultaneously in different geographic regions of their network. Protecting against single regional failures is more realistic. Network robustness, in terms of connectivity properties, also requires survivability algorithms to quickly reroute traffic affected by a network failure. In this paper, we consider a network embedded in a plane and study the problem of finding a circular region with radius r in that plane that would cause the biggest network degradation if all nodes within that particular region were to be destroyed. We propose a polynomial time algorithm for finding such critical regions. In addition, we develop a region-aware network augmentation technique to decrease the impact of a critical region failure. We subsequently consider the region-disjoint paths problem, which asks for two paths with minimum total weight between a source (s) and a destination (d) that cannot both be cut by a single circular regional failure of radius r (unless that failure includes s and d). We prove that the region-disjoint paths problem is NP-hard and propose and evaluate a heuristic algorithm for it.
Starting Page	1
Ending Page	9
File Size	650246
Page Count	9
File Format	PDF
ISBN	9783901882555
Language	English
Publisher	Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Publisher Date	2013-05-22
Publisher Place	USA
Access Restriction	Subscribed
Rights Holder	IFIP
Subject Keyword	Measurement Region-disjoint paths Heuristic algorithms Determining critical regions Educational institutions Robustness Polynomials Complexity theory Partitioning algorithms Survivability Network augmentation
Content Type	Text
Resource Type	Article

Sl.	Authority	Responsibilities	Communication Details
1	Ministry of Education (GoI), Department of Higher Education	Sanctioning Authority	https://www.education.gov.in/ict-initiatives
2	Indian Institute of Technology Kharagpur	Host Institute of the Project: The host institute of the project is responsible for providing infrastructure support and hosting the project	https://www.iitkgp.ac.in
3	National Digital Library of India Office, Indian Institute of Technology Kharagpur	The administrative and infrastructural headquarters of the project	Dr. B. Sutradhar bsutra@ndl.gov.in
4	Project PI / Joint PI	Principal Investigator and Joint Principal Investigators of the project	Dr. B. Sutradhar bsutra@ndl.gov.in Prof. Saswat Chakrabarti will be added soon
5	Website/Portal (Helpdesk)	Queries regarding NDLI and its services	support@ndl.gov.in
6	Contents and Copyright Issues	Queries related to content curation and copyright issues	content@ndl.gov.in
7	National Digital Library of India Club (NDLI Club)	Queries related to NDLI Club formation, support, user awareness program, seminar/symposium, collaboration, social media, promotion, and outreach	clubsupport@ndl.gov.in
8	Digital Preservation Centre (DPC)	Assistance with digitizing and archiving copyright-free printed books	dpc@ndl.gov.in
9	IDR Setup or Support	Queries related to establishment and support of Institutional Digital Repository (IDR) and IDR workshops	idr@ndl.gov.in

Finding Critical Regions and Region-Disjoint Paths in a Network

Finding critical regions and region-disjoint paths in a network

An algorithm for the shortest pairs of arc-disjoint paths problem

Critical regions and region-disjoint paths in a network.

Finding critical regions in a network

1finding critical regions and region-disjoint paths in a network.

Finding critical regions in a network

Critical regions and region-disjoint paths in a network (2013)

Cost-Efficient network improvement to achieve maximum path diversity

Critical regions and region-disjoint paths in a network

Similar Documents

Finding Critical Regions and Region-Disjoint Paths in a Network

Finding critical regions and region-disjoint paths in a network

An algorithm for the shortest pairs of arc-disjoint paths problem

Critical regions and region-disjoint paths in a network.

Finding critical regions in a network

1finding critical regions and region-disjoint paths in a network.

Finding critical regions in a network

Critical regions and region-disjoint paths in a network (2013)

Cost-Efficient network improvement to achieve maximum path diversity

Critical regions and region-disjoint paths in a network