O jitter de fase é um fenômeno inerente nos sistemas elétricos. O crescente interesse pelo jitter deve-se à degradação que causa em sistemas de transmissão de alta velocidade. Seus efeitos fazem-se sentir ao afetar o processo de recuperação de dados, causando aumento na taxa de erros por bit. Neste trabalho, o jitter é modelado como uma perturbação periódica e seu efeito na operação de PLLs é analisado. Deduzimos uma fórmula para o cálculo da amplitude do jitter envolvendo somente os parâmetros do PLL e do jitter e identificamos as regiões do espaço de parâmetros com os comportamentos dinâmicos do PLL. / Phase jitter or timing jitter is an inherent phenomenum on electrical systems. Jitter growing interest is due to degradation it causes in high-speed transmission systems. It affects the data recovering process and it causes an increase in the bit error rate. In this work, jitter is modelled as a periodic perturbation and its effects in the operation of a PLL are analysed. We deduce a formula that measures jitter amplitude by PLL and jitter parameters and we identify the regions of parameter space according to the system dynamical behaviour.

As of late there has been an immense increase of data within modern society. This is evident within the field of telecommunications. The amount of mobile data is growing fast. For a telecommunication operator, this provides means of getting more information of specific subscribers. The applications of this are many, such as segmentation for marketing purposes or detection of churners, people about to switching operator. Thus the analysis and information extraction is of great value. An approach of this analysis is that of social network analysis. Utilizing such methods yields ways of finding the importance of each individual subscriber in the network. This thesis aims at investigating the usefulness of social network analysis in telecommunication networks. As these networks can be very large the methods used to study them must scale linearly when the network size increases. Thus, an integral part of the study is to determine which social network analysis algorithms that have this scalability. Moreover, comparisons of software solutions are performed to find product suitable for these specific tasks. Another important part of using social network analysis is to be able to interpret the results. This can be cumbersome without expert knowledge. For that reason, a complete process flow for finding influential subscribers in a telecommunication network has been developed. The flow uses input easily available to the telecommunication operator. In addition to using social network analysis, machine learning is employed to uncover what behavior is associated with influence and pinpointing subscribers behaving accordingly.

Cette thèse propose un schéma entièrement distribué de routage résilient pour les réseaux de switches. Dans cette approche une panne est traitée localement ; ainsi les autres nœuds du réseau n’ont pas besoin de prendre des mesures spécifiques. Contrairement aux systèmes classiques de routage IP qui se base uniquement sur la destination, le routage est fait en se basant sur l’arc de l’entrée et la destination. La contrainte qui en résulte est que les deux flux à la même destination entrant dans un nœud par un arc commun doivent fusionner après cet arc. Nous montrons que sous des faibles hypothèses (en supposant que le réseau est symétrique et bi-connexes au sens des liens), il existe un schéma de routage résilient pour toutes les situations de pannes simples de liens. Nous modélisons le problème de dimensionnement par un programme linéaire en nombres entiers qui peut être résolu exactement pour des réseaux de taille modeste. Nous proposons également plusieurs heuristiques pour traiter des instances de grande taille. Notre méthode généralise les méthodes de la littérature, en particulier celles de Xi et al. et de Nelakuditi et al. qui ont proposé des approches similaires. Notre approche permet d’obtenir de meilleurs résultats sur de nombreuses instances de test. Nous avons également étudié l’existence d’un schéma de routage résilient pour situation de panne de nœud dans le réseau basée sur les switches. Nous montrons que dans le cas des pannes de plusieurs liens, la condition de connexité n’est pas suffisante. / This thesis presents a fully distributed resilient routing scheme for switch-based networks. A failure is treated locally, so other nodes in the network do not need to undertakespecial actions. In contrast to conventional IP routing schemes, each node routesthe traffic on the basis of the entering arc and of the destination. The resulting constraintis that two flows to the same destination entering in a node by a common archave to merge after this arc. We show that this is sufficient for dealing with all singlelink failure situations, assuming that the network is symmetric and two-link connected.We model the dimensioning problem with an Integer Linear Program which can besolved exactly for small networks. We also propose several heuristics for larger networks.Our method generalizes the methods of Xi et Chao and Li and of Nelakuditiet al. who have proposed similar schemes in the context of IP. Our methods are moreefficient than previous ones. We have also studied the existence of a resilient routingscheme for single node failure situation in switch-based network. We study also thecase of multi-link failure situations and show that requiring the network to be connectedafter any failure does not guarantee the existence of a resilent routing schemeas described above.

