Στις ημέρες μας, εμφανίζεται ολοένα και σε περισσότερα πλαίσια η ανάγκη για την ανάπτυξη αξιόπιστων ασύρματων αυτοοργανούμενων δικτύων (Mobile Ad hoc Networks). Τα δίκτυα αυτά δεν απαιτούν την ύπαρξη μίας σταθερής υποδομής ή διαδικασίας προετοιμασίας και εγκατάστασης, ενώ παράλληλα επιτρέπουν τη δημιουργία δυναμικών και συχνά μεταβαλλόμενων τοπολογιών με υπολογιστικούς κόμβους που κινούνται με τυχαίο τρόπο και συχνά χαρακτηρίζονται από αυστηρούς ενεργειακούς περιορισμούς. Το πρόβλημα της αποτελεσματικής σχεδίασης και ανάπτυξης αυτοοργανούμενων δικτύων αποτελεί μία πρόκληση που έχει προσελκύσει αρκετές ερευνητικές προσπάθειες. Στο πλαίσιο της παρούσας εργασίας, το ενδιαφέρον επικεντρώνεται στη μελέτη αλγορίθμων δρομολόγησης δεδομένων μεταξύ των κόμβων ενός αυτοοργανούμενου ασύρματου δικτύου. Αρχικά, παρατίθεται μία κριτική επισκόπηση των αλγορίθμων δρομολόγησης που υπάρχουν στη βιβλιογραφία. Στη συνέχεια, λαμβάνει χώρα η υλοποίηση του πρωτοκόλλου ZRP (Zone Routing Protocol), το οποίο όπως προκύπτει από την προαναφερθείσα κριτική επισκόπηση παρουσιάζει σημαντικά πλεονεκτήματα για αυτήν την κατηγορία δικτύων. Ακολουθεί η παρουσίαση τριών σειρών προσομοιώσεων που πραγματοποιήθηκαν για την ποσοτική αξιολόγηση του ZRP πρωτοκόλλου σε διάφορα σενάρια φορτίου και κινητικότητας των υπολογιστικών κόμβων. Παράλληλα, πραγματοποιήθηκε και μία εκτεταμένη ποσοτική σύγκριση του DSR πρωτοκόλλου με το ZRP. Τέλος, στο πλαίσιο της εργασίας προτείνεται μία βελτιωμένη παραλλαγή του πρωτοκόλλου ZRP, το επονομαζόμενο AZRP (Adaptive Zone Routing Protocol). Το AZRP πρωτόκολλο προσπαθεί να βελτιώσει και να επεκτείνει τους μηχανισμούς του ZRP εισάγοντας μία τεχνική αυτόματης προσαρμογής του μεγέθους της ζώνης δρομολόγησης κάθε κόμβου. Με αυτόν τον τρόπο το AZRP μπορεί να προσαρμόζεται πιο αποτελεσματικά σε οποιαδήποτε κατάσταση του δικτύου ανά πάσα χρονική στιγμή. Η ιδέα αυτή οδήγησε και σε μία σχετική επιστημονική δημοσίευση στο πλαίσιο της διπλωματικής αυτής. / Nowadays, there is a growing need to deploy reliable mobile ad hoc networks (MANETs). These networks enable the development of dynamic and frequently changing topologies of computational nodes that move randomly, and typically have energy consumption limitations, without relying on a centralized, pre-configured infrastructure. The abundance of challenges in the design and deployment of such networks has attracted the interest of many research efforts. The focus of this thesis is on the study of routing algorithms for MANETs. Initially, the thesis presents a critical survey of such routing algorithms mentioned in the bibliography. Next, an implementation of the ZRP protocol (Zone Routing Algorithm) is presented, which according to the aforementioned survey was found to have significant advantages for MANETs. Subsequently, three sets of simulations that evaluated the performance of the ZRP protocol in different scenarios of node mobility and network traffic are presented. In addition, an extended quantitative comparison of the DSR and ZRP protocol performance is also presented. Finally, in the context of this thesis a new, improved version of the ZRP protocol is proposed, named AZRP (Adaptive Zone Routing Protocol). The AZRP protocol tries to improve the performance of ZRP by introducing a mechanism that automatically adjusts the size of the routing zone of each node based on the overall network traffic and node mobility. The latter idea led to a related publication in the context of this thesis.

