Raul Landa | University College London (original) (raw)

Papers by Raul Landa

Research paper thumbnail of Towards informative statistical flow inversion

Abstract: A problem which has recently attracted research attention is that of estimating the dis... more Abstract: A problem which has recently attracted research attention is that of estimating the distribution of flow sizes in internet traffic. On high traffic links it is sometimes impossible to record every packet. Researchers have approached the problem of estimating flow lengths from sampled packet data in two separate ways. Firstly, different sampling methodologies can be tried to more accurately measure the desired system parameters.

Research paper thumbnail of Challenges in the capture and dissemination of measurements from high-speed networks

Abstract The production of a large-scale monitoring system for a high-speed network leads to a nu... more Abstract The production of a large-scale monitoring system for a high-speed network leads to a number of challenges. These challenges are not purely technical but also socio-political and legal. The number of stakeholders in such monitoring activity is large including the network operators, the users, the equipment manufacturers and, of course, the monitoring researchers.

Research paper thumbnail of Performance of locality-aware topologies for peer-to-peer live streaming

Abstract This study is concerned with the effect of overlay network topology on the performance o... more Abstract This study is concerned with the effect of overlay network topology on the performance of live streaming peer-to-peer systems. The study focuses on the evaluation of topologies which are aware of the delays experienced between different peers on the network. Metrics are defined which assess the topologies in terms of delay, bandwidth usage and resilience to peer drop-out. Several topology creation algorithms are tested and the metrics are measured in a simple simulation testbed.

Research paper thumbnail of Overlay Consolidation of ISP-Provided Preferences

Abstract There is growing evidence that mutually beneficial outcomes can be achieved when content... more Abstract There is growing evidence that mutually beneficial outcomes can be achieved when content distribution overlays and their underlying ISPs collaborate through open interfaces. We further contribute to this body of work by considering consolidated topology construction strategies that integrate the information provided by multiple ISPs.

Research paper thumbnail of An efficient playout smoothing mechanism for layered streaming in P2P networks

Abstract Layered video streaming in peer-to-peer (P2P) networks has drawn great interest, since i... more Abstract Layered video streaming in peer-to-peer (P2P) networks has drawn great interest, since it can not only accommodate large numbers of users, but also handle peer heterogeneity. However, there's still a lack of comprehensive studies on chunk scheduling for the smooth playout of layered streams in P2P networks. In these situations, a playout smoothing mechanism can be used to ensure the uniform delivery of the layered stream.

Research paper thumbnail of A Framework for Evolving Topology Analysis

Abstract—This paper addresses the problem of creating models to generate network topologies which... more Abstract—This paper addresses the problem of creating models to generate network topologies which match the statistical properties of real, evolving networks such as the Internet. A statistical framework known as FETA (Framework for Evolving Topology Analysis) is described. If information about the evolution of a network is available then this framework allows the statistical evaluation of candidate probabilistic algorithms to construct network topologies.

Research paper thumbnail of Multi recipient anycast routing

Abstract: This paper describes the design of the necessary mechanisms of a new network primitive:... more Abstract: This paper describes the design of the necessary mechanisms of a new network primitive: n-casting, the transmission of a message to the closest n members of a given group. This primitive can be use for anycasting (n= 1), p2p swarming, replicated databases querying and multicast among other applications.

Research paper thumbnail of A New Technique for Full Fast Recovery in Hop-by-Hop Routing

Abstract: This paper proposes a novel technique for fast re-route in hop-by-hop routing in case o... more Abstract: This paper proposes a novel technique for fast re-route in hop-by-hop routing in case of single link failures. It offers full repair coverage without requiring additional mechanisms such as tunnelling or interface-specific operations. The technique handles the failures without jeopardising the operable parts of a network. That is, the impact on network traffic is kept to minimum.

Research paper thumbnail of RiskTorrent: Using Portfolio Optimisation for Media Streaming

Page 1. RiskTorrent: Using Portfolio Optimisation for Media Streaming Raul Landa, Miguel Rio Comm... more Page 1. RiskTorrent: Using Portfolio Optimisation for Media Streaming Raul Landa, Miguel Rio Communications and Information Systems Research Group Department of Electronic and Electrical Engineering University College London Page 2. Definitions • Reciprocity: Peers need to upload in order to obtain download capacity • Let's call the throughput that peer uploads to peer • The throughput that obtains from as a result is defined as i j Page 3.

Research paper thumbnail of Packet Re-cycling: Eliminating Packet Losses due to Network Failures (Extended Version)

Research paper thumbnail of Recursive Loop-Free Alternates for full protection against transient link failures

… and Communications (ISCC), …, Jan 1, 2010

Research paper thumbnail of Modelling the Tradeoffs in Overlay-ISP Cooperation

NETWORKING 2012, Jan 1, 2012

Research paper thumbnail of Incentives Against Hidden Action in QoS Overlays

Peer-to-Peer …, Jan 1, 2008

Research paper thumbnail of Revisiting the issues on NetFlow sample and export performance

… and Networking in …, Jan 1, 2008

Research paper thumbnail of Criticisms of modelling packet traffic using long-range dependence (extended version)

Journal of Computer and System Sciences, Jan 1, 2011

Research paper thumbnail of Criticisms of modelling packet traffic using long-range dependence

Computer Communications and …, Jan 1, 2009

Research paper thumbnail of Measuring the likelihood of models for network evolution

… Workshops 2009, IEEE, Jan 1, 2009

Research paper thumbnail of A likelihood based framework for assessing network evolution models tested on real network data

… of the 1st Annual Workshop on …, Jan 1, 2009

Research paper thumbnail of Evaluating and optimising models of network growth

arXiv preprint arXiv:0904.0785, Jan 1, 2009

