Gauthier Picard

Prof. Gauthier Picard

orcid

Research Focus & Metrics

Academic Career Length

24Years (2003-Present)

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

Representative Publications

View All Publications
15 April 2003
Verified
Book Chapter
Closed access
PDF file
CBCarole Bernon
Carole Bernon
MGMarie-Pierre Gleizes
Marie-Pierre Gleizes
SPSylvain Peyruqueou
Sylvain Peyruqueou
GPGauthier Picard
Gauthier Picard

17 October 2018 in IEEE Transactions on Network and Service Management
Verified
Journal Article
Closed access
PQPham Tran Anh Quang
Pham Tran Anh Quang
ABAbbas BRADAI
Abbas BRADAI
KSKamal Deep Singh
Kamal Deep Singh
GPGauthier Picard
Gauthier Picard
RRRoberto Riggio
Roberto Riggio
Network Function Virtualization (NFV) will simplify deployment and management of network and telecommunication services. NFV provides flexibility by virtualizing the network functions and moving them to a virtualization platform. In order to achieve its full potential, NFV is being extended to mobile or wireless networks by considering virtualization of radio functions. A typical network service setup requires the allocation of a Virtual Network Function -Forwarding Graph (VNF-FG). A VNF-FG is allocated considering the resource constraints of the lower infrastructure. This topic has been well-studied in existing literature, however, the effects of variations of networks over time have not been addressed yet. In this paper, we provide a model of the adaptive and dynamic VNF allocation problem considering also VNF migration. Then we formulate the optimization problem as an Integer Linear Programming (ILP) and provide a heuristic algorithm for allocating multiple VNF-FGs. The idea is that VNF-FGs can be reallocated dynamically to obtain the optimal solution over time. First, a centralized optimization approach is proposed to cope with the ILP-resource allocation problem. Next, a decentralized optimization approach is proposed to deal with cooperative multi-operator scenarios. We adopt AD3, an ADMM-based algorithm, to solve this problem in a distributed way. The results confirm that the proposed algorithms are able to optimize the network utilization, while limiting the number of reallocations of VNFs which could interrupt network services.

1 January 2004
Verified
Book Chapter
Closed access
PDF file
GPGauthier Picard
Gauthier Picard
MGMarie-Pierre Gleizes
Marie-Pierre Gleizes

1 May 2015 in Computers and Electrical Engineering
Verified
Journal Article
Closed access
Alexandru SoriciAlexandru Sorici
Alexandru Sorici
GPGauthier Picard
Gauthier Picard
OBOlivier Boissier
Olivier Boissier
AZAntoine Zimmermann
Antoine Zimmermann
Adina Adina FloreaAdina Adina Florea
Adina Adina Florea

1 October 2008
Verified
Conference Paper
Closed access
GCGaël Clair
Gaël Clair
EKElsy Kaddoum
Elsy Kaddoum
MGMarie-Pierre Gleizes
Marie-Pierre Gleizes
GPGauthier Picard
Gauthier Picard
In this paper, we explore the potential of distributed satisfaction techniques as to provide self-regulated manufacturing control. This work relies on a DisCSP-based modeling distributed among agents (e.g. machines) having enough and reasoning capabilities to cooperate and negotiate for a committed schedule. This approach is used to dynamically regulate the system (the network of machines) when perturbations occur (machine break-out, operator or container unavailability, or even priority command). Thus, for these machines, embodied intelligence and autonomy are a mean to provide a more flexible and adaptive manufacturing network. In this paper, we present two different multi-agent models and two extensions of well-known DisCSP solvers. Experiments using a dedicated simulation platform, MASC, are presented and discussed.

1 January 2004 in Lecture Notes in Computer Science
Verified
Book Chapter
Closed access
PDF file
CBCarole Bernon
Carole Bernon
VCValérie Camps
Valérie Camps
MGMarie-Pierre Gleizes
Marie-Pierre Gleizes
GPGauthier Picard
Gauthier Picard