Στα αυτοοργανούμενα ασύρματα δίκτυα, αυτόνομοι κόμβοι με κάρτες ασύρματης μετάδοσης σχηματίζουν ένα δίκτυο χωρίς προϋπάρχουσα δομή. Η δρομολόγηση σε ένα συμβατικό δίκτυο γίνεται από ειδικούς δρομολογητές, είτε υλοποιημένους σε υλικό ειδικά για αυτό το σκοπό, ή υπολογιστές εξοπλισμένους με πολλαπλές διεπαφές δικτύου και ανάλογο λογισμικό. Αντίθετα, σε ένα ad-hoc δίκτυο, η δρομολόγηση διεκπεραιώνετε από τους ίδιους τους κόμβους. Κάθε κόμβος έχει τη δυνατότητα να προωθεί δικτυακό φορτίου στους υπόλοιπους. Αντίθετα με τους σταθερούς δρομολογητές, ένας κόμβος ασύρματου δικτύου έχει μόνο μια δικτυακή διεπαφή, καθώς όλη η επικοινωνία γίνεται μέσω ενός και μόνο ασύρματου καναλιού. Οι κόμβοι σε ένα ad-hoc δίκτυο προσφέρονται να προωθήσουν την δικτυακή κίνηση εκ μέρους άλλων κόμβων. Αν αρνηθούν να το κάνουν αυτό, η συνδεσιμότητα μεταξύ των κόμβων επηρεάζεται αρνητικά. Η λειτουργικότητα και χρησιμότητα του ad-hoc δικτύου εξαρτάται σημαντικά από την ικανότητα προώθησης πακέτων των κόμβων του. Συνεπώς, καταλαβαίνουμε ότι ο αλγόριθμος δρομολόγησης του ad-hoc δικτύου διαδρατίζει σημαντικό ρόλο στην απόδοσή του. Βασικός σκοπός της διπλωματικής αυτής εργασίας είναι να μελετήσει την απόδοση μερικών βασικών αλγορίθμων δρομολόγησης ως προς κάποιες μετρήσιμες παραμέτρους (throughput, end to end delay, delivery ratio). Έγιναν εξομοιώσεις για δύο διαφορετικά πρωτόκολλα φυσικού επιπέδου (802.11 και 802.15.4). Επίσης, αναλύονται θεωρητικά σε βάθος διάφορα ζητήματα σχετικά με τη διευθυνσιοδότηση, τη δρομολόγηση, τα σχετικά MAC πρωτόκολλα, τη δικτυακή ασφάλεια, τη κατανάλωσης ενέργειας, τις απαιτήσεις στο hardware των διάφορων αλγορίθμων δρομολόγησης που έχουν αναπτυχθεί από την ακαδημαϊκή κοινότητα και τη βιομηχανία. / In ad hoc wireless networks, autonomous nodes with wireless transmission cards form a network without pre-existing structure. The route in a conventional network is carried out by routers made for this reason, whether implemented on hardware specifically for this purpose, or computers equipped with multiple network interfaces and appropriate software. Conversely, in an ad-hoc network, routing is handled the nodes themselves. Each node has the ability to forward network load to others. Unlike fixed routers, a wireless network node has only one network interface and all communication is via a single wireless channel. The nodes in an ad-hoc network offer to promote the network traffic from other nodes. If they refuse to do so, the connectivity between nodes is affected negatively. The functionality and usefulness of ad-hoc network depends heavily on the ability to forward packages of nodes. Therefore, the routing algorithm in ad-hoc network plays an important role in the network's performance. The main purpose of this thesis is to study the performance of certain basic routing algorithms in terms of some measurable parameters (throughput, end to end delay, delivery ratio). We carried out simulations for two different physical layer protocols (802.11 and 802.15.4). Also, we analyzed theoretically various issues related to addressing, routing, related MAC protocols, network security, energy consumption requirements in the hardware of the various routing algorithms developed by academia and industry.

