Ecole nationale supérieure des télécommunications de Bretagne (Brest / 1977-2016)
Overview
| Works: | 527 works in 666 publications in 3 languages and 1,289 library holdings |
|---|---|
| Genres: | Conference papers and proceedings |
| Roles: | Degree grantor, Editor, Organizer of meeting, Producer, Other |
| Classifications: | T58.5, 621.385 |
Publication Timeline
.
Most widely held works by
Ecole nationale supérieure des télécommunications de Bretagne (Brest / 1977-2016)
2006 International Conference on Information & Communication Technologies : from Theory to Applications : ICTTA '06 : proceedings
: 24-28 April 2006, Damascus, Syria by
International Conference on Information & Communication Technologies: from Theory to Applications(
)
5 editions published between 2005 and 2006 in English and held by 250 WorldCat member libraries worldwide
5 editions published between 2005 and 2006 in English and held by 250 WorldCat member libraries worldwide
ICTTA '04 : 2004 International Conference on Information & Communication Technologies, from Theory to Applications : proceedings
: 19-23 April, 2004, Damascus, Syria by International Conference on Information & Communication Technologies: from Theory to Applications(
)
1 edition published in 2004 in English and held by 212 WorldCat member libraries worldwide
1 edition published in 2004 in English and held by 212 WorldCat member libraries worldwide
Questions de pédagogies dans l'enseignement supérieur, pratiques pédagogiques et finalités éducatives : actes du Ve colloque,
Brest, 18-20 juin 2008 by TELECOM Bretagne (Brest)(
Book
)
in French and held by 8 WorldCat member libraries worldwide
in French and held by 8 WorldCat member libraries worldwide
Questions de pédagogies dans l'enseignement supérieur, enjeux, attentes, changements : actes du VIe colloque, Brest, 08-09-10
juin 2011 by
Institut Supérieur de la Santé et des Bioproduits d'Angers (Angers)(
Book
)
1 edition published in 2011 in French and held by 8 WorldCat member libraries worldwide
1 edition published in 2011 in French and held by 8 WorldCat member libraries worldwide
17ème colloque sur le traitement du signal et des images : Vannes, 13-17 septembre 1999 by Colloque sur le traitement du signal et des images(
)
1 edition published in 1999 in Multiple languages and held by 8 WorldCat member libraries worldwide
1 edition published in 1999 in Multiple languages and held by 8 WorldCat member libraries worldwide
Routage et allocation de flots avec tolérance aux pannes dans les réseaux Internet nouvelle génération by
Samer Lahoud(
Book
)
2 editions published in 2006 in French and held by 4 WorldCat member libraries worldwide
Avec l'évolution de l'Internet, le dimensionnement des réseaux coeurs est devenu un enjeu stratégique pour les opérateurs. De nouvelles stratégies sont mises en oeuvre dans les réseaux Internet Nouvelle Génération (ING) pour permettre l'évolution du réseau ainsi que la tolérance aux pannes tout en garantissant un bon retour sur investissement. En particulier, les réseaux ING proposent une architecture à deux couches: un réseau de transport utilisant les technologies optiques comme DWDM et un réseau de données utilisant IP/GMPLS. Dans cette thèse, nous étudions les problèmes d'allocation de flots dans les réseaux de transport. Nous considérons différentes stratégies d'allocation qui privilégient l'équité, la maximisation du volume alloué, ou la minimisation des coûts. Nous étudions différents mécanismes de tolérance aux pannes, notamment la protection par lien et par chemin, et évaluons le partage de la bande passante de secours ainsi que la protection variable. Pour ces différents problèmes, nous proposons des algorithmes d'approximation qui calculent des solutions à un facteur garanti de l'optimal en un temps polynomial. Dans les réseaux de données, nous étudions deux variantes du problème de routage. Nous présentons un algorithme polynomial pour le routage off-line qui inclut différents objectifs d'ingénierie de trafic et fournit une flexibilité de contrôle de la qualité de la solution et une complexité réduite. Dans une autre variante, nous étudions le problème du routage on-line de tunnels à bande passante garantie. Notre approche considère différents mécanismes de tolérance aux pannes et utilise une nouvelle mesure de l'efficacité d'utilisation du réseau
2 editions published in 2006 in French and held by 4 WorldCat member libraries worldwide
Avec l'évolution de l'Internet, le dimensionnement des réseaux coeurs est devenu un enjeu stratégique pour les opérateurs. De nouvelles stratégies sont mises en oeuvre dans les réseaux Internet Nouvelle Génération (ING) pour permettre l'évolution du réseau ainsi que la tolérance aux pannes tout en garantissant un bon retour sur investissement. En particulier, les réseaux ING proposent une architecture à deux couches: un réseau de transport utilisant les technologies optiques comme DWDM et un réseau de données utilisant IP/GMPLS. Dans cette thèse, nous étudions les problèmes d'allocation de flots dans les réseaux de transport. Nous considérons différentes stratégies d'allocation qui privilégient l'équité, la maximisation du volume alloué, ou la minimisation des coûts. Nous étudions différents mécanismes de tolérance aux pannes, notamment la protection par lien et par chemin, et évaluons le partage de la bande passante de secours ainsi que la protection variable. Pour ces différents problèmes, nous proposons des algorithmes d'approximation qui calculent des solutions à un facteur garanti de l'optimal en un temps polynomial. Dans les réseaux de données, nous étudions deux variantes du problème de routage. Nous présentons un algorithme polynomial pour le routage off-line qui inclut différents objectifs d'ingénierie de trafic et fournit une flexibilité de contrôle de la qualité de la solution et une complexité réduite. Dans une autre variante, nous étudions le problème du routage on-line de tunnels à bande passante garantie. Notre approche considère différents mécanismes de tolérance aux pannes et utilise une nouvelle mesure de l'efficacité d'utilisation du réseau
Statistical analysis of network traffic for anomaly detection and quality of service provisioning by
Pedro Casas Hernandez(
Book
)
2 editions published in 2010 in English and held by 4 WorldCat member libraries worldwide
Network-wide traffic analysis and monitoring in large-scale networks is a challenging and expensive task. In this thesis work we have proposed to analyze the traffic of a large-scale IP network from aggregated traffic measurements, reducing measurement overheads and simplifying implementation issues. We have provided contributions in three different networking fields related to network-wide traffic analysis and monitoring in large-scale IP networks. The first contribution regards Traffic Matrix (TM) modeling and estimation, where we have proposed new statistical models and new estimation methods to analyze the Origin-Destination (OD) flows of a large-scale TM from easily available link traffic measurements. The second contribution regards the detection and localization of volume anomalies in the TM, where we have introduced novel methods with solid optimality properties that outperform current well-known techniques for network-wide anomaly detection proposed so far in the literature. The last contribution regards the optimization of the routing configuration in large-scale IP networks, particularly when the traffic is highly variable and difficult to predict. Using the notions of Robust Routing Optimization we have proposed new approaches for Quality of Service provisioning under highly variable and uncertain traffic scenarios. In order to provide strong evidence on the relevance of our contributions, all the methods proposed in this thesis work were validated using real traffic data from different operational networks. Additionally, their performance was compared against well-known works in each field, showing outperforming results in most cases. Taking together the ensemble of developed TM models, the optimal network-wide anomaly detection and localization methods, and the routing optimization algorithms, this thesis work offers a complete solution for network operators to efficiently monitor large-scale IP networks from aggregated traffic measurements and to provide accurate QoS-based performance, even in the event of volume traffic anomalies
2 editions published in 2010 in English and held by 4 WorldCat member libraries worldwide
Network-wide traffic analysis and monitoring in large-scale networks is a challenging and expensive task. In this thesis work we have proposed to analyze the traffic of a large-scale IP network from aggregated traffic measurements, reducing measurement overheads and simplifying implementation issues. We have provided contributions in three different networking fields related to network-wide traffic analysis and monitoring in large-scale IP networks. The first contribution regards Traffic Matrix (TM) modeling and estimation, where we have proposed new statistical models and new estimation methods to analyze the Origin-Destination (OD) flows of a large-scale TM from easily available link traffic measurements. The second contribution regards the detection and localization of volume anomalies in the TM, where we have introduced novel methods with solid optimality properties that outperform current well-known techniques for network-wide anomaly detection proposed so far in the literature. The last contribution regards the optimization of the routing configuration in large-scale IP networks, particularly when the traffic is highly variable and difficult to predict. Using the notions of Robust Routing Optimization we have proposed new approaches for Quality of Service provisioning under highly variable and uncertain traffic scenarios. In order to provide strong evidence on the relevance of our contributions, all the methods proposed in this thesis work were validated using real traffic data from different operational networks. Additionally, their performance was compared against well-known works in each field, showing outperforming results in most cases. Taking together the ensemble of developed TM models, the optimal network-wide anomaly detection and localization methods, and the routing optimization algorithms, this thesis work offers a complete solution for network operators to efficiently monitor large-scale IP networks from aggregated traffic measurements and to provide accurate QoS-based performance, even in the event of volume traffic anomalies
Testing and modeling seurity mechanisms in web applications by
Tejeddine Mouelhi(
Book
)
2 editions published in 2010 in English and held by 4 WorldCat member libraries worldwide
Les travaux effectués dans de cadre de cette thèse s'intéressent à la problématique du test de sécurité des applications, en considérant la validation des mécanismes de sécurité interne à un système d'une part, puis la sécurité des interfaces web d'autre part. Pour la partie interne, nous avons comparé, dans un premier temps, l'utilisation du test fonctionnel et des tests de sécurité pour valider les mécanismes implémentant une politique de contrôle d'accès. Dans ce cadre, l'analyse de mutation a été adaptée pour qualifier et évaluer les tests. Nous avons ensuite proposé trois méthodologies pour tester les mécanismes de contrôle d'accès ; utilisation du pair-wise pour générer les tests de sécurité, sélection et transformation des tests fonctionnels en tests de sécurité et enfin détection de mécanismes de sécurité cachés qui nuisent à la flexibilité et l'évolutivivité du système. Concernant le test des interfaces web, visant non seulement à tester le code validant les entrées de l'utilisateur mais aussi protéger les applications web, nous avons proposé une nouvelle approche qui tire profit du test par contournement et qui permet de protéger les applications web contre ce type d'attaques. Cette approche a été concrétisée dans un outil permettant à la fois l'audit et la sécurisation des applications web. L'ensemble de ces travaux a conduit à réfléchir à de nouvelles méthodologies de développement garantissant une meilleure qualité et une meilleure testabilité des mécanismes de contrôle d'accès. L'ingénierie des modèles (IDM) a été exploitée pour automatiser la spécification et le déploiement semi-automatisé des politiques de contrôle d'accès, et offrir par analyse de mutation un moyen de certification générique des tests de sécurité. Enfin, la composition de modèles permet d'automatiser l'intégration des mécanismes de sécurité, et surtout la reconfiguration automatique du système en cas d'évolution de la politique de sécurité
2 editions published in 2010 in English and held by 4 WorldCat member libraries worldwide
Les travaux effectués dans de cadre de cette thèse s'intéressent à la problématique du test de sécurité des applications, en considérant la validation des mécanismes de sécurité interne à un système d'une part, puis la sécurité des interfaces web d'autre part. Pour la partie interne, nous avons comparé, dans un premier temps, l'utilisation du test fonctionnel et des tests de sécurité pour valider les mécanismes implémentant une politique de contrôle d'accès. Dans ce cadre, l'analyse de mutation a été adaptée pour qualifier et évaluer les tests. Nous avons ensuite proposé trois méthodologies pour tester les mécanismes de contrôle d'accès ; utilisation du pair-wise pour générer les tests de sécurité, sélection et transformation des tests fonctionnels en tests de sécurité et enfin détection de mécanismes de sécurité cachés qui nuisent à la flexibilité et l'évolutivivité du système. Concernant le test des interfaces web, visant non seulement à tester le code validant les entrées de l'utilisateur mais aussi protéger les applications web, nous avons proposé une nouvelle approche qui tire profit du test par contournement et qui permet de protéger les applications web contre ce type d'attaques. Cette approche a été concrétisée dans un outil permettant à la fois l'audit et la sécurisation des applications web. L'ensemble de ces travaux a conduit à réfléchir à de nouvelles méthodologies de développement garantissant une meilleure qualité et une meilleure testabilité des mécanismes de contrôle d'accès. L'ingénierie des modèles (IDM) a été exploitée pour automatiser la spécification et le déploiement semi-automatisé des politiques de contrôle d'accès, et offrir par analyse de mutation un moyen de certification générique des tests de sécurité. Enfin, la composition de modèles permet d'automatiser l'intégration des mécanismes de sécurité, et surtout la reconfiguration automatique du système en cas d'évolution de la politique de sécurité
Interprétation sémantique des exigences pour l'enrichissement de la traçabilité et pour l'amélioration des architectures
de systèmes complexes by
Eric Le Pors(
Book
)
in French and held by 4 WorldCat member libraries worldwide
The increasing complexity of software-intensive systems produced in the industry is related to the complexity of engineering: reduction of production delays, activities organisation, managing subcontractors... This complexity is also due to the increasing number of new functions and data to be processed. Moreover, it depends on the number of physical and software components to interact, constrained in terms of functionality and quality, which implies ever more difficult designs for these systems. To control their production, a high level of expertise is required in more and more domains. Moreover, this knowledge must be shared by many teams collaborating on building specification and implementing separate and specific entities of the system. System Engineering process describes the different building phases, from operational need analysis, through system need analysis, to the establishment of an architectural solution that meets the functional need expressed by the customer. This need is formalized in requirements. This PhD work proposes an approach to model architectural solutions by expressing the required functions associated with their non-functional constraints using different viewpoints. These viewpoints can represent different facets of the architectural solution, separing thus the global complexity. Additionally, controls allow to ensure that the solution is compliant with coherence and design rules. We also propose a method coupled with the realization of a conceptual model of the system and its environment, in order to obtain better written requirements. The conceptual model allows us to make an interpretation of the semantics present in these requirements in order to extract control and verification elements. These items captured in requirements will annotate elements of different viewpoints, representing the architecture, by exploiting traceability links established by design engineers. The verification of these annotations consideration and the automatic generation of viewpoints from information contained in the requirements allows us to obtain architectural solutions closer to the customer needs. The conceptual model also gives us the opportunity to capitalize, in different expertise domains, on engineers knowledge. It also enables us to establish a reference model as a basis for discussion and training of new team members
in French and held by 4 WorldCat member libraries worldwide
The increasing complexity of software-intensive systems produced in the industry is related to the complexity of engineering: reduction of production delays, activities organisation, managing subcontractors... This complexity is also due to the increasing number of new functions and data to be processed. Moreover, it depends on the number of physical and software components to interact, constrained in terms of functionality and quality, which implies ever more difficult designs for these systems. To control their production, a high level of expertise is required in more and more domains. Moreover, this knowledge must be shared by many teams collaborating on building specification and implementing separate and specific entities of the system. System Engineering process describes the different building phases, from operational need analysis, through system need analysis, to the establishment of an architectural solution that meets the functional need expressed by the customer. This need is formalized in requirements. This PhD work proposes an approach to model architectural solutions by expressing the required functions associated with their non-functional constraints using different viewpoints. These viewpoints can represent different facets of the architectural solution, separing thus the global complexity. Additionally, controls allow to ensure that the solution is compliant with coherence and design rules. We also propose a method coupled with the realization of a conceptual model of the system and its environment, in order to obtain better written requirements. The conceptual model allows us to make an interpretation of the semantics present in these requirements in order to extract control and verification elements. These items captured in requirements will annotate elements of different viewpoints, representing the architecture, by exploiting traceability links established by design engineers. The verification of these annotations consideration and the automatic generation of viewpoints from information contained in the requirements allows us to obtain architectural solutions closer to the customer needs. The conceptual model also gives us the opportunity to capitalize, in different expertise domains, on engineers knowledge. It also enables us to establish a reference model as a basis for discussion and training of new team members
Contrôle de la mobilité et de la QoS dans les réseaux cellulaires tout IP by
Rachid Zagrouba(
Book
)
2 editions published in 2007 in English and held by 4 WorldCat member libraries worldwide
This study deals with QoS and mobility management in the wireless access networks. It is interested in the definition of wireless mobile IP networks both on the access network and the core network. The core network is supposed built on DiffServ and Mobile IP Protocol. We are thus focus mainly in the access network and in particular in the QoS signaling and handover management. The first part of this thesis consists in studying the basic concepts and proposals of QoS and mobility management in wireless IP networks. Then, we give an analysis and comparison of the main frameworks. Next, we define the new challenges for wireless operators and we address some important issues that arise when managing QoS within a wireless IP network. Lastly, we propose a new protocol to provide a set of scenarios and functions needed to couple QoS and mobility management. The proposed protocol, called QoS and Micro Mobility Management (Q3M), enables a network operator to use its network resources more efficiently, increase network performance and minimize signaling traffic. The implementation of Q3M protocol on the France Telecom R&D (Rennes) testbed, as well as the analytical and simulation results, show that Q3M protocol has a good performance in terms of delay establishment of QoS session and blocking probability. The performance of Q3M protocol is very reasonable compared to other related works. The Q3M advantage becomes more important when mobility is high and the network is congested
2 editions published in 2007 in English and held by 4 WorldCat member libraries worldwide
This study deals with QoS and mobility management in the wireless access networks. It is interested in the definition of wireless mobile IP networks both on the access network and the core network. The core network is supposed built on DiffServ and Mobile IP Protocol. We are thus focus mainly in the access network and in particular in the QoS signaling and handover management. The first part of this thesis consists in studying the basic concepts and proposals of QoS and mobility management in wireless IP networks. Then, we give an analysis and comparison of the main frameworks. Next, we define the new challenges for wireless operators and we address some important issues that arise when managing QoS within a wireless IP network. Lastly, we propose a new protocol to provide a set of scenarios and functions needed to couple QoS and mobility management. The proposed protocol, called QoS and Micro Mobility Management (Q3M), enables a network operator to use its network resources more efficiently, increase network performance and minimize signaling traffic. The implementation of Q3M protocol on the France Telecom R&D (Rennes) testbed, as well as the analytical and simulation results, show that Q3M protocol has a good performance in terms of delay establishment of QoS session and blocking probability. The performance of Q3M protocol is very reasonable compared to other related works. The Q3M advantage becomes more important when mobility is high and the network is congested
Reliable context aware security policy deployment - applications to IPv6 environments by
Stere Preda(
Book
)
2 editions published in 2010 in English and held by 4 WorldCat member libraries worldwide
Les réseaux sont aujourd'hui en continue évolution dû aux nouvelles exigences et activités organisationnelles. En parallèle, la protection des ressources doit changer et toute cette gestion devient une tâche difficile pour l'administrateur sécurité. Dans cette thèse, nous adressons plusieurs aspects clés dans le domaine de la sécurité réseaux et proposons des solutions conséquentes : 1. Déploiement des politiques basé sur des modèles de contrôle d'accès. Les diverses données inutiles dans la spécification de la politique seront ainsi éliminées avant le déploiement automatique de la politique abstraite. Les tâches de l'administrateur sont considérablement simplifiées. 2. Développement formel des algorithmes de déploiement. Ces algorithmes doivent être formellement prouvés pour que l'administrateur ait confiance dans le processus de déploiement. 3. La gestion des exigences contextuelles et des fonctionnalités de sécurité insuffisantes. Le modèle de contrôle d'accès doit être assez robuste afin de couvrir les exigences contextuelles. Le problème reste au niveau des composants de sécurité qui ne sont pas toujours capables d'interpréter ces contextes. 4. Nouveaux mécanismes de sécurité IPv6. Nous avons adressé la conception d'un nouveau mécanisme de sécurité IPv6 qui devrait interpréter certains contextes spécifique aux réseaux IPv6. Nos travaux de recherche constituent une approche cohérente et apportent des contributions claires pour garantir une gestion fiable des politiques de sécurité réseaux
2 editions published in 2010 in English and held by 4 WorldCat member libraries worldwide
Les réseaux sont aujourd'hui en continue évolution dû aux nouvelles exigences et activités organisationnelles. En parallèle, la protection des ressources doit changer et toute cette gestion devient une tâche difficile pour l'administrateur sécurité. Dans cette thèse, nous adressons plusieurs aspects clés dans le domaine de la sécurité réseaux et proposons des solutions conséquentes : 1. Déploiement des politiques basé sur des modèles de contrôle d'accès. Les diverses données inutiles dans la spécification de la politique seront ainsi éliminées avant le déploiement automatique de la politique abstraite. Les tâches de l'administrateur sont considérablement simplifiées. 2. Développement formel des algorithmes de déploiement. Ces algorithmes doivent être formellement prouvés pour que l'administrateur ait confiance dans le processus de déploiement. 3. La gestion des exigences contextuelles et des fonctionnalités de sécurité insuffisantes. Le modèle de contrôle d'accès doit être assez robuste afin de couvrir les exigences contextuelles. Le problème reste au niveau des composants de sécurité qui ne sont pas toujours capables d'interpréter ces contextes. 4. Nouveaux mécanismes de sécurité IPv6. Nous avons adressé la conception d'un nouveau mécanisme de sécurité IPv6 qui devrait interpréter certains contextes spécifique aux réseaux IPv6. Nos travaux de recherche constituent une approche cohérente et apportent des contributions claires pour garantir une gestion fiable des politiques de sécurité réseaux
Gestion de la mobilité dans une architecture d'accès multi-technologies by
Philippe Louis Henri Bertin(
Book
)
2 editions published in 2010 in French and held by 4 WorldCat member libraries worldwide
The observed mobile data services usage growth leads to anticipate congestion and quality of service issues in mobile networks. In this thesis, we consider a new architecture approach providing a unified support for different access technologies through a flat distribution of networking functions. This architecture aims to be very simple; it uses only three functional entities: the access node providing network and radio connectivity; the terminal, able to manage either one or several network attachments simultaneously; the interworking gateway. Our contribution focuses on the development of a new mobility management approach adapted to such a distributed architecture: DMA (Dynamic Mobility Anchoring). It considers dynamic mobility anchors activation in access nodes. Mobility management becomes hence fully distributed among those nodes whereas the rest of the network uses standard IP routing. In addition to mobility management, we introduce distributed idle mode management mechanisms adapted to multi-interfaces terminals, allowing the transposition of IP paging solutions to flat heterogeneous networks. For Evaluation purposes, we develop both a simulator and an analytical model for, respectively, distributed mobility management and idle mode support. Beyond to DMA functional validation, our results confirm that our distributed approach, thanks to the removing of mobile traffic concentration in centralised network nodes, enhances the quality of service provided to mobile users. We also outline operator's benefits brought by DMA in terms of mobile networks scalability, engineering and operational costs reduction
2 editions published in 2010 in French and held by 4 WorldCat member libraries worldwide
The observed mobile data services usage growth leads to anticipate congestion and quality of service issues in mobile networks. In this thesis, we consider a new architecture approach providing a unified support for different access technologies through a flat distribution of networking functions. This architecture aims to be very simple; it uses only three functional entities: the access node providing network and radio connectivity; the terminal, able to manage either one or several network attachments simultaneously; the interworking gateway. Our contribution focuses on the development of a new mobility management approach adapted to such a distributed architecture: DMA (Dynamic Mobility Anchoring). It considers dynamic mobility anchors activation in access nodes. Mobility management becomes hence fully distributed among those nodes whereas the rest of the network uses standard IP routing. In addition to mobility management, we introduce distributed idle mode management mechanisms adapted to multi-interfaces terminals, allowing the transposition of IP paging solutions to flat heterogeneous networks. For Evaluation purposes, we develop both a simulator and an analytical model for, respectively, distributed mobility management and idle mode support. Beyond to DMA functional validation, our results confirm that our distributed approach, thanks to the removing of mobile traffic concentration in centralised network nodes, enhances the quality of service provided to mobile users. We also outline operator's benefits brought by DMA in terms of mobile networks scalability, engineering and operational costs reduction
Beyond access control - specifying and deploying security policies in information systems by
Thierry Sans(
Book
)
2 editions published in 2007 in English and held by 4 WorldCat member libraries worldwide
Les services multimédia de type " streaming ", exigent classiquement des performances élevées du réseau (haut débit, faible taux d'erreur et délai bref), en contradiction avec les importantes contraintes que subissent les réseaux sans fil (bande passante limitée, canaux souvent bruités et états de réseau très changeants) . Dans cette thèse, nous étudions l'hypothèse que cet environnement subissant des contraintes importantes exige des architectures spécifiques à l'application, plutôt que des architectures généralistes, afin d'augmenter l'efficacité d'utilisation des ressources du réseau. Plus particulièrement, nous étudions le cas de la compression des en-têtes ROHC de flux vidéo en "streaming" sur les réseaux sans fil. Trois études ont été réalisées. La première étude évalue la performance de ROHC en complément du protocole UDP-Lite. Nous avons constaté que l'utilisation de la bande passante est améliorée par la diminution du taux de perte de paquets. Les deuxième et troisième études considèrent le cas où des utilisateurs joignent un canal commun, de manière aléatoire, pour recevoir la vidéo en " streaming ". Pour que l'affichage de la vidéo démarre, ces utilisateurs doivent attendre la réception de deux contextes, celui de ROHC et celui de la compression vidéo. Des architectures inter-couches, dites " de haut en bas ", ont été développées afin d'adapter les algorithmes de ROHC à ceux de la compression de la vidéo. Nos études montrent que ces architectures parviennent à optimiser l'utilisation de la bande passante, à assurer une robustesse à l'erreur, et à offrir un délai pour démarrer l'affichage de la vidéo plus court que ne le font les architectures généralistes
2 editions published in 2007 in English and held by 4 WorldCat member libraries worldwide
Les services multimédia de type " streaming ", exigent classiquement des performances élevées du réseau (haut débit, faible taux d'erreur et délai bref), en contradiction avec les importantes contraintes que subissent les réseaux sans fil (bande passante limitée, canaux souvent bruités et états de réseau très changeants) . Dans cette thèse, nous étudions l'hypothèse que cet environnement subissant des contraintes importantes exige des architectures spécifiques à l'application, plutôt que des architectures généralistes, afin d'augmenter l'efficacité d'utilisation des ressources du réseau. Plus particulièrement, nous étudions le cas de la compression des en-têtes ROHC de flux vidéo en "streaming" sur les réseaux sans fil. Trois études ont été réalisées. La première étude évalue la performance de ROHC en complément du protocole UDP-Lite. Nous avons constaté que l'utilisation de la bande passante est améliorée par la diminution du taux de perte de paquets. Les deuxième et troisième études considèrent le cas où des utilisateurs joignent un canal commun, de manière aléatoire, pour recevoir la vidéo en " streaming ". Pour que l'affichage de la vidéo démarre, ces utilisateurs doivent attendre la réception de deux contextes, celui de ROHC et celui de la compression vidéo. Des architectures inter-couches, dites " de haut en bas ", ont été développées afin d'adapter les algorithmes de ROHC à ceux de la compression de la vidéo. Nos études montrent que ces architectures parviennent à optimiser l'utilisation de la bande passante, à assurer une robustesse à l'erreur, et à offrir un délai pour démarrer l'affichage de la vidéo plus court que ne le font les architectures généralistes
Contributions to the traffic matrix problem by
Dimitri Marakov(
Book
)
2 editions published in 2007 in English and held by 4 WorldCat member libraries worldwide
This thesis addresses the traffic matrix estimation problem. Knowledge about the origin-destination (OD) traffic matrix (TM) allows us to solve problems in network engineering; the OD traffic matrix gives us a valuable information about who is communicating with whom in a network, at any given time. Traffic analysis, based on detailed packet or flow level measurements, usually not available throughout a large network due to hardware limitations or/and security reasons. An alternative approach is to use mathematical and statistical techniques for the estimation using the incomplete data accessible via SMNP. In my PhD thesis I describe the traffic data collection and, perform a critical evaluation of existing and novel methods for TM estimation on the real and synthetic data, and test the statistical and non-statistical methods. I discuss the weaknesses and strengths of the various methods, and highlight differences in the results for the simulated traffic and the real one obtained from European and American subnetworks. This research also addresses the variability of Internet traffic in backbone networks is essential for the creation of the better traffic model (vital for the estimation techniques), to better plan and manage existing networks, as well as to design next generation networks. I show the difference between the real traffic in high-bandwidth networks with the classic and most commonly used traffic models, propose a high-bandwidth TM simulation technique which can help with the evaluation of the traffic matrix algorithms in the case when the real TM necessary for the algorithms verification is difficult to obtain
2 editions published in 2007 in English and held by 4 WorldCat member libraries worldwide
This thesis addresses the traffic matrix estimation problem. Knowledge about the origin-destination (OD) traffic matrix (TM) allows us to solve problems in network engineering; the OD traffic matrix gives us a valuable information about who is communicating with whom in a network, at any given time. Traffic analysis, based on detailed packet or flow level measurements, usually not available throughout a large network due to hardware limitations or/and security reasons. An alternative approach is to use mathematical and statistical techniques for the estimation using the incomplete data accessible via SMNP. In my PhD thesis I describe the traffic data collection and, perform a critical evaluation of existing and novel methods for TM estimation on the real and synthetic data, and test the statistical and non-statistical methods. I discuss the weaknesses and strengths of the various methods, and highlight differences in the results for the simulated traffic and the real one obtained from European and American subnetworks. This research also addresses the variability of Internet traffic in backbone networks is essential for the creation of the better traffic model (vital for the estimation techniques), to better plan and manage existing networks, as well as to design next generation networks. I show the difference between the real traffic in high-bandwidth networks with the classic and most commonly used traffic models, propose a high-bandwidth TM simulation technique which can help with the evaluation of the traffic matrix algorithms in the case when the real TM necessary for the algorithms verification is difficult to obtain
Conception d'une infrastructure pour un déploiement sûr et flexible des composants logiciels by
Meriem Belguidoum(
Book
)
2 editions published in 2008 in French and held by 4 WorldCat member libraries worldwide
Software deployment is a complex task because it requires numerous dependent actions to be carried out. It covers all the activities of the software life cycle from its development to its use. In this work, we are interested in the installation, deinstallation and update activities. At the same time, applications are becoming more complex, causing an explosion in their size. To facilitate their management and reuse, they are represented as collections of components that are shared between several applications. Thus, deploying an application will affect all the applications that use it. Such an operation requires prior knowledge of the architecture of the applications with all their dependencies. The current approaches for managing deployment are often ad hoc and necessitate the intervention of experts to solve problems and carry out the deployment. Moreover, there is no way to guarantee the correctness of the deployment operation. Therefore, it is necessary to change to more structured, flexible and reliable approaches to be able to verify the deployment. Hence, we propose a generic meta-model for automatic component deployment and a formal system to check and ensure correct deployment. The metamodel represents the main deployment concepts so it can be re-used in several contexts. The formal system represents the mathematical description of the generic model. It allows the success and safety (maintaining consistency of the system) of the deployment operations to be demonstrated and proved. Finally, we propose a formal system which integrates the non-functional properties (version, level of security, performance, etc.) in managing the deployment. The interest of these properties is that they can take into account multiple instances of the same component or the same service in order to personalize deployment, depending on the target system
2 editions published in 2008 in French and held by 4 WorldCat member libraries worldwide
Software deployment is a complex task because it requires numerous dependent actions to be carried out. It covers all the activities of the software life cycle from its development to its use. In this work, we are interested in the installation, deinstallation and update activities. At the same time, applications are becoming more complex, causing an explosion in their size. To facilitate their management and reuse, they are represented as collections of components that are shared between several applications. Thus, deploying an application will affect all the applications that use it. Such an operation requires prior knowledge of the architecture of the applications with all their dependencies. The current approaches for managing deployment are often ad hoc and necessitate the intervention of experts to solve problems and carry out the deployment. Moreover, there is no way to guarantee the correctness of the deployment operation. Therefore, it is necessary to change to more structured, flexible and reliable approaches to be able to verify the deployment. Hence, we propose a generic meta-model for automatic component deployment and a formal system to check and ensure correct deployment. The metamodel represents the main deployment concepts so it can be re-used in several contexts. The formal system represents the mathematical description of the generic model. It allows the success and safety (maintaining consistency of the system) of the deployment operations to be demonstrated and proved. Finally, we propose a formal system which integrates the non-functional properties (version, level of security, performance, etc.) in managing the deployment. The interest of these properties is that they can take into account multiple instances of the same component or the same service in order to personalize deployment, depending on the target system
A smart management framework for multihomed mobile nodes & mobile routers by
Rayene Ben Rayana(
Book
)
2 editions published in 2010 in English and held by 4 WorldCat member libraries worldwide
Mobile communication technologies are now moving toward full heterogeneity support. Fourth-generation mobile devices incorporate multiple interfaces with diverse access technologies. The next step: derive benefit from this heterogeneity to ensure a ubiquitous and inexpensive access to mobile devices through multihoming. However, being multihomed is intrinsically complicated. It raises several issues such as energy overconsumption, additional usage costs and it strongly motivates the proposal of decision mechanisms to choose the "right" access networks among the available ones. This thesis describes SmartMob6: A mobility management framework that addresses these issues. A decision algorithm selects the most "useful" networks and proposes to deactivate the unused interfaces to save energy and money. For the dynamic evaluation of a network utility, it suggests to combine the flow's QoS and security requirements with the network characteristics. Flows are distributed over the remaining interfaces whith respect to their compatibility and their priority. This decision takes into account high-level policies coming from the administrator and also from operators as well as ISPs. In addition, the framework supports adaptive applications: When the resource level decreases, applications are asked to reduce their expectations to ensure a minimal service level. In this manuscript, we adapt these ideas to the contexts of IPv6 Mobility (Mobile IPv6, NEMO) and Intelligent Transportation Systems (ITS); we present the results of a testbed experimentation and we introduce NetPyLab: a simulator developed to test the framework
2 editions published in 2010 in English and held by 4 WorldCat member libraries worldwide
Mobile communication technologies are now moving toward full heterogeneity support. Fourth-generation mobile devices incorporate multiple interfaces with diverse access technologies. The next step: derive benefit from this heterogeneity to ensure a ubiquitous and inexpensive access to mobile devices through multihoming. However, being multihomed is intrinsically complicated. It raises several issues such as energy overconsumption, additional usage costs and it strongly motivates the proposal of decision mechanisms to choose the "right" access networks among the available ones. This thesis describes SmartMob6: A mobility management framework that addresses these issues. A decision algorithm selects the most "useful" networks and proposes to deactivate the unused interfaces to save energy and money. For the dynamic evaluation of a network utility, it suggests to combine the flow's QoS and security requirements with the network characteristics. Flows are distributed over the remaining interfaces whith respect to their compatibility and their priority. This decision takes into account high-level policies coming from the administrator and also from operators as well as ISPs. In addition, the framework supports adaptive applications: When the resource level decreases, applications are asked to reduce their expectations to ensure a minimal service level. In this manuscript, we adapt these ideas to the contexts of IPv6 Mobility (Mobile IPv6, NEMO) and Intelligent Transportation Systems (ITS); we present the results of a testbed experimentation and we introduce NetPyLab: a simulator developed to test the framework
ISIVC'04 : proceedings : 2d International Symposium on Image/Video Communications over fixed and mobile networks = 2è Colloque
International sur les communications Image/Vidéo sur les réseaux fixes et mobiles by International symposium on Image/Video Communications over fixed and mobile networks(
Book
)
1 edition published in 2004 in English and held by 4 WorldCat member libraries worldwide
1 edition published in 2004 in English and held by 4 WorldCat member libraries worldwide
Séquences binaires et traitements du signal by
Khalid Minaoui(
Book
)
2 editions published in 2010 in French and held by 4 WorldCat member libraries worldwide
The main task of radars (Radio Detection and Ranging) is to detect targets and to determine their distance from the radar transmitter. They have been studied in numerous academic and industrial developments. These developments concern in particular onboard radars that are now being developed for several applications in consumer electronic devices. Recent developments in radar systems have been made possible thanks to advances in electronics, computing and signals processing. This thesis aims to contribute to the radar signal processing and particularly for applications related to collision avoidance systems. This work was developed along two main axes. On one hand, we have contributed to the study of radar waveforms constituted by pseudo-random sequences. In this context, we first examined the sequences presented in the literature by recalling their performance in terms of the merit factor, defined as the ratio between the energy of the main peak and the correlation of secondary lobes of the autocorrelation function. Given the difficulty of building very efficient waveforms constituted by sequences of contiguous symbols, we have considered then the use of Golay pairs, and more generally Golay sets, which have an infinite merit factor when they are separated by guard intervals. More generally, we have highlighted the good properties of their ambiguity functions. In particular, we have checked that the multipulse emission of Golay sequences allows good rejection of the ambiguity function side lobes, and very good estimation of the parameters of distance and relative speed of other vehicles. The second theme developed in this thesis concerns the rapid calculation of the cross-ambiguity function between a sent wave and the received echoes. This calculation makes it possible to simultaneously locate a set of targets in the time-frequency plane. In this context, we have studied Gauss-Legendre and Clenshaw-Curtis quadrature techniques, for which we have studied analytically the disturbances on the quadrature introduced by the fact that they must be calculated from sampled signals. In addition, with a view to reduce the computational complexity of the calculation of ambiguity functions, we have considered number theoretic transforms, and in particular Fermat number transforms, for which multiplications simply amount to bit shifts, leading thus to significant computational burden reduction
2 editions published in 2010 in French and held by 4 WorldCat member libraries worldwide
The main task of radars (Radio Detection and Ranging) is to detect targets and to determine their distance from the radar transmitter. They have been studied in numerous academic and industrial developments. These developments concern in particular onboard radars that are now being developed for several applications in consumer electronic devices. Recent developments in radar systems have been made possible thanks to advances in electronics, computing and signals processing. This thesis aims to contribute to the radar signal processing and particularly for applications related to collision avoidance systems. This work was developed along two main axes. On one hand, we have contributed to the study of radar waveforms constituted by pseudo-random sequences. In this context, we first examined the sequences presented in the literature by recalling their performance in terms of the merit factor, defined as the ratio between the energy of the main peak and the correlation of secondary lobes of the autocorrelation function. Given the difficulty of building very efficient waveforms constituted by sequences of contiguous symbols, we have considered then the use of Golay pairs, and more generally Golay sets, which have an infinite merit factor when they are separated by guard intervals. More generally, we have highlighted the good properties of their ambiguity functions. In particular, we have checked that the multipulse emission of Golay sequences allows good rejection of the ambiguity function side lobes, and very good estimation of the parameters of distance and relative speed of other vehicles. The second theme developed in this thesis concerns the rapid calculation of the cross-ambiguity function between a sent wave and the received echoes. This calculation makes it possible to simultaneously locate a set of targets in the time-frequency plane. In this context, we have studied Gauss-Legendre and Clenshaw-Curtis quadrature techniques, for which we have studied analytically the disturbances on the quadrature introduced by the fact that they must be calculated from sampled signals. In addition, with a view to reduce the computational complexity of the calculation of ambiguity functions, we have considered number theoretic transforms, and in particular Fermat number transforms, for which multiplications simply amount to bit shifts, leading thus to significant computational burden reduction
Mécanismes de routage inter-domaine multi-critère : vers des services inter-opérateurs à performances garanties by
Gilles Bertrand(
Book
)
in French and held by 4 WorldCat member libraries worldwide
The issue of providing Quality of Service (QoS) in the Internet is becoming more and more important because of two phenomena: (1) the growth of the value added services that require QoS (e.g., VPNs, IPTV) and (2) network convergence towards a unified IP-based architecture, for voice, image and data services. In this context, the limitations of existing QoS technologies emerge: it is currently difficult for an operator to guarantee that its network can offer a specific level of service. Furthermore, it is hard to ensure a consistent treatment of end-to-end QoS-sensitive flow that cross networks controlled by several operators. Indeed, the control on such traffic flows is shared between all the traversed operators. In the thesis, we have studied these issues. Specifically, we have addressed the problems of routing and dynamic traffic engineering at inter-domain level. We have proposed several algorithmic solutions to compute paths subject to multiple performance constraints. Analytical studies and simulations show that our algorithms are efficient and scalable. Finally, we have integrated our solutions into an architecture that is under ongoing standardization by the IETF and we have studied the protocol adaptations required for the deployment of our algorithms. Our work represents an important step towards more effective inter-domain traffic management in traffic engineered networks
in French and held by 4 WorldCat member libraries worldwide
The issue of providing Quality of Service (QoS) in the Internet is becoming more and more important because of two phenomena: (1) the growth of the value added services that require QoS (e.g., VPNs, IPTV) and (2) network convergence towards a unified IP-based architecture, for voice, image and data services. In this context, the limitations of existing QoS technologies emerge: it is currently difficult for an operator to guarantee that its network can offer a specific level of service. Furthermore, it is hard to ensure a consistent treatment of end-to-end QoS-sensitive flow that cross networks controlled by several operators. Indeed, the control on such traffic flows is shared between all the traversed operators. In the thesis, we have studied these issues. Specifically, we have addressed the problems of routing and dynamic traffic engineering at inter-domain level. We have proposed several algorithmic solutions to compute paths subject to multiple performance constraints. Analytical studies and simulations show that our algorithms are efficient and scalable. Finally, we have integrated our solutions into an architecture that is under ongoing standardization by the IETF and we have studied the protocol adaptations required for the deployment of our algorithms. Our work represents an important step towards more effective inter-domain traffic management in traffic engineered networks
Privacy protection for location-based services by
Nabil Ajam(
Book
)
2 editions published in 2010 in English and held by 4 WorldCat member libraries worldwide
Dans cette thèse, nous nous intéressons à l'expression des principes de protection de la vie privée. Nous spécifions ces exigences de vie privée en proposant de les introduire dans les modèles des politiques de sécurité existants. Ainsi, nous suggérons l'application d'un seul modèle pour le contrôle d'accès et la protection de la vie privée. Le modèle de contrôle d'accès doit être étendu par de nouvelles conditions d'accès et de paramètres, à savoir les contextes, constituant les exigences de la vie privée. Pour cela, nous définissons le modèle Privacy-aware Organisation-Based Access Control (PrivOrBAC). L'administration de PrivOrBAC est manifestement différente des modèles d'administration des modèles contrôles d'accès. Nous identifions trois cas à introduire dans le modèle d'administration. Premièrement, à cause de l'attractivité des nouveaux services, les utilisateurs définissent généralement une politique de vie privée trop permissive qui ne correspond pas réellement à leurs préférences. Nous proposons que le contrôleur des données puisse prendre en charge la définition de la politique en se basant sur le contrat de service (SLA) incluant les préférences utilisateurs. Deuxièmement, le modèle d'administration doit prendre en compte la modélisation des interceptions légales. Cet accès est prioritaire vis à vis des préférences utilisateurs. Troisièmement, nous présentons le cas où les deux organisations, le contrôleur de données et les fournisseurs de services, doivent partager l'accès à la même ressource. Grâce au modèle d'interopérabilité O2O, les préférences utilisateurs peuvent être propagées et ainsi respectées par les organisations tierces demandant l'accès. Nous nous sommes focalisés sur les données de localisation qui représentent les données privées à protéger dans notre étude. Nous proposons une architecture prête à être déployer dans les systèmes d'information des services de localisation (LBS). Nous utilisons MotOrBAC, le prototype du modèle OrBAC, pour adapter notre solution au cadre des réseaux cellulaires. Nous avons aussi étendu la passerelle Parlay X par une nouvelle Privacy web service pour permettre un accès sécurisé et respectant la vie privée des fournisseurs de services aux données enregistrées dans les réseaux cellulaires
2 editions published in 2010 in English and held by 4 WorldCat member libraries worldwide
Dans cette thèse, nous nous intéressons à l'expression des principes de protection de la vie privée. Nous spécifions ces exigences de vie privée en proposant de les introduire dans les modèles des politiques de sécurité existants. Ainsi, nous suggérons l'application d'un seul modèle pour le contrôle d'accès et la protection de la vie privée. Le modèle de contrôle d'accès doit être étendu par de nouvelles conditions d'accès et de paramètres, à savoir les contextes, constituant les exigences de la vie privée. Pour cela, nous définissons le modèle Privacy-aware Organisation-Based Access Control (PrivOrBAC). L'administration de PrivOrBAC est manifestement différente des modèles d'administration des modèles contrôles d'accès. Nous identifions trois cas à introduire dans le modèle d'administration. Premièrement, à cause de l'attractivité des nouveaux services, les utilisateurs définissent généralement une politique de vie privée trop permissive qui ne correspond pas réellement à leurs préférences. Nous proposons que le contrôleur des données puisse prendre en charge la définition de la politique en se basant sur le contrat de service (SLA) incluant les préférences utilisateurs. Deuxièmement, le modèle d'administration doit prendre en compte la modélisation des interceptions légales. Cet accès est prioritaire vis à vis des préférences utilisateurs. Troisièmement, nous présentons le cas où les deux organisations, le contrôleur de données et les fournisseurs de services, doivent partager l'accès à la même ressource. Grâce au modèle d'interopérabilité O2O, les préférences utilisateurs peuvent être propagées et ainsi respectées par les organisations tierces demandant l'accès. Nous nous sommes focalisés sur les données de localisation qui représentent les données privées à protéger dans notre étude. Nous proposons une architecture prête à être déployer dans les systèmes d'information des services de localisation (LBS). Nous utilisons MotOrBAC, le prototype du modèle OrBAC, pour adapter notre solution au cadre des réseaux cellulaires. Nous avons aussi étendu la passerelle Parlay X par une nouvelle Privacy web service pour permettre un accès sécurisé et respectant la vie privée des fournisseurs de services aux données enregistrées dans les réseaux cellulaires
more
fewer
Audience Level
| 0 |
 |
1 | ||
| Kids | General | Special | ||
Related Identities
- Université européenne de Bretagne Other Degree grantor
- École doctorale Santé, information-communication et mathématiques, matière (Brest, Finistère) Other Degree grantor
- Institute of Electrical and Electronics Engineers
- École doctorale Mathématiques, télécommunications, informatique, signal, systèmes, électronique (Rennes) Other
- Institute of Electrical and Electronics Engineers French Section
- Université de Rennes 1 Other Degree grantor
- Université de Bretagne Sud Other Degree grantor
- Lagrange, Xavier (19..-....; ingénieur) Opponent Thesis advisor
- Cuppens, Frédéric (1962-....). Opponent Thesis advisor
- Université de Bretagne occidentale Other Degree grantor Editor
Useful Links
Alternative Names
École nationale supérieure des télécommunications de Bretagne
ENST Bretagne
ENST de Bretagne
ENST de Bretagne Brest, Finistère
Sup-Télécom Bretagne
Télécom Bretagne
Telecom Bretagne Brest, Finistère
ブルターニュ電気通信国立大学
布列塔尼電信學院
Languages