Les réseaux Telecom sont désormais en charge du transport d’une large variété de trafic de types donnés, voix, vidéo et autres protocoles industriels réclamant des garantie de qualité de service strictes. L’ingénierie de trafic permet non seulement d’optimiser les ressources réseaux mais aussi de parvenir à garantir ces qualités de service exprimées en termes de délais dans le réseau, de gigue mais aussi de taux de disponibilité en présence de pannes de liens ou de nœuds. La technologie MPLS TE, basée sur la commutation de labels le long de chemins contraints a permis d’atteindre ces objectifs et fut déployée dans de nombreux réseaux. L’objectif de cette thèse est de proposer un nouveau modèle architectural nommé PCE, ainsi que des protocoles et algorithmes novateurs afin de résoudre plusieurs problèmes d’envergure liés à l’ingénierie de trafic et disponibilité du réseau. L’architecture PCE est tout d’abord décrite ainsi que le protocole de signalisation PCEP utilisé entre clients et serveurs, puis les protocoles de découvertes de PCE et algorithmes de partage de charge. Ensuite un nouvel algorithme récursif est spécifié permettant grâce à un calcul collaboratif et récursif distribué impliquant une suite de PCEs de calculer le chemin optimal pour des tunnels inter-domaines. Un nouveau paradigme pour le calcul des chemin de secours est spécifié qui permet à chaque nœud d’agir en tant que PCE pour le calcul des tunnels de secours de chacun de ses voisins dans l’hypothèse que sa propre panne, permettant une utilisation partagée des ressources réseau dédiées au secours pour des tunnels protégeant des ressources indépendantes... / Modern data networks carry a wide variety of traffic such as voice, video, data and other industrial protocols that require guaranteed quality of service. Traffic Engineering (TE) allows for network resource optimization while meeting service level agreement for these sensitive traffics in terms of delays, jitter but also network reliability in case of network element failure. To that end a technology making use of constrained paths using label switching (called MPLS TE) has been developed and widely used in a number of networks. The objective of this thesis is to propose a new architecture model referred to as the Path Computation Element (PCE) along with a number of protocols and algorithms in order to tackle a number of technical challenges. First the PCE architecture is described in terms of functional blocks with its protocols: the signalization protocol called PCEP used between client and servers in charge of computing label switched path in the network, the process of PCE discovery and load balancing. Then a new backward recursive algorithm is specified allowing for the computation of optimal inter-domain tunnels, which involves a series of stateless PCEs. We then introduce a paradigm shift consisting distributing the computation of backup tunnels in the network used by the well-known technology called Fast Reroute. Thanks to this new paradigm, each node independently acts as a PCE computing the back tunnels of all of its neighbors, thus maximizing the degree of sharing of the backup capacity among tunnels that protect independent resources. We conclude this thesis by showing how the PCE architecture can be applied (with adaptations specified in the last two chapt...

With the development of the internet protocol (IP) and digitization for the global telecommunication industry, the convergence rate of communications and broadcasting has been improved. According to these motives, the domestic telecommunication industry modify present commercial operation managements and combine with the communication networks, the fixed-mobile communication (FMC) networks, and the mobile communication networks into the all-internet protocol (all-IP) communication network structure based on the extended upgrade communication network system. The domestic telecommunication industry expect that the integrated heterogeneous network, including the speech data, the video data, and the communication services, which can provide the omnipresent customizable mobile communication network services and obtain the advance business opportunities in terms of the future development of digital convergence. Hence, the domestic telecommunication industry not only build the next generation network structure to satisfy their demands, but also develop the management information system (MIS) to monitor the operation of telecommunication networks for ensure the quality of communication services and achieve the development of next generation networks. A primary consideration is to assure the usability of MIS for the telecommunication industry and the customers based on the profit rates and the omnipresent mobile network services, respectively¡C However, the current status of the telecommunication industry that meet the many difficult challenges and problems to construct the next generation MIS. For examples, the all-IP-based open network structure will be used instead of the close network structure, the different generation telecommunication systems combine with the operation and maintenance information system, the information security incident, and so on. It is must to consider highly of these situations between the major links above. Otherwise, the service usability of MIS will be destroyed. In this thesis, we adopt the case study approach to analyze the MIS construction process of the domestic telecommunication operator. During the build process, the MIS construction of next generation telecommunication networks must to suffice for the flexibility, the safety, and the stabilization and need to make sure the critical mission on stable operation condition, the lower service interruption, the higher usability. The implementation of the next generation MIS, which will help support the crucial operation procedure of the conglomerate and cope with the fast variation of the market demands.

This research is concerned with the development of algorithmic approaches for solving problems that arise in the design and analysis of telecommunication networks, location-allocation distribution contexts, and intelligent transportation networks. Specifically, the corresponding problems addressed in these areas are a local access and transport area (LATA) network design problem, the discrete equal-capacity p-median problem (PMED), and the estimation of dynamic origin-destination path ows or trip tables in a general network. For the LATA network problem, we develop a model and apply the Reformulation-Linearization Technique (RLT) to construct various enhanced tightened versions of the proposed model. We also design efficient Lagrangian dual schemes for solving the linear programming relaxation of the various enhanced models, and construct an effective heuristic procedure for deriving good quality solutions in this process. Extensive computational results are provided to demonstrate the progressive tightness resulting from the enhanced formulations and their effect on providing good quality feasible solutions. The results indicate that the proposed procedures typically yield solutions having an optimality gap of less than 2% with respect to the derived lower bound, within a reasonable effort that involves the solution of a single linear program. For the discrete equal-capacity p-median problem, we develop various valid inequalities, a separation routine for generating cutting planes via specific members of such inequalities, as well as an enhanced reformulation that constructs a partial convex hull representation that subsumes an entire class of valid inequalities via its linear programming relaxation. We also propose suitable heuristic schemes for solving this problem, based on sequentially rounding the continuous relaxation solutions obtained for the various equivalent formulations of the problem. Extensive computational results are provided to demonstrate the effectiveness of the proposed valid inequalities, enhanced formulations, and heuristic schemes. The results indicate that the proposed schemes for tightening the underlying relaxations play a significant role in enhancing the performance of both exact and heuristic solution methods for solving this class of problems. For the estimation of dynamic path ows in a general network, we propose a parametric optimization approach to estimate time-dependent path ows, or origin-destination trip tables, using available data on link traffic volumes for a general road network. Our model assumes knowledge of certain time-dependent link ow contribution factors that are a dynamic generalization of the path-link incidence matrix for the static case. We propose a column generation approach that uses a sequence of dynamic shortest path subproblems in order to solve this problem. Computational results are presented on several variants of two sample test networks from the literature. These results indicate the viability of the proposed approach for use in an on-line mode in practice. Finally, we present a summary of our developments and results, and offer several related recommendations for future research. / Ph. D.

Active Queue Management (AQM) schemes are used for ensuring the Quality of Service (QoS) in telecommunication networks. However, they are sensitive to parameter settings and have weaknesses in detecting and controlling congestion under dynamically changing network situations. Another drawback for the AQM algorithms is that they have been applied only on the Markovian models which are considered as Short Range Dependent (SRD) traffic models. However, traffic measurements from communication networks have shown that network traffic can exhibit self-similar as well as Long Range Dependent (LRD) properties. Therefore, it is important to design new algorithms not only to control congestion but also to have the ability to predict the onset of congestion within a network. An aim of this research is to devise some new congestion control methods for communication networks that make use of various traffic characteristics, such as LRD, which has not previously been employed in congestion control methods currently used in the Internet. A queueing model with a number of ON/OFF sources has been used and this incorporates a novel congestion prediction algorithm for AQM. The simulation results have shown that applying the algorithm can provide better performance than an equivalent system without the prediction. Modifying the algorithm by the inclusion of a sliding window mechanism has been shown to further improve the performance in terms of controlling the total number of packets within the system and improving the throughput. Also considered is the important problem of maintaining QoS constraints, such as mean delay, which is crucially important in providing satisfactory transmission of real-time services over multi-service networks like the Internet and which were not originally designed for this purpose. An algorithm has been developed to provide a control strategy that operates on a buffer which incorporates a moveable threshold. The algorithm has been developed to control the mean delay by dynamically adjusting the threshold, which, in turn, controls the effective arrival rate by randomly dropping packets. This work has been carried out using a mixture of computer simulation and analytical modelling. The performance of the new methods that have.

Le développement fulgurant des technologies de l’information et de la communication et singulièrement internet au Cameroun a été suivi par un discours marqué d’une certaine passion autour de la mise en oeuvre de la société de l’information. Sans être réticents aux innovations introduites par les nouveaux moyens de télécommunications, nous avons voulu signaler que « l’entrée du Cameroun dans la société de l’information » pose un certain nombre de questions par rapport aux infrastructures de télécommunications, aux réseaux de télécommunications, à la concurrence dans le secteur des télécommunications, etc.…auxquelles il convient d’apporter des réponses claires et précises. Par ailleurs, la réflexion juridique exige une certaine distance vis-à-vis de ces technologies dans la mesure où il se développe des dérapages et atteintes auxquelles s’ajoutent la complexité et la technicité de la matière. Il est alors nécessaire de se doter d’outils pouvant contribuer à les prévenir ou les sanctionner, dans le respect des règles démocratiques. / The lightning development of information and communication technologies and particularly internet in Cameroon was followed by a speech marked with a certain passion around the implémentation of the information society. Without being reluctant to the innovations introduced by the new means of telecommunications, we wanted to indicate that " the entry into the information society " set down certain number of questions with regard to the infrastructures of telecommunications, to the telecommunication networks, to the competition in the sector of telecommunications, etc… to which it is advisable to bring clear and precise answers. Besides, the legal reflection requires a certain distance towards these technologies as far as it develops skids and infringements to which are added the complexity and the technicality of the subject. It is then necessary to be equipped with tools which can contribute to prevent or to sanction them, in the respect for the democratic rules.

Call quality has been crucial from the inception of telecommunication networks. Operators need to monitor call quality from the end-user's perspective, in order to retain subscribers and reduce subscriber 'churn'. Operators worry not only about call quality and interconnect revenue loss, but also about network connectivity issues in areas where mobile network gateways are prevalent. Bandwidth quality as experienced by the end-user is equally important in helping operators to reduce churn. The parameters that network operators use to improve call quality are mainly from the end-user's perspective. These parameters are usually ASR (answer seizure ratio), PDD (postdial delay), NER (network efficiency ratio), the number of calls for which these parameters have been analyzed and successful calls. Operators use these parameters to evaluate and optimize the network to meet their quality requirements. Analysis of speech quality is a major arena for research. Traditionally, users' perception of speech quality has been measured offline using subjective listening tests. Such tests are, however, slow, tedious and costly. An alternative method is therefore needed; one that can be automatically computed on the subscriber's handset, be available to the operator as well as to subscribers and, at the same time, provide results that are comparable with conventional subjective scores. QMeter® 'a set of tools for signal and bandwidth measurement that have been developed bearing in mind all the parameters that influence call and bandwidth quality experienced by the end-user' addresses these issues and, additionally, facilitates dynamic tariff propositions which enhance the credibility of the operator. This research focuses on call quality parameters from the end-user's perspective. The call parameters used in the research are signal strength, successful call rate, normal drop call rate, and hand-over drop rate. Signal strength is measured for every five milliseconds of an active call and average signal strength is calculated for each successful call. The successful call rate, normal drop rate and hand-over drop rate are used to achieve a measurement of the overall call quality. Call quality with respect to bundles of 10 calls is proposed. An attempt is made to visualize these parameters for better understanding of where the quality is bad, good and excellent. This will help operators, as well as user groups, to measure quality and coverage. Operators boast about their bandwidth but in reality, to know the locations where speed has to be improved, they need a tool that can effectively measure speed from the end-user's perspective. BM (bandwidth meter), a tool developed as a part of this research, measures the average speed of data sessions and stores the information for analysis at different locations. To address issues of quality in the subscriber segment, this research proposes the varying of tariffs based on call and bandwidth quality. Call charging based on call quality as perceived by the end-user is proposed, both to satisfy subscribers and help operators to improve customer satisfaction and increase average revenue per user. Tariff redemption procedures are put forward for bundles of 10 calls and 10 data sessions. In addition to the varying of tariffs, quality escalation processes are proposed. Deploying such tools on selected or random samples of users will result in substantial improvement in user loyalty which, in turn, will bring operational and economic advantages.

La diversité croissante des différents agents constituant les réseaux de communication actuels ainsi que la capacité accrue des technologies concurrentes dans l’environnement réseau a conduit à la prise en compte d’une nouvelle approche distribuée de la gestion du réseau. Dans cet environnement réseau évolué, le besoin en accroissement de la bande passante et en ressources rares, s’oppose à la réduction de la consommation énergétique globale.Dans notre travail nous nous intéressons à l’application de mécanismes distribués et de méthodes d’apprentissages visant à introduire d’avantage d’autonomie dans les réseaux hétérogènes, mobiles en particulier, tout en améliorant les performances par rapport aux débits et à la qualité de service. Notre étude se concentre principalement sur l’élaboration de mécanismes distribués stochastiques et énergétiquement efficaces en profitant des capacités de calcul de tous les agents et entités du réseau. Divers outils de la théorie des jeux nous permettent de modéliser et d’étudier différents types de systèmes dont la complexité est induite par la grande taille, l’hétérogénéité et le caractère dynamique des interconnexions. Plus spécifiquement, nous utilisons des outils d’apprentissage par renforcement pour aborder des questions telles que l’attachement distribué des utilisateurs permettant une gestion dynamique, décentralisée et efficace des ressources radio. Nous combinons ensuite les procédures de sélection d’accès à des méthodes d’optimisation distribuées du type gradient stochastique, pour adresser le problème de coordination des interférences intercellulaires (ICIC) dans les réseaux LTE-A. Cette approche se base sur un contrôle de puissance dynamique conduisant à une réutilisation fractionnaire des fréquences radios. Par ailleurs nous adressons dans les réseaux décentralisés non-hiérarchiques, plus précisément les réseaux tolérants aux délais (DTNs), des méthodes décentralisées liées à la minimisation du délai de transmission de bout en bout. Dans ce cadre nous nous intéressons, en outre des équilibres de Nash, à la notion d’équilibre évolutionnairement stables dans différents contextes de jeux évolutionnaires, jeux évolutionnaires décisionnels markoviens et jeux de minorité. Enfin, la majeure partie du travail effectué se rattachant aux tests et validations par simulations,nous présentons plusieurs éléments d’implémentations et d’intégrations liés à la mise en place de plateformes de simulations et d’expérimentations / Growing diversity of agents in current communication networks and increasing capacitiesof concurrent technologies in the network environment has lead to the considerationof a novel distributed approach of the network management. In this evolvednetwork environment the increasing need for bandwidth and rare channel resources,opposes to reduction of the total energy consumption.This thesis focuses on application of distributed mechanisms and learning methodsto allow for more autonomy in the heterogeneous network, this in order to improveits performances. We are mainly interested in energy efficient stochastic mechanismsthat will operate in a distributed fashion by taking advantage of the computationalcapabilities of all the agents and entities of the network. We rely on application ofGame theory to study different types of complex systems in the distributed wirelessnetworks with dynamic interconnectivity.Specifically, we use the stochastic reinforcement learning tools to address issuessuch as, distributed user-network association that allows achieving an efficient dynamicand decentralized radio resource management. Then, we combine access selectionprocedures with distributed optimization to address the inter-cells interferencescoordination (ICIC) for LTE-advanced networks using dynamic power control and designof fractional frequency reuse mechanisms. Moreover we address in non-hierarchicalnetworks, more precisely in Delay Tolerant Networks (DTNs), decentralized methodsrelated to minimization of the end-to-end communication delay. In this framework weare interested, in addition to Nash equilibrium, to the notion of evolutionary stableequiliria in the different context of Evolutionary Games, Markov Decision EvolutionaryGames and Minority Games. As the major parts of our work includes testing andvalidations by simulations, eventually we present several implementations and integrationsmaterials for edition of simulation platforms and test beds