Luís Henrique Maciel Kosmalski Costa

Routing Metrics and Protocols for Wireless Mesh Networks

WMNs are low-cost access networks built on cooperative routing over a backbone composed of stationary wireless routers. WMNs must deal with the highly unstable wireless medium. Therefore, the design of algorithms that consider link quality to choose the best routes are enabling routing metrics and protocols to evolve. In this work, we analyze the state of the art in WMN metrics and propose a taxonomy for WMN routing protocols. Performance measurements for a WMN, deployed using various routing metrics, are presented and corroborate our analysis.

Hop by hop multicast routing protocol

IP Multicast is facing a slow take-off although it is a hotly debated topic since more than a decade. Many reasons are responsible for this status. Hence, the Internet is likely to be organized with both unicast and multicast enabled networks. Thus, it is of utmost importance to design protocols that allow the progressive deployment of the multicast service by supporting unicast clouds. This paper proposes HBH (Hop-By-Hop multicast routing protocol). HBH adopts the source-specific channel abstraction to simplify address allocation and implements data distribution using recursive unicast trees, which allow the transparent support of unicast-only routers. Additionally, HBH is original because its tree construction algorithm takes into account the unicast routing asymmetries. As most multicast routing protocols rely on the unicast infrastructure, these asymmetries impact the structure of the multicast trees. We show through simulation that HBH outperforms other multicast routing protocols in terms of the delay experienced by the receivers and the bandwidth consumption of the multicast trees.

Virtual networks: isolation, performance, and trends

Currently, there is a strong effort of the research community in rethinking the Internet architecture to cope with its current limitations and support new requirements. Many researchers conclude that there is no one-size-fits-all solution for all of the user and network provider needs and thus advocate for a pluralist network architecture, which allows the coexistence of different protocol stacks running at the same time over the same physical substrate. In this paper, we investigate the advantages and limitations of the virtualization technologies for creating a pluralist environment for the Future Internet. We analyze two types of virtualization techniques, which provide multiple operating systems running on the same hardware, represented by Xen, or multiple network flows on the same switch, represented by OpenFlow. First, we define the functionalities needed by a Future Internet virtual network architecture and how Xen and OpenFlow provide them. We then analyze Xen and OpenFlow in terms of network programmability, processing, forwarding, control, and scalability. Finally, we carry out experiments with Xen and OpenFlow network prototypes, identifying the overhead incurred by each virtualization tool by comparing it with native Linux. Our experiments show that OpenFlow switch forwards packets as well as native Linux, achieving similar high forwarding rates. On the other hand, we observe that the high complexity involving Xen virtual machine packet forwarding limits the achievable packet rates. There is a clear trade-off between flexibility and performance, but we conclude that both Xen and OpenFlow are suitable platforms for network virtualization.

Improving the Data Transmission Throughput over the Home Electrical Wiring

Powerline communications (PLC) are receiving special attention since they use an already available and ubiquitous infrastructure. The main standard for PLC home networks is HomePlug. This work improves the throughput of HomePlug by modifying the medium access control sub-layer. The key idea is to define a fast collision avoidance mechanism where every station that wants to access the medium increments its contention window after sensing another ongoing transmission. The proposal reduces the number of collisions in the network improving the achievable throughput. We compared our mechanism to the original HomePlug standard through simulation and mathematical analysis. We verified that the improvement is independent from the packet size, the transmission rate and the number of nodes when the network is high loaded

Measuring the capacity of in-car to in-car vehicular networks

A particular class of vehicular networks is the one that includes off-the-shelf end-user equipment (e.g., laptops and PDAs) running from the interior of vehicles: in-car nodes. They are subject to limited communication conditions when compared with nodes specifically designed to this context. Existing works either consider antennas installed on top of the vehicle roof or nodes that operate in infrastructure mode. In this article, we investigate through real experiments the characteristics of links formed by in-car nodes running off-the-shelf wireless technologies such as IEEE 802.11(a/g) in ad hoc mode. We surprisingly observe that in-car nodes do show enough performance in terms of network capacity to be used in a number of applications, such as file transfer in peer-to-peer applications. Nonetheless, we identify some key performance issues and devise a number of configuration recommendations and future work directions.

