arXiv subjects

Jon Crowcroft

Publications and source records attributed to Jon Crowcroft.

At least 73 records · Page 4Linked to original sources

arXiv2018

On the Impact of Guest Traffic in Open-Access Domestic Broadband Sharing Schemes

Open-access domestic broadband connection sharing constitutes a voluntary practice that is associated with societal, economic and public-safety benefits. Despite this fact, broadband subscribers are usually hesitant to freely share their broadband connection with guests for a multitude of reasons; one of them being sharing their network might hinder their own broadband quality of experience. In this paper, we investigate experimentally the impact of uplink guest traffic on the sharer's broadband quality of experience under both generic and broadband-sharing-specific packet scheduling policies. Both guest-user traffic and access point profiles employed in our study are developed by analyzing real-world traffic traces and measurements, captured from actual broadband sharing networking environments. Our results validate the suitability of hybrid packet scheduling policies for broadband sharing schemes and show that only a few dozen kilobytes per second of uplink guest traffic can be tolerated by sharers without hampering their broadband quality of experience. In this context, we show that the selection of the most appropriate packet scheduling policy for broadband sharing, as well as its respective configuration, depend largely on the capacity of the broadband connection and the policy's packet-dropping behavior on guest traffic.

cs.NI↗

arXiv2018

Bringing Information Centric Networking to Challenged Environments: An overview of the Second Workshop on Future Internet Architecture for Developing Regions

The 2nd workshop on Future Internet Architecture for Developing Regions (FI4D) took place on January 8th, 2017. The workshop was hosted by the 14th Annual IEEE Consumer Communications $\&$ Networking Conference in Las Vegas, USA. This report summarizes the motivation, discussions and perspectives held during the half-day event.

cs.NI↗

arXiv2018

On and Off-Blockchain Enforcement Of Smart Contracts

In this paper we discuss how conventional business contracts can be converted into smart contracts---their electronic equivalents that can be used to systematically monitor and enforce contractual rights, obligations and prohibitions at run time. We explain that emerging blockchain technology is certainly a promising platform for implementing smart contracts but argue that there is a large class of applications, where blockchain is inadequate due to performance, scalability, and consistency requirements, and also due to language expressiveness and cost issues that are hard to solve. We explain that in some situations a centralised approach that does not rely on blockchain is a better alternative due to its simplicity, scalability, and performance. We suggest that in applications where decentralisation and transparency are essential, developers can advantageously combine the two approaches into hybrid solutions where some operations are enforced by enforcers deployed on--blockchains and the rest by enforcers deployed on trusted third parties.

cs.CY↗

arXiv2018

Data Analytics Service Composition and Deployment on Edge Devices

Data analytics on edge devices has gained rapid growth in research, industry, and different aspects of our daily life. This topic still faces many challenges such as limited computation resource on edge devices. In this paper, we further identify two main challenges: the composition and deployment of data analytics services on edge devices. We present the Zoo system to address these two challenge: on one hand, it provides simple and concise domain-specific language to enable easy and and type-safe composition of different data analytics services; on the other, it utilises multiple deployment backends, including Docker container, JavaScript, and MirageOS, to accommodate the heterogeneous edge deployment environment. We show the expressiveness of Zoo with a use case, and thoroughly compare the performance of different deployment backends in evaluation.

cs.SE↗

arXiv2017

User-centric Composable Services: A New Generation of Personal Data Analytics

Machine Learning (ML) techniques, such as Neural Network, are widely used in today's applications. However, there is still a big gap between the current ML systems and users' requirements. ML systems focus on improving the performance of models in training, while individual users cares more about response time and expressiveness of the tool. Many existing research and product begin to move computation towards edge devices. Based on the numerical computing system Owl, we propose to build the Zoo system to support construction, compose, and deployment of ML models on edge and local devices.

cs.LG↗

arXiv2017

My Home is My Post-Office: Evaluation of a decentralized email architecture on Internet-of-Things low-end device