A aplicação de redes sem fio vem crescendo consideravelmente nos últimos anos. Protocolos baseados nesta tecnologia estão sendo desenvolvidos para uma grande variedade de aplicações. A confiabilidade é um dos principais requisitos dos protocolos de comunicação nos ambientes industriais. Interferências, ambiente ruidoso e o grande risco das aplicações industriais que são monitoradas são fatores que elevam os níveis de exigência no que se refere à confiabilidade, redundância e segurança do protocolo. O protocolo WirelessHART é um padrão de comunicação sem fio desenvolvido especificamente para monitoramento e controle de processos com os requisitos necessários para ser utilizado em ambientes industriais. A norma do WirelessHART define diversos aspectos técnicos a serem utilizados no desenvolvimento de algoritmos. Os algoritmos de roteamento e escalonamento de mensagens são de grande relevância para o cumprimento dos requisitos temporais, de confiabilidade e segurança. Requisitos de roteamento e escalonamento são especificados, porém, os algoritmos a serem utilizados não são definidos. O objetivo nessa dissertação é analisar alguns dos principais algoritmos que tem sido propostos especificamente para o protocolo WirelessHART e apresentar um conjunto capaz de ser aplicado nesse protocolo. Análises e comparações entre os algoritmos são realizadas proporcionando um estudo aprofundado sobre seus impactos no desempenho do protocolo. / The application of wireless networks has grown considerably in recent years. Protocols based on this technology are being developed for a great variety of applications. Reliability is one of the main requirements for communication protocols in industrial environments. Interferences, noisy environment and high risk processes that are monitored are factors that increase the levels of requirements in terms of reliability, redundancy and security of the protocol. The WirelessHART protocol is a wireless communication standard specifically designed for process monitoring and control applications with the necessary requirements for to be used in industrial environments. The WirelessHART standard defines several technical aspects to be used in the development of the algorithms. The algorithms of routing and scheduling messages are highly relevant to meeting the timing requirements of reliability and safety. Routing and scheduling strategies are specified, however, the routing and scheduling algorithms are not defined for use. The goal of this dissertation is to analyze some of the main algorithms that have been proposed specifically for the WirelessHART protocol and to present a set able to be applied in this protocol. Analyzes and comparisons between algorithms are realized by providing a detailed study of their impacts on the protocol performance.

A aplicação de redes sem fio vem crescendo consideravelmente nos últimos anos. Protocolos baseados nesta tecnologia estão sendo desenvolvidos para uma grande variedade de aplicações. A confiabilidade é um dos principais requisitos dos protocolos de comunicação nos ambientes industriais. Interferências, ambiente ruidoso e o grande risco das aplicações industriais que são monitoradas são fatores que elevam os níveis de exigência no que se refere à confiabilidade, redundância e segurança do protocolo. O protocolo WirelessHART é um padrão de comunicação sem fio desenvolvido especificamente para monitoramento e controle de processos com os requisitos necessários para ser utilizado em ambientes industriais. A norma do WirelessHART define diversos aspectos técnicos a serem utilizados no desenvolvimento de algoritmos. Os algoritmos de roteamento e escalonamento de mensagens são de grande relevância para o cumprimento dos requisitos temporais, de confiabilidade e segurança. Requisitos de roteamento e escalonamento são especificados, porém, os algoritmos a serem utilizados não são definidos. O objetivo nessa dissertação é analisar alguns dos principais algoritmos que tem sido propostos especificamente para o protocolo WirelessHART e apresentar um conjunto capaz de ser aplicado nesse protocolo. Análises e comparações entre os algoritmos são realizadas proporcionando um estudo aprofundado sobre seus impactos no desempenho do protocolo. / The application of wireless networks has grown considerably in recent years. Protocols based on this technology are being developed for a great variety of applications. Reliability is one of the main requirements for communication protocols in industrial environments. Interferences, noisy environment and high risk processes that are monitored are factors that increase the levels of requirements in terms of reliability, redundancy and security of the protocol. The WirelessHART protocol is a wireless communication standard specifically designed for process monitoring and control applications with the necessary requirements for to be used in industrial environments. The WirelessHART standard defines several technical aspects to be used in the development of the algorithms. The algorithms of routing and scheduling messages are highly relevant to meeting the timing requirements of reliability and safety. Routing and scheduling strategies are specified, however, the routing and scheduling algorithms are not defined for use. The goal of this dissertation is to analyze some of the main algorithms that have been proposed specifically for the WirelessHART protocol and to present a set able to be applied in this protocol. Analyzes and comparisons between algorithms are realized by providing a detailed study of their impacts on the protocol performance.