Research paper thumbnail of Distributed overlay anycast tables using space filling curves

Research paper thumbnail of Towards informative statistical flow inversion

Abstract: A problem which has recently attracted research attention is that of estimating the dis... more Abstract: A problem which has recently attracted research attention is that of estimating the distribution of flow sizes in internet traffic. On high traffic links it is sometimes impossible to record every packet. Researchers have approached the problem of estimating flow lengths from sampled packet data in two separate ways. Firstly, different sampling methodologies can be tried to more accurately measure the desired system parameters.

Research paper thumbnail of Challenges in the capture and dissemination of measurements from high-speed networks

Abstract The production of a large-scale monitoring system for a high-speed network leads to a nu... more Abstract The production of a large-scale monitoring system for a high-speed network leads to a number of challenges. These challenges are not purely technical but also socio-political and legal. The number of stakeholders in such monitoring activity is large including the network operators, the users, the equipment manufacturers and, of course, the monitoring researchers.

Research paper thumbnail of Performance of locality-aware topologies for peer-to-peer live streaming

Abstract This study is concerned with the effect of overlay network topology on the performance o... more Abstract This study is concerned with the effect of overlay network topology on the performance of live streaming peer-to-peer systems. The study focuses on the evaluation of topologies which are aware of the delays experienced between different peers on the network. Metrics are defined which assess the topologies in terms of delay, bandwidth usage and resilience to peer drop-out. Several topology creation algorithms are tested and the metrics are measured in a simple simulation testbed.

Research paper thumbnail of Overlay Consolidation of ISP-Provided Preferences

Abstract There is growing evidence that mutually beneficial outcomes can be achieved when content... more Abstract There is growing evidence that mutually beneficial outcomes can be achieved when content distribution overlays and their underlying ISPs collaborate through open interfaces. We further contribute to this body of work by considering consolidated topology construction strategies that integrate the information provided by multiple ISPs.

Research paper thumbnail of An efficient playout smoothing mechanism for layered streaming in P2P networks

Abstract Layered video streaming in peer-to-peer (P2P) networks has drawn great interest, since i... more Abstract Layered video streaming in peer-to-peer (P2P) networks has drawn great interest, since it can not only accommodate large numbers of users, but also handle peer heterogeneity. However, there's still a lack of comprehensive studies on chunk scheduling for the smooth playout of layered streams in P2P networks. In these situations, a playout smoothing mechanism can be used to ensure the uniform delivery of the layered stream.

Research paper thumbnail of A Framework for Evolving Topology Analysis

Abstract—This paper addresses the problem of creating models to generate network topologies which... more Abstract—This paper addresses the problem of creating models to generate network topologies which match the statistical properties of real, evolving networks such as the Internet. A statistical framework known as FETA (Framework for Evolving Topology Analysis) is described. If information about the evolution of a network is available then this framework allows the statistical evaluation of candidate probabilistic algorithms to construct network topologies.

Research paper thumbnail of Multi recipient anycast routing

Abstract: This paper describes the design of the necessary mechanisms of a new network primitive:... more Abstract: This paper describes the design of the necessary mechanisms of a new network primitive: n-casting, the transmission of a message to the closest n members of a given group. This primitive can be use for anycasting (n= 1), p2p swarming, replicated databases querying and multicast among other applications.

Research paper thumbnail of A New Technique for Full Fast Recovery in Hop-by-Hop Routing

Abstract: This paper proposes a novel technique for fast re-route in hop-by-hop routing in case o... more Abstract: This paper proposes a novel technique for fast re-route in hop-by-hop routing in case of single link failures. It offers full repair coverage without requiring additional mechanisms such as tunnelling or interface-specific operations. The technique handles the failures without jeopardising the operable parts of a network. That is, the impact on network traffic is kept to minimum.

Research paper thumbnail of RiskTorrent: Using Portfolio Optimisation for Media Streaming

Page 1. RiskTorrent: Using Portfolio Optimisation for Media Streaming Raul Landa, Miguel Rio Comm... more Page 1. RiskTorrent: Using Portfolio Optimisation for Media Streaming Raul Landa, Miguel Rio Communications and Information Systems Research Group Department of Electronic and Electrical Engineering University College London Page 2. Definitions • Reciprocity: Peers need to upload in order to obtain download capacity • Let's call the throughput that peer uploads to peer • The throughput that obtains from as a result is defined as i j Page 3.

Research paper thumbnail of Packet Re-cycling: Eliminating Packet Losses due to Network Failures (Extended Version)

Research paper thumbnail of Recursive Loop-Free Alternates for full protection against transient link failures

… and Communications (ISCC), …, Jan 1, 2010

Research paper thumbnail of Modelling the Tradeoffs in Overlay-ISP Cooperation

NETWORKING 2012, Jan 1, 2012

Research paper thumbnail of Incentives Against Hidden Action in QoS Overlays

Peer-to-Peer …, Jan 1, 2008

Research paper thumbnail of Revisiting the issues on NetFlow sample and export performance

… and Networking in …, Jan 1, 2008

Research paper thumbnail of Criticisms of modelling packet traffic using long-range dependence (extended version)

Journal of Computer and System Sciences, Jan 1, 2011

Research paper thumbnail of Criticisms of modelling packet traffic using long-range dependence

Computer Communications and …, Jan 1, 2009

Research paper thumbnail of Measuring the likelihood of models for network evolution

… Workshops 2009, IEEE, Jan 1, 2009

Research paper thumbnail of A likelihood based framework for assessing network evolution models tested on real network data

… of the 1st Annual Workshop on …, Jan 1, 2009

Research paper thumbnail of Evaluating and optimising models of network growth

arXiv preprint arXiv:0904.0785, Jan 1, 2009

Research paper thumbnail of Distributed overlay anycast tables using space filling curves