Log in

Relevant bibliographies by topics / QoS routing algorithm / Dissertations / Theses

To see the other types of publications on this topic, follow the link: QoS routing algorithm.

Dissertations / Theses on the topic 'QoS routing algorithm'

Author: Grafiati

Published: 3 June 2025

Last updated: 31 July 2025

Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles

Select a source type:

Consult the top 50 dissertations / theses for your research on the topic 'QoS routing algorithm.'

Next to every source in the list of references, there is an 'Add to bibliography' button. Press on it, and we will generate automatically the bibliographic reference to the chosen work in the citation style you need: APA, MLA, Harvard, Chicago, Vancouver, etc.

You can also download the full text of the academic publication as pdf and read online its abstract whenever available in the metadata.

Browse dissertations / theses on a wide variety of disciplines and organise your bibliography correctly.

1

Abdullah, Jiwa. "QoS routing for mobile ad hoc networks using genetic algorithm." Thesis, Loughborough University, 2007. https://dspace.lboro.ac.uk/2134/35198.

Full text

Abstract:

Mobile Ad Hoc Networks (MANETs) are a class of infrastructure less network architecture which are formed by a collection of mobile nodes that communicate with each other using multi-hop wireless links. They eliminate the need for central management, hence each node must operate cooperatively to successfully maintain the network. Each node performs as a source, a sink and a router. Future applications of MANETs are expected to be based on all-IP architecture, carrying a multitude of real-time multimedia applications such as voice, video and data. It would be necessary for MANETs to have an effi

APA, Harvard, Vancouver, ISO, and other styles

2

Hashem, Eiza Mahmoud. "Secure multi-constrained QoS reliable routing algorithm for vehicular ad hoc networks (VANETs)." Thesis, Brunel University, 2014. http://bura.brunel.ac.uk/handle/2438/10204.

Full text

Abstract:

Vehicular Ad hoc Networks (VANETs) are a particular form of wireless network made by vehicles communicating among themselves and with roadside base stations. A wide range of services has been developed for VANETs ranging from safety to infotainment applications. A key requirement for such services is that they are offered with Quality of Service (QoS) guarantees in terms of service reliability and availability. Furthermore, due to the openness of VANET’s wireless channels to both internal and external attacks, the application of security mechanisms is mandatory to protect the offered QoS guara

APA, Harvard, Vancouver, ISO, and other styles

3

Mendoça, Pedroso Pedro Miguel. "GMPLS-OBS interoperability and routing acalability in internet." Doctoral thesis, Universitat Politècnica de Catalunya, 2011. http://hdl.handle.net/10803/52565.

Full text

Abstract:

The popularization of Internet has turned the telecom world upside down over the last two decades. Network operators, vendors and service providers are being challenged to adapt themselves to Internet requirements in a way to properly serve the huge number of demanding users (residential and business). The Internet (data-oriented network) is supported by an IP packet-switched architecture on top of a circuit-switched, optical-based architecture (voice-oriented network), which results in a complex and rather costly infrastructure to the transport of IP traffic (the dominant traffic nowadays). I

APA, Harvard, Vancouver, ISO, and other styles

4

Porwal, Rupesh. "Adaptive Selective Flooding Qos Routing." Thesis, Indian Institute of Science, 2002. https://etd.iisc.ac.in/handle/2005/3924.

Full text

Abstract:

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,

APA, Harvard, Vancouver, ISO, and other styles

5

Porwal, Rupesh. "Adaptive Selective Flooding Qos Routing." Thesis, Indian Institute of Science, 2002. http://hdl.handle.net/2005/51.

Full text

Abstract:

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, a

APA, Harvard, Vancouver, ISO, and other styles

6

Li, Ding. "Localised Routing Algorithms with Quality of Service Constraints. Development and performance evaluation by simulation of new localised Quality of Service routing algorithms for communication networks using residual bandwidth and mean end-to-end delay as metrics." Thesis, University of Bradford, 2010. http://hdl.handle.net/10454/4912.

Full text

Abstract:

Localised QoS routing is a relatively new, alternative and viable approach to solve the problems of traditional QoS routing algorithms which use global state information resulting in the imposition of a large communication overhead and route flapping. They make use of a localised view of the network QoS state in source nodes to select paths and route flows to destination nodes. Proportional Sticky Routing (PSR) and Credit Based Routing (CBR) have been proposed as localised QoS routing schemes and these can offer comparable performances. However, since network state information for a specific p

APA, Harvard, Vancouver, ISO, and other styles

7