Les WMNs comportent des nœuds qui sont capables de recevoir et de transmettre des données vers de multiples destinations dans le réseau. De ce fait, les WMNs sont capables de s'auto-organiser et auto-configurer dynamiquement [5]. Chaque nœud crée et maintient la connectivité avec ses voisins. La disponibilité du mode ad-hoc basée sur la norme IEEE 802.11 permet une mise en œuvre de WMNs à faible coût. Les WMNs présentent cependant deux inconvénients majeurs liés aux interférences d'une part et à la scalabilité d'autre part [6]. (D1) Le problème des interférences (D2) Le problème de scalabilité. Les solutions existantes au niveau de la couche PHY ou de la couche MAC peuvent apporter des solutions au problème des interférences mentionné ci-dessus (cf. D1) . D'un autre côté, le problème de scalabilité dans les WMNs peut être résolu par les solutions de routage efficaces [11]. En effet, les algorithmes de routage dans les WMNs sont chargés de calculer des routes pour transporter des données de multiples sauts jusqu' à atteindre les destinations. Comme illustré dans [11], les routes les plus courtes, qui sont les solutions par défaut des algorithmes de routage classiques, ont généralement plus d'interférences. En conséquences, il faut trouver des routes qui ont moins d'interférences. Pour un objectif de routage donné et des paramètres donnés, ces routes peuvent être optimales ou sub-optimales. Les objectifs de routage peuvent être par exemple de maximiser la bande passante entre utilisateurs, ou de minimiser les pertes de paquets, etc. Les paramètres dans les problèmes de routage comprennent des métriques orientées réseau et des métriques orientées utilisateur. Les métriques orientées réseau, également appelées les métriques de la qualité de service (QoS), sont dérivées à partir des paramètres réseau comme la bande passante, le délai, la gigue, etc. En revanche, les métriques orientées vers l'utilisateur, également appelées les métriques de qualité d'expérience (QoE), sont basées sur l'expérience de l'utilisateur, tels que les notes MOS (Mean Opinion Score) qui indiquent le niveau de satisfaction de l'utilisateur. La perception de l'utilisateur est un objectif majeur des services de streaming vidéo. La plupart des algorithmes de routage existants prennent des décisions de routage en fonction d'une seule ou d'une combinaison des métriques orientées réseau. Ainsi, les algorithmes de routage dans [12, 13, 14] déterminent les routes basées sur la bande passante et la charge du réseau. Cependant, les métriques orientées réseau ne sont pas nécessairement corrélée à l'expérience de l'utilisateur [15, 16, 17, 18]. En d'autres termes, les utilisateurs peuvent ne pas être satisfaits même avec les routes optimales qui sont basées sur les métriques orientés réseau. En conséquences, il est nécessaire de développer les algorithmes de routage qui tiennent compte de métriques orientées utilisateur. Cette thèse traite d'algorithmes de routage dans les WMNs avec comme objectif d'améliorer la qualité pour les applications de streaming vidéo. Les algorithmes de routage proposés prendront des décisions de routage basées sur la perception de l'utilisateur. Dans ce contexte, toutes les solutions doivent faire face aux deux challenges suivants : (M1) l'estimation en temps réel de la perception utilisateur et (M2) découverte des routes optimales ou sous-optimales. / WMNs comprise nodes that are able to receive and forward the data to other destinations in the networks. Consequently, WMNs are able to dynamically self-organize and self-configure [5]. Each node itself creates and maintains the connectivity with its neighbors. The availability of ad-hoc mode on popular IEEE 802.11 allows low-cost implementation of WMNs. Nevertheless, WMNs have two major drawbacks: interference and scalability as discussed in [6]. (D1) Interference : The independent behaviour and arbitrary deployment of nodes in WMNs can create an extremely high interference environment, which leads to degradation in the quality of wireless connections. For instance, the Carrier Sense Multiple Access with Collision Avoidance (CSMA/CA) mechanism of IEEE 802.11 (CSMA/CA) has long delays and low resource utilization in dense networks [7]. Recent advancements in physical (PHY) and medium control access (MAC) layers, such as multiple-input multiple-output (MIMO) and multiple channels MAC, can overcome this challenge. The deployment of some solutions are unable in practice because of specific requirements of hardware. Moreover, some implementations such as multiple channel MAC requires high synchronization, which is difficult in WMNs [8]. (D2) Scalability: Multi-hop communication are able to improve coverage and band-width availability in wireless networks [9]. However, it has scalability issues as discussed in [10, 11]. It means that the performance of networks deteriorates significantly when the size of networks grows. PHY layer may experience an extremely noisy medium, thus causing throughput degradation at MAC layer. Moreover, the noisy environment increases the packet loss rate, which impacts significantly to network and transport layers. The existing solutions at PHY or MAC layer can solve the interference problem mentioned in D1. Meanwhile, the scalability of WMNs could be tackled by routing solutions [11]. Routing algorithms are responsible for computing routes so as to convey data through multiple hops until reaching the destinations. As shown in [11], the shortest-path routes, which are the default solutions of conventional routing algorithms, usually have more interference. The solution, subsequently, is finding other routes that have less interference. These routes could be optimal or sub-optimal with given objectives and arguments. The arguments of routing problems comprise of network-oriented metrics and User-oriented metrics. Network-oriented metrics, also called as Quality of Service (QoS) metrics, are derived from the network directly such as bandwidth, delay, jitter, etc. Meanwhile, User-oriented metrics, also called as Quality of Experience (QoE) metrics, are based on users’ experience such as mean opinion score (MOS). They represent the level of satisfaction of a users. The good perception of users is the major objective of video streaming services. Most of existing routing algorithms give routing decisions based on single or combination of network-oriented metrics. For example, the routing algorithms in [12, 13, 14] determine routes based on the bandwidth and congestion. Nevertheless, network-oriented metrics may not be well-correlated to users’ experience [15, 16, 17, 18]. In other words, users may not be satisfied even with optimal network-oriented metric routes. As a result, it is necessary to develop routing algorithms that take user-oriented metrics into account. This thesis addresses the routing of video streaming over WMNs and proposes novel routing algorithms. These routing algorithms give routing decisions based on the perception of users. To do that, the proposed solution has to address two challenges as follows :(M1) estimate users’ perception in real-time and (M2) find optimal or sub-optimal routes efficiently.

