241 |
Modeling and Analysis of Active Queue Management Schemes under Bursty Traffic.Wang, Lan, Min, Geyong, Awan, Irfan U. January 2006 (has links)
No / Traffic congestion arising from the shared nature of uplink channels in wireless networks can cause serious problems for the provision of QoS to various services. One approach to overcome these problems is to implement some effective congestion control mechanisms at the downlink buffer at the mobile network link layer or at gateways on the behalf of wireless network access points. Active queue management (AQM) is an effective mechanism to support end-to-end traffic congestion control in modern high-speed networks. Initially developed for Internet routers, AQM is now being also considered as an effective congestion control mechanism to enhance TCP performance over 3G links. This paper proposes an analytical performance model for AQM using various dropping functions. The selection of different dropping functions and threshold values required for this scheme plays a critical role on its effectiveness. The model uses a well-known Markov-modulated Poisson process (MMPP) to capture traffic burstiness and correlations. The validity of the model has been demonstrated through simulation experiments. Extensive analytical results have indicated that exponential dropping function is a good choice for AQM to support efficient congestion control.
|
242 |
Modelling QoS in IoT applicationsAwan, Irfan U., Younas, M., Naveed, W. January 2015 (has links)
No / Abstract:
Internet of Things (IoT) aims to enable the interconnection of a large number of smart devices (things) using a combination of networks and computing technologies. But an influx of interconnected things makes a greater demand on the underlying communication networks and affects the quality of service (QoS). This paper investigates into the QoS of delay sensitive things and the corresponding traffic they generate over the network. Things such as security alarms, cameras, etc, generate delay sensitive information that must be communicated in a real time. Such things have heterogeneous features with limited buffer capacity, storage and processing power. Thus the most commonly used Best Effort service model cannot be an attractive mechanism to treat delay sensitive traffic. This paper proposes a cost-effective analytical model for a finite capacity queueing system with pre-emptive resume service priority and push-out buffer management scheme. Based on the analytical model various simulation results are generated in order to analyse the mean queue length and the blocking probability of high and low priority traffic for system with various capacities.
|
243 |
Elastic call admission control using fuzzy logic in virtualized cloud radio base stationsSigwele, Tshiamo, Pillai, Prashant, Hu, Yim Fun January 2015 (has links)
No / Conventional Call Admission Control (CAC) schemes are based on stand-alone Radio Access Networks (RAN) Base Station (BS) architectures which have their independent and fixed spectral and computing resources, which are not shared with other BSs to address their varied traffic needs, causing poor resource utilization, and high call blocking and dropping probabilities. It is envisaged that in future communication systems like 5G, Cloud RAN (C-RAN) will be adopted in order to share this spectrum and computing resources between BSs in order to further improve the Quality of Service (QoS) and network utilization. In this paper, an intelligent Elastic CAC scheme using Fuzzy Logic in C-RAN is proposed. In the proposed scheme, the BS resources are consolidated to the cloud using virtualization technology and dynamically provisioned using the elasticity concept of cloud computing in accordance to traffic demands. Simulations shows that the proposed CAC algorithm has high call acceptance rate compared to conventional CAC.
|
244 |
Novel localised quality of service routing algorithms : performance evaluation of some new localised quality of service routing algorithms based on bandwidth and delay as the metrics for candidate path selectionAlghamdi, Turki A. January 2010 (has links)
The growing demand on the variety of internet applications requires management of large scale networks by efficient Quality of Service (QoS) routing, which considerably contributes to the QoS architecture. The biggest contemporary drawback in the maintenance and distribution of the global state is the increase in communication overheads. Unbalancing in the network, due to the frequent use of the links assigned to the shortest path retaining most of the network loads is regarded as a major problem for best effort service. Localised QoS routing, where the source nodes use statistics collected locally, is already described in contemporary sources as more advantageous. Scalability, however, is still one of the main concerns of existing localised QoS routing algorithms. The main aim of this thesis is to present and validate new localised algorithms in order to develop the scalability of QoS routing. Existing localised routing, Credit Based Routing (CBR) and Proportional Sticky Routing (PSR), use the blocking probability as a factor in selecting the routing paths and work with either credit or flow proportion respectively, which makes impossible having up-to-date information. Therefore our proposed Highest Minimum Bandwidth (HMB) and Highest Average Bottleneck Bandwidth History (HABBH) algorithms utilise bandwidth as the direct QoS criterion to select routing paths. We introduce an Integrated Delay Based Routing and Admission Control mechanism. Using this technique Minimum Total Delay (MTD), Low Fraction Failure (LFF) and Low Path Failure (LPF) were compared against the global QoS routing scheme, Dijkstra, and localised High Path Credit (HPC) scheme and showed superior performance. The simulation with the non-uniformly distributed traffic reduced blocking probability of the proposed algorithms. Therefore, we advocate the algorithms presented in the thesis, as a scalable approach to control large networks. We strongly suggest that bandwidth and mean delay are feasible QoS constraints to select optimal paths by locally collected information. We have demonstrated that a few good candidate paths can be selected to balance the load in the network and minimise communication overhead by applying the disjoint paths method, recalculation of candidate paths set and dynamic paths selection method. Thus, localised QoS routing can be used as a load balancing tool in order to improve the network resource utilization. A delay and bandwidth combination is one of the future prospects of our work, and the positive results presented in the thesis suggest that further development of a distributed approach in candidate paths selection may enhance the proposed localised algorithms.
|
245 |
Performances des applications IP dans les systèmes de communications par satellite : cas du DVB-RCS et du DVB-S2 / Performance of IP applications over satellite communication systems : case study of DVB-RCS and DVB-S2Jegham, Nizar 12 November 2008 (has links)
Les retours et les études dont on dispose sur les réseaux IP par satellite ne permettent pas d’apprécier les performances dont ils sont capables. Pourtant, les difficultés de transmettre de l’IP par satellite persistent encore. L’inadaptation du protocole IP, initialement conçu pour des réseaux terrestres, au large produit délai-bande du média satellite est une raison. Le fonctionnement souvent dé-corrélé entre les niveaux supérieurs de la pile TCP/IP et les couches physique et MAC du média satellite, est une autre. Dans le cadre de ce travail de thèse nous adoptons une démarche expérimentale basée sur l’observation, l’analyse et l’évaluation de systèmes implantant des technologies IP par satellite tels que le standard DVB-RCS, la technologie propriétaire iDirect ou la nouvelle norme DVB-S2. Nous étudions l’impact des règles de qualité de service IP sur les performances des applications dans un contexte de bande limitée. Nous nous penchons notamment sur l’évaluation des efficacités de l’encapsulation IP en termes de consommation de bande. Notre premier objectif est de déceler les niveaux auxquels un opérateur peut agir en vue d’optimiser la configuration d’un système IP par satellite et en accroître les performances / Despite of a number of IP satellite networks developed and deployed, only a limited number of studies and feedbacks about the performance is available. IP over satellite systems raises several constraints. One of the main reasons is the lack of adaptation of IP protocol, initially designed for terrestrial wired networks, to the large bandwidth delay product of the satellite media. Another reason is a lack of coordination between the IP protocol stack upper layer and the satellite MAC and physical layer. The purpose of this PhD study is to evaluate and assess the behaviour of IP applications when conveyed over satellite systems. We mainly focus on the IP quality of service performance, bandwidth encapsulation efficiency as well as IP applications metrics. Through the observation, we try to find how it’s possible to modify the IP satellite systems configuration in order to improve IP applications performance. We also suggest some ideas about the way to refine these technologies with regards to the design aspects. Experimentations have been performed over test beds implementing both standardised satellite technologies such as DVB-RCS as well as proprietary systems such as iDirect in addition to the new normalised technology DVB-S2
|
246 |
Performances of LTE networks / Performances des Réseaux LTEIturralde Ruiz, Geovanny Mauricio 02 October 2012 (has links)
Poussé par la demande croissante de services à haut débit sans fil, Long Term Evolution (LTE) a émergé comme une solution prometteuse pour les communications mobiles. Dans plusieurs pays à travers le monde, la mise en oeuvre de LTE est en train de se développer. LTE offre une architecture tout-IP qui fournit des débits élevés et permet une prise en charge efficace des applications de type multimédia. LTE est spécifié par le 3GPP ; cette technologie fournit une architecture capable de mettre en place des mécanismes pour traiter des classes de trafic hétérogènes comme la voix, la vidéo, les transferts de fichier, les courriers électroniques, etc. Ces classes de flux hétérogènes peuvent être gérées en fonction de la qualité de service requise mais aussi de la qualité des canaux et des conditions environnementales qui peuvent varier considérablement sur une courte échelle de temps. Les standards du 3GPP ne spécifient pas l’algorithmique de l’allocation des ressources du réseau d’accès, dont l’importance est grande pour garantir performance et qualité de service (QoS). Dans cette thèse, nous nous focalisons plus spécifiquement sur la QoS de LTE sur la voie descendante. Nous nous concentrons alors sur la gestion des ressources et l’ordonnancement sur l’interface radio des réseaux d’accès. Dans une première partie, nous nous sommes intéressés à des contextes de macro-cellules. Le premier mécanisme proposé pour l’allocation des ressources combine une méthode de jetons virtuels et des ordonnanceurs opportunistes. Les performances obtenues sont très bonnes mais n’assurent pas une très bonne équité. Notre seconde proposition repose sur la théorie des jeux, et plus spécifiquement sur la valeur de Shapley, pour atteindre un haut niveau d’équité entre les différentes classes de services au détriment de la qualité de service. Cela nous a poussé, dans un troisième mécanisme, à combiner les deux schémas. La deuxième partie de la thèse est consacrée aux femto-cellules (ou femtocells) qui offrent des compléments de couverture appréciables. La difficulté consiste alors à étudier et à minimiser les interférences. Notre premier mécanisme d’atténuation des interférences est fondé sur le contrôle de la puissance de transmission. Il fonctionne en utilisant la théorie des jeux non coopératifs. On effectue une négociation constante entre le débit et les interférences pour trouver un niveau optimal de puissance d’émission. Le second mécanisme est centralisé et utilise une approche de division de la bande passante afin d’obliger les femtocells à ne pas utiliser les mêmes sous-bandes évitant ainsi les interférences. Le partage de bande passante et l’allocation sont effectués en utilisant sur la théorie des jeux (valeur de Shapley) et en tenant compte du type d’application. Ce schéma réduit les interférences considérablement. Tous les mécanismes proposés ont été testés et évalués dans un environnement de simulation en utilisant l’outil LTE-Sim au développement duquel nous avons contribué. / Driven by the growing demand for high-speed broadband wireless services, Long term Evolution (LTE) technology has emerged as a competitive alternative to mobile communications solution. In several countries around the world, the implementation of LTE has started. LTE offers an IP-based framework that provides high data rates for multimedia applications. Moreover, based on the 3GPP specifications, the technology provides a set of built in mechanisms to support heterogeneous classes of traffic including data, voice and video, etc. Supporting heterogeneous classes of services means that the traffic is highly diverse and has distinct QoS parameters, channel and environmental conditions may vary dramatically on a short time scale. The 3GPP specifications leave unstandardized the resource management and scheduling mechanisms which are crucial components to guarantee the QoS performance for the services. In this thesis, we evaluate the performance and QoS in LTE technology. Moreover, our research addresses the resource management and scheduling issues on the wireless interface. In fact, after surveying, classifying and comparing different scheduling mechanisms, we propose three QoS mechanisms for resource allocation in macrocell scenarios focused on real time services and two mechanisms for interference mitigation in femtocell scenarios taking into account the QoS of real time services. Our first proposed mechanism for resource allocation in macrocell scenarios combines the well known virtual token (or token buckets) method with opportunistic schedulers, our second scheme utilizes game theory, specifically the Shapley value in order to achieve a higher fairness level among classes of services and our third mechanism combines the first and the second proposed schemes. Our first mechanism for interference mitigation in femtocell scenarios is power control based and works by using non cooperative games. It performs a constant bargain between throughput and SINR to find out the optimal transmit power level. The second mechanism is centralised, it uses a bandwidth division approach in order to not use the same subbands to avoid interference. The bandwidth division and assignation is performed based on game theory (Shapley value) taking into account the application bitrate . This scheme reduces interference considerably and shows an improvement compared to other bandwidth division schemes. All proposed mechanism are performed in a LTE simulation environment. several constraints such as throughput, Packet Loss Ratio, delay, fairness index, SINR are used to evaluate the efficiency of our schemes
|
247 |
New quality of service routing algorithms based on local state information : the development and performance evaluation of new bandwidth-constrained and delay-constrained quality of service routing algorithms based on localized routing strategiesAldosari, Fahd M. January 2011 (has links)
The exponential growth of Internet applications has created new challenges for the control and administration of large-scale networks, which consist of heterogeneous elements under dynamically changing traffic conditions. These emerging applications need guaranteed service levels, beyond those supported by best-effort networks, to deliver the intended services to the end user. Several models have been proposed for a Quality of Service (QoS) framework that can provide the means to transport these services. It is desirable to find efficient routing strategies that can meet the strict routing requirements of these applications. QoS routing is considered as one of the major components of the QoS framework in communication networks. In QoS routing, paths are selected based upon the knowledge of resource availability at network nodes and the QoS requirements of traffic. Several QoS routing schemes have been proposed that differ in the way they gather information about the network state and the way they select paths based on this information. The biggest downside of current QoS routing schemes is the frequent maintenance and distribution of global state information across the network, which imposes huge communication and processing overheads. Consequently, scalability is a major issue in designing efficient QoS routing algorithms, due to the high costs of the associated overheads. Moreover, inaccuracy and staleness of global state information is another problem that is caused by relatively long update intervals, which can significantly deteriorate routing performance. Localized QoS routing, where source nodes take routing decisions based solely on statistics collected locally, was proposed relatively recently as a viable alternative to global QoS routing. It has shown promising results in achieving good routing performance, while at the same time eliminating many scalability related problems. In localized QoS routing each source-destination pair needs to determine a set of candidate paths from which a path will be selected to route incoming flows. The goal of this thesis is to enhance the scalability of QoS routing by investigating and developing new models and algorithms based on the localized QoS routing approach. For this thesis, we have extensively studied the localized QoS routing approach and demonstrated that it can achieve a higher routing performance with lower overheads than global QoS routing schemes. Existing localized routing algorithms, Proportional Sticky Routing (PSR) and Credit-Based Routing (CBR), use the blocking probability of candidate paths as the criterion for selecting routing paths based on either flow proportions or a crediting mechanism, respectively. Routing based on the blocking probability of candidate paths may not always reflect the most accurate state of the network. This has motivated the search for alternative localized routing algorithms and to this end we have made the following contributions. First, three localized bandwidth-constrained QoS routing algorithms have been proposed, two are based on a source routing strategy and the third is based on a distributed routing strategy. All algorithms utilize the quality of links rather than the quality of paths in order to make routing decisions. Second, a dynamic precautionary mechanism was used with the proposed algorithms to prevent candidate paths from reaching critical quality levels. Third, a localized delay-constrained QoS routing algorithm was proposed to provide routing with an end-to-end delay guarantee. We compared the performance of the proposed localized QoS routing algorithms with other localized and global QoS routing algorithms under different network topologies and different traffic conditions. Simulation results show that the proposed algorithms outperform the other algorithms in terms of routing performance, resource balancing and have superior computational complexity and scalability features.
|
248 |
Advanced techniques for Web service query optimization / Techniques avancées pour l’optimisation de requêtes de services WebBenouaret, Karim 09 October 2012 (has links)
De nos jours, nous assistons à l’émigration du Web de données vers le Web orienté services. L’amélioration des capacités et fonctionnalités des moteurs actuels de recherche sur le Web, par des techniques efficaces de recherche et de sélection de services, devient de plus en plus importante. Dans cette thèse, dans un premier temps, nous proposons un cadre de composition de services Web en tenant compte des préférences utilisateurs. Le modèle fondé sur la théorie des ensembles flous est utilisé pour représenter les préférences. L’approche proposée est basée sur une version étendue du principe d’optimalité de Pareto. Ainsi, la notion des top-k compositions est introduite pour répondre à des requêtes utilisateurs de nature complexe. Afin d’améliorer la qualité de l’ensemble des compositions retournées, un second filtre est appliqué à cet ensemble en utilisant le critère de diversité. Dans un second temps, nous avons considéré le problème de la sélection des services Web en présence de préférences émanant de plusieurs utilisateurs. Une nouvelle variante, appelée Skyline de services à majorité, du Skyline de services traditionnel est défini. Ce qui permet aux utilisateurs de prendre une décision « démocratique » conduisant aux services les plus appropriés. Un autre type de Skyline de services est également discuté dans cette thèse. Il s’agit d’un Skyline de Services de nature graduelle et se fonde sur une relation de dominance floue. Comme résultat, les services Web présentant un meilleur compromis entre les paramètres QoS sont retenus, alors que les services Web ayant un mauvais compromis entre les QoS sont exclus. Finalement, nous avons aussi absorbé le cas où les QoS décrivant les services Web sont entachés d’incertitude. La théorie des possibilités est utilisée comme modèle de l’incertain. Ainsi, un Skyline de Services possibilité est proposé pour permettre à l’utilisateur de sélectionner les services Web désirés en présence de QoS incertains. De riches expérimentations ont été conduites afin d’évaluer et de valider toutes les approches proposées dans cette thèse / As we move from a Web of data to a Web of services, enhancing the capabilities of the current Web search engines with effective and efficient techniques for Web services retrieval and selection becomes an important issue. In this dissertation, we present a framework that identifies the top-k Web service compositions according to the user fuzzy preferences based on a fuzzification of the Pareto dominance relationship. We also provide a method to improve the diversity of the top-k compositions. An efficient algorithm is proposed for each method. We evaluate our approach through a set of thorough experiments. After that, we consider the problem of Web service selection under multiple users preferences. We introduce a novel concept called majority service skyline for this problem based on the majority rule. This allows users to make a “democratic” decision on which Web services are the most appropriate. We develop a suitable algorithm for computing the majority service skyline. We conduct a set of thorough experiments to evaluate the effectiveness of the majority service skyline and the efficiency of our algorithm. We then propose the notion of α-dominant service skyline based on a fuzzification of Pareto dominance relationship, which allows the inclusion of Web services with a good compromise between QoS parameters, and the exclusion ofWeb services with a bad compromise between QoS parameters. We develop an efficient algorithm based on R-Tree index structure for computing efficiently the α-dominant service skyline. We evaluate the effectiveness of the α-dominant service skyline and the efficiency of the algorithm through a set of experiments. Finally, we consider the uncertainty of the QoS delivered by Web services. We model each uncertain QoS attribute using a possibility distribution, and we introduce the notion of pos-dominant service skyline and the notion of nec-dominant service skyline that facilitates users to select their desired Web services with the presence of uncertainty in their QoS. We then developappropriate algorithms to efficiently compute both the pos-dominant service skyline and nec-dominant service skyline. We conduct extensive sets of experiments to evaluate the proposed service skyline extensions and algorithms
|
249 |
Políticas para servidores web baseados em sessões visando qualidade e diferenciação de serviços / Policies to web servers based on sessions aiming quality and differentiation of servicesBarbato, Alessandra Kelli 25 April 2008 (has links)
Este trabalho propõe políticas para servidores Web baseados em sessões, visando ao oferecimento de garantias de qualidade de serviço (Quality of Service - QoS) a seus usuários. Para o fornecimento de QoS, dois tipos de políticas são consideradas: as responsáveis pela diferenciação de serviços e as responsáveis pelo controle de admissão. Alguns algoritmos de escalonamento foram desenvolvidos com o objetivo de oferecer melhores serviços para as sessões prioritárias: o algoritmo de escalonamento baseado em sessão (SBSA) e o algoritmo de escalonamento baseado em sessão com diferenciação de serviços (SBSA-DS). Quanto ao controle de admissão, foram consideradas duas novas políticas, as quais utilizam diferentes parâmetros para a tomada de decisão e têm como objetivo garantir a finalização do maior número de sessões prioritárias. A partir dos resultados obtidos nos experimentos realizados por meio de simulação, constatou-se que o emprego dos algoritmos e das políticas desenvolvidos melhora o atendimento das sessões para as quais deve ser oferecido um serviço preferencial. Portanto, em servidores Web preocupados com a garantia de QoS para seus usuários, os quais interagem com o sistema por meio de sessões, o uso dessas novas técnicas se mostra adequado / This work considers policies for Web servers based on sessions, aiming at the guarantees of Quality of Service (QoS) to the systems users. Two types of policies are considered: the responsible for the differentiation of services and the responsible for the admission control. Some scheduling algorithms had been developed to offer better services for the priority sessions: the Session Based Scheduling Algorithm (SBSA) and the Session Based Scheduling Algorithm with Differentiation of Services (SBSA-DS). In relation to the admission control, two new policies had been considered, which use different parameters to help the decisions and have as objective guarantee the finalization of as many priority sessions as possible. From the obtained results of the experiments realized by mean of simulation, it is evidenced that the use of the developed algorithms and policies improves the attendance of the sessions that deserve preferential service. Therefore, in Web servers worried in the guarantee the QoS for their users, which interact with the system by sessions, the use of these new techniques reveals adequate
|
250 |
Réseaux de capteurs sans fil linéaires : impact de la connectivité et des interférences sur une méthode d'accès basée sur des jetons circulants / Linear Wireless Sensors Networks : Impact of connectivity and interferences on an Token Based MAC ProtocolNdoye, El Hadji Malick 21 December 2015 (has links)
Dans cette thèse, il s'agit de proposer un protocole MAC qui prend en compte certaines spécificités des réseaux de capteurs sans fil linéaires. Ce protocole MAC est basé sur des jetons circulants qui donnent aux noeuds le droit d’accès au canal de transmission. Nous évaluons à partir de ce protocole l’impact des interférences et de la connectivité sur un réseau linéaire. Cette évaluation nous permet de proposer des techniques de clustering dans un réseau de capteurs sans fil linéaire. Nous supposons d’abord un clustering basé sur une exploitation logique du voisinage des noeuds capteurs. Nous considérons dans ce cas, un modèle de propagation déterministe qui ne tient pas en compte la complexité du milieu. Ensuite, nous considérons une technique de clustering dans laquelle le modèle de propagation prend en compte les fluctuations qui rendent le milieu complexe. / In this thesis, we propose a MAC protocol that takes into account the specific characteristics of LSNs. This MAC protocol is based on tokens circulating that give the right to nodes to access to the transmission channel. We evaluate from this protocol the impact of interference and connectivity in the LSN. This evaluation allows us to propose clustering techniques in a LSN. We assume first a clustering based on a logical exploitation of the vicinity of the sensor nodes. In this case, we assume that a deterministic propagation model that does not take into account the complexity of the environment. Next, we consider a clustering technique wherein the propagation model takes into account the fluctuations that make complex the medium.
|
Page generated in 0.0253 seconds