Aldosari, Fahd M. "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 strategies." Thesis, University of Bradford, 2011. http://hdl.handle.net/10454/5406.

Full text

Abstract:

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 req

APA, Harvard, Vancouver, ISO, and other styles

8

Alghamdi, Turki A. "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 selection." Thesis, University of Bradford, 2010. http://hdl.handle.net/10454/5420.

Full text

Abstract:

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 lo

APA, Harvard, Vancouver, ISO, and other styles

9

Fathelrahman, T. M. (Tayseer). "QoS routing in IP networks using multi-constrained computational methods." Thesis, Stellenbosch : University of Stellenbosch, 2010. http://hdl.handle.net/10019.1/4098.

Full text

Abstract:

Thesis (MSc (Mathematics))--University of Stellenbosch, 2010.<br>ENGLISH ABSTRACT: In this thesis, we consider the multi-constraints QoS routing problem in IP networks. Namely, we consider the problem of minimizing the path delays on IP networks. We use genetic algorithms to perform the optimization, some penalty function methods and the simulated annealing method for handling the problems constraints. Our aim is to compare the performance of di erent penalty function methods and the simulated annealing method. The penalty function methods under consideration include penalty methods with

APA, Harvard, Vancouver, ISO, and other styles

10

Supreeth, Koushik Sheshadri. "Multi-constrained node-disjoint multipath QoS routing algorithms for status dissemination networks." Online access for everyone, 2004. http://www.dissertations.wsu.edu/Thesis/Spring2004/S%5FSheshadri%5F050304.pdf.

Full text

APA, Harvard, Vancouver, ISO, and other styles

11

Mohammad, Abdulbaset H. T. "Localised Routing Algorithms in Communication Networks with Quality of Service Constraints. Performance Evaluation and Enhancement of New Localised Routing Approaches to Provide Quality of Service for Computer and Communication Networks." Thesis, University of Bradford, 2010. http://hdl.handle.net/10454/5163.

Full text

Abstract:

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 res

APA, Harvard, Vancouver, ISO, and other styles

12

Alzahrani, Ahmed S. "Localized Quality of Service Routing Algorithms for Communication Networks. The Development and Performance Evaluation of Some New Localized Approaches to Providing Quality of Service Routing in Flat and Hierarchical Topologies for Computer Networks." Thesis, University of Bradford, 2009. http://hdl.handle.net/10454/4254.

Full text

Abstract:

Quality of Service (QoS) routing considered as one of the major components of the QoS framework in communication networks. The concept of QoS routing has emerged from the fact that routers direct traffic from source to destination, depending on data types, network constraints and requirements to achieve network performance efficiency. It has been introduced to administer, monitor and improve the performance of computer networks. Many QoS routing algorithms are used to maximize network performance by balancing traffic distributed over multiple paths. Its major components include bandwidth, dela

APA, Harvard, Vancouver, ISO, and other styles

13

Pham, Tran Anh Quang. "Algorithms and optimization for quality of experience aware routing in wireless networks : from centralized to decentralized solutions." Thesis, Rennes 1, 2017. http://www.theses.fr/2017REN1S002/document.

Full text

Abstract:

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é

APA, Harvard, Vancouver, ISO, and other styles

14

Mustafa, Elmabrook B. M. "Some new localized quality of service models and algorithms for communication networks : the development and evaluation of new localized quality of service routing algorithms and path selection methods for both flat and hierarchical communication networks." Thesis, University of Bradford, 2009. http://hdl.handle.net/10454/4288.

Full text

Abstract:

The Quality of Service (QoS) routing approach is gaining an increasing interest in the Internet community due to the new emerging Internet applications such as real-time multimedia applications. These applications require better levels of quality of services than those supported by best effort networks. Therefore providing such services is crucial to many real time and multimedia applications which have strict quality of service requirements regarding bandwidth and timeliness of delivery. QoS routing is a major component in any QoS architecture and thus has been studied extensively in the lite

APA, Harvard, Vancouver, ISO, and other styles

15

Bouzid, Salah Eddine. "Optimisation multicritères des performances de réseau d’objets communicants par méta-heuristiques hybrides et apprentissage par renforcement." Thesis, Le Mans, 2020. http://cyberdoc-int.univ-lemans.fr/Theses/2020/2020LEMA1026.pdf.

Full text

Abstract:

Le déploiement des réseaux d’objets communicants «ROCs», dont les densités augmentent sans cesse, conditionne à la fois l’optimalité de leur qualité de service, leur consommation énergétique et par conséquent leur durée de vie. Il s’avère que le problème de déterminer le placement optimal, relativement aux différents critères de qualité, des nœuds de ces réseaux est un problème Np-Complet. Face à cette Np-complétude, et en particulier pour des environnements intérieurs, les approches existantes focalisent sur l’optimisation d’un seul objectif en négligeant les autres critères, ou optent pour u

APA, Harvard, Vancouver, ISO, and other styles

16

Boudargham, Nadine. "Competent QoS-aware and energy efficient protocols for body sensor networks." Thesis, Bourgogne Franche-Comté, 2020. http://www.theses.fr/2020UBFCD007.

Full text

Abstract:

Les réseaux de capteurs corporels (RC2) sont constitués de bio-capteurs à faibles ressources énergétiques et de calcul. Ils collectent des données physiologiques du corps humain et de son environnement, et les transmettent à un coordinateur comme le PDA (Personal Digital Assistant) ou un smartphone, pour être acheminé ensuite aux experts de santé. Les réseaux de capteurs corporels collaboratifs (RC3) sont une collection de RC2 qui se déplacent dans une zone donnée et collaborent,interagissent et échangent des données entre eux pour identifier l'activité du groupe et surveiller l'état individue

APA, Harvard, Vancouver, ISO, and other styles

17

Al-Turaihi, Firas Sabah Salih. "Performance improvement for mobile ad hoc cognitive packets network." Thesis, Brunel University, 2018. http://bura.brunel.ac.uk/handle/2438/17123.

Full text

Abstract:

In this thesis, focusing on the quality of service (QoS) improvement using per-packet power control algorithm in Ad Hoc Cognitive Packet Networks (AHCPN). A power control mechanism creates as a network-assisted function of ad hoc cognitive packet-based routing and aims at reducing both energy consumption in nodes and QoS requirements. The suggested models facilitate transmission power adjustments while also taking into account the effects on network performance. The thesis concentrate on three main contributions. Firstly, a power control algorithm, namely the adaptive Distributed Power managem

APA, Harvard, Vancouver, ISO, and other styles

18

Urra, i. Fàbregas Anna. "Multi-layer survivability: routing schemes for GMPLS-based networks." Doctoral thesis, Universitat de Girona, 2006. http://hdl.handle.net/10803/7883.

Full text

Abstract:

En les xarxes IP/MPLS sobre WDM on es transporta gran quantitat d'informacio, la capacitat de garantir que el trafic arriba al node de desti ha esdevingut un problema important, ja que la fallada d'un element de la xarxa pot resultar en una gran quantitat d'informacio perduda. Per garantir que el trafic afectat per una fallada arribi al node desti, s'han definit nous algoritmes d'encaminament que incorporen el coneixement de la proteccio en els dues capes: l'optica (WDM) i la basada en paquets (IP/MPLS). D'aquesta manera s'evita reservar recursos per protegir el trafic a les dues capes. Els no

APA, Harvard, Vancouver, ISO, and other styles

19

Rego, Máñez Albert. "Intelligent multimedia flow transmission through heterogeneous networks using cognitive software defined networks." Doctoral thesis, Universitat Politècnica de València, 2021. http://hdl.handle.net/10251/160483.

Full text

Abstract:

[ES] La presente tesis aborda el problema del encaminamiento en las redes definidas por software (SDN). Específicamente, aborda el problema del diseño de un protocolo de encaminamiento basado en inteligencia artificial (AI) para garantizar la calidad de servicio (QoS) en transmisiones multimedia. En la primera parte del trabajo, el concepto de SDN es introducido. Su arquitectura, protocolos y ventajas son comentados. A continuación, el estado del arte es presentado, donde diversos trabajos acerca de QoS, encaminamiento, SDN y AI son detallados. En el siguiente capítulo, el controlador S

APA, Harvard, Vancouver, ISO, and other styles

20

Calle, Ortega Eusebi. "Enhanced fault recovery methods for protected traffic services in GMPLS networks." Doctoral thesis, Universitat de Girona, 2004. http://hdl.handle.net/10803/7727.

Full text

Abstract:

Les noves tecnologies a la xarxa ens permeten transportar, cada cop més, grans volums d' informació i trànsit de xarxa amb diferents nivells de prioritat. En aquest escenari, on s'ofereix una millor qualitat de servei, les conseqüències d'una fallada en un enllaç o en un node esdevenen més importants. <br/>Multiprotocol Lavel Switching (MPLS), juntament amb l'extensió a MPLS generalitzat (GMPLS), proporcionen mecanismes ràpids de recuperació de fallada establint camins, Label Switch Path (LSPs), redundants per ser utilitzats com a camins alternatius. En cas de fallada podrem utilitzar aquests

