The Quality of Service (QoS) is a profound concept which is gaining increasing attention in the Internet industry. Best-effort applications are now no longer acceptable in certain situations needing high bandwidth provisioning, low loss and streaming of multimedia applications. New emerging multimedia applications are requiring new levels of quality of services beyond those supported by best-effort networks. Quality of service routing is an essential part in any QoS architecture in communication networks. QoS routing aims to select a path among the many possible choices that has sufficient resources to accommodate the QoS requirements. QoS routing can significantly improve the network performance due to its awareness of the network QoS state. Most QoS routing algorithms require maintenance of the global network's state information to make routing decisions. Global state information needs to be periodically exchanged among routers since the efficiency of a routing algorithm depends on link-state information accuracy. However, most QoS routing algorithms suffer from scalability due to the high communication overhead and the high computation effort associated with maintaining accurate link state information and distributing global state information to each node in the network. The ultimate goal of this thesis is to contribute towards enhancing the scalability of QoS routing algorithms. Towards this goal, the thesis is focused on Localised QoS routing algorithms proposed to overcome the problems of using global network state information. Using such an approach, the source node makes routing decisions based on the local state information for each node in the path. Localised QoS routing algorithms avoid the problems associated in the global network state, like high communication and processing overheads. In Localised QoS routing algorithms each source node maintains a predetermined set of candidate paths for each destination and avoids the problems associated with the maintenance of a global network state by using locally collected flow statistics and flow blocking probabilities.

No description available.

The Quality of Service (QoS) is a profound concept which is gaining increasing attention in the Internet industry. Best-effort applications are now no longer acceptable in certain situations needing high bandwidth provisioning, low loss and streaming of multimedia applications. New emerging multimedia applications are requiring new levels of quality of services beyond those supported by best-effort networks. Quality of service routing is an essential part in any QoS architecture in communication networks. QoS routing aims to select a path among the many possible choices that has sufficient resources to accommodate the QoS requirements. QoS routing can significantly improve the network performance due to its awareness of the network QoS state. Most QoS routing algorithms require maintenance of the global network¿s state information to make routing decisions. Global state information needs to be periodically exchanged among routers since the efficiency of a routing algorithm depends on link-state information accuracy. However, most QoS routing algorithms suffer from scalability due to the high communication overhead and the high computation effort associated with maintaining accurate link state information and distributing global state information to each node in the network. The ultimate goal of this thesis is to contribute towards enhancing the scalability of QoS routing algorithms. Towards this goal, the thesis is focused on Localised QoS routing algorithms proposed to overcome the problems of using global network state information. Using such an approach, the source node makes routing decisions based on the local state information for each node in the path. Localised QoS routing algorithms avoid the problems associated in the global network state, like high communication and processing overheads. In Localised QoS routing algorithms each source node maintains a predetermined set of candidate paths for each destination and avoids the problems associated with the maintenance of a global network state by using locally collected flow statistics and flow blocking probabilities. / Libya's higher education

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.

Multicasting is a technique used for distributing data packets from one or more sources to a set of receivers on interconnected networks. Currently developing network applications bring specific quality of service (QoS) requirements like bounded delay, minimum bandwidth, and maximum data loss rate. Providing the required quality of service addresses routing and resource reservation concepts. In this study, a literature survey is carried out on traditional and QoS multicast routing protocols, and the need for QoS routing protocols is investigated. QoS multicast routing protocols are classified and compared according to their multicast tree construction and resource reservation approaches. Two QoS protocols, QROUTE and QMBF, are selected, and their performances are experimentally compared using the network simulation tool Network Simulator-2 (ns-2). The objective of the simulations is to compare the QoS routing algorithms and their tree construction efficiencies. The first contribution of the thesis is the survey and classification of traditional and QoS multicast routing protocols. Another contribution is the ns-2 implementation of two QoS multicast routing protocols. The final contribution of the thesis is the performance evaluation of the recent protocols from a different perspective.

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. / Umm AlQura University in Mecca

The routing strategy used in today's Internet is best-effort service, where all data packets are treated equally. This type of service is not suited for applications such as video conferencing, and video on demand, that requires the availability of certain resources (such as bandwidth) to be guaranteed for them to function properly. The routing in this context, called Quality-of-Service (QoS) Routing, is the problem of finding suitable paths that meet the application's resource requirements. The majority of proposed QoS routing schemes operate by maintaining the global state of the network, and using this knowledge to compute the QoS route. However, all these schemes suffer from the inherent drawback of scalability, because of the need for each node to collect state information about the complete network. The other type of QoS routing schemes do not maintain network state information, but instead flood the network with QoS connection establishment requests. This type of scheme suffers from excessive message overhead during QoS connection establishment. In this thesis, we present a new QoS routing algorithm that is a combination of the above-mentioned two schemes (i.e., global state and flooding based). The algorithm aims at minimizing the message overhead associated with these two schemes and still maintaining the positive aspects of both of them. The basic idea of the algorithm is: to reach to a destination, the path(s) will always pass through a specific set of intermediate nodes. The algorithm discovers such intermediate nodes (limited by a hop count threshold value needed to reach there). When a QoS connection request arrives at a node, it selects the feasible path leading to the intermediate node for the requested destination. The QoS connection establishment message (or routing message) is forwarded along this path. When the message arrives at the intermediate node, the further path is decided through same logic. To decide the path that leads to the intermediate node, the algorithm maintains the link state related to these intermediate nodes, and link state updates are restricted only with regard to these intermediate nodes. Because of this restriction in link state updation, one has less message overhead, compared to the global state based routing scheme. Further, the algorithm tries to group these intermediate nodes in such a way that the routing message need be sent to only one of the grouped intermediate nodes, and still makes sure that all the possible paths are covered. Therefore, one has a reduced message overhead because of grouping.

