Abstract
Network operators have been reluctant to deploy IP multicast services mainly due to the lack of native control rover multicast groups. This lack of control does not only prevent operators from generating revenue from multicast-based services but also hinders regular network management. In this work we identified the network elements where admission control should be enforced for multicast session spawning over heterogeneous access networks. The architecture proposed uses existing AAA functionality to perform user identification and multicast session admission control. This control is made at the network layer with no protocol modifications. Three access networks were considered: xDSL, WiMAX and UMTS.

Abstract
Technological evolution is leading telecommunications toward all-IP scenarios, where multiple services are transported as IP packets. Among these services is the broadcast of video. A possible mechanism for broadcasting multiple video channels over IP is to use IP multicast, and let each client decide about the reception of a channel. The secure IP multicast specified by the IETF MSEC working group is a candidate solution for securing these broadcast services. In this paper we propose a new solution for supporting the broadcast of multiple video channels which can be accessed only by authorized users; besides, when a video channel is not visualized in the last mile its transmission is temporarily suspended, so that the cable can be used for other services such as standard Internet access.

Abstract
Communication networks have been developed based on two networking approaches: bridging and routing. The convergence to an all-Ethernet paradigm in Personal and Local Area Networks and the increasing heterogeneity found in these networks emphasizes the current and future applicability of bridging. When bridging is used, a single active spanning tree needs to be defined. A Minimum Routing Cost Tree is known to be the optimal spanning tree if the probability of communication between any pair of network nodes is the same. Given that its computation is a NP-hard problem, approximation algorithms have been proposed. We propose a new approximation Minimum Routing Cost Tree algorithm. Our algorithm has time complexity lower than the fastest known approximation algorithm and provides a spanning tree with the same routing cost in practice. In addition, it represents a better solution than the current spanning tree algorithm used in bridged networks.

Abstract

Abstract

Abstract
This paper presents a project based teaching experience in an advanced digital systems design course with emphasis on design methodologies and laboratory assignments. Projects are the core of the practised teaching methodology and are structured in a pedagogical format according to the course programme. The use of the FPGA technology as the most suitable implementation technology for digital design teaching purposes is discussed. The course structure, oriented to the development of real working digital systems, challenges the students and increases their motivation. This way, the learning process is improved and the classes are more productive. A laboratory development infrastructure based on a FPGA device, used to implement a real-time video processing system, is presented. Examples of laboratory projects implemented with this infrastructure in a recent course edition are also presented. © 2008 IEEE.