APA, Harvard, Vancouver, ISO, and other styles

21

Ben, Slimane Jamila. "Allocation conjointe des canaux de fréquence et des créneaux de temps et routage avec QdS dans les réseaux de capteurs sans fil denses et étendus." Electronic Thesis or Diss., Université de Lorraine, 2013. http://www.theses.fr/2013LORR0224.

Full text

Abstract:

Le thème général du sujet tourne autour de l'optimisation inter-couche des réseaux de capteurs basés sur la technologie ultra large bande ULB (UWB, Ultra Wide Band) moyennant des solutions protocolaires permettant d'un côté de répondre au besoin de qualité de service QdS à critères multiples dans les réseaux de capteurs sans fil et d'autre côté d'assurer le partage et l'allocation efficace les ressources disponibles (spectrale et temporelle) ainsi que l'optimisation de la consommation d'énergie dans des tels réseaux. Le domaine d'application cible choisi dans le présent travail est les système

APA, Harvard, Vancouver, ISO, and other styles

22

Ben, Slimane Jamila. "Allocation conjointe des canaux de fréquence et des créneaux de temps et routage avec QdS dans les réseaux de capteurs sans fil denses et étendus." Thesis, Université de Lorraine, 2013. http://www.theses.fr/2013LORR0224/document.

Full text

Abstract:

Le thème général du sujet tourne autour de l'optimisation inter-couche des réseaux de capteurs basés sur la technologie ultra large bande ULB (UWB, Ultra Wide Band) moyennant des solutions protocolaires permettant d'un côté de répondre au besoin de qualité de service QdS à critères multiples dans les réseaux de capteurs sans fil et d'autre côté d'assurer le partage et l'allocation efficace les ressources disponibles (spectrale et temporelle) ainsi que l'optimisation de la consommation d'énergie dans des tels réseaux. Le domaine d'application cible choisi dans le présent travail est les système

APA, Harvard, Vancouver, ISO, and other styles

23

Alabbad, Saad H., and Mike E. Woodward. "Localised Credit Based QoS Routing." 2006. http://hdl.handle.net/10454/3832.

Full text

Abstract:

No<br>Localized Quality of Service (QoS) routing has recently been proposed as a viable alternative approach to traditional QoS routing algorithms that use global state information. In this approach, problems associated with maintaining global state information and the staleness of such information are avoided by having the source nodes to infer the network QoS state based on flow blocking statistics collected locally, and perform flow routing using this localized view of the network QoS state . In this paper we introduce a credit based routing algorithm (cbr) which is a simple yet effective l

APA, Harvard, Vancouver, ISO, and other styles

24

Jishnu, A. "QoS Routing With Multiple Constraints." Thesis, 2004. https://etd.iisc.ac.in/handle/2005/1125.

Full text

APA, Harvard, Vancouver, ISO, and other styles

25

Jishnu, A. "QoS Routing With Multiple Constraints." Thesis, 2004. http://hdl.handle.net/2005/1125.

Full text

APA, Harvard, Vancouver, ISO, and other styles

26

Chen, Chia-Jung, and 陳嘉瑢. "A QoS Routing Algorithm and its Performance Evaluation." Thesis, 2001. http://ndltd.ncl.edu.tw/handle/19965378084547484410.

Full text

Abstract:

碩士<br>國立交通大學<br>電信工程系<br>89<br>With the coming of Broadband Internet era, there are more and more new applications. Some real-time applications need guarantees for QoS (Quality of Service), so the demand for QoS routing algorithms comes into existence. QoS routing algorithm can find a path that is satisfied with the requests for the QoS traffic. Besides, the QoS routing algorithms have to consider their effect on the other traffic in the network. Each time when a new connection comes into the network, the selection of its routing path is an important issue. In addition to considerin

APA, Harvard, Vancouver, ISO, and other styles

27

Chu, Yen-Ting, and 朱晏廷. "A hybrid PSO/ACO algorithm for QoS multicast routing." Thesis, 2009. http://ndltd.ncl.edu.tw/handle/59771352513217276539.

Full text

Abstract:

碩士<br>國立暨南國際大學<br>資訊管理學系<br>97<br>The problem for finding the minimum cost multicasting tree with multiple constraints is NP-complete. This paper describes the Quality of Service (QoS) multicast routing problem with bandwidth and delay constraints and proposed a hybrid algorithm based on metaheuristics. Our algorithm hybridizes particle swarm optimization (PSO) and ant colony optimization (ACO) with the media through pheromone and guiding best solutions. We first introduce a new encoding method for the multicasting tree and then propose a heuristic based on tabu list and feedback list in order

