2024-03-29T08:53:13Zhttps://ebuah.uah.es/oai/requestoai:ebuah.uah.es:10017/12592023-12-14T15:51:59Zcom_10017_149com_10017_17761com_10017_17741com_10017_1216com_10017_18241col_10017_150col_10017_1225
Arquitectura de agentes para entornos domóticos
Paricio García, Álvaro
Velasco Pérez, Juan Ramón
López Carmona, Miguel Ángel
Marsá Maestre, Iván
Universidad de Alcalá. Departamento de Automática
Domótica
Agentes inteligentes
Inteligencia Ambiental
En la rápida evolución sufrida por los sistemas domóticos e inmóticos en los últimos años, el papel de los agentes y
específicamente, de los agentes inteligentes, es cada vez más relevante. La gran mayoría de las propuestas de
investigación y comerciales, incluyen uno o más agentes dotados de un nivel de inteligencia variable según su
función. Este artículo realiza una taxonomía de los agentes implicados en el entorno domótico, según su
funcionalidad, proponiendo una Arquitectura de Sistema Multiagente (MAS) al efecto. En ella se presta especial
atención a la distinción entre el conjunto de agentes personales nómadas (móviles con los usuarios y con los
dispositivos), y el conjunto de agentes estáticos o de sistema con los que interactúan. Éstos últimos pueden resultar
de propiedad individual, colectiva o de terceros, por lo que los modelos de negociación presentan ciertas
diferencias, en la obtención de recursos y servicios.
2008-01-24T18:19:02Z
2008-01-24T18:19:02Z
2008-01-24T18:19:02Z
2004
info:eu-repo/semantics/conferenceObject
XIV Jornadas Telecom I+D
http://hdl.handle.net/10017/1259
spa
info:eu-repo/semantics/openAccess
oai:ebuah.uah.es:10017/12602023-12-14T15:51:59Zcom_10017_149com_10017_17761com_10017_17741com_10017_1216com_10017_18241col_10017_150col_10017_1225
Arquitectura para un sistema domótico basado en agentes
Marsá Maestre, Iván
Navarro Guillén, Andrés
López Carmona, Miguel Ángel
Velasco Pérez, Juan Ramón
Universidad de Alcalá. Departamento de Automática
Entorno Inteligente
Domótica
Agentes Software
Dispositivos Personales
Un entorno inteligente -smart environment- es aquél capaz de adquirir y aplicar conocimientos acerca de sus habitantes y
de lo que les rodea con el fin de adaptarse a ellos. Esta definición presupone no sólo la capacidad de recoger información
acerca del propio entorno y sus habitantes y de actuar sobre la condiciones del mismo, sino también la capacidad del
entorno para inferir estrategias de operación adecuadas a partir de la observación y del conocimiento de las preferencias
de sus usuarios. Estas consideraciones plantean requisitos de minería de datos distribuida, autonomía e inteligencia que
sugieren el empleo de tecnología de agentes como una opción prometedora para este tipo de sistemas. En este documento
se propone una arquitectura que sirve de punto de partida para la construcción un sistema de entorno inteligente -en
particular, un sistema domótico- basado en agentes software.
2008-01-24T18:32:51Z
2008-01-24T18:32:51Z
2008-01-24T18:32:51Z
2004
info:eu-repo/semantics/conferenceObject
Conferencia IADIS Ibero-americana WWW/Internet 2004
http://hdl.handle.net/10017/1260
spa
info:eu-repo/semantics/openAccess
oai:ebuah.uah.es:10017/18942023-12-14T15:51:59Zcom_10017_149com_10017_17761com_10017_17741com_10017_1216com_10017_18241col_10017_150col_10017_1225
Sistemas multiagente de tiempo real
Marsá Maestre, Iván
Sánchez Prieto, Sebastián
Velasco Pérez, Juan Ramón
Universidad de Alcalá. Departamento de Automática
Sistemas multiagente
Tiempo real
Existen diferentes aplicaciones y entornos de tiempo real
donde puede ser necesario o conveniente incluir capacidades de proceso
e inferencia más propias de la inteligencia arti cial. Este trabajo realiza
un breve análisis de la problemática de integrar inteligencia arti cial y
consideraciones de tiempo real en una misma aplicación, así como de las
técnicas más utilizadas para ello. Por último, se presentan los sistemas
multiagente de tiempo real como una alternativa prometedora para este
tipo de sistemas, se enumeran los requisitos que deben cumplir, y se comentan
dos de las arquitecturas existentes para el diseño de sistemas
multiagente de tiempo real: ObjectAgent y SIMBA.
2008-09-03T11:56:43Z
2008-09-03T11:56:43Z
2008-09-03T11:56:43Z
2005
info:eu-repo/semantics/article
Proceedings of the 1st Iberoamerican Congress on Ubiquitous Computing CICU¿2005
http://hdl.handle.net/10017/1894
spa
info:eu-repo/semantics/openAccess
CEUR Workshop Proceedings
oai:ebuah.uah.es:10017/12622023-12-14T15:52:00Zcom_10017_149com_10017_17761com_10017_17741com_10017_1216com_10017_18241col_10017_150col_10017_1225
A fully-distributed, multiagent approach to negotiation in mobile ad-hoc networks
Marsá Maestre, Iván
Velasco Pérez, Juan Ramón
López Carmona, Miguel Ángel
Navarro Guillén, Andrés
Universidad de Alcalá. Departamento de Automática
Multiagent approach
Mobile ad-hoc networks
This paper presents an interaction protocol intended to be used in distributed negotiation problems using software agents,
which could be applied to multi-agent systems deployed over Personal Digital Assistants (PDAs) connected via wireless
networks. We are especially interested in semi-competitive scenarios, where each agent in the system acts on behalf of a
user, trying to maximize its user preferences while pursuing a common agreement. In these conditions, and especially if
we are dealing with open and dynamic environments like mobile ad-hoc networks, the goals and attitudes of software
agents cannot be guaranteed. Taking this into account we propose a protocol where interaction among agents is done in a
fully-distributed manner, so that no user can have negotiation privileges over the others.
2008-01-24T18:53:47Z
2008-01-24T18:53:47Z
2008-01-24T18:53:47Z
2005-10
info:eu-repo/semantics/conferenceObject
International Conference IADIS WWW/Internet 2005
http://hdl.handle.net/10017/1262
eng
info:eu-repo/semantics/openAccess
oai:ebuah.uah.es:10017/12632023-12-14T15:52:00Zcom_10017_149com_10017_17761com_10017_17741com_10017_1216com_10017_18241col_10017_150col_10017_1225
A contextual ontology to provide location-aware services and interfaces in smart environments
Machuca, Miriam
López Carmona, Miguel Ángel
Marsá Maestre, Iván
Velasco Pérez, Juan Ramón
Universidad de Alcalá. Departamento de Automática
Location-aware services
Interfaces
Smart environments
Context-aware computing is about gathering user information and their environment such as user location and
preferences, service status, and nearby devices. Such context information is used to adjust enviroment settings to suit user
needs and preferences. As environments can change rapidly, applications must be aware of it and adapt their behaviour in
real time. We describe an application that introduces intelligent agents in smart homes to provide location-aware services
and interfaces. This application must keep an eye on some context information to carry out user preferences. Our
approach is based on a contextual ontology that is a key component to enable context sharing and representation.
2008-01-24T18:56:07Z
2008-01-24T18:56:07Z
2008-01-24T18:56:07Z
2005-10
info:eu-repo/semantics/conferenceObject
International Conference IADIS WWW/Internet 2005
http://hdl.handle.net/10017/1263
eng
info:eu-repo/semantics/openAccess
oai:ebuah.uah.es:10017/12652023-12-14T15:52:00Zcom_10017_149com_10017_17761com_10017_17741com_10017_1216com_10017_18241col_10017_150col_10017_1225
Location-aware services and interfaces in smart homes using multiagent systems
Velasco Pérez, Juan Ramón
Marsá Maestre, Iván
Navarro Guillén, Andrés
López Carmona, Miguel Ángel
Vicente Rodríguez, Antonio José de
Hoz de la Hoz, Enrique de la
Paricio García, Álvaro
Machuca, Miriam
Universidad de Alcalá. Departamento de Automática
Location-aware services
Smart homes
Multiagent systems
Computer systems are fully capable of providing
customized interfaces for users. Every time we log on to an ecommerce
website we have used before, the interface changes
in order to fit our most probable interests. Some sophisticated
vehicles adjust the seat position, rearview mirror orientation and
other parameters to match the preferences of the drivers when
they enter the car -provided that they belong to the set of known
drivers-. However, this kind of service customization has not yet
reached the home environment. In the same way as computer
systems with productivity, the smart home must prevent the user
from performing routine and tedious tasks to achieve comfort,
security, and effective energy management. In this paper we
propose an architecture for building a smart home environment
using multiagent systems, and we demonstrate its effectivenes
with an application example where multimedia contents follow
the user movements throughout the house.
2008-01-24T19:09:05Z
2008-01-24T19:09:05Z
2008-01-24T19:09:05Z
2005
info:eu-repo/semantics/conferenceObject
The 2005 International Conference on Pervasive Systems and Computing
http://hdl.handle.net/10017/1265
eng
info:eu-repo/semantics/openAccess
oai:ebuah.uah.es:10017/12642023-12-14T15:52:01Zcom_10017_149com_10017_17761com_10017_17741com_10017_1216com_10017_18241col_10017_150col_10017_1225
Personalización de servicios multimedia en el hogar digital inteligente
Velasco Pérez, Juan Ramón
Marsá Maestre, Iván
Navarro Guillén, Andrés
López Carmona, Miguel Ángel
Vicente Rodríguez, Antonio José de
Hoz de la Hoz, Enrique de la
Paricio García, Álvaro
Machuca, Miriam
Universidad de Alcalá. Departamento de Automática
Servicios multimedia
Hogar digital inteligente
Hace ya tiempo que los sistemas informáticos
nos tienen acostumbrados a ofrecernos un
interfaz personalizado. Cada vez que nos
conectamos de nuevo a un sitio de comercio
electrónico en el que solemos adquirir
productos, el interfaz de la tienda se adapta a
nuestros gustos o preferencias. Otro ejemplo de
personalización se produce en algunos
vehículos, habitualmente de gama alta, que
configuran el asiento y las condiciones de
conducción a la persona que utiliza el coche
(normalmente, mediante una serie de
preferencias almacenadas en alguna memoria,
que activamos al entrar).
Sin embargo, esa personalización aún no ha
llegado a las viviendas. Al igual que los
ordenadores en el mundo productivo, el hogar
digital del futuro debe evitar que el usuario
tenga que realizar tareas rutinarias que afectan a
su confort, seguridad o movimientos. Este
trabajo propone una arquitectura que permite la
personalización del hogar digital por medio de
la tecnología de sistemas multiagente. Como
ejemplo de aplicación proponemos un sistema
capaz de hacer que los contenidos multimedia a
los que un usuario accede, le ¿persigan¿ por su
hogar a medida que se mueve, sin pérdida de
información.
2008-01-24T19:02:47Z
2008-01-24T19:02:47Z
2008-01-24T19:02:47Z
2005
info:eu-repo/semantics/conferenceObject
X Congreso Nacional de Internet, Telecomunicaciones y Sociedad de la Información
http://hdl.handle.net/10017/1264
spa
info:eu-repo/semantics/openAccess
Mundo Internet 2005
oai:ebuah.uah.es:10017/18922023-12-14T15:52:01Zcom_10017_149com_10017_17761com_10017_17741com_10017_1216com_10017_18241col_10017_150col_10017_1225
Un enfoque práctico para la localización de usuarios mediante Bluetooth en entornos domóticos
Marsá Maestre, Iván
Machuca, Miriam
Navarro Guillén, Andrés
Velasco Pérez, Juan Ramón
Universidad de Alcalá. Departamento de Automática
Domótica
Localización de usuarios
Bluetooth
Para que un sistema domótico pueda adaptarse adecuadamente
a las preferencias de sus diferentes usuarios, debe ser capaz de determinar
en cada momento en qué habitación se encuentran éstos dentro
de la vivienda. Este artículo presenta un sistema de localización especialmente
orientado a su utilización dentro del hogar inteligente. Cada
usuario del sistema lleva consigo un dispositivo personal Bluetooth, a
partir del cual el sistema puede identi carle y localizarle dentro de la
vivienda. El sistema se ha desarrollado dentro de una arquitectura multiagente
específicamente diseñada para ser utilizada en un hogar digital
capaz de ofrecer servicios a sus habitantes en función de su ubicación.
2008-09-03T11:52:29Z
2008-09-03T11:52:29Z
2008-09-03T11:52:29Z
2005
info:eu-repo/semantics/article
Proceedings of the 1st Iberoamerican Congress on Ubiquitous Computing CICU¿2005
http://hdl.handle.net/10017/1892
spa
info:eu-repo/semantics/openAccess
CEUR Workshop Proceedings
oai:ebuah.uah.es:10017/18932023-12-14T15:52:01Zcom_10017_149com_10017_17761com_10017_17741com_10017_1216com_10017_18241col_10017_150col_10017_1225
Mecanismos de Seguridad para una red ad hoc en un entorno urbano
Hoz de la Hoz, Enrique de la
Marsá Maestre, Iván
Alarcos Alcázar, Bernardo
Universidad de Alcalá. Departamento de Automática
Mecanismos de seguridad
Entorno urbano
Redes ad-hoc
Las redes ad-hoc representan un paradigma de comunicación
emergente cuya aplicación se ha propuesto en diversos entornos por su
capacidad de autoconfiguración y rápido despliegue. Sin embargo, siguen
planteados importantes desafíos relativos a problemas de seguridad. Uno
de estos problemas es la gestión y distribución de claves. Se propone la
aplicación del protocolo TESLA de distribución de claves a una red adhoc
de servicios en un entorno urbano como la alternativa más adecuada
frente a otras propuestas en el estado del arte. Finalmente, se realizan
pruebas de validación de un estadio preliminar del algoritmo propuesto.
2008-09-03T11:55:38Z
2008-09-03T11:55:38Z
2008-09-03T11:55:38Z
2005
info:eu-repo/semantics/article
Proceedings of the 1st Iberoamerican Congress on Ubiquitous Computing CICU¿2005
http://hdl.handle.net/10017/1893
spa
info:eu-repo/semantics/openAccess
CEUR Workshop Proceedings
oai:ebuah.uah.es:10017/12612023-12-14T15:52:01Zcom_10017_149com_10017_17761com_10017_17741com_10017_1216com_10017_18241col_10017_150col_10017_1225
Infraestructura para servicios e interfaces sensibles a la localicación en hogares inteligentes
Machuca, Miriam
López Carmona, Miguel Ángel
Velasco Pérez, Juan Ramón
Marsá Maestre, Iván
Universidad de Alcalá. Departamento de Automática
Servicios sensibles
Hogares inteligentes
Interfaces sensibles
Some not widespread environments like sophisticated vehicles, adjust controlled elements,
like the seat and the rearview, in order to match the preferences of their users. In this context
computer systems are fully capable of providing customized interfaces for users. However, this kind
of service customization has not yet reached the home environment. Inside real home environments,
we can find new services based on automatizing traditional ones, which make our lives easier and
more comfortable. However, this services are provided independently, the degree of personalization is
still very low, and the results are insufficient. The smart home must release the user from performing
routine and tedious tasks to achieve comfort, security, and effective energy management. To achieve
this goal, designed systems must use all posible components at home, providing a high quality service.
In this paper we extend our previous work on using multiagent systems to build a smart home
environment. We describe its funcionality and introduce a new ontology in order to make easy agent
communication and knowledge sharing.
2008-01-24T18:46:48Z
2008-01-24T18:46:48Z
2008-01-24T18:46:48Z
2005-09
info:eu-repo/semantics/conferenceObject
V Jornadas de Ingeniería Telemática JITEL '05
http://hdl.handle.net/10017/1261
spa
info:eu-repo/semantics/openAccess
oai:ebuah.uah.es:10017/18902023-12-22T08:12:44Zcom_10017_149com_10017_17761com_10017_17741com_10017_1216com_10017_18241col_10017_150col_10017_1225
A Hierarchical Agent-based Approach to Security in Smart Offices
Marsá Maestre, Iván
Hoz de la Hoz, Enrique de la
Alarcos Alcázar, Bernardo
Velasco Pérez, Juan Ramón
Universidad de Alcalá. Departamento de Automática
Hierarchical
Agent-based approach
Security
Smart offices
Seguridad industrial
As electronic devices become more and more pervasively integrated
in our daily routine, security concerns start to become evident.
In the last years, there has been an increasing interest on the topic of security
in smart environments. One of the most challenging environments
regarding security are smart offices due to the high number of potential
users, devices and spaces, and the diversity of security roles. This paper
presents a security solution for an agent-based architecture for the smart
office. This security solution is potentially applicable to generic smart
environments, but it suits particularly well to the smart office scenario,
taking advantage of the particular characteristics of the environment to
satisfy the security requirements. The result is a hierarchical, agent-based
solution, flexible and scalable enough to be applicable to different smart
office scenarios, from small businesses to large organizations.
2008-09-03T11:40:41Z
2008-09-03T11:40:41Z
2008-09-03T11:40:41Z
2006-06
info:eu-repo/semantics/article
Marsá, I., Hoz, E., Alarcos, B. & Velasco, j.R., 2006, "A Hierarchical Agent-based Approach to Security in Smart Offices", in International Conference on Ubiuitous Computing 2006.
http://hdl.handle.net/10017/1890
eng
info:eu-repo/grantAgreement/JCCM//PBC-05009-2/ES//
info:eu-repo/grantAgreement/UAH//UAH-PI2005%2F082/ES/SERVICIOS DE VALOR AÑADIDO EN UN ENTORNO URBANO BASADO EN REDES AD-HOC
info:eu-repo/semantics/openAccess
oai:ebuah.uah.es:10017/18952023-12-14T15:52:02Zcom_10017_149com_10017_17761com_10017_17741com_10017_1216com_10017_18241col_10017_150col_10017_1225
Images Protection Sent to Mobile Devices
Díaz, Ukrania
Alarcos Alcázar, Bernardo
Hoz de la Hoz, Enrique de la
Marsá Maestre, Iván
Universidad de Alcalá. Departamento de Automática
Images Protection
Mobile devices
Sistemas de comunicación móviles
With the increasing use of multimedia technologies and mobile
devices, also increases the applications which purpose is to offer information or
to do advertising by means of the sending of images or videos. In this paper, we
approached a digital tourist guide scene in which mobile devices with limited
resources need to receive multimedia information across a wireless connection.
Also we approached that this information is visible only authorized users. We
centre the article on the protection of images on an format of compression
adapted. Standard JPEG 2000 has been selected to offer an optimal balance between
the quality of image and the occupied space. In order to protect the information,
we have worked with selective encryption mechanism, that allow to
obtain a relation of commitment between the computational cost, on having
concealed the information and the concealment degree.
2008-09-03T12:12:50Z
2008-09-03T12:12:50Z
2008-09-03T12:12:50Z
2006-06
info:eu-repo/semantics/article
International Conference on Ubiuitous Computing
http://hdl.handle.net/10017/1895
eng
info:eu-repo/semantics/openAccess
oai:ebuah.uah.es:10017/12662023-12-14T15:52:02Zcom_10017_149com_10017_17761com_10017_17741com_10017_1216com_10017_18241col_10017_150col_10017_1225
Automated Purchase Negotiations in a Dynamic Electronic Marketplace
López Carmona, Miguel Ángel
Velasco Pérez, Juan Ramón
Alarcos Alcázar, Bernardo
Universidad de Alcalá. Departamento de Automática
Automated purchase
Dynamic electronic marketplace
Nowadays, there is a surge of B2C and B2B e-commerce operated
on the Internet. However, many of these systems are often nothing
more than electronic product or service catalogues. Against this background,
it is argued that new generation systems based on automatic
negotiation will emerge. This paper covers a particular kind of automatic
negotiation systems, where a number of participants in a mobile
dynamic electronic marketplace automatically negotiate the purchase of
products or services, by means of multiple automated one-to-one bargainings.
In a dynamic e-marketplace, the number of buyers and sellers
and their preferences may change over time. By mobile we mean that
buyers in a commercial area may initiate simultaneous negotiations with
several sellers using portable devices like cell phones, laptops or personal
digital assistants, so these negotiations do not require participants to be
colocated in space. We will show how an expressive approach to fuzzy
constraint based agent purchase negotiations in competitive trading environments,
is ideally suited to work on these kind of e-marketplaces. An
example of mobile e-marketplace, and a comparison between an expressive
and an inexpressive approach will be presented to show the efficiency
of the proposed solution.
2008-01-24T19:13:18Z
2008-01-24T19:13:18Z
2008-01-24T19:13:18Z
2006-06
info:eu-repo/semantics/conferenceObject
1st International Conference on Ubiquitous Computing
http://hdl.handle.net/10017/1266
eng
info:eu-repo/grantAgreement/UAH//PI2005%2F082
Info:eu-repo/grantAgreement/MEC//TSI2005-07384-C03-03/ES//IMPROVISA
info:eu-repo/semantics/openAccess
oai:ebuah.uah.es:10017/12672023-12-14T15:52:02Zcom_10017_149com_10017_17761com_10017_17741com_10017_1216com_10017_18241col_10017_150col_10017_1225
Extending the bdi-asdp methodology for real-time
Fernández, Susel
Díaz, Ukrania
Marsá Maestre, Iván
López Carmona, Miguel Ángel
Universidad de Alcalá. Departamento de Automática
Bdi-asdp
Real-time
Multi-agent systems are an emerging research area which is experiencing a fast growth. In the last years, many theories,
architectures, languages and platforms for the development of agent based systems have been developed. On the other
hand, real-time systems represent an important challenge from the perspective of multi-agent systems, considering the
increasing need to count on software which is able to respond to certain situations in a timely partition. Nevertheless, in
spite of its increasing interest, an important difficulty when applying these technologies to the resolution of a concrete
problem is in the agent-based software development process. Many efforts have been made to extend the capacities of
standard software modelling to integrate multi-agent and real-time systems, and different methodological proposals exist,
but their practical application is not always obvious from the definition of the methodology. This work proposes an
extension of the BDI-ASDP methodology for the inclusion of timing constraints. We have applied this methodology to
model some of the agents which participate in a virtual baseball game.
2008-01-24T19:17:12Z
2008-01-24T19:17:12Z
2008-01-24T19:17:12Z
2007-02
info:eu-repo/semantics/conferenceObject
IADIS International Conference on Applied Computing
http://hdl.handle.net/10017/1267
eng
Info:eu-repo/grantAgreement/MEC//TSI2005-07384-C03-03/ES//IMPROVISA
info:eu-repo/semantics/openAccess
oai:ebuah.uah.es:10017/12682023-12-14T15:52:02Zcom_10017_149com_10017_17761com_10017_17741com_10017_1216com_10017_18241col_10017_150col_10017_1225
ANEGSYS: Un sistema de recomendación basado en negociaciones automáticas para mercados electrónicos locales
López Carmona, Miguel Ángel
Marsá Maestre, Iván
Velasco Pérez, Juan Ramón
Alarcos Alcázar, Bernardo
Universidad de Alcalá. Departamento de Automática
ANEGSYS
Sistema de recomendación
Negociación automática
Mercados electrónicos
Local e-marketplaces are local online e-commerce platforms deployed by product and service
providers and accessed by local customers via mobile devices. In this scenario, customers need to gather
information about available offers from the different providers in the area, in order to select the most
suitable for their needs and preferences. We present ANEGSYS, an agent-based recommender system for
product acquisition which uses automatic bilateral negotiations to generate purchase pre-agreements among
buyer and seller agents. This greatly enhances the search for solutions which maximize both buyer and
seller utilities.
2008-01-24T19:21:23Z
2008-01-24T19:21:23Z
2008-01-24T19:21:23Z
2007-09
info:eu-repo/semantics/conferenceObject
VI Jornadas de Ingeniería Telemática, JITEL 2007
http://hdl.handle.net/10017/1268
spa
info:eu-repo/grantAgreement/JCCM//PBC-05009-2
Info:eu-repo/grantAgreement/MEC//TSI2005-07384-C03-03/ES//IMPROVISA
info:eu-repo/semantics/openAccess
oai:ebuah.uah.es:10017/12692023-12-14T15:52:03Zcom_10017_149com_10017_17761com_10017_17741com_10017_1216com_10017_18241col_10017_150col_10017_1225
Dispositivos Móviles y Espacios Inteligentes Personales
Marsá Maestre, Iván
López Carmona, Miguel Ángel
Navarro Guillén, Andrés
Hoz de la Hoz, Enrique de la
Universidad de Alcalá. Departamento de Automática
Dispositivos móviles
Espacios inteligentes
Though personal mobile devices like cell phones and PDAs already offer their users some
kinds of service personalization, service personalization through personal mobile devices can be taken
one step further. In particular, personal devices can be used to integrate services provided within
smart environments with the services provided at the personal devices themselves. In this paper, we
present an approach for the seamless integration of personal devices and smart environments through
the use of personal smart spaces. This would allow personal devices to become even more integrated
in our everyday lives.
2008-01-24T19:23:31Z
2008-01-24T19:23:31Z
2008-01-24T19:23:31Z
2007-09
info:eu-repo/semantics/conferenceObject
Jornadas de Ingeniería Telemática JITEL 2007
http://hdl.handle.net/10017/1269
spa
info:eu-repo/grantAgreement/JCCM//PBC-05009-2
info:eu-repo/grantAgreement/CAM//CCG06-UAH%2FTIC-0424/ES/LOCALIZACION AUTOMATICA DE DISPOSITIVOS EN RECINTOS ACOTADOS/
info:eu-repo/semantics/openAccess
oai:ebuah.uah.es:10017/18912023-12-14T15:52:03Zcom_10017_149com_10017_17761com_10017_17741com_10017_1216com_10017_18241col_10017_150col_10017_1225
Una Arquitectura de Seguridad Jerárquica para Entornos de Trabajo Inteligentes
Hoz de la Hoz, Enrique de la
Marsá Maestre, Iván
Vicente Rodríguez, Antonio José de
Alarcos Alcázar, Bernardo
Universidad de Alcalá. Departamento de Automática
Seguridad
Trabajo inteligente
Arquitectura
In the last years, there has been an increasing interest on security concerns in smart
environments. In smart home environments the main goals are user comfort and easy deployment of
new devices, so security is usually left apart or focuses mainly in transparency and privacy
enhancement. Office security, however, has more rigorous security requirements due to the high
number of potential users, devices and spaces, and the diversity of security roles. This paper presents a
security solution for an agent-based architecture for the smart office. This security solution is
potentially applicable to generic smart environments, but it suits particularly well to the smart office
scenario, taking advantage of the particular characteristics of the environment to satisfy the security
requirements.
2008-09-03T11:49:30Z
2008-09-03T11:49:30Z
2008-09-03T11:49:30Z
2007-09
info:eu-repo/semantics/article
Jornadas de Ingeniería Telemática JITEL 2007
http://hdl.handle.net/10017/1891
spa
info:eu-repo/semantics/openAccess
oai:ebuah.uah.es:10017/41412023-12-20T15:20:48Zcom_10017_149com_10017_17761com_10017_17741com_10017_1216com_10017_18241col_10017_150col_10017_1225
Evaluation of Tree-Based Routing Ethernet
Ibáñez Fernández, Guillermo Agustín
García Martínez, Alberto
Carral Pelayo, Juan Antonio
Azcorra, Arturo
Arco Rodríguez, José Manuel
Universidad de Alcalá. Departamento de Automática
Routing bridges
Ethernet
Spanning tree
Routing protocols
Telecommunication network topology
Tree-based Routing (TRE) revisits Tree-based Routing Architecture for Irregular Networks (TRAIN)¿a forwarding scheme based on a spanning tree that was extended to use some shortcut links.We propose its adaptation to Ethernet, using a new type of hierarchical Ethernet addresses and a procedure to assign them to bridges. We show that compared to RSTP, TRE offers improved throughput. The impact of transient loops in TRE is lower compared to the application of the classical shortest path routing protocols to Ethernet. Finally, TRE is self-configuring and its forwarding process is simpler and more efficient than in standard Ethernet and shortest path routing proposals.
2009-09-29T16:12:35Z
2009-09-29T16:12:35Z
2009-09-29T16:12:35Z
2009-06
info:eu-repo/semantics/article
http://dx.doi.org/10.1109/LCOMM.2009.090469
http://hdl.handle.net/10017/4141
eng
info:eu-repo/grantAgreement/MICINN//TIN2008-06739-C04-04/ES/TECNOLOGIAS TELEMATICAS DE COOPERACION CIUDADANA/
info:eu-repo/semantics/openAccess
IEEE
oai:ebuah.uah.es:10017/41442023-12-20T15:22:27Zcom_10017_149com_10017_17761com_10017_17741com_10017_1216com_10017_18241col_10017_150col_10017_1225
HURP/HURBA: Zero-configuration hierarchical Up/Down routing and bridging architecture for Ethernet backbones and campus networks
Ibáñez Fernández, Guillermo Agustín
García Martínez, Alberto
Carral Pelayo, Juan Antonio
Gonzalez, Pedro A.
Azcorra, Arturo
Arco Rodríguez, José Manuel
Universidad de Alcalá. Departamento de Automática
Routing
Up/Down routing
Turn prohibition
Cycle-breaking
Ethernet
Ethernet switched networks do not scale appropriately due to limitations inherent to the spanning tree protocol. Ethernet architectures based on routing over a virtual topology in which turns are prohibited offer improved performance over spanning tree, although in some cases suffer from excessive computational complexity. Up/Down routing is a turn prohibition algorithm with low computational complexity. In this paper we propose HURBA, a new layer-two architecture that improves Up/Down routing performance due to an optimization based on the use of hierarchical addressing, while preserving the computational complexity of Up/Down. The resulting architecture requires zero-configuration, uses the same frame format as Ethernet, allows upgrades by software update, and is compatible with 802.1D bridges by means of encapsulation. HURP protocol builds automatically a core with the interconnected HURP routing bridges and the standard bridges get connected to the edges in standard spanning trees. Simulations show that the performance of HURP, evaluated over various combinations of network topology and size, is close to the one of shortest path, is consistently better than that of Up/Down, and is equal or better than Turn Prohibition, with the advantage of having a lower complexity.
2009-09-29T16:24:56Z
2009-09-29T16:24:56Z
2009-09-29T16:24:56Z
2009
info:eu-repo/semantics/article
G. Ibáñez et al., HURP/HURBA: Zero-configuration hierarchical Up/Down routing and bridging architecture for Ethernet backbones and campus networks, Comput. Netw. (2009), doi:10.1016/j.comnet.2009.08.007
http://hdl.handle.net/10017/4144
eng
http://dx.doi.org/10.1016/j.comnet.2009.08.007
info:eu-repo/grantAgreement/MEC//TEC2007-67966-C03-03%2FTCM/ES/CONTRIBUCION A LOS NUEVOS PARADIGMAS Y TECNOLOGIAS DE RED PARA LAS COMUNICACIONES DEL MAÑANA/CON-PARTE 3
info:eu-repo/grantAgreement/CAM//CCG07-UC3M%2FTIC-3356/ES/TOLERANCIA A FALLOS EN REDES IP AVANZADAS/
info:eu-repo/grantAgreement/CAM//S-0505%2FTIC%2F000251/ES/APLICACIONES EMERGENTES PARA INTERNET DE NUEVA GENERACION/
info:eu-repo/grantAgreement/JCCM/PROGRAMA ESTATAL DE FOMENTO DE LA INVESTIGACION CIENTIFICA Y TECNICA DE EXCELENCIA/PII1I09-0204-4319/ES/EXTENSIONES, VARIANTES Y MEJORAS DE ARQUITECTURA DE RED ESCALABLE DE CAPA DOS AUTOCONFIGURABLE MEDIANTE CONMUTADORES-ENRUTADORES ETHERNET/EMARECE
info:eu-repo/semantics/openAccess
Elsevier
oai:ebuah.uah.es:10017/41462023-12-20T15:21:14Zcom_10017_149com_10017_17761com_10017_17741com_10017_1216com_10017_18241col_10017_150col_10017_1225
Evolución conceptual de los protocolos de puentes transparentes
Ibáñez Fernández, Guillermo Agustín
García Martínez, Alberto
Carral Pelayo, Juan Antonio
Arco Rodríguez, José Manuel
Azcorra, Arturo
Universidad de Alcalá. Departamento de Automática
conmutación de paquetes
enrutamiento
protocolos
puentes
Los puentes Ethernet transparentes son un elemento cada vez más importante en las redes
de telecomunicaciones. Este artículo ofrece una visión panorámica de la evolución conceptual de los
paradigmas de puentes durante las últimas décadas, desde los puentes transparentes con árbol de
expansión hasta las propuestas actualmente en estandarización: por una parte Shortest Path Bridges,
Provider Bridges y Provider Backbone Bridges en el IEEE 802.1; por otra parte Routing Bridges en el
IETF. Estas propuestas buscan aumentar la escalabilidad y obtener una alta utilización de la infraestructura
de red, así como la provisión de servicios basados en Ethernet a gran número de usuarios. Mediante
un mapa genealógico y una tabla se resumen e ilustran los aspectos funcionales, la evolución de los
puentes propuestos en cuanto a los mecanismos básicos empleados para el encaminamiento, reenvío
y la prevención de bucles tales como protocolos de vector distancia y de estado de enlaces, árboles
múltiples de expansión, jerarquización mediante encapsulado de tramas y prohibición de algunos giros
en los nodos. La evolución reciente de las propuestas muestra claramente varias tendencias: el predominio
de los protocolos de estado de enlaces como IS-IS para el encaminamiento y/o construcción de
árboles múltiples, de los mecanismos de encapsulado, y la multiplicación de tipos de identificadores
para etiquetar y procesar separada y homogéneamente miles de servicios y clientes.
2009-09-29T16:29:49Z
2009-09-29T16:29:49Z
2009-09-29T16:29:49Z
2009-03
info:eu-repo/semantics/article
Novática es la revista de la Asociación de Técnicos de Informática, Nº 198, pg 55
http://hdl.handle.net/10017/4146
spa
info:eu-repo/semantics/openAccess
Novatica
oai:ebuah.uah.es:10017/41432023-12-20T15:22:04Zcom_10017_149com_10017_17761com_10017_17741com_10017_1216com_10017_18241col_10017_150col_10017_1225
Hierarchical Up/Down Routing Architecture for Ethernet backbones and campus networks
Ibáñez Fernández, Guillermo Agustín
García Martínez, Alberto
Carral Pelayo, Juan Antonio
Gonzalez, Pedro A.
Azcorra, Arturo
Arco Rodríguez, José Manuel
Universidad de Alcalá. Departamento de Automática
Routing
computer networks
Up/Down routing
turn prohibition
cycle breaking
We describe a new layer two distributed and scalable routing architecture. It uses an automatic hierarchical node identifier assignment mechanism associated to the rapid spanning tree protocol. Enhanced up/down mechanisms are used to prohibit some turns at nodes to break cycles, instead of blocking links like the spannning tree protocol does. The protocol performance is similar or better than other turn prohibition algorithms recently proposed with lower complexity O(Nd) and better scalability. Simulations show that the fraction of prohibited turns over random networks is less than 0.2. The effect of root bridge election on the performance of the protocol is limited both in the random and regular networks studied. The use of hierarchical, tree-descriptive addresses simplifies the routing, and avoids the need of all nodes having a global knowleddge of the network topology. Routing frames through the hierarchical tree at very high speed is possible by progressive decoding of frame destination address, without routing tables or port address learning. Coexistence with standard bridges is achieved using combined devices: bridges that forward the frames having global destination MAC addresses as standard bridges and frames with local MAC frames with the proposed protocol.
2009-09-29T16:19:32Z
2009-09-29T16:19:32Z
2009-09-29T16:19:32Z
2008-04
info:eu-repo/semantics/article
INFOCOM Workshops 2008, IEEE , vol., no., pp.1-6
http://hdl.handle.net/10017/4143
eng
info:eu-repo/semantics/openAccess
IEEE
oai:ebuah.uah.es:10017/67702023-12-14T15:52:04Zcom_10017_149com_10017_17761com_10017_17741com_10017_1216com_10017_18241col_10017_150col_10017_1225
A Simple, Zero-configuration, Low Latency, Bridging Protocol
Ibáñez Fernández, Guillermo Agustín
Naous, Jad
Rojas Sánchez, Elisa
Rivera Pinto, Diego
Carral Pelayo, Juan Antonio
Arco Rodríguez, José Manuel
Universidad de Alcalá. Departamento de Automática
Ethernet
Routing bridges
Shortest Path Bridges
Spanning Tree
This paper describes a demo for a new type of
bridges, ARP-Path bridges. These ARP-based Ethernet Switches
rely on the race between ARP Request packets flooded over all
links, to discover the minimum latency path to the destination
host. The protocol uses all links, is loop free, uses the standard
Ethernet frame format, is fully transparent to hosts and neither
needs a spanning tree protocol to prevent loops nor a links state
protocol to obtain minimum latency paths. Implementations in
Linux and Openflow on NetFPGA show inherent robustness and
fast reconfiguration. Simulation results show throughput and
delay performance superior to the Spanning Tree Protocol and
similar to shortest path routing, with lower complexity.
2010-09-24T15:23:18Z
2010-09-24T15:23:18Z
2010-09-24T15:23:18Z
2010-10-11
info:eu-repo/semantics/conferenceObject
http://www.ieeelcn.org/lcn35demos/lcn-demo2010_ibanez.pdf
http://hdl.handle.net/10017/6770
eng
info:eu-repo/grantAgreement/CAM//S2009%2FTIC1468/ES//MEDIANET-CM
info:eu-repo/grantAgreement/JCCM/Programa Estatal de Fomento de la Investigación Científica y Técnica de Excelencia/PII1I09-0204-4319/ES/Extensiones, Variantes Y Mejoras de Arquitectura de Red Escalable de Capa Dos Autoconfigurable Mediante Conmutadores-Enrutadores Ethernet (Emarece)/
info:eu-repo/semantics/openAccess
The 35th IEEE Conference on Local Computer Networks (LCN)
oai:ebuah.uah.es:10017/67712023-12-14T15:52:05Zcom_10017_149com_10017_17761com_10017_17741com_10017_1216com_10017_18241col_10017_150col_10017_1225
ARP-Path Bridges: Implementación de Shortest Path Bridges Ethernet basados en ARP sobre Linux y Openflow/NetFPGA
Ibáñez Fernández, Guillermo Agustín
Naous, Jad
Rojas Sánchez, Elisa
Rivera Pinto, Diego
Carral Pelayo, Juan Antonio
Velasco Pérez, Juan Ramón
Universidad de Alcalá. Departamento de Automática
Ethernet
Routing bridges
Shortest Path Bridges
Spanning Tree Protocol
En este artículo se describen los conmutadores ARP-Path (también denominados FastPath y sus implementaciones
recientes en Linux y NetFPGA. ARP-Path es una evolución conceptual de los puentes transparentes con aprendizaje que no requiere
protocolo auxiliar de encaminamiento (ni de árbol de expansión) en capa dos, a diferencia de las propuestas actualmente en
estandarización RBridges y Shortest Path Bridges. Cada host establece, en los conmutadores ARP-Path, un camino mínimo al mismo
tiempo que se envía el paquete estándar ARP_Request, pero inundado por todos los enlaces. El camino marcado por el paquete ARP
Request que alcanza el destino se confirma aprovechando el paquete ARP_Reply de respuesta del host destino. Se han realizado
implementaciones de puentes ARP-Path en Linux y en la plataforma Openflow con tarjetas NetFPGA (actualmente en pruebas), así
como simulaciones sobre Omnet. Las prestaciones son similares o ligeramente superiores a las de enrutadores de camino mínimo y
muy superiores a STP. Las pruebas con tráfico real y de reconfiguración muestran las robustez y rapidez del protocolo. ARP-Path no
modifica la trama de Ethernet y es compatible con puentes estándar en modo núcleo-isla.
2010-09-24T15:29:16Z
2010-09-24T15:29:16Z
2010-09-24T15:29:16Z
2010-09-27
info:eu-repo/semantics/conferenceObject
http://hdl.handle.net/10017/6771
spa
info:eu-repo/grantAgreement/CAM//S2009%2FTIC1468/ES//MEDIANET-CM
info:eu-repo/grantAgreement/JCCM/Programa Estatal de Fomento de la Investigación Científica y Técnica de Excelencia/PII1I09-0204-4319/ES/Extensiones, Variantes Y Mejoras de Arquitectura de Red Escalable de Capa Dos Autoconfigurable Mediante Conmutadores-Enrutadores Ethernet (Emarece)/
info:eu-repo/semantics/openAccess
XX Jornadas de Telecom I+D
oai:ebuah.uah.es:10017/62982023-12-20T15:21:41Zcom_10017_149com_10017_17761com_10017_17741com_10017_1216com_10017_18241col_10017_150col_10017_1225
Fast Path Ethernet Switching: On-demand Efficient Transparent Bridges for Data Center and Campus Networks
Ibáñez Fernández, Guillermo Agustín
Carral Pelayo, Juan Antonio
García Martínez, Alberto
Arco Rodríguez, José Manuel
Rivera Pinto, Diego
Azcorra, Arturo
Universidad de Alcalá. Departamento de Automática
Routing bridges
Ethernet
Spanning Tree
Computer networks
Routing protocols
Switching
Ethernet bridging in campus networks offers advantages like zero configuration, no need of IP addresses administration in subnets, high performance and low costs. But Ethernet bridging does not scale. Current proposals under standardization, like Shortest Path Bridges and Routing Bridges use a link-state routing protocol to compute shortest paths. As a simpler alternative, we propose an evolution of the transparent bridges learning mechanism, that provides loop-free, full infrastructure utilization for
campus and datacenter networks. Fast Path Ethernet Switches double use the standard ARP Request and Reply packets to set up fast on-demand paths between hosts when needed. This architecture uses standard Ethernet frame format, is fully transparent to hosts and compatible with 802.1D bridges in core-island mode. A proof of concept has been implemented in Linux. Preliminary simulations in metropolitan and campus newtork topologies show clearly superior to spanning tree and even shortest path routers, at a fraction of the complexity.
2010-05-04T09:05:56Z
2010-05-04T09:05:56Z
2010-05-04T09:05:56Z
2010-05-05
info:eu-repo/semantics/conferenceObject
http://hdl.handle.net/10017/6298
eng
info:eu-repo/grantAgreement/CAM//S2009%2FTIC1468/ES//MEDIANET-CM
info:eu-repo/grantAgreement/JCCM/Programa Estatal de Fomento de la Investigación Científica y Técnica de Excelencia/PII1I09-0204-4319/ES/Extensiones, Variantes Y Mejoras de Arquitectura de Red Escalable de Capa Dos Autoconfigurable Mediante Conmutadores-Enrutadores Ethernet (Emarece)/
info:eu-repo/semantics/openAccess
IEEE LAN/MAN Workshop
oai:ebuah.uah.es:10017/62742023-12-20T15:22:48Zcom_10017_149com_10017_17761com_10017_17741com_10017_1216com_10017_18241col_10017_150col_10017_1225
TRE+: Extended Tree-Based Routing Ethernet
Carral Pelayo, Juan Antonio
Ibáñez Fernández, Guillermo Agustín
García Martínez, Alberto
López Carmona, Miguel Ángel
Marsá Maestre, Iván
Universidad de Alcalá. Departamento de Automática
Routing bridges
Ethernet
Spanning tree
Hierarchical addresses
Tree-based routing Ethernet (TRE) is a recent Ethernet
architecture that enables shortcut links to improve performance
compared to spanning tree protocols. However, TRE can only
use shortcuts that arrive directly at bridges located in the
branch of the destination. TRE+ extends the topology
knowledge of a bridge to 2 hops away, thus unveiling new
shortcuts to the destination branch. Simulations show a major
performance improvement of TRE+ compared to TRE, with
results close to shortest paths in some topologies.
2010-04-20T11:16:53Z
2010-04-20T11:16:53Z
2010-04-20T11:16:53Z
2010-02
info:eu-repo/semantics/article
ETRI Journal, vol.32, no.1, Feb. 2010, pp.157-159
http://hdl.handle.net/10017/6274
eng
info:eu-repo/grantAgreement/JCCM/PROGRAMA ESTATAL DE FOMENTO DE LA INVESTIGACION CIENTIFICA Y TECNICA DE EXCELENCIA/PII1I09-0204-4319/ES/EXTENSIONES, VARIANTES Y MEJORAS DE ARQUITECTURA DE RED ESCALABLE DE CAPA DOS AUTOCONFIGURABLE MEDIANTE CONMUTADORES-ENRUTADORES ETHERNET/EMARECE
info:eu-repo/semantics/openAccess
ETRI Journal
oai:ebuah.uah.es:10017/51572023-12-14T15:52:06Zcom_10017_149com_10017_17761com_10017_17741com_10017_1216com_10017_18241col_10017_150col_10017_1225
A Performance Comparison of Virtual Backbone Formation Algorithms for Wireless Mesh Networks
Ibáñez Fernández, Guillermo Agustín
Manzanedo, Eva
Carral Pelayo, Juan Antonio
García, Antonio
Arco Rodríguez, José Manuel
Universidad de Alcalá. Departamento de Automática
Ad hoc
Algorithms
Connected dominating set (CDS)
Dominating Set Simulation Suite
Mesh
Routing
Algoritmos computacionales
Currently wireless networks are dominant by star
topology paradigm. Its natural the evolution is towards wireless mesh
multi-hop networks. This article compares the performance of several
algorithms for virtual backbone formation in ad hoc mesh networks
both theoretically and through simulations. Firstly, an overview of the
algorithms is given. Next, the results of the algorithm simulations
made with the program Dominating Set Simulation Suite (DSSS) are
described and interpreted. We have been extended the simulator to
simulate the Mobile Backbone Network Topology Synthesis
Algorithm. The results show that this algorithm has the best
combination of performance characteristics among the compared
algorithms.
2009-12-04T12:07:36Z
2009-12-04T12:07:36Z
2009-12-04T12:07:36Z
2009-11
info:eu-repo/semantics/article
http://hdl.handle.net/10017/5157
eng
Info:eu-repo/grantAgreement/MEC//TEC2004-05622-C04-03%2FTCM
info:eu-repo/grantAgreement/CAM//S-0505%2FTIC%2F000251/ES/APLICACIONES EMERGENTES PARA INTERNET DE NUEVA GENERACION/
info:eu-repo/semantics/openAccess
International Journal of Communication Networks and Information Security
oai:ebuah.uah.es:10017/86772023-12-14T15:52:06Zcom_10017_149com_10017_17761com_10017_17741com_10017_1216com_10017_18241col_10017_150col_10017_1225
Implementation of ARP-Path Low Latency Bridges in Linux and OpenFlow/NetFPGA
Ibáñez Fernández, Guillermo Agustín
De Schuymer, Bart
Naous, Jad
Rivera Pinto, Diego
Rojas Sánchez, Elisa
Carral Pelayo, Juan Antonio
Universidad de Alcalá. Departamento de Automática
Ethernet
Routing bridges
Shortest Path Bridges
Spanning Tree
This paper describes the implementation of ARP- Path (a.k.a. FastPath) bridges, a recently proposed concept for low latency bridges, in Linux/Soekris and OpenFlow/NetFPGA platforms. These ARP-based Ethernet Switches rely on the race between the replicas of a standard ARP Request packet flooded over all links, to discover the minimum latency path to the destination host, complemented in the opposite direction by the ARP Reply packet directed to the source host. Implementations show that the protocol is loop free, does not block links, is fully transparent to hosts and neither needs a spanning tree protocol to prevent loops nor a link state protocol to obtain low latency paths. Implementations in Linux and OpenFlow on NetFPGA show inherent robustness and fast reconfiguration. Previous simulations showed a superior performance (throughput and delay) than the Spanning Tree Protocol and similar to shortest path routing, with lower complexity.
2011-09-09T11:05:28Z
2011-09-09T11:05:28Z
2011-09-09T11:05:28Z
2011-07-04
info:eu-repo/semantics/article
http://ieeexplore.ieee.org/xpl/freeabs_all.jsp?arnumber=5986000
http://hdl.handle.net/10017/8677
eng
info:eu-repo/grantAgreement/MICINN//TIN2008-06739-C04-04/ES/TECNOLOGIAS TELEMATICAS DE COOPERACION CIUDADANA/
info:eu-repo/grantAgreement/CAM//S2009%2FTIC1468/ES//MEDIANET-CM
info:eu-repo/grantAgreement/JCCM/Programa Estatal de Fomento de la Investigación Científica y Técnica de Excelencia/PII1I09-0204-4319/ES/Extensiones, Variantes Y Mejoras de Arquitectura de Red Escalable de Capa Dos Autoconfigurable Mediante Conmutadores-Enrutadores Ethernet (Emarece)/
info:eu-repo/semantics/openAccess
12th IEEE International Conference on High Performance Switching and Routing
oai:ebuah.uah.es:10017/86762023-12-14T15:52:06Zcom_10017_149com_10017_17761com_10017_17741com_10017_1216com_10017_18241col_10017_150col_10017_1225
Implementing ARP-Path Low Latency Bridges in NetFPGA
Rojas Sánchez, Elisa
Naous, Jad
Ibáñez Fernández, Guillermo Agustín
Rivera Pinto, Diego
Carral Pelayo, Juan Antonio
Arco Rodríguez, José Manuel
Universidad de Alcalá. Departamento de Automática
Routing bridges
NetFPGA
Shortest Path Bridges
Spanning Tree
Ethernet
The demo is focused on the implementation of ARP-Path (a.k.a. FastPath) bridges, a recently proposed concept for low latency bridges. ARP-Path Bridges rely on the race between broadcast ARP Request packets, to discover the minimum latency path to the destination host. Several implementations (in Omnet++, Linux, OpenFlow, NetFPGA) have shown that ARP-Path exhibits loop-freedom, does not block links, is fully transparent to hosts and neither needs a spanning tree protocol to prevent loops nor a link state protocol to obtain low latency paths. This demo compares our hardware implementation on NetFPGA to bridges running STP, showing that ARP-Path finds lower latency paths than STP.
2011-09-09T10:29:33Z
2011-09-09T10:29:33Z
2011-09-09T10:29:33Z
2011-08-15
info:eu-repo/semantics/article
Proceedings of the ACM SIGCOMM 2011 conference Pages 444-445
http://hdl.handle.net/10017/8676
eng
info:eu-repo/grantAgreement/CAM//S2009%2FTIC1468/ES//MEDIANET-CM
info:eu-repo/grantAgreement/JCCM/PROGRAMA ESTATAL DE FOMENTO DE LA INVESTIGACION CIENTIFICA Y TECNICA DE EXCELENCIA/PII1I09-0204-4319/ES/EXTENSIONES, VARIANTES Y MEJORAS DE ARQUITECTURA DE RED ESCALABLE DE CAPA DOS AUTOCONFIGURABLE MEDIANTE CONMUTADORES-ENRUTADORES ETHERNET/EMARECE
info:eu-repo/semantics/openAccess
ACM SIGCOMM 2011
oai:ebuah.uah.es:10017/81752023-12-14T15:52:06Zcom_10017_149com_10017_17761com_10017_17741com_10017_1216com_10017_18241col_10017_150col_10017_1225
ARP-Path: ARP-based, Shortest Path Bridges
Ibáñez Fernández, Guillermo Agustín
Carral Pelayo, Juan Antonio
Arco Rodríguez, José Manuel
Rivera Pinto, Diego
Montalvo Taravillo, Aarón
Universidad de Alcalá. Departamento de Automática
Ethernet
Routing bridges
Spanning Tree
This letter is a summary proposal for an evolution of
the Ethernet transparent bridge paradigm that provides simple,
shortest path bridging in campus networks. ARP-Path Ethernet
Switches set up an on-demand path between two hosts just
reusing and flooding the standard ARP request frame through all
links and confirming the path reaching to the destination host
with the ARP reply frame. ARP-Path uses the standard Ethernet
frame format, is fully transparent to hosts and does not require
spanning tree or link state protocol. Simulation results show
superior performance to spanning tree and similar to shortest
path routing, with lower complexity. Our implementations
confirm backward compatibility, robustness and performance.
2011-05-05T10:45:57Z
2011-05-05T10:45:57Z
2011-05-05T10:45:57Z
2011-05-05T10:45:57Z
info:eu-repo/semantics/article
http://hdl.handle.net/10017/8175
eng
info:eu-repo/grantAgreement/JCCM/PROGRAMA ESTATAL DE FOMENTO DE LA INVESTIGACION CIENTIFICA Y TECNICA DE EXCELENCIA/PII1I09-0204-4319/ES/EXTENSIONES, VARIANTES Y MEJORAS DE ARQUITECTURA DE RED ESCALABLE DE CAPA DOS AUTOCONFIGURABLE MEDIANTE CONMUTADORES-ENRUTADORES ETHERNET/EMARECE
info:eu-repo/grantAgreement/CAM//S2009%2FTIC1468/ES//MEDIANET-CM
info:eu-repo/semantics/openAccess
oai:ebuah.uah.es:10017/89632023-12-14T15:52:07Zcom_10017_149com_10017_17761com_10017_17741com_10017_1216com_10017_18241col_10017_150col_10017_1225
A Small Data Center Network of ARP-Path Bridges made of Openflow Switches
Ibáñez Fernández, Guillermo Agustín
Rojas Sánchez, Elisa
Rivera Pinto, Diego
De Schuymer, Bart
Dietz, Thomas
Naous, Jad
Universidad de Alcalá. Departamento de Automática
Ethernet
Routing bridges
Shortest Path Bridges
Spanning Tree
This demo shows, in a small data center demo network topology the ARP Path bridges functionality and robustness over varied platforms and their interoperability. ARP-Path bridges set up on-demand shortest paths between hosts using the standard ARP Request, but flooded over all links, to find the lowest latency path to the destination host. ARP Path is loop free, uses the standard Ethernet frame and compatible with hosts and routers.Data center demo network consists of ten ARP Path bridges. Eight bridges are implemented with standard Openflow switches (four NEC PF8800/PF5240 Open flow capable switches and four Soekris boxes running Open flow Switch implementation) and the other two are implemented on OpenWRT. A previous demo showed (in remote lab) the protocol operation over four NetFPGA boards executing Openflow[7]. Demo shows network operation with standard applications like video, demonstrating the protocol robustness, zero configuration, fast network reconfiguration upon link failures and after mobility of a host.. Implementations in Linux and Openflow show inherent robustness and fast reconfiguration. Additionally, information and video of the Sigcomm 2011 demo with implementation of ARP Path protocol on a network of four NetFPGA boards (pure hardware implementation) is also posted [8].
2011-10-18T16:58:17Z
2011-10-18T16:58:17Z
2011-10-18T16:58:17Z
2011-10-05
info:eu-repo/semantics/article
The 36th IEEE Conference on Local Computer Networks (LCN). Bonn(Alemania)(04/10/2011 - 07/10/2011)
http://hdl.handle.net/10017/8963
eng
info:eu-repo/semantics/openAccess
The 36th IEEE Conference on Local Computer Networks (LCN)
oai:ebuah.uah.es:10017/170692023-12-14T15:52:07Zcom_10017_149com_10017_17761com_10017_17741com_10017_1216com_10017_18241col_10017_150col_10017_1225
Shortest Path Bridges Without Routing (All-path) (beyond link-state routing in shortest path bridges)
Ibáñez Fernández, Guillermo Agustín
Rojas Sánchez, Elisa
Universidad de Alcalá. Departamento de Automática
Etherner, All-Path, STP
2013-05-07T10:38:43Z
2013-05-07T10:38:43Z
2013-05-07T10:38:43Z
2013-04-04
info:eu-repo/semantics/article
http://hdl.handle.net/10017/17069
eng
info:eu-repo/semantics/openAccess
oai:ebuah.uah.es:10017/170702023-12-14T15:52:07Zcom_10017_149com_10017_17761com_10017_17741com_10017_1216com_10017_18241col_10017_150col_10017_1225
Torii-HLMAC: Torii-HLMAC: Fat Tree Data Center Architecture
Rojas Sánchez, Elisa
Universidad de Alcalá. Departamento de Automática
Etherner, All-Path, HLMAC
2013-05-07T10:41:00Z
2013-05-07T10:41:00Z
2013-05-07T10:41:00Z
2013-04-03
info:eu-repo/semantics/article
http://hdl.handle.net/10017/17070
eng
info:eu-repo/semantics/openAccess
oai:ebuah.uah.es:10017/188812023-12-14T15:52:07Zcom_10017_149com_10017_17761com_10017_17741com_10017_1216com_10017_18241col_10017_150col_10017_1225
Evaluating Native Load Distribution of ARP- Path Bridging Protocol in Mesh and Data Center
Ibáñez Fernández, Guillermo Agustín
Carral Pelayo, Juan Antonio
Rojas Sánchez, Elisa
Giménez Guzmán, José Manuel
Universidad de Alcalá. Departamento de Automática
Ethernet, Routing bridges, Spanning Tree, Load Distribution
RP-Path is a simple, low latency, shortest path bridging protocol for campus, enterprise and data center networks. We recently found that this protocol natively distributes the traffic load in networks having redundant paths of similar characteristics. The reason is that every new path between hosts is selected on-demand in a race among ARP Request packet replicas over all available paths: the first arriving replica gets its path selected on the fly. This means a continuous adaptation of new paths to variations on the load at links and bridges. To show this unique load distribution capability and path diversity property we use a number of simulations for complex scenarios, including two different simulators: one flow- based and one packet-based, and two basic topologies: data center and a regular mesh. We also verify this behavior on real hardware on a network of nine ARP-Path NetFPGA switches. The conclusion is that the ARP-Path protocol efficiently distributes traffic via alternative paths at all load levels, provided that multiple paths of similar propagation delays are available
2013-09-12T12:08:53Z
2013-09-12T12:08:53Z
2013-09-12T12:08:53Z
2013-06-10
info:eu-repo/semantics/conferenceObject
http://hdl.handle.net/10017/18881
10.1109/ICC.2013.6655142
eng
info:eu-repo/grantAgreement/CAM//S2009%2FTIC1468/ES//MEDIANET-CM
info:eu-repo/semantics/openAccess
Communications (ICC), 2013 IEEE International Conference on , vol., no., pp.3769,3774, 9-13 June 2013
doi: 10.1109/ICC.2013.6655142
oai:ebuah.uah.es:10017/221182023-12-14T15:52:07Zcom_10017_149com_10017_17761com_10017_17741com_10017_1216com_10017_18241col_10017_150col_10017_1225
Design and evaluation of a learning environment to effectively provide network security skills
Marsá Maestre, Iván
Hoz de la Hoz, Enrique de la
Giménez Guzmán, José Manuel
López Carmona, Miguel Ángel
Universidad de Alcalá. Departamento de Automática
Architectures for educational technology systems
Distributed learning environments
Interactive learning environments
Simulations
Teaching/learning strategies
Information system security and network security are topics of increasing importance in the information society. They are also topics where the adequate education of professionals requires the use of specific laboratory environments where the practical aspects of the discipline may be addressed. However, most approaches currently used are excessively static and lack the flexibility that the education requirements of security professionals demand. In this paper we present NEMESIS, a scenario generation framework for education on system and network security, which is based on virtualization technologies and has been designed to be open, distributed, modular, scalable and flexible. Finally, an example scenario is described and some results validating the benefits of its use in undergraduate computer security courses are shown.
La seguridad de redes y sistemas de información es un área de importancia creciente en el ámbito de la sociedad de información. Además, constituye un tema en el que la adecuada formación de profesionales exige el uso de entornos de laboratorio específicos en los que abordar los aspectos prácticas de la disciplina. Sin embargo, la mayoría de las aproximación usadas en la actualidad son excesivamente estáticas y carecen de la flexibilidad que las exigencias de la formación de profesionales de seguridad imponente. En este artículo, presentamos NEMESIS, un entorno para la generación de escenarios para la formación en seguridad de redes y sistemas, basado en tecnologías de virtualización que ha sido diseñado para ser abierto, distribuido, modular, escalable y flexible. Finalmente, se describe un escenario de ejemplo y se muestran resultados que validan los beneficios de su uso en cursos de seguridad informática de grado
2015-07-21T09:10:31Z
2015-07-21T09:10:31Z
2015-07-21T09:10:31Z
2013
info:eu-repo/semantics/article
Ivan Marsa-Maestre, Enrique de la Hoz, Jose Manuel Gimenez-Guzman, Miguel A. Lopez-Carmona, Design and evaluation of a learning environment to effectively provide network security skills, Computers & Education, Volume 69, November 2013, Pages 225-236, ISSN 0360-1315, http://dx.doi.org/10.1016/j.compedu.2013.07.022.
(http://www.sciencedirect.com/science/article/pii/S0360131513001899)
Keywords: Architectures for educational technology systems; Distributed learning environments; Interactive learning environments; Simulations; Teaching/learning strategies
0360-1315
http://hdl.handle.net/10017/22118
eng
http://dx.doi.org/10.1016/j.compedu.2013.07.022
info:eu-repo/semantics/openAccess
Copyright © 2015 Elsevier Ltd. All rights reserved
Elsevier
oai:ebuah.uah.es:10017/205302023-12-14T15:52:08Zcom_10017_149com_10017_17761com_10017_17741com_10017_1216com_10017_18241col_10017_150col_10017_1225
Torii: Multipath Distributed Ethernet Fabric Protocol for Data Centers with Zero-Loss Path Repair
Rojas Sánchez, Elisa
Giménez Guzmán, José Manuel
Azcorra, Arturo
Rivera Pinto, Diego
Ibáñez Fernández, Guillermo Agustín
Universidad de Alcalá. Departamento de Automática
Ethernet
Tree-based routing
Routing bridges
Data center
Shortest Path bridges
This paper describes and evaluates Torii, a layer-two data center network fabric protocol. The main features of Torii are being fully distributed, scalable, fault-tolerant and with automatic setup. Torii is based on multiple, tree-based, topological MAC addresses that are used for table-free forwarding over multiple equal-cost paths, and it is capable of rerouting frames around failed links on the fly without needing a central fabric manager for any function. To the best of our knowledge, it is the first protocol that does not require the exchange of periodic messages to work under normal conditions and to recover from link failures, as Torii exchanges messages just once. Moreover, another important characteristic of Torii is that it is compatible with a wide range of data center topologies. Simulation results show an excellent distribution of traffic load and latencies, similar to shortest path protocols.
2014-10-07T09:35:43Z
2014-10-07T09:35:43Z
2014-10-07T09:35:43Z
2014-10-07
info:eu-repo/semantics/article
http://hdl.handle.net/10017/20530
eng
info:eu-repo/grantAgreement/CAM//S2009%2FTIC1468/ES//MEDIANET-CM
info:eu-repo/semantics/openAccess
oai:ebuah.uah.es:10017/211442023-12-20T15:20:10Zcom_10017_149com_10017_17761com_10017_17741com_10017_1216com_10017_18241col_10017_150col_10017_1225
All-Path Bridging: Path Exploration Protocols for Data Center and Campus Networks
Rojas Sánchez, Elisa
Ibáñez Fernández, Guillermo Agustín
Giménez Guzmán, José Manuel
Carral Pelayo, Juan Antonio
García Martínez, Alberto
Martinez Yelmo, Isaias
Arco Rodríguez, José Manuel
Universidad de Alcalá. Departamento de Automática
Path exploration
Path computation
Routing switches
Shortest path bridges
All-Path
Today, link-state routing protocols that compute multiple shortest paths predominate in data center and campus networks, where routing is performed either in layer three or in layer two using link-state routing protocols. But current proposals based on link-state routing do not adapt well to real time traffic variations and become very complex when attempting to balance the traffic load. We propose All-Path bridging, an evolution of the classical transparent bridging that forwards frames over shortest paths using the complete network topology, which overcomes the limitations of the spanning tree protocol. All-Path is a new frame routing paradigm based on the simultaneous exploration of all paths of the real network by a broadcast probe frame, instead of computing routes on the network graph. This paper presents All- Path switches and their differences with standard switches and describes ARP-Path protocol in detail, its path recovery mechanisms and compatibility with IEEE 802.1 standard bridges. ARP-Path is the first protocol variant of the All-Path protocol family. ARP-Path reuses the standard ARP Request and Reply packets to explore reactively the network and find the fastest path between two hosts. We compare its performance in terms of latency and load distribution with link-state shortest-path routing bridges, showing that ARP-Path distributes the load more evenly and provides lower latencies. Implementations on different platforms prove the robustness of the protocol. The conclusion is that All-Path bridging offer a simple, resilient and scalable alternative to path computation protocols.
2015-02-04T09:00:09Z
2015-02-04T09:00:09Z
2015-02-04T09:00:09Z
2014
info:eu-repo/semantics/article
Elisa Rojas, Guillermo Ibañez, Jose Manuel Gimenez-Guzman, Juan A. Carral, Alberto Garcia-Martinez, Isaias Martinez-Yelmo, Jose Manuel Arco, All-Path bridging: Path exploration protocols for data center and campus networks, Computer Networks, Volume 79, 14 March 2015, Pages 120-132, ISSN 1389-1286.
http://hdl.handle.net/10017/21144
10.1016/j.comnet.2015.01.002
eng
info:eu-repo/grantAgreement/CAM//S2013%2FICE-2919/ES/TECNOLOGIAS INTEGRADAS DE GESTION Y OPERACIÓN DE RED 5G/TIGRE5-CM
info:eu-repo/semantics/openAccess
oai:ebuah.uah.es:10017/264432023-12-14T15:52:08Zcom_10017_149com_10017_17761com_10017_17741com_10017_1216com_10017_18241col_10017_150col_10017_1225
Detecting and defeating advanced man-in-the-middle attacks against TLS
Hoz de la Hoz, Enrique de la
Cochrane, Gary
Moreira-Lemus, Jose Manuel
Paez-Reyes, Rafael
Marsá Maestre, Iván
Alarcos Alcázar, Bernardo
Universidad de Alcalá. Departamento de Automática
Certificate-pinning schemes
MITM attacks retaliation
SDN (Software-defined networking)
OpenFlow
TLS es un bloque esencial para la construcción de redes privadas. Un aspecto crítico para la seguridad de TLS es la autenticación y el intercambio de claves, que habitualmente se realiza mediante certificados. Un intercambio inseguro de claves puede conducir a un ataque de hombre en el medio (MITM). La confianza en los certificados se consigue habitualmente gracias a la utilización de una infraestructura de clave pública (PKI), que emplea autoridades de certificación (CA) de confianza para el establecimiento de cadenas de validez de certificados. En los últimos años, han surgido una serie de problemas relacionados con el uso del PKI: lo certificados pueden ser emitidos para cualquier entidad de Internet, con independencia de la posición de la CA en el árbol jerárquico. Esto implica que un ataque exitoso contra una CA tiene el potencial de permitir la generación de certificados válidos que posibilitarán la realización de ataques de hombre en el medio. No podemos descartar la posibilidad de usos malicioso de CA intermedias para llevar a cabo ataques dirigidos mediante la emisión de certificados ad-hoc, que serían extremadamente difíciles de detectar. La infraestructura PKI actual es susceptible a este tipo de ataques, por lo que se hace necesaria la creación de nuevos mecanismos para la detección y neutralización de los mismos. El IETF y otros organismos de estandarización han lanzado distintas iniciativas para posibilitar la detección de certificados falsificados. La mayoría de estas iniciativas intentan solucionar los problemas existentes mantenimiento el modelo PKI y agregando la técnica de 'certificate pinning', que asocia certificados concretos a servidores. Estas técnicas tienen limitaciones significativas, como la necesidad de un proceso de arranque seguro, o el establecimiento de la asociación para cada host de forma individual y uno por uno. Este trabajo proporciona una evolución desde el esquema de 'pinning' realizado en el host a un esquema de 'pinning' en la red, mediante la habilitación de mecanismos para la validación de certificados cuando atraviesan una red determinada. Los certificados se clasificarán como confiables o no como resultado del cruce de información obtenida de distintas fuentes. Esto resultaría en la detección temprana de certificados sospechosos y lanzaría mecanismos para rechazar el ataque, minimizar su impacto y recopilar información sobre los atacantes. Junto con lo anterior, se podría realizar un análisis más detallado y pormenorizado.
TLS is an essential building block for virtual private networks. A critical aspect for the security of TLS dialogs is authentication and key exchange, usually performed by means of certificates. An insecure key exchange can lead to a man-in-the-middle attack (MITM). Trust in certificates is generally achieved using Public Key Infrastructures (PKIs), which employ trusted certificate authorities (CAs) to establish certificate validity chains.
In the last years, a number of security concerns regarding PKI usage have arisen: certificates can be issued for entities in the Internet, regardless of its position in the CA hierarchy tree. This means that successful attacks on CAs have the potential to generate valid certificates enabling man-in-the-middle attacks. The possibility of malicious use of intermediate CAs to perform targeted attacks through ad-hoc certificates cannot be neglected and are extremely difficult to detect. Current PKI infrastructure for TLS is prone to MITM attacks, and new mechanisms for detection and avoidance of those attacks are needed. IETF and other standardization bodies have launched several initiatives to enable the detection of “forged” certificates. Most of these initiatives attempt to solve the existing problems by maintaining the current PKI model and using certificate pinning, which associates certificates and servers on use. These techniques have significant limitations, such as the need of a secure bootstrap procedure, or pinning requiring some host-by-host basis. This study proposes an evolution from pinning-in-the-host to pinning-in-the-net, by enabling mechanisms to validate certificates as they travel through a given network. Certificates would be classified as trusted or not trusted as a result of cross-information obtained from different sources. This would result in early detection of suspicious certificates and would trigger mechanisms to defeat the attack; minimize its impact; and gather information on the attackers. Additionally, a more detailed and thorough analysis could be performed.
2016-10-13T11:38:06Z
2016-10-13T11:38:06Z
2016-10-13T11:38:06Z
2014-10-07
info:eu-repo/semantics/article
E. de la Hoz, G. Cochrane, J. M. Moreira-Lemus, R. Paez-Reyes, I. Marsa-Maestre, and B. Alarcos, “Detecting and defeating
advanced man-in-the-middle attacks against TLS,” in Cyber Conflict (CyCon 2014), 2014 6th International Conference On, 2014,
pp. 209–221.
2325-5366
http://hdl.handle.net/10017/26443
10.1109/CYCON.2014.6916404
eng
http://dx.doi.org/10.1109/CYCON.2014.6916404
info:eu-repo/semantics/openAccess
© NATO CCD COE Publications, Tallinn
NATO CCD COE
oai:ebuah.uah.es:10017/230792023-12-14T15:52:08Zcom_10017_149com_10017_17761com_10017_17741com_10017_1216com_10017_18241col_10017_150col_10017_1225
Automated Negotiation for Resource Assignment in Wireless Surveillance Sensor Networks
Hoz de la Hoz, Enrique de la
Giménez Guzmán, José Manuel
Marsá Maestre, Iván
Orden Martín, David
Universidad de Alcalá. Departamento de Automática
Wireless sensor networks
Surveillance
Resource assignment
Graphs
Automated negotiation
Due to the low cost of CMOS IP-based cameras, wireless surveillance sensor networks have emerged as a new application of sensor networks able to monitor public or private areas or even country borders. Since these networks are bandwidth intensive and the radioelectric spectrum is limited, especially in unlicensed bands, it is mandatory to assign frequency channels in a smart manner. In this work, we propose the application of automated negotiation techniques for frequency assignment. Results show that these techniques are very suitable for the problem, being able to obtain the best solutions among the techniques with which we have compared them.
2015-11-24T13:14:53Z
2015-11-24T13:14:53Z
2015-11-24T13:14:53Z
2015
info:eu-repo/semantics/article
de la Hoz, E.; Gimenez-Guzman, J.M.; Marsa-Maestre, I.; Orden, D. Automated Negotiation for Resource Assignment in Wireless Surveillance Sensor Networks. Sensors 2015, 15, 29547-29568.
1424-8220
http://hdl.handle.net/10017/23079
eng
http://dx.doi.org/10.3390/s151129547
info:eu-repo/grantAgreement/MINECO//TIN 2014-61627-EXP/ES/DIVIDE AND NOT CONQUER-COMPORTAMIENTOS EMERGENTES EN REDES COMPLEJAS EGOISTAS/
info:eu-repo/grantAgreement/CAM//S2013%2FICE-2919/ES/TECNOLOGIAS INTEGRADAS DE GESTION Y OPERACIÓN DE RED 5G/TIGRE5-CM
info:eu-repo/grantAgreement/AEI//MTM2011-22792/ES/COMBINATORIA Y COMPLEJIDAD DE ESTRUCTURAS GEOMETRICAS DISCRETAS/
info:eu-repo/grantAgreement/MINECO//MTM2014-54207-P/ES/COMBINATORIA Y COMPLEJIDAD DE ESTRUCTURAS GEOMETRICAS DISCRETAS/
http://creativecommons.org/licenses/by-nc/3.0/es/
info:eu-repo/semantics/openAccess
Atribución-NoComercial 3.0 España