WorldCat Identities

Baynat, Bruno

Overview
Works: 12 works in 26 publications in 2 languages and 279 library holdings
Roles: Author, Opponent, Thesis advisor
Classifications: QA76.9.A43, 005.1
Publication Timeline
.
Most widely held works by Bruno Baynat
Exercices et problèmes d'algorithmique 155 énoncés avec solutions détaillées by Bruno Baynat( Book )

12 editions published between 2003 and 2012 in French and held by 153 WorldCat member libraries worldwide

Pour les étudiants en licence et Master de mathématiques et d'informatique, ou en cursus universitaires équivalents de Bac+3 à Bac+5, ainsi que les élèves en écoles d'ingénieurs
Théorie des files d'attente : des chaînes de Markov aux réseaux à forme produit by Bruno Baynat( Book )

3 editions published in 2000 in French and held by 85 WorldCat member libraries worldwide

Exercices et problèmes d'algorithmique : 155 énoncés avec solutions détaillées by Bruno Baynat( )

1 edition published in 2012 in French and held by 28 WorldCat member libraries worldwide

UNE METHODE APPROXIMATIVE D'ANALYSE DES RESEAUX DE FILES D'ATTENTE FERMES MULTICLASSES by Bruno Baynat( Book )

2 editions published in 1991 in French and held by 4 WorldCat member libraries worldwide

LE BUT DE CE TRAVAIL ETAIT DE DEVELOPPER UNE METHODE APPROXIMATIVE D'ANALYSE DES RESEAUX DE FILES D'ATTENTE FERMES GENERAUX, POUVANT COMPORTER, PAR EXEMPLE, DES MECANISMES DE SYNCHRONISATION, DE PARTAGE DE RESSOURCE, DE DESASSEMBLAGE ET D'ASSEMBLAGE, OU ENCORE DES MECANISMES DE DEPENDANCE VIS-A-VIS DE L'ETAT DU SYSTEME. DANS LA PREMIERE PARTIE DE CE TRAVAIL NOUS NOUS SOMMES INTERESSES AUX RESEAUX DE FILES D'ATTENTE MONOCLASSES. NOUS AVONS DEVELOPPE UNE METHODE GENERALE PERMETTANT DE REGROUPER SOUS UNE VISION UNIFIEE, DEUX TECHNIQUES APPROXIMATIVES LARGEMENT UTILISEES, LA TECHNIQUE D'AGREGATION ET LA METHODE DE MARIE. NOUS AVONS MONTRE QUE CES DEUX TECHNIQUES PEUVENT ETRE VUES COMME DEUX FACONS D'OBTENIR DES ESTIMATIONS DES PARAMETRES D'UNE SOLUTION APPROXIMATIVE A FORME PRODUIT. LE CADRE GENERAL DE CETTE EMTHODE NOUS A PERMIS PERMIS DE COMPARER PLUS FACILEMENT L'AGREGATION ET LA METHODE DE MARIE, EN TERMES DE COUT DE CALCUL ET DE PRECISION. DANS LA DEUXIEME PARTIE DE CE TRAVAIL NOUS MONTRONS QU'UNE EXTENSION DIRECTE DE CES TRAVAUX AU CAS D'UN RESEAU MULTICLASSE, N'EST PAS REALISABLE. EN PARTICULIER LE PRINCIPE GENERAL DE LA TECHNIQUE D'AGREGATION NE PEUT ETRE ETENDU AU CAS D'UN SYSTEME MULTICLASSE. UNE EXTENSION DE LA METHODE DE MARIE S'ELOIGNANT LEGEREMENT DE L'IDEE ORIGINELLE DE LA METHODE MONOCLASSE A CEPENDANT PU ETRE OBTENUE, MAIS NOUS MONTRONS QUE LA COMPLEXITE DE CETTE METHODE FAIT QU'ELLE N'EST APPLICABLE QUE POUR DES RESEAUX DE TRES PETITE TAILLE. NOUS AVONS DONC DEVELOPPE DANS LA TROISIEME PARTIE DE CE TRAVAIL UNE NOUVELLE EXTENSION DE LA METHODE GENERALE MONOCLASSE. L'IDEE DE CETTE METHODE EST ALORS D'ESTIMER LES PERFORMANCES DU SYSTEME MULTICLASSE A L'AIDE DE DIFFERENTES SOLUTIONS APPROXIMATIVES A FORME PRODUIT MONOCLASSE. CETTE APPROCHE PERMET DE REDUIRE CONSIDERABLEMENT LA COMPLEXITE DE LA METHODE, LA RENDANT AINSI UTILISABLE POUR UNE TRES LARGE CLASSE DE RESEAUX
Exercices et problemes d'algorithmique - 3eme edition by Bruno Baynat( )

1 edition published in 2012 in English and held by 2 WorldCat member libraries worldwide

Modèles multicellulaires pour les réseaux mobiles 4G by Narcisse Nya Kamtchoum( )

1 edition published in 2018 in French and held by 1 WorldCat member library worldwide