Users predominantly access their email via mobile devices. This presents a two-fold challenge to the email applications. First, email's update from multiple devices has to be eventually reconciled with the server. Prioritization of updates is difficult and maybe undesirable. Solving this problem requires a data store with the complete history of email changes. Second, legacy email protocols don't provide an optimal email synchronization and access in mobile environment. In this paper we are proposing to take advantage of the Internet of Things (IoT) phenomena. In IoT environment a user may have multiple interconnected in-home low-end devices with publicly accessible address. In this architecture we move the email application from the central service into user's in-home and mobile devices, store complete email history on each device, and replace legacy IMAP and SMTP protocols with a synchronization protocol found in Distributed Version Control Systems(DVCS). This addresses the email reconciliation issue, optimizes the bandwidth usage, and intrinsically puts the user in control of her data. We analyze a number of stores and synchronization implementations and compare them with the open source Dovecot email server.

cs.DC↗

arXiv2017

An Email Attachment is Worth a Thousand Words, or Is It?

There is an extensive body of research on Social Network Analysis (SNA) based on the email archive. The network used in the analysis is generally extracted either by capturing the email communication in From, To, Cc and Bcc email header fields or by the entities contained in the email message. In the latter case, the entities could be, for instance, the bag of words, url's, names, phones, etc. It could also include the textual content of attachments, for instance Microsoft Word documents, excel spreadsheets, or Adobe pdfs. The nodes in this network represent users and entities. The edges represent communication between users and relations to the entities. We suggest taking a different approach to the network extraction and use attachments shared between users as the edges. The motivation for this is two-fold. First, attachments represent the "intimacy" manifestation of the relation's strength. Second, the statistical analysis of private email archives that we collected and Enron email corpus shows that the attachments contribute in average around 80-90% to the archive's disk-space usage, which means that most of the data is presently ignored in the SNA of email archives. Consequently, we hypothesize that this approach might provide more insight into the social structure of the email archive. We extract the communication and shared attachments networks from Enron email corpus. We further analyze degree, betweenness, closeness, and eigenvector centrality measures in both networks and review the differences and what can be learned from them. We use nearest neighbor algorithm to generate similarity groups for five Enron employees. The groups are consistent with Enron's organizational chart, which validates our approach.

cs.SI↗

arXiv2017

Extending programs with debug-related features, with application to hardware development

The capacity and programmability of reconfigurable hardware such as FPGAs has improved steadily over the years, but they do not readily provide any mechanisms for monitoring or debugging running programs. Such mechanisms need to be written into the program itself. This is done using ad hoc methods and primitive tools when compared to CPU programming. This complicates the programming and debugging of reconfigurable hardware. We introduce Program-hosted Directability (PhD), the extension of programs to interpret direction commands at runtime to enable debugging, monitoring and profiling. Normally in hardware development such features are fixed at compile time. We present a language of directing commands, specify its semantics in terms of a simple controller that is embedded with programs, and implement a prototype for directing network programs running in hardware. We show that this approach affords significant flexibility with low impact on hardware utilisation and performance.

cs.PL↗

arXiv2017

FairCache: Introducing Fairness to ICN Caching - Technical Report

Information-centric networking extensively uses universal in-network caching. However, developing an efficient and fair collaborative caching algorithm for selfish caches is still an open question. In addition, the communication overhead induced by collaboration is especially poorly understood in a general network setting such as realistic ISP and Autonomous System networks. In this paper, we address these two problems by modeling the in-network caching problem as a Nash bargaining game. We show that the game is a convex optimization problem and further derive the corresponding distributed algorithm. We analytically investigate the collaboration overhead on general graph topologies, and theoretically show that collaboration has to be constrained within a small neighborhood due to its cost growing exponentially. Our proposed algorithm achieves at least 16% performance gain over its competitors on different network topologies in the evaluation, and guarantees provable convergence, Pareto efficiency and proportional fairness.

cs.NI↗

arXiv2017

