Franck Le

Franck Le

Auto-generated profile, based on publicly available information

Franck Le

IBM Research

Research Focus & Metrics

Academic Career Length

14Years (2013-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
25 April 2019
Verified
Book Chapter
Closed access
PDF file
FLFranck Le
Franck Le
JOJorge Ortiz
Jorge Ortiz
DVDinesh Verma
Dinesh Verma
DKDilip Kandlur
Dilip Kandlur

1 July 2013 in Theory and Practice of Logic Programming
Verified
Journal Article
Closed access
PDF file
JMJiefei Ma
Jiefei Ma
FLFranck LE
Franck LE
DWDavid Wood
David Wood
ARAlessandra Russo
Alessandra Russo
JLJorge Lobo
Jorge Lobo
There is an increasing interest in using logic programming to specify and implement distributed algorithms, including a variety of network applications. These are applications where data and computation are distributed among several devices and where, in principle, all the devices can exchange data and share the computational results of the group. In this paper we propose a declarative approach to distributed computing whereby distributed algorithms and communication models can be (i) specified as action theories of fluents and actions; (ii) executed as collections of distributed state machines, where devices are abstracted as (input/output) automata that can exchange messages; and (iii) analysed using existing results on connecting causal theories and Answer Set Programming. Results on the application of our approach to different classes of network protocols are also presented.

5 February 2019 in IEEE Journal on Selected Areas in Communications
Verified
Journal Article
Closed access
JDJingpu Duan
Jingpu Duan
XYXiaodong Yi
Xiaodong Yi
JWJunjie Wang
Junjie Wang
CWChuan Wu
Chuan Wu
FLFranck Le
Franck Le
Network functions (NFs) are more than simple packet processors that apply various transformations to the packet content. Modern NFs often resort to various external services to achieve their purposes, e.g., storing flow states in an external storage or looking up a DNS. Working with external services is usually implemented using callback-based asynchronous programming, which is complex and error-prone. This paper proposes NetStar, a new NF programming framework that brings the future/promise abstraction to the NF dataplane for flow processing. NetStar simplifies asynchronous NF programming via a carefully designed async-flow interface that exploits the future/promise paradigm by chaining multiple continuation functions for asynchronous operations handling. The programs implemented using the NetStar framework mimic simple synchronous programming but are able to achieve full flow processing asynchrony. We have used NetStar to implement a number of representative NFs. Our experience and evaluation results show that NetStar can effectively simplify asynchronous NF programming by substantially reducing the lines of code, while still approaching line-rate packet processing speeds.

5 July 2019 in IEEE Journal on Selected Areas in Communications
Verified
Journal Article
Closed access
QXQiao Xiang
Qiao Xiang
JZJingxuan Jensen Zhang
Jingxuan Jensen Zhang
XWXin Tony Wang
Xin Tony Wang
YLYang Jace Liu
Yang Jace Liu
CGChin Guok
Chin Guok
YYY. Richard Yang
Y. Richard Yang
Multi-domain network resource reservation systems are being deployed, driven by the demand and substantial benefits of providing predictable network resources. However, a major lack of existing systems is their coarse granularity, due to the participating networks’ concern of revealing sensitive information, which can result in substantial inefficiencies. This paper presents Mercator, a novel multi-domain network resource discovery system to provide fine-grained, global network resource information, for collaborative sciences. The foundation of Mercator is a resource abstraction through algebraic-expression enumeration (i.e., linear inequalities/equations), as a compact representation of multiple properties of network resources (e.g., bandwidth, delay and loss rate) in multi-domain networks. In addition, we develop an obfuscating protocol, to address the privacy concerns by ensuring that no participant can associate the algebraic expressions with the corresponding member networks. We also introduce a super-set projection technique to increase Mercator’s scalability. We implement a prototype Mercator and deploy it in a small federation network. We also evaluate the performance of Mercator through extensive experiments using real topologies and traces. Results show that Mercator (1) efficiently discovers available networking resources in collaborative networks on average four orders of magnitude faster, and allows fairer allocations of network resources; (2) preserves the member networks’ privacy with little overhead; and (3) scales to a collaborative network of 200 member networks.

7 January 2016 in IEEE Transactions on Knowledge and Data Engineering
Verified
Journal Article
Closed access
JMJiefei Ma
Jiefei Ma
FLFranck Le
Franck Le
ARAlessandra Russo
Alessandra Russo
JLJorge Lobo
Jorge Lobo
Researchers have recently shown that declarative database query languages, such as Datalog, could naturally be used to specify and implement network protocols and services. In this paper, we present a declarative framework for the specification, execution, simulation, and analysis of distributed applications. Distributed applications, including routing protocols, can be specified using a Declarative Networking language, called D2C, whose semantics capture the notion of a Distributed State Machine (DSM), i.e., a network of computational nodes that communicate with each other through the exchange of data. The D2C specification can be directly executed using the DSM computational infrastructure of our framework. The same specification can be simulated and formally verified. The simulation component integrates the DSM tool within a network simulation environment and allows developers to simulate network dynamics and collect data about the execution in order to evaluate application responses to network changes. The formal analysis component of our framework, instead, complements the empirical testing by supporting the verification of different classes of properties of distributed algorithms, including convergence of network routing protocols. To demonstrate the generality of our framework, we show how it can be used to analyze two classes of network routing protocols, a path vector and a Mobile Ad-Hoc Network (MANET) routing protocol, and execute a distributed algorithm for pattern formation in multi-robot systems.

3 July 2019 in IEEE/ACM Transactions on Networking
Verified
Journal Article
Closed access
ZZZiyao Zhang
Ziyao Zhang
LMLiang Ma
Liang Ma
KLKin K. Leung
Kin K. Leung
FLFranck Le
Franck Le
SKSastry Kompella
Sastry Kompella
LTLeandros Tassiulas
Leandros Tassiulas
Distributed software-defined networks (SDN), consisting of multiple inter-connected network domains, each managed by one SDN controller, is an emerging networking architecture that offers balanced centralized control and distributed operations. Under such a networking paradigm, most existing works focus on designing sophisticated controller-synchronization strategies to improve joint controller-decision-making for inter-domain routing. However, there is still a lack of fundamental understanding of how the performance of distributed SDN is related to network attributes, thus it is impossible to justify the necessity of complicated strategies. In this regard, we analyze and quantify the performance enhancement of distributed SDN architectures, which is influenced by intra-/inter-domain synchronization levels and network structural properties. Based on a generic network model, we establish analytical methods for performance estimation under four canonical inter-domain synchronization scenarios. Specifically, we first derive an asymptotic expression to quantify how dominating structural and synchronization-related parameters affect the performance metric. We then provide performance analytics for an important family of networks, where all links are of equal preference for path constructions. Finally, we establish fine-grained performance metric expressions for networks with dynamically adjusted link preferences. Our theoretical results reveal how network performance is related to synchronization levels and intra-/inter-domain connections, the accuracy of which is confirmed by simulations based on both real and synthetic networks. To the best of our knowledge, this is the first work quantifying the performance of distributed SDN in terms of network structural properties and synchronization levels.