Under the umbrella of Internet of Things (IoT) and Internet of Everything (IoE), new applications with diverse requirements have emerged and the traditional System-on-Chips (SoCs) were unable to support them. Hence, new versatile SoC architectures were designed, like chiplets and Cloud-of-Chips (CoC). A key component of every SoC, is the on-chip interconnect technology, which is responsible for the communication between Processing Elements (PEs) of a system. Network-on-Chip (NoC) is the current widely used interconnect technology, which is a layered, scalable approach. However, the last years the high structural complexity together with the functional diversity and the challenges (QoS, high latency, security) of NoC motivated the researchers to explore alternatives of it. One NoC alternative that recently gained attention is the Software Defined Network-on-Chip (SDNoC). SDNoC originated from Software Defined Network (SDN) technology, which supports the dynamic nature of future networks and applications, while lowering operating costs through simplified hardware and software. Nevertheless, SDN technology designed for large scale networks. Thus, in order to be ported to micro-scale networks proper alterations and new hardware architectures need to be considered.In this thesis, an exploration of how to embed the SDN technology within the micro scale networks in order to provide secure and manageable communication, improve the network performance and reduce the hardware complexity is presented. Precisely, the design and implementation of an SDNoC architecture is thoroughly described followed by the creation and evaluation of a novel SDNoC communication protocol, called MicroLET, in order to provide secure and efficient communication within system components. Furthermore, the security aspect of SDNoC constitutes a big gap in the literature. Hence, it has been addressed by proposing a secure SDNoC Group Key Agreement (GKA) communication protocol, called SSPSoC, followed by the exploration of Byzantine faults within SDNoC and the investigation of a novel Hardware Trojan (HT) attack together with a proposed detection and defend method. / Doctorat en Sciences de l'ingénieur et technologie / info:eu-repo/semantics/nonPublished