[EN] This thesis dissertation tackles the problem concerning provision of video streaming services over mobile wireless ad hoc networks. Such networks are characterized by their versatility and flexibility, features that make them particularly suited to be used in many scenarios. However, some limitations inherited of the wireless channel and the mobility of the nodes make difficult to guarantee certain degree of quality of service, which is a required condition to the multimedia applications. Furthermore, with the massive demand of video content, it has become very necessary for mobile ad hoc networks to have an efficient routing and quality of services mechanisms to support this traffic. This is because video streaming services require network to provide sufficient bandwidth and an upper bound in delay, jitter and loss rate. Consequently, traditional best-effort protocols are not adequate. The main contribution of this thesis is the development of a comprehensive routing protocol that has a feedback scheme in order to provide information to the application about the network conditions. This protocol has a cross-layer architecture and it incorporates three important enhancements. Firstly, a new route recovery strategy, which provides a mechanism to detect the link failures in a route and re-establish the connections taking into account the conditions of quality of service that have been established during the previous route discovery phase. Secondly, an algorithm for the estimation of the available bandwidth along the route, information that is sent to application layer in order to apply an adaptation procedure that adjusts the bit rate of the video source. This rate-adaptive strategy is performed exploiting the layered scheme of the scalable video coding. In particular, the adaptive method removes, from the scalable video stream, those layers that could not be efficiently supported by network since their bitrates exceed the available bandwidth. The third main feature of the proposed routing protocol is a gateway discovery algorithm to improve the interconnectivity between mobile ad hoc networks and infrastructure-based networks. This algorithm incorporates available bandwidth as a metric during the gateway selection and a dynamic adaptation of some operational parameters such as the size of the proactive area and the frequency of the advertisement messages. Additionally, in order to solve the lack of a software tool to simulate rate-adaptive transmission of scalable video, a new simulation framework had be implemented. This simulation tool is an open source software freely available and, thus, it represents other contribution of this thesis. The results reveal performance improvements in terms of packet delay, dropped packets and the number of link failures while a more efficient use of the available bandwidth is obtained. In terms of video transmission, the results prove that the combined use of the proposed protocol and the scalable video coding provides an efficient platform for supporting rate-adaptive video streaming over mobile ad hoc networks. / [ES] Esta tesis aborda los problemas relacionados con los servicios de video en modo streaming sobre las redes móviles ad hoc. Este tipo de redes se caracterizan por su versatilidad y flexibilidad, lo cual las hace especialmente adecuadas para ser utilizadas en diversos escenarios. Sin embargo, algunas limitaciones inherentes a los enlaces inalámbricos y a la movilidad de los nodos, hace difícil garantizar cierto nivel de calidad de servicio, lo cual es una condición necesaria para el transporte de flujos multimedia. Además, con la masiva demanda de videos desde los dispositivos móviles, hace aún más necesario asegurar un encaminamiento eficiente y un cierto nivel de calidad de servicio en las redes móviles ad hoc. Por lo tanto, los tradicionales protocolos que funcionan bajo el modelo del "mejor esfuerzo" no son adecuados. Esto se debe principalmente a que las aplicaciones multimedia necesitan que la red asegure suficiente ancho de banda y unos valores máximos de retardo, jitter, y tasa de pérdidas. La principal contribución de esta tesis es el desarrollo de un protocolo de encaminamiento que contiene un esquema de realimentación que le permite informar a la aplicación sobre las condiciones de la red. Este protocolo tiene una arquitectura cross-layer e incorpora tres importantes mejoras. Primero, una nueva estrategia de mantenimiento y recuperación de rutas que provee mecanismos para detectar los fallos de conectividad y el posterior re-establecimiento de las conexiones, teniendo en cuenta las condiciones de calidad de servicio que fueron establecidas durante la etapa inicial del descubrimiento de las rutas. Segundo, un algoritmo para la estimación del ancho de banda disponible a lo largo de la ruta, información que es enviada a la capa de aplicación para aplicar un proceso de adaptación que ajusta la tasa de envío de datos de la fuente. Esta estrategia adaptativa de la tasa aprovecha el esquema por capas de la codificación escalable de video. En particular, el método adaptativo elimina del flujo de video escalable, aquellas capas que no pueden ser transmitidas por la red ya que su tasa de bits supera el ancho de banda disponible. La tercera mejora incluida en el protocolo propuesto es un algoritmo de descubrimiento de gateways para mejorar la interconectividad entre las redes móviles ad hoc y las redes basadas en infraestructura. Dicho algoritmo utiliza el ancho de banda disponible para seleccionar el mejor gateway, así mismo, realiza una adaptación dinámica de algunos parámetros operacionales como el alcance y la frecuencia de los mensajes anuncio. Adicionalmente, ha sido desarrollada una herramienta software para simular la transmisión adaptativa de video escalable sobre redes móviles ad hoc. Esta herramienta de simulación es un software de código abierto y constituye otra contribución más de esta tesis. Los resultados muestran mejoras en el funcionamiento de las redes relacionadas con el retardo, la tasa de pérdidas de paquetes y el número de fallos en la conectividad. Simultáneamente, se obtiene un uso más eficiente del ancho de banda. En relación a la calidad del video transmitido, los resultados demuestran que la utilización del protocolo propuesto junto con la codificación de video escalable, provee un eficiente sistema para la transmisión adaptativa de video escalable sobre redes móviles ad hoc. / [CAT] Aquesta tesi aborda els problemes relacionats amb els serveis de vídeo en mode streaming sobre les xarxes mòbils ad hoc. Aquest tipus de xarxes es caracteritzen per la seva versatilitat i flexibilitat, la qual cosa les fa especialment adequades per a ser utilitzades en diversos escenaris. No obstant això, algunes limitacions inherents als enllaços sense fils i a la mobilitat dels nodes, fa difícil garantir cert nivell de qualitat de servei, cosa que és una condició necessària per al transport de fluxos multimèdia. A més, amb la massiva demanda de vídeos des dels dispositius mòbils, fa encara més necessari assegurar un encaminament eficient i un cert nivell de qualitat de servei en les xarxes mòbils ad hoc. Per tant, els tradicionals protocols que funcionen sota el model del "millor esforç" no són adequats. Això es deu principalment al fet que les aplicacions multimèdia necessiten que la xarxa asseguri suficient ample de banda i uns valors màxims de retard, jitter, i taxa de pèrdues. La principal contribució d'aquesta tesi és el desenvolupament d'un protocol d'encaminament que conté un esquema de realimentació que li permet informar l'aplicació sobre les condicions de la xarxa. Aquest protocol té una arquitectura cross-layer i incorpora tres importants millores. Primer, una nova estratègia de manteniment i recuperació de rutes que proveeix mecanismes per detectar les fallades de connectivitat i el posterior re-establiment de les connexions, tenint en compte les condicions de qualitat de servei que van ser establertes durant l'etapa inicial del descobriment de les rutes. Segon, un algoritme per a l'estimació de l'ample de banda disponible al llarg de la ruta, informació que és enviada a la capa d'aplicació per aplicar un procés d'adaptació que ajusta la taxa d'enviament de dades de la font. Aquesta estratègia adaptativa de la taxa aprofita l'esquema per capes de la codificació escalable de vídeo. En particular, el mètode adaptatiu elimina del flux de vídeo escalable aquelles capes que no poden ser transmeses per la xarxa ja que la seva taxa de bits supera l'ample de banda disponible. La tercera millora inclosa en el protocol proposat és un algoritme de descobriment de gateways per millorar la interconnectivitat entre les xarxes mòbils ad hoc i les xarxes basades en infraestructura. Aquest algoritme utilitza l'ample de banda disponible per seleccionar el millor gateway, així mateix, realitza una adaptació dinàmica d'alguns paràmetres operacionals com l'abast i la freqüència dels missatges anunci. Addicionalment, ha estat desenvolupada una eina programari per a simular la transmissió adaptativa de vídeo escalable sobre xarxes mòbils ad hoc. Aquesta eina de simulació és un programari de codi obert i constitueix una altra contribució més d'aquesta tesi. Els resultats mostren millores en el funcionament de les xarxes relacionades amb el retard, la taxa de pèrdues de paquets i el nombre de fallades en la connectivitat. Simultàniament, se n'obté un ús més eficient de l'ample de banda. En relació a la qualitat del vídeo transmès, els resultats demostren que la utilització del protocol proposat juntament amb la codificació de vídeo escalable, proveeix un eficient sistema per a la transmissió adaptativa de vídeo escalable sobre xarxes mòbils ad hoc. / Castellanos Hernández, WE. (2015). Quality of Service Routing and Mechanisms for Improving Video Streaming over Mobile Wireless Ad hoc Networks [Tesis doctoral]. Editorial Universitat Politècnica de València. https://doi.org/10.4995/Thesis/10251/53238 / TESIS