Matrices with distances between pairs of locations are essential for solving vehicle routing problems like the Capacitated Vehicle Routing Problem (CVRP), Traveling Salesman Problem (TSP) and others. This work deals with ...
Flich Cardo, José; Skeie, . Tor; Mejia, Andres; Lysne, . Olav; López Rodríguez, Pedro Juan; Robles Martínez, Antonio; Duato Marín, José Francisco; Koibuchi, . Michihiro; Rokicki, . Tomas; Sancho, . Jose Carlos(Institute of Electrical and Electronics Engineers (IEEE), 2012)
Most standard cluster interconnect technologies are flexible with respect to network topology. This has spawned a substantial amount of research on topology-agnostic routing algorithms, which make no assumption about the ...
Juvaa, Boldbaatar(Universitat Politècnica de València, 2015-09-29)
[EN] In this project, different router architectures will be designed, together with different connection patterns among routers, which will lead to different topologies. The goal is the exploration of resource overheads ...
Rego Máñez, Albert(Universitat Politècnica de València, 2021-02-01)
[ES] La presente tesis aborda el problema del encaminamiento en las redes definidas
por software (SDN). Específicamente, aborda el problema del diseño de un protocolo
de encaminamiento basado en inteligencia artificial ...
Escribano, Javier G.; García, Andrés; de la Fuente, Miguel(Elsevier, 2011-10-05)
[EN] Tracking and physical condition monitoring of people who find themselves in hazardous situations, and therefore may require special attention, is crucial to improving their safety. The systems that are commonly used ...
Andújar-Muñoz, Francisco José; Coll, Salvador; Alonso Díaz, Marina; López Rodríguez, Pedro Juan; Martínez-Rubio, Juan-Miguel(Association for Computing Machinery, 2019-01)
[EN] In order to save energy in HPC interconnection networks, one usual proposal is to switch idle links into a low-power mode after a certain time without any transmission, as IEEE Energy Efficient Ethernet standard ...
In this paper we deal with the mixed capacitated general routing problem with turn penalties. This problem generalizes many important arc and node routing problems, and it takes into account turn penalties and forbidden ...
Peñaranda Cebrián, Roberto; Gómez Requena, Crispín; Gómez Requena, María Engracia; López Rodríguez, Pedro Juan(Elsevier, 2017)
[EN] Routing is a key design parameter in the interconnection network of large parallel computers. Routing algorithms are classified into two different categories depending on the number of routing options available for ...