APA, Harvard, Vancouver, ISO, and other styles

28

Shih, Tsung-Jung, and 施宗榮. "Adaptive Routing Algorithm with QoS support in Heterogeneous Wireless Network." Thesis, 2004. http://ndltd.ncl.edu.tw/handle/57001311712204616694.

Full text

Abstract:

碩士<br>國立中山大學<br>資訊工程學系研究所<br>92<br>With the progress of wireless radio technology and telecommunication, various wireless specifications and protocols form the unhandy heterogeneous network. The routing problems in heterogeneous network become popular researches nowadays. In this thesis, we integrate cellular (3G) network and Mobile Ad-Hoc Network (MANET) into a hybrid network. This hybrid network is called heterogeneous wireless network(HWN) with multi-cells architecture to overcome the weakness of cellular network and Ad-Hoc network. Based on HWN, we propose a routing algorithm with qualit

APA, Harvard, Vancouver, ISO, and other styles

29

Hsu, Shih-Chin, and 許矢勤. "A QoS-Enabled Multicast Routing Algorithm for Supporting Streaming Service." Thesis, 2003. http://ndltd.ncl.edu.tw/handle/20200206206232984371.

Full text

Abstract:

碩士<br>國立成功大學<br>資訊工程學系碩博士班<br>91<br>Today there are the great usage of network and strong necessary of multimedia, and how to provide the needed Quality-of-Service (QoS) for streaming service is an important issue. These needed QoS for streaming service includes bandwidth, delay, and delay variation. Among these requirements, the needed bandwidth for network multimedia transmission is very large, and using multicasting to replace general routing is a good choice to lower down the bandwidth-consumption. Therefore, we proposed a multicasting algorithm and adopted some QoS mechanisms for stre

APA, Harvard, Vancouver, ISO, and other styles

30

Chiang, Jeng-Long, and 江政龍. "A Two-Pass QoS Routing Algorithm Based on Bounded Flooding." Thesis, 2001. http://ndltd.ncl.edu.tw/handle/25258614652223998700.

Full text

Abstract:

碩士<br>國立清華大學<br>資訊工程學系<br>89<br>Quality-of-Service (QoS) routing is extensively received for emerging distributed multimedia applications, which have stringent QoS requirements in terms of bandwidth, delay, delay jitter, cost or loss rate, etc. Essentially, QoS routing explores qualified routes between senders and receivers for establishing connections with some QoS guarantees. Previous studies on QoS routing can be classified into two categories: link-state based and probing based. Link-state approaches suffer from complexity of route computation, overhead of link-state dissemination, and imp

APA, Harvard, Vancouver, ISO, and other styles

31

Deb, S. S., and Mike E. Woodward. "A New Distributed QoS Routing Algorithm Based on Fano's Method." 2005. http://hdl.handle.net/10454/3411.

Full text

Abstract:

No<br>Providing a guaranteed quality-of-service (QoS) is essential to many real-time applications. The existing distributed QoS routing algorithms are based on either shortest path or flooding and both tend to have high message overhead. A new distributed unicast QoS routing algorithm based on Fano¿s decoding method is studied. Fano¿s decoding method is a technique used in error control coding and it attempts to trace an optimal path probabilistically. The similarity of various aspects of Fano¿s decoding method to a QoS routing algorithm and the benefits it can provide encourages us to investi

APA, Harvard, Vancouver, ISO, and other styles

32

Tsai, Chih-Hui, and 蔡志輝. "An Algorithm for Supporting Multimedia Applications on Multi-Constrained QoS Routing." Thesis, 2006. http://ndltd.ncl.edu.tw/handle/57078348572827197625.

Full text

Abstract:

碩士<br>國立屏東科技大學<br>資訊管理系<br>94<br>Multicast routing supports real-time communication and multimedia services over Internet and allows to use network resources more efficiently by sending only a single copy of multimedia data to all group members. In order to support those new applications and services often require quality of service (QoS) guarantees from the network. For solving multiple QoS constrains of multicast routing problem in large scale networks, this thesis proposes a new algorithm called DHQMRA (Degree-Heuristic QoS Multicast Routing Algorithm) using extened Dijkstra’s algorithm and

APA, Harvard, Vancouver, ISO, and other styles

33

Wang, Chang-Jen, and 王彰人. "Design of an Efficient Multicast Routing Algorithm for Satisfying QoS Requirements." Thesis, 2005. http://ndltd.ncl.edu.tw/handle/75143340672716601185.