In order to meet the ever-increasing need for bandwidth and to offer ever more services, wherever users are, cellular networks are rapidly evolving towards technologies characterized by an increasingly sophisticated radio interface. For example, while the deployment of 4G networks was just beginning, operators already planned the first updates to LTE-A solutions and 5G technologies are currently receiving active attention. These rapid changes are motivated by the explosion of mobile traffic, as shown by numerous studies and observations on current networks. Users equipped with smartphones, tablets, and other mobile devices mainly generate this traffic. However most of models for cellular networks in literature do not take into account mobility of users. Authors who have tried to take into account users' mobility, propose models based on hypotheses like users moving with infinite speed. In this thesis we have developed analytical models for 4G and 5G cellular networks taking into account user mobility in a realistic way. The proposed models were designed to be simple and easy to solve, allowing users and networks performance to be evaluated almost instantaneously. Our first analysis and results where on the impact of mobility in dense LTE-A networks with small cells. We developed two models to access static users performance in small cell with mixed users (static and mobile users). The first model is based on Markov chains and the second one on Processor-Sharing queue. Our second analysis and results where on LTE/LTE-A macrocells with two coding zones and visited by mobile users. We proposed a model based on queuing theory to study the performance of mobile users in a LTE/LTE-A macrocell with different radio conditions over its coverage area. Then, we have then extended these models to the case of homogeneous cellular networks where cells are statistically identical. These models allowed us to show the positive impact of user mobility on performance in a cell or in a network. Moreover, we showed that this performance gain was not a monotonous function of user mobility, which is an important result showing the impact of hard handover implemented in LTE and LTE-A networks on performance. Finally, we turned our attention to heterogeneous networks with different type of cells and visited by users with different profiles (speed, amount of data to be transferred)
Exercices et problèmes d'algorithmique : 155 énoncés avec solutions détaillées Ed. 3 by Bruno Baynat( )

1 edition published in 2010 in French and held by 1 WorldCat member library worldwide

Ce livre s'appuie sur l'expérience d'enseignants-chercheurs chevronnés qui ont souhaité offrir un support de travail aux étudiants de fin de licence et début de master ainsi qu'aux élèves ingénieurs dans leur approche de l'algorithmique.Sur des sujets très divers (algorithmes sur les arbres, sur les graphes, les mots, la géométrie), ce livre propose des exercices de forme et de difficulté variables, exercices d'entraînement ou sujets d'examens. Les corrigés comportent les rédactions complètes des preuves et des algorithmes exprimés selon un formalisme proche de celui des langages de programmation impératifs (C, C++, Pascal, Java...). Cette troisième édition s'enrichit de quelques nouveaux exercices
A unified view of product-form approximation techniques for general closed queueing networks by Bruno Baynat( Book )

1 edition published in 1990 in English and held by 1 WorldCat member library worldwide

Approximate techniques for general closed queueing networks with subnetworks having population constraints by Bruno Baynat( Book )

1 edition published in 1990 in English and held by 1 WorldCat member library worldwide

Exercices et problèmes d'algorithmique : 155 énoncés avec solutions détaillées Ed. 3 by Bruno Baynat( )

1 edition published in 2010 in French and held by 1 WorldCat member library worldwide

Ce livre s'appuie sur l'expérience d'enseignants-chercheurs chevronnés qui ont souhaité offrir un support de travail aux étudiants de fin de licence et début de master ainsi qu'aux élèves ingénieurs dans leur approche de l'algorithmique.Sur des sujets très divers (algorithmes sur les arbres, sur les graphes, les mots, la géométrie), ce livre propose des exercices de forme et de difficulté variables, exercices d'entraînement ou sujets d'examens. Les corrigés comportent les rédactions complètes des preuves et des algorithmes exprimés selon un formalisme proche de celui des langages de programmation impératifs (C, C++, Pascal, Java...). Cette troisième édition s'enrichit de quelques nouveaux exercices
Modeling and performance analysis of IEEE 802.11-based chain networks by Thiago Wanderley Matos de Abreu( )

1 edition published in 2015 in English and held by 1 WorldCat member library worldwide

The IEEE 802.11 protocol, based on the CMSA/CA principles, is widely deployed in current communications, mostly due to its simplicity and low cost implementation. One common usage can be found in multi-hop wireless networks, where communications between nodes may involve relay nodes. A simple topology of these networks including one source and one destination is commonly known as a chain. In this thesis, a hierarchical modeling framework, composed of two levels, is presented in order to analyze the associated performance of such chains. The upper level models the chain topology and the lower level models each of its nodes. It estimates the performance of the chain in terms of the attained throughput and datagram losses, according to different patterns of channel degradation. In terms of precision, the model delivers, in general, accurate results. Furthermore, the time needed for solving it remains very small. The proposed model is then applied to chains with 2, 3 and 4 nodes, in the presence of occasional hidden nodes, finite buffers and non-perfect physical layer. Moreover, the use of the proposed model allows us to highlight some inherent properties to such networks. For instance, it is shown that a chain presents a performance maximum (with regards to the attained throughput) according to the system workload level, and this performance collapses with the increase of the workload. This represents a non-trivial behavior of wireless networks and cannot be easily identified. However, the model captures this non-trivial effect. Finally, some of the impacts in chains performance due to the IEEE 802.11 mechanisms are analyzed and detailed. The strong synchronization among nodes of a chain is depicted and how it represents a challenge for the modeling of such networks. The proposed model overcomes this obstacle and allows an easy evaluation of the chain performance
A product-form approximation method for general closed queueing networks with several classes of customers by Bruno Baynat( Book )

1 edition published in 1991 in English and held by 1 WorldCat member library worldwide

 
moreShow More Titles
fewerShow Fewer Titles
Audience Level
0
Audience Level
1
  General Special  
Audience level: 0.00 (from 0.00 for Exercices ... to 0.00 for Exercices ...)

Associated Subjects
Exercices et problèmes d'algorithmique 155 énoncés avec solutions détaillées
Covers
Languages
French (21)

English (5)