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.

Suppose that we have a network of n processors where each processor knows its own ID and the IDs of its neighbors. Processors communicate in synchronous rounds by writing messages on a whiteboard, which is visible to all of them. The goal is to design a protocol at the end of which every processor knows the topology of the network.

Airbnb.com is an online community marketplace that facilitates short-term rentals of "unique spaces" around the world. Since its launch, Airbnb has grown from a few hundred bookings in 2008 to over ten million nights of cumulative bookings worldwide by the end of 2012, spanning more than 300,000 properties in 192 countries. Our work investigates the consequences of the rise of Airbnb as seen by the local economy, focusing on quantifying the impact of Airbnb's growth on the local hotel industry. To explore this question, we consider the state of Texas, where Airbnb adoption exhibits significant spatio-temporal variation across a large number of city-level markets. We leverage a dataset we collected from Airbnb.com,  comprehensively spanning the thousands of Texas properties listed on Airbnb from 2008 to 2013, which we combine with a panel of quarterly tax revenue data for all hotels in the state of Texas from 2001 to 2013. Our analysis provides evidence that the hotel industry has experienced a decrease in revenue due to the entry of Airbnb in the market. Specifically, we find that a 1% increase in the size of the Airbnb market results in a 0.05% decrease in hotel revenue. Furthermore, our results indicate that losses are unevenly distributed among hotels in different price segments, with lower-priced hotels experiencing the largest impact. 

We consider Internet-based Master-Worker task computing systems, such as SETI@home, where a master sends tasks to potentially unreliable workers, and the workers execute and report back the result.

The concept of Content Networks (CN) has extended Content Distribution Network (CDN) research in order to also comprise other aspects beyond delivery optimization. One central element of this research is the recognition that users are ultimately interested in the content (or a piece of information) and not any specific copy. This resulted in research on content addressing that allows general content access, i.e., the goal is retrieving content (or information) rather than routing of packets between end hosts. This is called Content-Centric respectively Information-Centric Networking (CCN/ICN). For some time these concepts have been explored for the better provision of and access to content services.