1 resultado para bounded gaps
em DigitalCommons@University of Nebraska - Lincoln
Filtro por publicador
- Aberdeen University (1)
- Aberystwyth University Repository - Reino Unido (2)
- Academic Research Repository at Institute of Developing Economies (1)
- Acceda, el repositorio institucional de la Universidad de Las Palmas de Gran Canaria. España (1)
- AMS Tesi di Dottorato - Alm@DL - Università di Bologna (1)
- AMS Tesi di Laurea - Alm@DL - Università di Bologna (1)
- Aquatic Commons (6)
- ArchiMeD - Elektronische Publikationen der Universität Mainz - Alemanha (1)
- Archimer: Archive de l'Institut francais de recherche pour l'exploitation de la mer (1)
- Archive of European Integration (5)
- Archivo Digital para la Docencia y la Investigación - Repositorio Institucional de la Universidad del País Vasco (3)
- Aston University Research Archive (8)
- Biblioteca Digital da Produção Intelectual da Universidade de São Paulo (4)
- Biblioteca Digital da Produção Intelectual da Universidade de São Paulo (BDPI/USP) (6)
- BORIS: Bern Open Repository and Information System - Berna - Suiça (20)
- Brock University, Canada (1)
- Bulgarian Digital Mathematics Library at IMI-BAS (5)
- CaltechTHESIS (1)
- Cambridge University Engineering Department Publications Database (36)
- CentAUR: Central Archive University of Reading - UK (23)
- Chinese Academy of Sciences Institutional Repositories Grid Portal (6)
- Cochin University of Science & Technology (CUSAT), India (3)
- Comissão Econômica para a América Latina e o Caribe (CEPAL) (13)
- CORA - Cork Open Research Archive - University College Cork - Ireland (2)
- Corvinus Research Archive - The institutional repository for the Corvinus University of Budapest (3)
- CUNY Academic Works (2)
- Deakin Research Online - Australia (46)
- Department of Computer Science E-Repository - King's College London, Strand, London (13)
- Digital Commons - Michigan Tech (1)
- Digital Commons at Florida International University (2)
- DigitalCommons@University of Nebraska - Lincoln (1)
- Diposit Digital de la UB - Universidade de Barcelona (1)
- Duke University (1)
- Ecology and Society (1)
- eResearch Archive - Queensland Department of Agriculture; Fisheries and Forestry (32)
- Glasgow Theses Service (1)
- Helda - Digital Repository of University of Helsinki (35)
- Indian Institute of Science - Bangalore - Índia (128)
- Instituto Politécnico de Bragança (1)
- Instituto Politécnico do Porto, Portugal (3)
- Lume - Repositório Digital da Universidade Federal do Rio Grande do Sul (1)
- Massachusetts Institute of Technology (1)
- National Center for Biotechnology Information - NCBI (3)
- Nottingham eTheses (3)
- Plymouth Marine Science Electronic Archive (PlyMSEA) (3)
- Publishing Network for Geoscientific & Environmental Data (4)
- QUB Research Portal - Research Directory and Institutional Repository for Queen's University Belfast (48)
- Queensland University of Technology - ePrints Archive (423)
- Repositório Alice (Acesso Livre à Informação Científica da Embrapa / Repository Open Access to Scientific Information from Embrapa) (1)
- Repositorio de la Universidad del Pacífico - PERU (1)
- Repositório digital da Fundação Getúlio Vargas - FGV (3)
- Repositório Institucional da Universidade Federal do Rio Grande - FURG (1)
- Repositório Institucional UNESP - Universidade Estadual Paulista "Julio de Mesquita Filho" (23)
- Repositorio Institucional Universidad de Medellín (1)
- RUN (Repositório da Universidade Nova de Lisboa) - FCT (Faculdade de Cienecias e Technologia), Universidade Nova de Lisboa (UNL), Portugal (1)
- Universidad de Alicante (3)
- Universidad Politécnica de Madrid (5)
- Universidade Federal do Pará (1)
- Universitätsbibliothek Kassel, Universität Kassel, Germany (1)
- Université de Montréal, Canada (4)
- University of Michigan (8)
- University of Queensland eSpace - Australia (12)
- University of Washington (1)
- USA Library of Congress (2)
- WestminsterResearch - UK (1)
Resumo:
Establishing a fault-tolerant connection in a network involves computation of diverse working and protection paths. The Shared Risk Link Group (SRLG) [1] concept is used to model several types of failure conditions such as link, node, fiber conduit, etc. In this work we focus on the problem of computing optimal SRLG/link diverse paths under shared protection. Shared protection technique improves network resource utilization by allowing protection paths of multiple connections to share resources. In this work we propose an iterative heuristic for computing SRLG/link diverse paths. We present a method to calculate a quantitative measure that provides a bounded guarantee on the optimality of the diverse paths computed by the heuristic. The experimental results on computing link diverse paths show that our proposed heuristic is efficient in terms of number of iterations required (time taken) to compute diverse paths when compared to other previously proposed heuristics.