Full text

Abstract:

碩士<br>國立屏東科技大學<br>資訊管理系<br>93<br>Multicast is a very crucial research topic in communication networks. Nowadays, multicast-based applications have a pervasive presence and influence in our wide area network. In the future, various consumer electronics will use future high-speed networks and in many cases will include multiple users. Hence, multicast routing algorithms can efficiently manage network resources and satisfy the QoS requirements of individual applications are becoming increasingly important. Several new communication technologies have appeared recently, including multimedia telecon

APA, Harvard, Vancouver, ISO, and other styles

34

Ke, Bo-Syun, and 柯伯勳. "A QoS-aware Routing Algorithm for SDN-based Data Center Networks." Thesis, 2015. http://ndltd.ncl.edu.tw/handle/752g5k.

Full text

Abstract:

碩士<br>國立交通大學<br>網路工程研究所<br>103<br>Nowadays, the booming of big data has aroused a great interest of academic and business communities in big data. With more and more big data applications running in cloud data centers, the traffic exchanged among switches in cloud data centers has grown up rapidly, which may lead to the congestion problem between switches and that results in low throughput performance in cloud data centers. With software-define networks (SDN) architecture, the routing algorithm can be realized as a routing application at the top of the SDN controller and find an optimal path f

APA, Harvard, Vancouver, ISO, and other styles

35

Deng, Guo-Cin, and 鄧國欽. "An Application-aware QoS Routing Algorithm for SDN-based IoT Networking." Thesis, 2017. http://ndltd.ncl.edu.tw/handle/9thwn8.

Full text

Abstract:

碩士<br>國立交通大學<br>資訊科學與工程研究所<br>105<br>With numerous emerging internet of things (IoT) devices, they generate big data. The big data transmitted to the remote cloud will consume massive network bandwidth. This may result in the traditional IoT network easily encountering performance degradation and network congestion problems. Moreover, there are IoT applications that need to transfer multimedia messages with multiple quality of service (QoS) requirements to guarantee messages delivered successfully in the IoT network. A state-of-the-art, MINA, intends to meet multiple QoS requirements of IoT ap

APA, Harvard, Vancouver, ISO, and other styles

36

Hsieh, Yu-Jen, and 謝友仁. "A Near-Optimail Distributed QoS Constrained Routing Algorithm for Multichannel Wireless Mesh Networks." Thesis, 2009. http://ndltd.ncl.edu.tw/handle/07981979472416120389.

Full text

Abstract:

碩士<br>國立臺灣大學<br>資訊管理學研究所<br>97<br>Wireless mesh networks (WMNs) are considered as a solution to providing last-mile broadband Internet access. Employing multiple channels into WMN is shown to be an efficient way to conquer the degradation of capacity due to the interferences. For each user, it is desirable to choose the route with low interference and minimum delay to access the Internet; however, this is suboptimal for the whole system. 　　In this thesis, we propose a simple channel assignment heuristic algorithm which is easy for implementation and makes each node have locally maximal paralle

APA, Harvard, Vancouver, ISO, and other styles

37

Luo, Jin-Shing, and 駱進興. "Distributed-and-Weighted QoS Routing Algorithm--The Analysis on Performance and Signaling Overhead." Thesis, 2003. http://ndltd.ncl.edu.tw/handle/5w5vaa.

Full text

Abstract:

碩士<br>靜宜大學<br>資訊管理學系研究所<br>91<br>Many real-time multimedia transmission requirements are emerging in recent and future wired or wireless communication networks. For the transmission of such information, quality of service (QoS) that guarantee the real-time arrival of these data is especially important. To meet the QoS requirement, finding a suitable network path with enough resource or capacity to transmit the data is an important issue to achieve the goal. This issue is generally called the QoS routing problem. There have been many researches discussing the QoS routing problem. The thesis ev

APA, Harvard, Vancouver, ISO, and other styles

38

Woodward, Mike E., and Feng Gao. "A Hybrid Topological-Stochastic Partitioning Method for Scaling QoS Routing Algorithms." 2007. http://hdl.handle.net/10454/3063.

Full text

Abstract:

No<br>This paper presents a new partitioning strategy with the objective of increasing scalability by reducing computational effort of routing in networks. The original network is partitioned into blocks (subnetworks) so that there is a bi-directional link between any two blocks. When there is a connection request between a pair of nodes, if the nodes are in the same block, we only use the small single block to derive routings. Otherwise we combine the two blocks where the two nodes locate and in this way the whole network will never be used. The strategy is generic in that it can be used in a

