Jean-Pierre Thomesse

dblp:49/1843 · DBLP profile ↗
← Back
9ranked-venue papers
2as first author
0since 2021 · last 2011
—ORCID · none

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

Systems, architecture and hardware · 4 · 1 first-authorComputer networks · 2Applied, interdisciplinary, general and emerging computing · 2 · 1 first-authorDatabases, data management, data science and information retrieval · 1

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 architecture, parallel and distributed computing, and storage systems
1 paper
Embedded and real-time systems · 100%
Computer networks
2 papers
Internet of things and sensor networks · 48% Network performance modeling · 40% Physical-layer communications · 12%

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

TopicWeightPapersLastEvidence papers
Embedded and real-time systems › cyber-physical system platforms
industrial automation
0.112005
Fieldbus Technology in Industrial Automation · Proc. IEEE 2005
Internet of things and sensor networks › industrial iot
industrial sensor networks
0.012005
Fieldbus Technology in Industrial Automation · Proc. IEEE 2005
Network performance modeling
queueing analysis
0.011995
Message sojourn time for TDM schemes with any buffer capacity · IEEE Trans. Commun. 1995
Physical-layer communications › multiplexing
time-division multiplexing
0.011995
Message sojourn time for TDM schemes with any buffer capacity · IEEE Trans. Commun. 1995

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

qos analysis · 0.1medium access control protocols · 0.1medium access control protocol · 0.1queueing theory · 0.0probability distribution derivation · 0.0laplace transform · 0.0
YearPublicationVenuePosition
2011 CodaQ: A Context-Aware and Adaptive QoS-Aware Middleware for Activity Monitoring
Shahram Nourizadeh, Yeqiong Song, Jean-Pierre Thomesse
ICOST3
2010 Metadata for WICRI, a Network of Semantic Wikis for Communities in Research and Innovation
Jacques Ducloy, Thierry Daunois, Muriel Foulonneau, Alice Hermann, Jean-Charles Lamirel, Stéphane Sire, Jean-Pierre Thomesse, Christine Vanoirbeek
Dublin Core Conference7
2005 Fieldbus Technology and Industrial Automation
abstract
All automation systems are now based on fieldbuses. The solutions are numerous due to the number of fieldbuses, which are in turn due to the variety of applications. This paper traces fieldbus technology from its beginnings, which go back to the first industrial networks in the 1970's. It analyzes the fieldbus requirements, in terms of functions (or services) and of performance (or quality of service). The three following types of quality of service are studied: transport, timeliness and coherence, according to the different types of traffic to ensure (or to operate). The characteristics of periodic and aperiodic traffic are described. The main international standards (IEC, ISO, CEN) are presented regarding these criteria and the main concepts issued from the OSI model. The architecture of applications and the services of the communication system have a mutual influence. This is an important point for the distribution of the application processes, and will be analyzed in regards to the possible application layer models. The architecture of the communication system itself is also studied in the hopes of finding a single system for all applications. Future developments will be considered, regarding both the end-user needs and the available technologies. And finally, to conclude, we will go back to the title and try to answer the question "Is fieldbus a technology?"
Jean-Pierre Thomesse
ETFA1
2005 Fieldbus Technology in Industrial Automation
abstract
Fieldbus technology in industrial automation is not only relatively complex because of the number of solutions possible, but also, and above all, because of the variety of applications. Ironically, these in turn are responsible for the multitude of solutions available. If the analysis of the basic needs is relatively standard, as they will always involve connecting sensors, actuators, and field controllers with each other, the options in architecture are numerous and can impose the need for certain services. The required performances themselves and the QoS expected fundamentally depend on the applications. This paper traces this technology from its beginnings, which go back to the first industrial networks in the 1970s. The principal stages of development are recounted, from the initial requirement specifications to the current state of international standardization. The diverse technical solutions are then analyzed and classified. In particular, we study the temporal aspects, the medium access control protocols, and application relationships.
Jean-Pierre Thomesse
Proc. IEEE1
2004 Integrating (m, k)-Firm Real-Time Guarantees into the Internet QoS Model
Anis Koubaa, Yeqiong Song, Jean-Pierre Thomesse
NETWORKING3
2003 PROTEUS - a European initiative for e-maintenance platform development
abstract
This account presents the foundation of PROTEUS project programme, which consists in designing and modeling of a distributed network orientation platform for integration of maintenance applications. The presentation is focused on basic requirements defining project's rationale and on the development of the platform.
Jacek Szymanski, Thomas Bangemann, Mario Thron, Jean-Pierre Thomesse, Xavier Rebeuf, Christophe Lang, Éric Garcia 0001
ETFA (2)4
1995 Message sojourn time for TDM schemes with any buffer capacity
abstract
In this paper we deal with a queueing model based on TDM schemes. Many results concerning this kind of model can be found in literature, but a large part of these results only concerns particular cases. Our main concern is to provide a general solution for the exact message sojourn time in the queue that should be available whatever the storage capacity may be. First, the probability distribution function as well as the Laplace transform of the message sojourn time in the buffer are derived, assuming Poisson fixed-length message arrivals, multiple output and finite buffer capacity. Second, taking advantage of these results, we provide the expected value of the message sojourn time and compare our results with those obtained by many authors. The formulas stated here are available for various particular cases especially for unlimited buffer capacity. Finally, we point out that the work done is directly usable for performance evaluation of many communication systems such as real-time networks, multiplexers and ATM links. Therefore, our results are both of theoretical and practical interests.>
François Simonot, Yeqiong Song, Jean-Pierre Thomesse
IEEE Trans. Commun.3
1981 Compiling distributed applications
A. Cochet-Muchy, Jean-Pierre Thomesse
Microprocessing and Microprogramming2
1977 Information processing, automation and microprocessor education
René Husson, C. Goeldel, Jean-Pierre Thomesse, P. Nonn
Euromicro Newsletter3