An in-depth characterisation of Bots and Humans on Twitter

Recent research has shown a substantial active presence of bots in online social networks (OSNs). In this paper we utilise our past work on studying bots (Stweeler) to comparatively analyse the usage and impact of bots and humans on Twitter, one of the largest OSNs in the world. We collect a large-scale Twitter dataset and define various metrics based on tweet metadata. We divide and filter the dataset in four popularity groups in terms of number of followers. Using a human annotation task we assign 'bot' and 'human' ground-truth labels to the dataset, and compare the annotations against an online bot detection tool for evaluation. We then ask a series of questions to discern important behavioural bot and human characteristics using metrics within and among four popularity groups. From the comparative analysis we draw important differences as well as surprising similarities between the two entities, thus paving the way for reliable classification of automated political infiltration, advertisement campaigns, and general bot detection.

cs.SI↗

arXiv2016

Peer provided cell-like networks built out of thin air

The success of Wi-Fi technology as an efficient and low-cost last-mile access solution has enabled massive spontaneous deployments generating storms of beacons all across the globe. Emerging location systems are using these beacons to observe mobility patterns of people through portable or wearable devices and offers promising use-cases that can help to solve critical problems in the developing world. In this paper, we design and develop a novel prototype to organise these spontaneous deployments of Access Points into what we call virtual cells (vcells). We compute virtual cells from a list of Access Points collected from different active scans for a geographical region. We argue that virtual cells can be encoded using Bloom filters to implement the location process. Lastly, we present two illustrative use-cases to showcase the suitability and challenges of the technique.

cs.NI↗

arXiv2016

Valorising the IoT Databox: Creating Value for Everyone

The Internet of Things (IoT) is expected to generate large amounts of heterogeneous data from diverse sources including physical sensors, user devices, and social media platforms. Over the last few years, significant attention has been focused on personal data, particularly data generated by smart wearable and smart home devices. Making personal data available for access and trade is expected to become a part of the data driven digital economy. In this position paper, we review the research challenges in building personal Databoxes that hold personal data and enable data access by other parties, and potentially thus sharing of data with other parties. These Databoxes are expected to become a core part of future data marketplaces.

cs.CY↗

arXiv2016

I(FIB)F: Iterated Bloom Filters for Routing in Named Data Networks

Named Data Networks provide a clean-slate redesign of the Future Internet for efficient content distribution. Because Internet of Things are expected to compose a significant part of Future Internet, most content will be managed by constrained devices. Such devices are often equipped with limited CPU, memory, bandwidth, and energy supply. However, the current Named Data Networks design neglects the specific requirements of Internet of Things scenarios and many data structures need to be further optimised. The purpose of this research is to provide an efficient strategy to route in Named Data Networks by constructing a Forwarding Information Base using Iterated Bloom Filters defined as I(FIB)F. We propose the use of content names based on iterative hashes. This strategy leads to reduce the overhead of packets. Moreover, the memory and the complexity required in the forwarding strategy are lower than in current solutions. We compare our proposal with solutions based on hierarchical names and Standard Bloom Filters. We show how to further optimise I(FIB)F by exploiting the structure information contained in hierarchical content names. Finally, two strategies may be followed to reduce: (i) the overall memory for routing or (ii) the probability of false positives.

cs.NI↗

arXiv2016

You Really Need A Good Ruler to Measure Caching Performance in Information-Centric Networks

Information-centric networks are an interesting new paradigm for distributing content on the Internet. They bring up many research challenges, such as addressing content by name, securing content, and wide-spread caching of content. Caching has caught a lot of attention in the research community, but a lot of the work suffers from a poor understanding of the different metrics with which caching performance can be measured. In this paper we not only present a comprehensive overview of different caching metrics that have been proposed for information-centric networks, but also propose the coupling factor as a new metric to capture the relation- ship between content popularity and network topology. As we show, many commonly used metrics have several failure modes which are largely ignored in literature. We identify these problems and propose remedies and new metrics to address these failures. Our work highlights the fundamental differences between information-centric caches and "traditional" cache networks and we demonstrate the need for a systematic understanding of the metrics for information- centric caching. We also discuss how experimental work should be done when evaluating networks of caches.

