1 resultado para Optimal reactive dispatch problem
em DigitalCommons@University of Nebraska - Lincoln
Filtro por publicador
- Abertay Research Collections - Abertay University’s repository (2)
- Aberystwyth University Repository - Reino Unido (2)
- AMS Tesi di Dottorato - Alm@DL - Università di Bologna (3)
- AMS Tesi di Laurea - Alm@DL - Università di Bologna (1)
- Aquatic Commons (1)
- ArchiMeD - Elektronische Publikationen der Universität Mainz - Alemanha (2)
- Archive of European Integration (1)
- Archivo Digital para la Docencia y la Investigación - Repositorio Institucional de la Universidad del País Vasco (5)
- Aston University Research Archive (18)
- 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) (5)
- BORIS: Bern Open Repository and Information System - Berna - Suiça (9)
- Boston University Digital Common (2)
- Brock University, Canada (2)
- Bulgarian Digital Mathematics Library at IMI-BAS (21)
- CaltechTHESIS (11)
- Cambridge University Engineering Department Publications Database (13)
- CentAUR: Central Archive University of Reading - UK (23)
- Chinese Academy of Sciences Institutional Repositories Grid Portal (4)
- Cochin University of Science & Technology (CUSAT), India (4)
- CORA - Cork Open Research Archive - University College Cork - Ireland (2)
- Corvinus Research Archive - The institutional repository for the Corvinus University of Budapest (4)
- CUNY Academic Works (1)
- Dalarna University College Electronic Archive (7)
- Deakin Research Online - Australia (39)
- Digital Commons - Michigan Tech (3)
- Digital Commons @ DU | University of Denver Research (1)
- Digital Commons at Florida International University (4)
- Digital Peer Publishing (1)
- DigitalCommons@The Texas Medical Center (1)
- DigitalCommons@University of Nebraska - Lincoln (1)
- DRUM (Digital Repository at the University of Maryland) (1)
- Duke University (1)
- eResearch Archive - Queensland Department of Agriculture; Fisheries and Forestry (1)
- FUNDAJ - Fundação Joaquim Nabuco (2)
- Glasgow Theses Service (2)
- Greenwich Academic Literature Archive - UK (4)
- Helda - Digital Repository of University of Helsinki (1)
- Illinois Digital Environment for Access to Learning and Scholarship Repository (1)
- Indian Institute of Science - Bangalore - Índia (136)
- Instituto Politécnico do Porto, Portugal (17)
- Massachusetts Institute of Technology (4)
- Nottingham eTheses (3)
- Portal de Revistas Científicas Complutenses - Espanha (1)
- QUB Research Portal - Research Directory and Institutional Repository for Queen's University Belfast (20)
- Queensland University of Technology - ePrints Archive (343)
- Repositório Científico da Universidade de Évora - Portugal (4)
- Repositório Científico do Instituto Politécnico de Lisboa - Portugal (1)
- Repositorio de la Universidad de Cuenca (1)
- Repositório digital da Fundação Getúlio Vargas - FGV (8)
- Repositório Institucional da Universidade de Aveiro - Portugal (9)
- Repositorio Institucional de la Universidad de Málaga (1)
- Repositório Institucional UNESP - Universidade Estadual Paulista "Julio de Mesquita Filho" (131)
- Savoirs UdeS : plateforme de diffusion de la production intellectuelle de l’Université de Sherbrooke - Canada (1)
- The Scholarly Commons | School of Hotel Administration; Cornell University Research (1)
- Universidad de Alicante (3)
- Universidad Politécnica de Madrid (22)
- Universidade Federal do Pará (3)
- Universidade Federal do Rio Grande do Norte (UFRN) (1)
- Universitat de Girona, Spain (2)
- Université de Lausanne, Switzerland (1)
- Université de Montréal, Canada (5)
- Université Laval Mémoires et thèses électroniques (1)
- University of Connecticut - USA (1)
- University of Michigan (1)
- University of Queensland eSpace - Australia (15)
Resumo:
Protecting a network against link failures is a major challenge faced by network operators. The protection scheme has to address two important objectives - fast recovery and minimizing the amount of backup resources needed. Every protection algorithm is a tradeoff between these two objectives. In this paper, we study the problem of segment protection. In particular, we investigate what is the optimal segment size that obtains the best tradeoff between the time taken for recovery and minimizing the bandwidth used by the backup segments. We focus on the uniform fixed-length segment protection method, where each primary path is divided into fixed-length segments, with the exception of the last segment in the path. We observe that the optimal segment size for a given network depends on several factors such as the topology and the ratio of the costs involved.