Cargando…
Resilient Capacity-Aware Routing
To ensure a high availability, communication networks provide resilient routing mechanisms that quickly change routes upon failures. However, a fundamental algorithmic question underlying such mechanisms is hardly understood: how to verify whether a given network reroutes flows along feasible paths,...
Autores principales: | Schmid, Stefan, Schnepf, Nicolas, Srba, Jiří |
---|---|
Formato: | Online Artículo Texto |
Lenguaje: | English |
Publicado: |
2021
|
Materias: | |
Acceso en línea: | https://www.ncbi.nlm.nih.gov/pmc/articles/PMC7979162/ http://dx.doi.org/10.1007/978-3-030-72016-2_22 |
Ejemplares similares
-
Synthesis for Multi-weighted Games with Branching-Time Winning Conditions
por: Kaufmann, Isabella, et al.
Publicado: (2020) -
Resilient routing in communication networks
por: Rak, Jacek
Publicado: (2015) -
On-the-Fly Synthesis for Strictly Alternating Games
por: Karra, Shyam Lal, et al.
Publicado: (2020) -
Neighboring and Connectivity-Aware Routing in VANETs
por: Ghafoor, Huma, et al.
Publicado: (2014) -
Dynamic Cost-Aware Routing of Web Requests
por: Velusamy, Gandhimathi, et al.
Publicado: (2018)