APA, Harvard, Vancouver, ISO, and other styles

39

Peng, Chong-sheng, and 彭崇聖. "A Fixed Interference-free Channel Assignment and QoS Routing Algorithm in Wireless Mesh Networks." Thesis, 2009. http://ndltd.ncl.edu.tw/handle/89270307493602639056.

Full text

Abstract:

碩士<br>國立臺灣科技大學<br>電子工程系<br>97<br>A Wireless Mesh Network (WMN) is a novel wireless broadband access technology. It has low cost to build up and manage. Because of the feature of interference between neighbor nodes in multi-hop networks, the available bandwidth decreases seriously. More and more researchers are interested in multi-radio and multi-channel WMN field. Increase simultaneous transmissions can greatly improve the WMN throughput. Because WMN routers are stationary, we propose a fixed channel assignment scheme for avoiding the hidden node problem. Routing is another important topic for

APA, Harvard, Vancouver, ISO, and other styles

40

Chen, Hung-Chieh, and 陳宏傑. "Using Modified Dynamic Multicast Routing Algorithm to Solve Transmission Path under Various QoS Constraints." Thesis, 2006. http://ndltd.ncl.edu.tw/handle/85549528024350986018.

Full text

Abstract:

碩士<br>國立屏東科技大學<br>資訊管理系<br>94<br>With unceasing variant requirements about future network, QoS of the multicast routing problem attachs great importance to many researchers. Under 3G’s era will be approaching, it’s no longer come up to user’s requirements by current network settings. So it should use better multicast routing method to serve them by means of suitable ways. In other papers, they have introduced some methods to construct dynamic multicast routing, such as Naïve, Greedy, WGA, DDMA, but outcomes weren’t obvious that we expected. The first three algorithms consider only one factor o

APA, Harvard, Vancouver, ISO, and other styles

41

Liao, Chuen-chieh, and 廖俊傑. "Finding a Multicast Routing Tree Based on QoS Constraint Using a Genetic Algorithm with Fuzzy Selection and Local Search." Thesis, 2005. http://ndltd.ncl.edu.tw/handle/u9dr46.

Full text

Abstract:

碩士<br>朝陽科技大學<br>資訊管理系碩士班<br>93<br>Most of network based on Fiber constructed as a middle-ware from a source node to destination nodes, the fiber supplies a huge of high-speed network. Therefore, many of new communication applications have emerged, such as distribution systems, on-line video-services, and some other applications. These services must ensure stable QoS (Quality of Service) and provide acceptable link costs, time delay, bandwidth, and packet loss constraints, essentially a multicast routing problem. In multicast routing problems, to construct the least-cost multicast routing tree

APA, Harvard, Vancouver, ISO, and other styles

42

Lee, Wen-Chuan, and 李文專. "A Modified Ant-based Algorithm to Solve Multicast Routing with QoS Support and Topology Design Problem in Communication Network." Thesis, 2005. http://ndltd.ncl.edu.tw/handle/37388268995122109780.

Full text

Abstract:

碩士<br>國立屏東科技大學<br>資訊管理系<br>93<br>This thesis proposes a modified ant-based algorithm of ACO (Ant Colony Optimization), called ACOS (Ant Colony Optimization with Stage), to solve multicast routing problem in the multimedia communication network. Based on the ant algorithm, this thesis proposes a distributed multicast routing scheme with least-cost routing path and QoS (Quality of Service) support. It also can be used to solve the network topology design problem. By a strategy with stage, ACOS can obtain a effective and efficient achievement. Comparing with ACO algorithm, it is observed that ACO

APA, Harvard, Vancouver, ISO, and other styles

43

Hadimani, Vijayalakshmi. "Efficient Bandwidth Constrained Routing Protocols For Communication Networks." Thesis, 2006. https://etd.iisc.ac.in/handle/2005/319.

Full text

Abstract:

QoS routing is one of the major building blocks for supporting QoS in communication networks and, hence, a necessary component of future communication networks. Bandwidth- Constrained Routing Algorithm (BCRA) may help to satisfy QoS requirements such as end-to-end delay, delay-jitter etc when WFQ-like (Weighted Fair Queuing) scheduling mechanisms are deployed. The existing algorithms for bandwidth constrained routing suffer from high message overhead and have a high computational and space complexity. The work presented in the thesis, therefore, focuses on the different techniques that an be

APA, Harvard, Vancouver, ISO, and other styles

44