There is a seemingly endless miniaturization of electronic components, which has enabled designers to build sophisticated computing structureson silicon chips. Consequently, electronic systems are continuously improving with new and more advanced functionalities. Design complexity ofthese Systems on Chip (SoC) is reduced by the use of pre-designed cores. However, several problems related to the interconnection of coresremain. Network on Chip (NoC) is a new SoC design paradigm, which targets the interconnect problems using classical network concepts. Still,SoC cores show large variance in size and functionality, whereas several NoC benefits relate to regularity and homogeneity. This thesis studies some network aspects which are characteristic to NoC systems. One is the issue of area wastage in NoC due to cores of varioussizes. We elaborate on using oversized regions in regular mesh NoC and identify several new design possibilities. Adverse effects of regions oncommunication are outlined and evaluated by simulation. Deadlock freedom is an important region issue, since it affects both the usability and performance of routing algorithms. The concept of faultyblocks, used in deadlock free fault-tolerant routing algorithms has similarities with rectangular regions. We have improved and adopted one suchalgorithm to provide deadlock free routing in NoC with regions. This work also offers a methodology for designing topology agnostic, deadlockfree, highly adaptive application specific routing algorithms. The methodology exploits information about communication among tasks of anapplication. This is used in the analysis of deadlock freedom, such that fewer deadlock preventing routing restrictions are required. A comparative study of the two proposed routing algorithms shows that the application specific algorithm gives significantly higher performance.But, the fault-tolerant algorithm may be preferred for systems requiring support for general communication. Several extensions to our work areproposed, for example in areas such as core mapping and efficient routing algorithms. The region concept can be extended for supporting reuse ofa pre-designed NoC as a component in a larger hierarchical NoC.

Mobile Ad hoc Networks (MANETs) are of great interest to researchers and have become very popular in the last few years. One of the great challenges is to provide a routing protocol that is capable of offering the shortest and most reliable path in a MANET in which users are moving continuously and have no base station to be used as a reference for their position. This thesis proposes some new routing protocols based on the angles (directions) of the adjacent mobile nodes and also the node density. In choosing the next node in forming a route, the neighbour node with the closest heading angle to that of the node of interest is selected, so the connection between the source and the destination consists of a series of nodes that are moving in approximately the same direction. The rationale behind this concept is to maintain the connection between the nodes as long as possible. This is in contrast to the well known hop count method, which does not consider the connection lifetime. We propose three enhancements and modifications of the Ad-hoc on demand distance vector (AODV) protocol that can find a suitable path between source and destination using combinations and prioritization of angle direction and hop count. Firstly, we consider that if there are multiple routing paths available, the path with the minimum hop count is selected and when the hop counts are the same the path with the best angle direction is selected. Secondly, if multiple routing paths are available the paths with the best angle direction are chosen but if the angles are the same (fall within the same specified segment), the path with minimum hop count is chosen. Thirdly, if there is more than one path available, we calculate the average of all the heading angles in every path and find the best one (lowest average) from the source to the destination. In MANETs, flooding is a popular message broadcasting technique so we also propose a new scheme for MANETS where the value of the rebroadcast packets for every host node is dynamically adjusted according to the number of its neighbouring nodes. A fixed probabilistic scheme algorithm that can dynamically adjust the rebroadcasting probability at a given node according to its ID is also proposed; Fixed probabilistic schemes are one of the solutions to reduce rebroadcasts and so alleviate the broadcast storm problem. Performance evaluation of the proposed schemes is conducted using the Global Mobile Information System (GloMoSim) network simulator and varying a number of important MANET parameters, including node speed, node density, number of nodes and number of packets, all using a Random Waypoint (RWP) mobility model. Finally, we measure and compare the performance of all the proposed approaches by evaluating them against the standard AODV routing protocol. The simulation results reveal that the proposed approaches give relatively comparable overall performance but which is better than AODV for almost all performance measures and scenarios examined.

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

No description available.