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
The changes in the communication paradigm envisioned for future networks, with peer-to-peer/symmetric attachments gaining momentum and two IP (Internet Protocol) versions coexisting, will pose new challenges to mobile communication networks. Traditional IP auto-configuration mechanisms will not work properly, since they were designed mostly having in mind a client-server/asymmetric attachment model, they assume a single IP version paradigm, and they target the auto-configuration of devices only. The IST Ambient Networks project has introduced a new concept - the Ambient Network - that enables handling every communication entity, either a single device or an entire network, as an Ambient Network (AN). This paper describes a new efficient mechanism, named Basic Connectivity (BC) mechanism, for auto-configuring IP connectivity between attaching ANs. A proof-of-concept prototype, experimental results, and theoretical analysis show that BC suites the future networking paradigm and represents a solution more efficient than the current trial-and-error mechanism for auto-configuring IP connectivity.

Abstract
In beyond 3G networks the user will not be aware of the access network technology used to provide a telecommunications service. Heterogeneous network technologies will be seamlessly integrated in one "common" access network, enabling users to move around and continuously receive their subscribed services. In a commercial environment, this network evolution requires that a telecommunications operator jointly manages its networks resources to improve the service offered to the users and, at the same time, to increase its revenue. Starting from the UMTS and WLAN interconnection architecture defined by 3GPP, this paper analyzes the performance of a new joint radio resource management strategy, comparing it with two well-known strategies used in scenarios where both networks, the UMTS and the WLAN, are interconnected. The new strategy presented in the paper bases its decisions on criteria related to user mobility characteristics and the application characteristics. The strategy also introduces the possibility of renegotiating new calls and reallocating running calls from one access network to another. The performance analysis considers two traffic scenarios. One where only real-time applications are running and other which also introduces TCP applications. The comparison studies show the proposed strategy outperforms the other strategies in what concerns call blocking probability and applications QoS support. Besides, the proposed strategy tends to reduce the handoffs between networks.

Abstract
Header compression techniques such as robust header compression can be used to reduce the overhead of IP-based traffic. Voice over IP may replace voice circuits in the next generations of wireless networks, and it is the type of traffic that benefits most from header compression because its packets have small pay-loads, IEEE 802.11 is a technology that will play an important role in the next generations of wireless networks. The study reported in this article shows that the maximum gain of the RoHC's U-mode when applied to VoIP over IEEE 802.11. is about 23 percent for medium or better voice quality. Values for the RoHC U-mode parameters over IEEE 802.11 are also suggested.

Abstract
The changes in the communication paradigm envisioned for next-generation networks (NGNs), with peer-to-peer/symmetric attachments gaining momentum and two Internet Protocol (IP) versions coexisting, will pose new challenges to mobile communication networks. Traditional IP auto-configuration mechanisms will not work properly, since they were designed mostly having in mind a client-server/asymmetric attachment model, they assume a single IP version paradigm, and they target the auto-configuration of devices only. The IST Ambient Networks (ANs) project has introduced a new concept the AN that enables handling every communication entity, either a single device or an entire network, as an AN. This paper describes a new efficient mechanism, named Basic Connectivity (BC) mechanism, for auto-configuring IP connectivity between attaching ANs. A proof-of-concept prototype, experimental results, and theoretical analysis show that BC suites the future networking paradigm and represents a solution more efficient than the current trial-and-error mechanism for auto-configuring IP connectivity. Copyright (C) 2009 John Wiley & Sons, Ltd.

Abstract
Explicit congestion control (XCC) is emerging as one potential solution for overcoming limitations inherent to the current TCP algorithm, characterized by unstable throughput, high queuing delay, RTT-limited fairness, and a static dynamic range that does not scale well to high bandwidth delay product networks. In XCC, routers provide multibit feedback to sources, which, in turn, adapt throughput more accurately to the path bandwidth with potentially faster convergence times. Such systems, however, require precise knowledge of link capacity for efficient operation. In the presence of variable-capacity media, e.g., 802.11, such information is not entirely obvious or may be difficult to extract. We explore three possible algorithms for XCC which retain efficiency under such conditions by inferring available bandwidth from queue dynamics and test them through simulations with two relevant XCC protocols: XCP and RCP. Additionally, preliminary results from an experimental implementation based on XCP are presented. Finally, we compare our proposals with TCP and show how such algorithms outperform it in terms of efficiency, stability, queuing delay, and flow-rate fairness.