A Survey on Wireless Ad Hoc Networks

A wireless ad hoc network is a collection of wireless nodes that can dynamically self-organize into an arbitrary and temporary topology to form a network without necessarily using any pre-existing infrastructure. These characteristics make ad hoc networks well suited for military activities, emergency operations, and disaster recoveries. Nevertheless, as electronic devices are getting smaller, cheaper, and more powerful, the mobile market is rapidly growing and, as a consequence, the need of seamlessly internetworking people and devices becomes mandatory. New wireless technologies enable easy deployment of commercial applications for ad hoc networks. The design of an ad hoc network has to take into account several interesting and difficult problems due to noisy, limited-range, and insecure wireless transmissions added to mobility and energy constraints. This paper presents an overview of issues related to medium access control (MAC), routing, and transport in wireless ad hoc networks and techniques proposed to improve the performance of protocols. Research activities and problems requiring further work are also presented. Finally, the paper presents a project concerning an ad hoc network to easily deploy Internet services on low-income habitations fostering digital inclusion.

OpenFlow and Xen-Based Virtual Network Migration

Migration is an important feature for network virtualization because it allows the reallocation of virtual resources over the physical resources. In this paper, we investigate the characteristics of different migration models, according to their virtualization platforms. We show the main advantages and limitations of using the migration mechanisms provided by Xen and OpenFlow platforms. We also propose a migration model for Xen, using data and control plane separation, which outperforms the Xen standard migration. We developed two prototypes, using Xen and OpenFlow, and we performed evaluation experiments to measure the impact of the network migration on traffic forwarding.

Implementing the Expected Transmission Time Metric for OLSR Wireless Mesh Networks

This paper presents the design of a plug-in for the optimized link state routing (OLSR) protocol with the expected transmission time (ETT) metric and experiments in an indoor testbed. The ETT metric is implemented as a plug-in, keeping portability and facilitating its deployment on operational networks. Our design identifies important implementation issues. Additionally, we run experiments in an indoor testbed to verify the performance of our ETT plug-in. Our results show that the ETT metric has the lowest packet loss rate and the lowest round trip time among the analyzed metrics, because it reproduces link quality conditions and also takes into account physical transmission rates.

Online traffic-aware virtual machine placement in data center networks

Data centers rely on virtualization to provide different services over a shared infrastructure. The placement of the different services and tasks in the physical machines is crucial for the performance of the whole system. A misplaced service can overload some network links, lead to congestion, or even connection disruptions. On the other hand, virtual machine migration allows reallocating services and changing the traffic matrix, leading to more efficient use of bandwidth. In this paper, we propose a Virtual Machine Placement (VMP) algorithm to (re)allocate virtual machines in the data center servers, based on the current traffic matrix, CPU, and memory usage. Analyzing the formation of community patterns in terms of traffic using graph theory, we are able to find virtual machines that are correlated because they exchange high amount of data. Those virtual machines are aggregated and allocated to servers as close as possible to each other, reducing traffic congestion. Our simulation results show that VMP was able to improve the traffic distribution. In some specific cases we were able to reduce 80% of the core traffic, concentrating it at the edge of the network.

The ad hoc return channel: a low-cost solution for Brazilian interactive digital TV

The upcoming terrestrial digital television technology brings a new class of services to traditional TV sets. A set-top box may, for example, access the Internet and send email. The interactive return channel makes these new services possible. This channel allows TV viewers to interact by sending data back to the TV broadcaster. In this article we analyze the viability of a wireless ad hoc network to implement the return channel. For this purpose, an ad hoc network is a low-cost and flexible solution. We evaluate the performance of an ad hoc return channel using the IEEE 802.11 wireless technology for different Brazilian geographical scenarios. The results show that ad hoc networking is a promising solution for the return channel of Brazilian interactive digital TV