Aplicación de gestión y web para un criadero-residencia canino.

El objetivo de este proyecto es implementar un sitio Web i un programa gestor de datos para el criadero/residencia canino De La Serranía (Madrid). Gracias al desarrollo de esta aplicación y del sitio Web se conseguirá que el cliente suprima el uso de todo el papel utilizado anteriormente para guardar la información relativa a clientes, animales y entradas a la residencia, podrá controlar la ocupación de la residencia y generar automáticamente las facturas, crear automáticamente árboles genealógicos de todos los ejemplares registrados, mejorar el rendimiento del criadero gracias a la opción que controla los datos de cría de cada animal: fecha de monta, fecha de parto, resultados de cada parto, etc. y controlar los gastos y ganancias de la empresa

Carrier Ethernet "label" scalability

A collection of slides from the authorpsilas seminar presentation is given

An improved method for discovering link criticality in transport networks

Quantitatively assessing the importance or criticality of each link in a network is of practical value to operators, as that can help them to increase the network's resilience, provide more efficient services, or improve some other aspect of the service. Betweenness is a graph-theoretical measure of centrality that can be applied to communication networks to evaluate link importance. However, as we illustrate in this paper, the basic definition of betweenness centrality produces inaccurate estimations as it does not take into account some aspects relevant to networking, such as the heterogeneity in link capacity or the difference between node-pairs in their contribution to the total traffic. A new algorithm for discovering link centrality in transport networks is proposed in this paper. It requires only static or semi-static network and topology attributes, and yet produces estimations of good accuracy, as verified through extensive simulations. Its potential value is demonstrated by an example application. In the example, the simple shortest-path routing algorithm is improved in such a way that it outperforms other more advanced algorithms in terms of blocking ratio