Ludovic Béliveau

dblp:202/2909 · DBLP profile ↗
← Back
3ranked-venue papers
0as first author
0since 2021 · last 2017
—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Computer networks · 2

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Computer networks
1 paper
Software-defined and programmable networks · 62% Network management and operations · 19% Wireless networking · 19%

Topics — the 3 heaviest of 3, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Software-defined and programmable networks › network function virtualization
service function chaining
0.212013
StEERING: A software-defined networking for inline service chaining · ICNP 2013
Wireless networking › network deployment
middlebox deployment
0.012013
StEERING: A software-defined networking for inline service chaining · ICNP 2013
Network management and operations
network configuration
0.012013
StEERING: A software-defined networking for inline service chaining · ICNP 2013

Methods — techniques the papers use, named apart from their topics

service placement optimization · 0.2openflow · 0.2centralized flow steering · 0.2
YearPublicationVenuePosition
2017 Extensions to decision-tree based packet classification algorithms to address new classification paradigms
Thibaut Stimpfling, Normand Bélanger, Omar Cherkaoui, André Béliveau, Ludovic Béliveau, Yvon Savaria
Comput. Networks5
2014 Runtime Resource Allocation Model over Network Processors
abstract
Delivering high performance when several virtual nodes share the same physical resources requires finding the optimal resource allocation between them. In the context of Software Defined Network (SDN) and Network Virtualization, data plane requires the design of a new and more flexible flow packet processing. Virtual nodes involves several packet processing functions such as search operations in different data structures, processing the packets by modifying their respective contents and buffering them. Each packet processing requires a set of shared resources. If there is a conflict for a given resources, resource reassignment strategy is needed to ensure the continuity of the processing and solve resource congestion in accordance with the available hardware resources. In this paper, we propose a resource allocation strategy to share fairly the network processor resources. It is based on network calculus model and game theory algorithms. This strategy maps dynamically the suitable resources according to virtual nodes processing. In our implementation, we focus on packet processing tasks in regard to OpenFlow forwarding model within several processors to reassign resources.
Khalil Blaiech, Omar Mounaouar, Omar Cherkaoui, Ludovic Béliveau
IC2E4
2013 StEERING: A software-defined networking for inline service chaining
abstract
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.
Ying Zhang 0022, Neda Beheshti, Ludovic Béliveau, Geoffrey Lefebvre, Ravi Manghirmalani, Ramesh Mishra, Ritun Patney, Meral Shirazipour, Ramesh Subrahmaniam, Catherine Truchan, Mallik Tatipamula
ICNP3