Network


Latest external collaboration on country level. Dive into details by clicking on the dots.

Hotspot


Dive into the research topics where Geoffrey Lefebvre is active.

Publication


Featured researches published by Geoffrey Lefebvre.


international conference on network protocols | 2013

StEERING: A software-defined networking for inline service chaining

Ying Zhang; Neda Beheshti; Ludovic Beliveau; Geoffrey Lefebvre; Ravi Manghirmalani; Ramesh Mishra; Ritun Patneyt; Meral Shirazipour; Ramesh Subrahmaniam; Catherine Truchan; Mallik Tatipamula

Network operators are faced with the challenge of deploying and managing middleboxes (also called inline services) such as firewalls within their broadband access, datacenter or enterprise networks. Due to the lack of available protocols to route traffic through middleboxes, operators still rely on error-prone and complex low-level configurations to coerce traffic through the desired set of middleboxes. Built upon the recent software-defined networking (SDN) architecture and OpenFlow protocol, this paper proposes StEERING, short for SDN inlinE sERvices and forwardlNG. It is a scalable framework for dynamically routing traffic through any sequence of middleboxes. With simple centralized configuration, StEERING can explicitly steer different types of flows through the desired set of middleboxes, scaling at the level of per-subscriber and per-application policies. With its capability to support flexible routing, we further propose an algorithm to select the best locations for placing services, such that the performance is optimized. Overall, StEERING allows network operators to monetize their middlebox deployment in new ways by allowing subscribers flexibly to select available network services.


virtual execution environments | 2012

Execution mining

Geoffrey Lefebvre; Brendan Cully; Christopher Head; Mark Spear; Norm Hutchinson; Mike Feeley; Andrew Warfield

Operating systems represent large pieces of complex software that are carefully tested and broadly deployed. Despite this, developers frequently have little more than their source code to understand how they behave. This static representation of a system results in limited insight into execution dynamics, such as what code is important, how data flows through a system, or how threads interact with one another. We describe Tralfamadore, a system that preserves complete traces of machine execution as an artifact that can be queried and analyzed with a library of simple, reusable operators, making it easy to develop and run new dynamic analyses. We demonstrate the benefits of this approach with several example applications, including a novel unified source and execution browser.


international workshop on dynamic analysis | 2011

Retroactive aspects: programming in the past

Robin Salkeld; Wenhao Xu; Brendan Cully; Geoffrey Lefebvre; Andrew Warfield; Gregor Kiczales

We present a novel approach to the problem of dynamic program analysis: writing analysis code directly into the program source, but evaluating it against a recording of the original programs execution. This approach allows developers to reason about their program in the familiar context of its actual source, and take full advantage of program semantics, data structures, and library functionality for understanding execution. It also gives them the advantage of hindsight, letting them easily analyze unexpected behavior after it has occurred. Our position is that writing offline analysis as retroactive aspects provides a unifying approach that developers will find natural and powerful.


acm sigops european workshop | 2004

Separating durability and availability in self-managed storage

Geoffrey Lefebvre; Michael J. Feeley

Building reliable data storage from unreliable components presents many challenges and is of particular interest for peer-to-peer storage systems. Recent work has examined the trade-offs associated with ensuring data availability in such systems. Reliability, however, is more than just availability. In fact, the durability of data is typically of more paramount concern. While users are likely to tolerate occasional disconnection from their data (they will likely have no choice in the matter), they demand a much stronger guarantee that their data is never permanently lost due to failure. To deliver strong durability guarantees efficiently, however, requires decoupling durability from availability. This paper describes the design of a data redundancy scheme that guarantees durability independently from availability. We provide a formula for determining the rate of redundancy repair when durability is the only concern and show that availability requires much more frequent repair. We simulate modified versions of the Total Recall block store that incorporate our design. Our results show that we can deliver durability more cheaply than availability, reducing network overhead by between 50% and 97%.


networked systems design and implementation | 2008

Remus: high availability via asynchronous virtual machine replication

Brendan Cully; Geoffrey Lefebvre; Dutch T. Meyer; Mike Feeley; Norm Hutchinson; Andrew Warfield


european conference on computer systems | 2008

Parallax: virtual disks for virtual machines

Dutch T. Meyer; Gitika Aggarwal; Brendan Cully; Geoffrey Lefebvre; Michael J. Feeley; Norman C. Hutchinson; Andrew Warfield


Archive | 2013

Systems, methods and devices for integrating end-host and network resources in distributed memory

Andrew Warfield; Jacob Taylor Wires; Daniel Stodden; Dutch T. Meyer; Jean Maurice Guy Guyader; Keir Fraser; Timothy John Deegan; Brendan Cully; Christopher Clark; Kevin Jamieson; Geoffrey Lefebvre


virtual execution environments | 2010

Multi-stage replay with crosscut

Jim Chow; Dominic Lucchetti; Tal Garfinkel; Geoffrey Lefebvre; Ryan Gardner; Joshua Mason; Sam Small; Peter M. Chen


file and storage technologies | 2014

Strata: scalable high-performance storage on virtualized non-volatile memory

Brendan Cully; Jake Wires; Dutch T. Meyer; Kevin Jamieson; Keir Fraser; Tim Deegan; Daniel Stodden; Geoffrey Lefebvre; Andrew Warfield


european conference on computer systems | 2009

Tralfamadore: unifying source code and execution experience

Geoffrey Lefebvre; Brendan Cully; Michael J. Feeley; Norman C. Hutchinson; Andrew Warfield

Collaboration


Dive into the Geoffrey Lefebvre's collaboration.

Top Co-Authors

Avatar

Brendan Cully

University of British Columbia

View shared research outputs
Top Co-Authors

Avatar

Andrew Warfield

University of British Columbia

View shared research outputs
Top Co-Authors

Avatar

Dutch T. Meyer

University of British Columbia

View shared research outputs
Top Co-Authors

Avatar

Michael J. Feeley

University of British Columbia

View shared research outputs
Top Co-Authors

Avatar

Norman C. Hutchinson

University of British Columbia

View shared research outputs
Top Co-Authors

Avatar

Mike Feeley

University of British Columbia

View shared research outputs
Top Co-Authors

Avatar

Norm Hutchinson

University of British Columbia

View shared research outputs
Top Co-Authors

Avatar

Andrew Warfield

University of British Columbia

View shared research outputs
Top Co-Authors

Avatar

Christopher Head

University of British Columbia

View shared research outputs
Top Co-Authors

Avatar

Gitika Aggarwal

University of British Columbia

View shared research outputs
Researchain Logo
Decentralizing Knowledge