Event Category: External Presentation (External Speaker)

From Quality of Service to Chaos in wireless networks

With the increasing availability of configurable network equipments, the research has moved from proposals to improve quality of service in the wireless standards, to complete potential chaos when it becomes accessible to every user. In this talk we go through this evolution and discuss its impact on the network and on the user.

Read more arrow_right_alt

Network Virtualization: Vision, Algorithms, Prototype

Virtualization is a powerful paradigm in computer science, as it allows to decouple software and services from the constraints of the underlying physical infrastructure. Virtualization is also one of the main innovation motors in today's Internet

Read more arrow_right_alt

Harnessing Visible Light for Time Synchronization and Mobile Context Recognition

Visible light is ubiquitous in the cyber-space nowadays. In this talk, I will introduce our recent work about how to harness visible light for mobile computing applications in both temporal and spatial design domains. Our work leverages the fact that the fluorescent light intensity changes with a stable period, which can serve as both a global time reference and an indoor environment indicator.

Read more arrow_right_alt

Publish/Subscribe for Large-Scale Social Interaction: Design, Analysis and Resource Provisioning

Publish/subscribe (pub/sub) is a popular communication paradigm in the design of large-scale distributed systems. We are witnessing an increasingly widespread use of the pub/sub for wide array of applications both in industry and academia and yet there is a lack of detailed study of a large-scale real-world pub/sub system.

Read more arrow_right_alt

Utility Optimization for Multi-Transmitter Wireless Data Systems

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.

Read more arrow_right_alt

Bitcoin. The TCP/IP of finances?

Bitcoin is a decentralized peer-to-peer payments network. It is the first and most widely used example of a new kind of money known as cryptocurrency. Transactions are fast, non-repudiable and almost anonymous. Fees are extremely cheap and every single transaction is stored in a ledger called the block chain.

Read more arrow_right_alt

In3 conference: the first international conference on Internet Science

This unique conference will be the venue fostering dialogue among scholars and practitioners belonging to these disciplines.

Event website: http://www.internet-science.eu/1st-internet-science-conference

Read more arrow_right_alt

Measuring Large-Scale Distributed Systems: Case of BitTorrent Mainline DHT

Peer-to-peer networks have been quite thoroughly measured over the past years; however it is interesting to note that the BitTorrent Mainline DHT has received very little attention even though it is by far the largest of currently active overlay systems, as our results show. As Mainline DHT differs from other systems, existing measurement methodologies are not appropriate for studying it. In this talk we present an efficient methodology for estimating the number of active users in the network. We have identified an omission in previous methodologies used to measure the size of the network and our methodology corrects this. This omission may lead to inaccuracies of up to 40% in the number of active users. Our method is based on modeling crawling inaccuracies as a Bernoulli process. It guarantees a very accurate estimation and is able to provide the estimate in about 5 seconds. Through experiments in controlled situations, we demonstrate the accuracy of our method and show the causes of the inaccuracies in previous work, by reproducing the incorrect results. Besides accurate network size estimates, our methodology can be used to detect network anomalies, in particular Sybil attacks in the network. We also report on the results from our measurements which have been going on for almost 2.5 years and are the first long-term study of Mainline DHT.

Read more arrow_right_alt

Adaptable Human-Centric Mobile and Wireless Systems

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.

Read more arrow_right_alt

Stateless DNS for Efficient Private Service Discovery

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.

Read more arrow_right_alt

Archives

Categories