cs.NI↗

arXiv2016

Cloudrone: Micro Clouds in the Sky

Recent years have witnessed several initiatives on enabling Internet access to the next three billion people. Access to the Internet necessarily translates to access to its services. This means that the goal of providing Internet access requires ac- cess to its critical service infrastructure, which are currently hosted in the cloud. However, recent works have pointed out that the current cloud centric nature of the Internet is a fundamental barrier for Internet access in rural/remote areas as well as in developing regions. It is important to explore (low cost) solutions such as micro cloud infrastructures that can provide services at the edge of the network (potentially on demand), right near the users. In this paper, we present Cloudrone- a preliminary idea of deploying a lightweight micro cloud infrastructure in the sky using indigenously built low cost drones, single board computers and lightweight Operating System virtualization technologies. Our paper lays out the preliminary ideas on such a system that can be instantaneously deployed on demand. We describe an initial design of the Cloudrone and provide a preliminary evaluation of the proposed system mainly focussed on the scalability issues of supporting multiple services and users.

cs.NI↗

arXiv2016

Taming Limits with Approximate Networking

Internet is the linchpin of modern society, which the various threads of modern life weave around. But being a part of the bigger energy-guzzling industrial economy, it is vulnerable to disruption. It is widely believed that our society is exhausting its vital resources to meet our energy requirements, and the cheap fossil fuel fiesta will soon abate as we cross the tipping point of global oil production. We will then enter the long arc of scarcity, constraints, and limits---a post-peak "long emergency" that may subsist for a long time. To avoid the collapse of the networking ecosystem in this long emergency, it is imperative that we start thinking about how networking should adapt to these adverse "undeveloping" societal conditions. We propose using the idea of "\textit{approximate networking}"---which will provide \textit{good-enough} networking services by employing \textit{contextually-appropriate} tradeoffs---to survive, or even thrive, in the conditions of scarcity and limits.

cs.NI↗

arXiv2016

C3PO: Computation Congestion Control (PrOactive) - an algorithm for dynamic diffusion of ephemeral in-network services

There is an obvious trend that more and more data and computation are migrating into networks nowadays. Combining mature virtualization technologies with service-centric net- working, we are entering into an era where countless services reside in an ISP network to provide low-latency access. Such services are often computation intensive and are dynamically created and destroyed on demands everywhere in the network to perform various tasks. Consequently, these ephemeral in-network services introduce a new type of congestion in the network which we refer to as "computation congestion". The service load need to be effectively distributed on different nodes in order to maintain the funtionality and responsiveness of the network, which calls for a new design rather than reusing the centralised scheduler designed for cloud-based services. In this paper, we study both passive and proactive control strategies, based on the proactive control we further propose a fully distributed solution which is low complexity, adaptive, and responsive to network dynamics.

cs.NI↗

arXiv2016

"Resource Pooling" for Wireless Networks: Solutions for the Developing World

We live in a world in which there is a great disparity between the lives of the rich and the poor. Technology offers great promise in bridging this gap. In particular, wireless technology unfetters developing communities from the constraints of infrastructure providing a great opportunity to leapfrog years of neglect and technological waywardness. In this paper, we highlight the role of resource pooling for wireless networks in the developing world. Resource pooling involves: (i) abstracting a collection of networked resources to behave like a single unified resource pool and (ii) developing mechanisms for shifting load between the various parts of the unified resource pool. The popularity of resource pooling stems from its ability to provide resilience, high utilization, and flexibility at an acceptable cost. We show that "resource pooling", which is very popular in its various manifestations, is the key unifying principle underlying a diverse number of successful wireless technologies (such as white space networking, community networks, etc.). We discuss various applications of resource pooled wireless technologies and provide a discussion on open issues.

cs.NI↗