Information and communication technologies (ICTs) often fail to perform well in environments and scenarios that were not envisioned at the time of the ICTs creation. Examples of such failures include poor usability of traditional WiFi networks in resource-constrained rural areas, geographically-dependent performance of centralised networked systems, and context-insensitive behaviour of ubiquitous computing devices.

In this talk, we discuss a theoretical framework to evaluate the throughput of underwater networks over an ensemble of node topologies and propagation environments. We start with a review of the properties of underwater acoustic communications.

One of the most important achievements of Software-Defined Networking is a possibility to redefine existing invariants in network management, This talk covers three important aspects of data path provision: (1) what should be flexible at the network element level to express various economic models and how different characteristics impact desired objective functions?; (2) how to represent this expressiveness efficiently on data plane; and 3) new abstractions that allow to integrate services from heterogeneous controllers without standardization of Northbound API.

In this paper, we propose the use of prefix visibility at the interdomain level as an early symptom of anomalous events in the Internet. We focus on detecting anomalies which, despite their significant impact on the routing system, remain concealed from state of the art tools. We design a machine learning system to winnow the prefixes with unintended limited visibility – symptomatic of anomalous events – from the prefixes with intended limited visibility – resulting from legitimate routing operations.

Providing secure, reliable, and dependable wireless services is the primary objective of modern data networks. While enabling technology for “on-demand” services through any of the common wireless architectures, such as WiMax, WiFi, ad hoc networks, sensor networks, and vehicular networks, has made large strides, many formidable challenges remain to be overcome, such as the integration of infrastructure-based and ad hoc networks, robust algorithms for self-organizing, reconfigurable wireless networks, on-demand service models and their performance in highly-volatile interconnect topologies as well as interoperability of different architectures.

Motivated by limitations in today's host-centric IP network, several recent "clean-slate" network architectures have proposed alternate first-class principals, such as content, services, or users.

The main functionality of the Internet is to provide global connectivity for every node attached to it. In light of the IPv4 address space depletion, large networks are in the process of deploying IPv6. In this paper we perform an extensive analysis of how BGP route propagation affects global reachability of the active IPv6 address space in the context of this unique transition of the Internet infrastructure. We propose and validate a methodology for testing the reachability of an IPv6 address block active in the routing system. Leveraging the global visibility status of the IPv6 prefixes evaluated with the BGP Visibility Scanner, we then use this methodology to verify if the visibility status of the prefix impacts its reachability at the interdomain level. We perform active measurements using the RIPE Atlas platform. We test destinations with different BGP visibility degrees (i.e., limited visibility – LV, high visibility – HV and dark prefixes). We show that the IPv6 LV prefixes (v6LVPs) are generally reachable, mostly due to a less-specific HV covering prefix (v6HVP). However, this is not the case of the dark address space, which, by not having a covering v6HVP is largely unreachable. When talking about the results we present in this paper a better explanation of trace route and some basic concepts of BGP will be provided.

We study algorithms for carrier and rate allocation in cellular systems with distributed components such as a heterogeneous LTE system with macrocells and femtocells.  Existing work on LTE systems often involves centralized techniques or requires significant signaling, and is therefore not always applicable in the presence of femtocells. More distributed CSMA-based algorithms (carrier-sense multiple access) were developed in the context of 802.11 systems and have been proven to be utility optimal. However, the proof typically assumes a single transmission rate on each carrier. Further, it relies on the CSMA collision detection mechanisms to know whether a transmission is feasible. In this talk we present a framework for LTE scheduling that is based on CSMA techniques. In particular we first prove that CSMA-based algorithms can be generalized to handle multiple transmission rates in a multi-carrier setting while maintaining utility optimality.  We then show how such an algorithm can be implemented in a heterogeneous LTE system where the existing Channel Quality Indication (CQI) mechanism is used to decide transmission feasibility.

Discovering services in the local broadcast domain is easy from the application point of view. However, from the network point of view, especially when wireless networks are also involved, it is wasteful, as query and response are broadcast on all access points at the lowest data rate, ignoring efficient transmission modes. It also does not scale beyond the single broadcast domain, as this would require deployment of IP multicast, which has yet to happen despite decades of trying. We introduce Stateless DNS as an efficient and broader range alternative. Stateless DNS requires no action from the network service provider, improves upon privacy and comes with incremental deployment options. While providing a well-known DNS interface to the applications, it can identify organizational boundaries and uses existing DNS caches for performance.

The main functionality of the Internet is to provide global connectivity for every node attached to it. In light of the IPv4 address space depletion, large networks are in the process of deploying IPv6.