Hadimani, Vijayalakshmi. "Efficient Bandwidth Constrained Routing Protocols For Communication Networks." Thesis, 2006. http://hdl.handle.net/2005/319.

Full text

Abstract:

QoS routing is one of the major building blocks for supporting QoS in communication networks and, hence, a necessary component of future communication networks. Bandwidth- Constrained Routing Algorithm (BCRA) may help to satisfy QoS requirements such as end-to-end delay, delay-jitter etc when WFQ-like (Weighted Fair Queuing) scheduling mechanisms are deployed. The existing algorithms for bandwidth constrained routing suffer from high message overhead and have a high computational and space complexity. The work presented in the thesis, therefore, focuses on the different techniques that an be

APA, Harvard, Vancouver, ISO, and other styles

45

Chen, Yun-Wen, and 陳韻文. "QoS Routing Algorithms for Multiple Traffic Classes." Thesis, 2000. http://ndltd.ncl.edu.tw/handle/06201570684456489166.

Full text

Abstract:

碩士<br>國立中正大學<br>資訊工程研究所<br>88<br>One of the most important features of the next generation Internet is the ability to provide quality of service (QOS) guarantee. Recent developments in Internet provide at least two types of service. For example, guaranteed service and controlled load service in Integrated services networks, and expedited forwarding and assured forwarding in Differentiated services networks. Providing guaranteed service and expedited service, referred to as bandwidth-guaranteed traffic, requires reservation of a fixed amount of bandwidth while controlled load service and assure

APA, Harvard, Vancouver, ISO, and other styles

46

Tzu-Lun, Huang. "Design and Analysis of Distributed QoS Multicast Routing Algorithms." 2006. http://www.cetd.com.tw/ec/thesisdetail.aspx?etdun=U0001-0607200621170000.

Full text

APA, Harvard, Vancouver, ISO, and other styles

47

Teng, Kia Seong. "QoS-based unicast routing algorithms for high speed internetworks." 2005. http://hdl.handle.net/1993/20262.

Full text

APA, Harvard, Vancouver, ISO, and other styles

48

Huang, Tzu-Lun, and 黃子倫. "Design and Analysis of Distributed QoS Multicast Routing Algorithms." Thesis, 2006. http://ndltd.ncl.edu.tw/handle/69969472600973689714.

Full text

Abstract:

博士<br>國立臺灣大學<br>資訊工程學研究所<br>94<br>How to provide an efficient quality of service (QoS) routing in wide area networks (WAN) or in Internet has been an important research issue since about 1990. In the dissertation, we propose efficient heuristic-based distributed algorithms for addressing the problem of multicast routing with multiple QoS constraints. Two types of multicast routing problem are considered, bi-criteria routing and multi-criteria routing. In bi-criteria routing, we first review some existing algorithms, and point out errors in the well-known algorithm due to Jia [24] by two counte

APA, Harvard, Vancouver, ISO, and other styles

49

Hu, Chin Hwa, and 胡晉華. "Admission Control and QoS-constrained Routing Algorithms Considering Multicast Service and Traffic Rerouting." Thesis, 2003. http://ndltd.ncl.edu.tw/handle/35070939824504196646.

Full text

Abstract:

碩士<br>國立臺灣大學<br>資訊管理研究所<br>91<br>Because effective bandwidth transforms the complex non-linear influence between traffic flows into a linear expression, it reduces the complexity of the traffic model. The notion of effective bandwidths has provided an useful practical framework for call admission control and capacity planning problems. In this thesis, we first propose a general call admission control and QoS-constrained routing algorithm. The difference between this proposed algorithm and other algorithms is that when we decide whether the new traffic flow is admitted, rerouting of

APA, Harvard, Vancouver, ISO, and other styles

50

Parag, Parimal. "Delay-sensitive Communications Code-Rates, Strategies, and Distributed Control." Thesis, 2011. http://hdl.handle.net/1969.1/ETD-TAMU-2011-12-10699.

Full text

Abstract:

An ever increasing demand for instant and reliable information on modern communication networks forces codewords to operate in a non-asymptotic regime. To achieve reliability for imperfect channels in this regime, codewords need to be retransmitted from receiver to the transmit buffer, aided by a fast feedback mechanism. Large occupancy of this buffer results in longer communication delays. Therefore, codewords need to be designed carefully to reduce transmit queue-length and thus the delay experienced in this buffer. We first study the consequences of physical layer decisions on the transmit

APA, Harvard, Vancouver, ISO, and other styles

We offer discounts on all premium plans for authors whose works are included in thematic literature selections. Contact us to get a unique promo code!