Zaloguj się

Gotowe bibliografie tematyczne / QoS routing algorithm / Artykuły w czasopismach

Kliknij ten link, aby zobaczyć inne rodzaje publikacji na ten temat: QoS routing algorithm.

Artykuły w czasopismach na temat „QoS routing algorithm”

Autor: Grafiati

Data publikacji: 3 czerwca 2025

Data aktualizacji: 31 lipca 2025

Utwórz poprawne odniesienie w stylach APA, MLA, Chicago, Harvard i wielu innych

Wybierz rodzaj źródła:

Sprawdź 50 najlepszych artykułów w czasopismach naukowych na temat „QoS routing algorithm”.

Przycisk „Dodaj do bibliografii” jest dostępny obok każdej pracy w bibliografii. Użyj go – a my automatycznie utworzymy odniesienie bibliograficzne do wybranej pracy w stylu cytowania, którego potrzebujesz: APA, MLA, Harvard, Chicago, Vancouver itp.

Możesz również pobrać pełny tekst publikacji naukowej w formacie „.pdf” i przeczytać adnotację do pracy online, jeśli odpowiednie parametry są dostępne w metadanych.

Przeglądaj artykuły w czasopismach z różnych dziedzin i twórz odpowiednie bibliografie.

1

Barolli, Leonard, Makoto Ikeda, Giuseppe De Marco, Arjan Durresi, Akio Koyama, and Jiro Iwashige. "A Search Space Reduction Algorithm for Improving the Performance of a GA-Based QoS Routing Method in Ad-Hoc Networks." International Journal of Distributed Sensor Networks 3, no. 1 (2007): 41–57. http://dx.doi.org/10.1080/15501320601067881.

Pełny tekst źródła

Streszczenie:

A lot of work has been done on routing in MANETs. However, the proposed routing solutions deal only with the best effort data traffic. Connections with Quality of Service (QoS) requirements are not supported. The QoS routing has been receiving increasingly intensive attention in the wireline network domain. However, for MANETs only few QoS routing algorithms are proposed. For MANETs, approximated solutions and heuristic algorithms should be developed and QoS routing algorithms should be adaptive, flexible, and intelligent. In our previous work, we proposed a Genetic Algorithm (GA) based routin

Style APA, Harvard, Vancouver, ISO itp.

2

Anh, Tran Minh, and Nguyen Chien Trinh. "Propose a new algorithm of routing with information collected locally." Journal of Science and Technology: Issue on Information and Communications Technology 2, no. 1 (2016): 70. http://dx.doi.org/10.31130/jst.2016.30.

Pełny tekst źródła

Streszczenie:

The type of algorithm which uses local information collected from source node for Quality of Service (QoS) routing has recently been researched as an alternative to QoS routing algorithms that traditionally use global state information. This algorithm, collecting information from source node only, helps flow routing better and assures more flexibly QoS for network. This trend leads to a new solution for satisfying the higher and higher demand of telecom market in the near future. In this paper, we introduce a new algorithm of routing like that type for assuring the quality of network as well a

Style APA, Harvard, Vancouver, ISO itp.

3

Vimala, K., and Dr D. Maruthanayagam. "Comparative Analysis of Routing Algorithms to Enhance the Quality of Service in MANET." International Journal of Recent Technology and Engineering (IJRTE) 11, no. 1 (2022): 108–15. http://dx.doi.org/10.35940/ijrte.a6949.0511122.

Pełny tekst źródła

Streszczenie:

Mobile Ad hoc Network is a self-organizing, infrastructure-free, distributed wireless networks made up of various mobile devices. Quality-of-Service routing is most difficult task in MANET due to inherent characteristics–for example frequent dynamic topology, node mobility, resource scarcity, absence of centralized control, etc as well. The QoS variables of any MANET routing algorithms determine its performance. QoS routing is process of routing packets from source (S) to destination (D) based on QoS resource constraints such as bandwidth, delay, packet loss rate, cost, security, link stabilit

Style APA, Harvard, Vancouver, ISO itp.

4

K., Vimala, and D. Maruthanayagam Dr. "Comparative Analysis of Routing Algorithms to Enhance the Quality of Service in MANET." International Journal of Recent Technology and Engineering (IJRTE) 11, no. 1 (2022): 108–15. https://doi.org/10.35940/ijrte.A6949.0511122.

Pełny tekst źródła

Streszczenie:

<strong>Abstract:</strong> Mobile Ad hoc Network is a self-organizing, infrastructure-free, distributed wireless networks made up of various mobile devices. Quality-of-Service routing is most difficult task in MANET due to inherent characteristics–for example frequent dynamic topology, node mobility, resource scarcity, absence of centralized control, etc as well. The QoS variables of any MANET routing algorithms determine its performance. QoS routing is process of routing packets from source (S) to destination (D) based on QoS resource constraints such as bandwidth, delay, packet loss ra

Style APA, Harvard, Vancouver, ISO itp.

5

KOYAMA, AKIO, LEONARD BAROLLI, GENCI CAPI, BERNADY O. APDUHAN, JUNPEI ARAI, and ARJAN DURRESI. "AN EFFICIENT MULTI-PURPOSE OPTIMIZATION METHOD FOR QOS ROUTING USING GENETIC ALGORITHM." Journal of Interconnection Networks 05, no. 04 (2004): 409–28. http://dx.doi.org/10.1142/s0219265904001246.

Pełny tekst źródła

Streszczenie:

In order to support multimedia communication, it is necessary to develop routing algorithms that make decisions based on multiple Quality of Service (QoS) parameters. This is because new services such as video on demand and remote meeting systems have multiple QoS requirements. However, the problem of QoS routing is difficult because finding a feasible route with two independent path constraints is NP-complete problem. Also, QoS routing algorithms for broadband networks must be adaptive, flexible, and intelligent for efficient network management. In this paper, we propose a multi-purpose optim

Style APA, Harvard, Vancouver, ISO itp.

6

Wang, Jun Wei, and Yong Tao Wei. "PSO-Based Trust QoS Routing Algorithm for Wireless Sensor Networks." Applied Mechanics and Materials 401-403 (September 2013): 1751–55. http://dx.doi.org/10.4028/www.scientific.net/amm.401-403.1751.

Pełny tekst źródła

Streszczenie:

The existing routing algorithm of Wireless Sensor Networks (WSNs) pays more attention to the energy efficient. However, Quality of Service (QoS) supported and the validity of packet transmission unveil additional challenges. Based on the Particle Swarm Optimization (PSO), this paper presents a trust QoS routing algorithm for WSNs. Hierarchical structure is adopted and the trust value of the node is constructed with the direct trust value and the indirect trust value. In addition, delivery delay and packet loss are considered as main QoS metrics. Finally, under the optimization ability of PSO,

Style APA, Harvard, Vancouver, ISO itp.

7

Barolli, Leonard, Akio Koyama, Takuo Suganuma, and Norio Shiratori. "GAMAN: A GA Based QoS Routing Method for Mobile Ad-Hoc Networks." Journal of Interconnection Networks 04, no. 03 (2003): 251–70. http://dx.doi.org/10.1142/s0219265903000866.

Pełny tekst źródła

Streszczenie:

The Mobile Ad Hoc Networks (MANETs) are useful in many applications environments and do not need any infrastructure support. Much work has been done on routing in MANETs. However, the proposed routing solutions only deal with the best effort data traffic. Connections with Quality of Service (QoS) requirements, such as voice channels with delay and bandwidth constraints, are not supported. The QoS routing has been receiving increasingly intensive attention in the wireline network domain. However, these QoS routing algorithms can not be applied directly to MANETs, because of the bandwidth constr

Style APA, Harvard, Vancouver, ISO itp.

8

Gong, Yue, and Jia Nan Wang. "Research of Multiple Constrained Qos Routing Based on Improved Ant Colony Algorithm." Applied Mechanics and Materials 513-517 (February 2014): 994–98. http://dx.doi.org/10.4028/www.scientific.net/amm.513-517.994.

Pełny tekst źródła

Streszczenie:

This paper mainly discusses the Multiple Constrained Qos Routing Algorithm, in the analysis of the basic on the basis of mathematical model of Qos routing. It has proposed a routing model with an objective function, integrated optimization of multiple Qos constraints. Finally, the optimization of ant colony algorithm applied to solve the problem of multiple constraints Qos. Through simulation experiments proved that the algorithm to find the path to maximum degree meets Qos requirements.

Style APA, Harvard, Vancouver, ISO itp.

9

Dr. D. Maruthanayagam. "An Efficient and Most Reliable Novel Route Selection Algorithm (ERRSAE) to Improve QOS in Manet Environment." International Journal of Scientific Research in Computer Science, Engineering and Information Technology 11, no. 1 (2025): 2652–66. https://doi.org/10.32628/cseit251112281.

Pełny tekst źródła

Streszczenie:

Mobile ad-hoc network (MANET) has got more focus because of its pragmatic applications and inevitability of communication in mobile devices. MANETs are collection of mobile hosts dynamically forming a temporary network without the aid of any existing infrastructure or centralized control. Quality of Service (QoS) support for MANET is a challenging task due to the dynamic topology and limited resources. The existing QoS based routing solutions for MANET involves with single metric or two metrics. It is important that MANETs should provide QoS support routing such as end-to-end-delay, energy con

Style APA, Harvard, Vancouver, ISO itp.

10

Zhou, Dong Ming, and Hong Cai. "QoS Routing Algorithm Using Competitive PCNN." Applied Mechanics and Materials 229-231 (November 2012): 1908–12. http://dx.doi.org/10.4028/www.scientific.net/amm.229-231.1908.

Pełny tekst źródła

Streszczenie:

The solution of the multi-constrained QoS routing is translated into a shortest path problem for a weighted graph, and the problem of multi-constrained QoS routing is successfully solved using the properties of pulse wave parallel propagation of the competitive PCNN. The number of iteration of our algorithm is dependent of the length of the globally optimal multi-constrained QoS routing between source node and destination node and independent of the number of nodes and edges and the complexity of network distribution structure. The method shows better computational performance and dominance an

Style APA, Harvard, Vancouver, ISO itp.

11

Barolli, Admir, Evjola Spaho, Leonard Barolli, Fatos Xhafa, and Makoto Takizawa. "QoS Routing in Ad-Hoc Networks Using GA and Multi-Objective Optimization." Mobile Information Systems 7, no. 3 (2011): 169–88. http://dx.doi.org/10.1155/2011/607540.

Pełny tekst źródła

Streszczenie:

Much work has been done on routing in Ad-hoc networks, but the proposed routing solutions only deal with the best effort data traffic. Connections with Quality of Service (QoS) requirements, such as voice channels with delay and bandwidth constraints, are not supported. The QoS routing has been receiving increasingly intensive attention, but searching for the shortest path with many metrics is an NP-complete problem. For this reason, approximated solutions and heuristic algorithms should be developed for multi-path constraints QoS routing. Also, the routing methods should be adaptive, flexible

Style APA, Harvard, Vancouver, ISO itp.

12

WU, JIE, and FEI DAI. "QoS ROUTING IN HYPERCUBE MULTICOMPUTERS." Parallel Processing Letters 13, no. 01 (2003): 43–52. http://dx.doi.org/10.1142/s0129626403001136.

Pełny tekst źródła

Streszczenie:

In this paper, we present a coding method to capture QoS information in hypercube multicomputers. The coding method is based on a localized algorithm where each node interacts with its neighbors to gather QoS information. Specifically, each node maintains a QoS vector where the k-th element represents the guaranteed QoS performance to a destination that is k hops away. The localized algorithm exhibits desirable properties of self-stabilizing, self-optimizing, and self-healing. Simulation results show that this coding method provides a good approximation of the minimum QoS value to a k-hop dest

Style APA, Harvard, Vancouver, ISO itp.

13

Shen, Xue Zhen, and Xin Guo Tang. "Dynamic Routing Algorithm Based on HIP Multicast Model." Advanced Materials Research 424-425 (January 2012): 607–11. http://dx.doi.org/10.4028/www.scientific.net/amr.424-425.607.

Pełny tekst źródła

Streszczenie:

A HIP multicast mode; based dynamic multicast routing algorithm (HIPDMR) was brought out and network model was established to describe and simplify problem to be researched. HIPDMR used Bellman-Ford as routing search algorithm, which can determine dynamic multicast routing with minimum hop number and overhead while meet constraints of bandwidth, delay, jitter and packet loss rate. Simulation experiments result show that HIPDMR can build dynamic multicast routing under constraints of multiple QoS comparing with algorithms that not considering QoS assuming network node output link capacity be eq

Style APA, Harvard, Vancouver, ISO itp.

14

He, Chang Lin, Yu Fen Li, and Lei Zhang. "QoS Routing Optimization Based on Improved Genetic Algorithm." Advanced Materials Research 998-999 (July 2014): 1169–73. http://dx.doi.org/10.4028/www.scientific.net/amr.998-999.1169.

Pełny tekst źródła

Streszczenie:

A improved genetic algorithm is proposed to QoS routing optimization. By improving coding schemes, fitness function designs, selection schemes, crossover schemes and variations, the proposed method can effectively reduce computational complexity and improve coding accuracy. Simulations are carried out to compare our algorithm with the traditional genetic algorithms. Experimental results show that our algorithm converges quickly and is reliable. Hence, our method vastly outperforms the traditional algorithms.

Style APA, Harvard, Vancouver, ISO itp.

15

Haikal, Amira Y., M. Badawy, and Hesham A. Ali. "Towards Internet QoS Provisioning Based on Generic Distributed QoS Adaptive Routing Engine." Scientific World Journal 2014 (2014): 1–29. http://dx.doi.org/10.1155/2014/694847.

Pełny tekst źródła

Streszczenie:

Increasing efficiency and quality demands of modern Internet technologies drive today’s network engineers to seek to provide quality of service (QoS). Internet QoS provisioning gives rise to several challenging issues. This paper introduces a generic distributed QoS adaptive routing engine (DQARE) architecture based on OSPFxQoS. The innovation of the proposed work in this paper is its undependability on the used QoS architectures and, moreover, splitting of the control strategy from data forwarding mechanisms, so we guarantee a set of absolute stable mechanisms on top of which Internet QoS can

Style APA, Harvard, Vancouver, ISO itp.

16

Zhang, Lianming, Yong Lu, Dian Zhang, Haoran Cheng, and Pingping Dong. "DSOQR: Deep Reinforcement Learning for Online QoS Routing in SDN-Based Networks." Security and Communication Networks 2022 (November 29, 2022): 1–11. http://dx.doi.org/10.1155/2022/4457645.

Pełny tekst źródła

Streszczenie:

With the rapid development of mobile communication technology, there are an increasing number of new network applications and services, and the existing best-effort routing algorithms cannot meet the quality-of-service (QoS) requirements of these applications and services. QoS-routing optimization solutions based on a software-defined network (SDN) are often targeted at specific network scenarios and difficult to adapt to changing business requirements. The current routing algorithms based on machine learning (ML) methods can generally only handle discrete, low-dimensional action spaces and us

Style APA, Harvard, Vancouver, ISO itp.

17

Ye, An Xin, and Jian Bin Wu. "A Novel Particle Swarm Algorithm to Optimize QoS Unicast Routing." Advanced Materials Research 230-232 (May 2011): 377–83. http://dx.doi.org/10.4028/www.scientific.net/amr.230-232.377.

Pełny tekst źródła

Streszczenie:

Unicast routing service is becoming a important requirement of computer networks supporting multimedia applications. And unicast routing problem has been demonstrated technically as a NP-complete. This paper proposes a novel QoS-based unicast routing algorithm using the Chaotic Particle Swarm Optimization algorithm (CPSO).The algorithm enhance the global searching ability when some particles have trapped in local minimums by chaotic series .The novel algorithm makes use of the ergodicity of chaotic search to improve the capability of precise search and keep the balance between the global searc

Style APA, Harvard, Vancouver, ISO itp.

18

Li, Yuan Chen, and Guo Fang Kuang. "A Multicast Routing Algorithm with Cost, Delay and Bandwidth Constraints." Advanced Materials Research 756-759 (September 2013): 1850–54. http://dx.doi.org/10.4028/www.scientific.net/amr.756-759.1850.

Pełny tekst źródła

Streszczenie:

Quality of service (QoS) generally assumes more than one QoS measure which implies that routing can be categorized as an instance of routing subject to multiple constraints: such as cost, delay, bandwidth, etc. The problem of constructing multicast trees is studied to meet the QoS requirements where it is necessary to provide bounded constraints among the source and all destinations while keeping the cost of the multicast tree low. So, a kind of source-destination QoS multicast routing problem is addressed about communication networks. The algorithm we presented takes bandwidth, delay and loss

Style APA, Harvard, Vancouver, ISO itp.

19

Majdi, Ali. "PROPOSING NEW ROUTING PROTOCOL BASED ON CHAOS ALGORITHM." International Journal of Engineering Technology and Scientific Innovation 07, no. 05 (2022): 106–31. http://dx.doi.org/10.51193/ijetsi.2022.7502.

Pełny tekst źródła

Streszczenie:

In MANET, the multicast routing is considered as a non-deterministic polynomial (NP) complexity, it contains assorted objectives and restrictions. In the multicast issue of MANET, the Quality of services (QoS) based upon cost, delay, jitter, bandwidth, these are constantly deemed as multi-objective for intending multiple cast routing protocols. Conversely, mobile node has finite battery energy and the lifetime of network depending on its mobile node battery energy. If the mobile node has high battery energy consumption, it automatically reduces the network’s life time because of their route br

Style APA, Harvard, Vancouver, ISO itp.

20

Xiang, F., L. Junzhou, W. Jieyi, and G. Guanqun. "QoS routing based on genetic algorithm." Computer Communications 22, no. 15-16 (1999): 1392–99. http://dx.doi.org/10.1016/s0140-3664(99)00113-9.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

21

A., Rama Rao, Satyananda Reddy, and Valli Kumari V. "Multi-path selection based on fractional cuckoo search algorithm for QoS aware routing in MANET." Sensor Review 39, no. 2 (2019): 218–32. http://dx.doi.org/10.1108/sr-08-2017-0170.

Pełny tekst źródła

Streszczenie:

Purpose Multimedia applications such as digital audio and video have stringent quality of service (QoS) requirement in mobile ad hoc network. To support wide range of QoS, complex routing protocols with multiple QoS constraints are necessary. In QoS routing, the basic problem is to find a path that satisfies multiple QoS constraints. Moreover, mobility, congestion and packet loss in dynamic topology of network also leads to QoS performance degradation of protocol. Design/methodology/approach In this paper, the authors proposed a multi-path selection scheme for QoS aware routing in mobile ad ho

Style APA, Harvard, Vancouver, ISO itp.

22

Yu, Zhanke, Feng Ma, Jingxia Liu, Bingxin Hu, and Zhaodong Zhang. "An Efficient Approximate Algorithm for Disjoint QoS Routing." Mathematical Problems in Engineering 2013 (2013): 1–9. http://dx.doi.org/10.1155/2013/489149.

Pełny tekst źródła

Streszczenie:

Disjoint routing is used to find the disjoint paths between a source and a destination subject to QoS requirements. Disjoint QoS routing is an effective strategy to achieve robustness, load balancing, congestion reduction, and an increased throughput in computer networks. For multiple additive constraints, disjoint QoS routing is an NP-complete class that cannot be exactly solved in polynomial time. In the paper, the disjoint QoS routing problem was formulated as a 0-1 integer linear programming. The complicating constraints were included in the objective function using an adaptive penalty fun

Style APA, Harvard, Vancouver, ISO itp.

23

Majdi, Ali. "Proposing New Routing Protocol Based on Chaos Algorithm." Review of Computer Engineering Research 9, no. 1 (2022): 55–70. http://dx.doi.org/10.18488/76.v9i1.2992.

Pełny tekst źródła

Streszczenie:

In MANET, the multicast routing is considered a non-deterministic polynomial (NP) complexity, it contains assorted objectives and restrictions. In the multicast issue of MANET, the quality of services (QoS) based upon cost, delay, jitter, bandwidth, are constantly deemed as multi-objective for directing multicast routing protocols (MR). Conversely, a mobile node has finite battery energy and the lifetime of a network depends on its mobile node battery energy. Here, the MR problem of MANET has five objectives vis-a-vis the optimization of cost, delay, jitter, bandwidth, and network lifetime wit

Style APA, Harvard, Vancouver, ISO itp.

24

Xiao, Jing, Yang Liu, Hu Qin, Chaoqun Li, and Jie Zhou. "A Novel QoS Routing Energy Consumption Optimization Method Based on Clone Adaptive Whale Optimization Algorithm in IWSNs." Journal of Sensors 2021 (April 22, 2021): 1–14. http://dx.doi.org/10.1155/2021/5579252.

Pełny tekst źródła

Streszczenie:

Routing requests in industrial wireless sensor networks (IWSNs) are always restricted by QoS. Therefore, finding a high-quality routing path is a key problem. In this paper, a clone adaptive whale optimization algorithm (CAWOA) is designed for reducing the routing energy consumption of IWSNs with QoS constraints, and a novel clone operator is proposed. More importantly, CAWOA innovatively adopts a discrete binary-based routing coding method, which provides strong support for optimal routing schemes. In addition, a novel routing model of IWSNs combined with QoS constraints has been designed, wh

Style APA, Harvard, Vancouver, ISO itp.

25

Gao, Long, and La Yuan Li. "A Energy-Aware QoS Routing Protocol for Wireless Sensor Networks." Applied Mechanics and Materials 373-375 (August 2013): 323–28. http://dx.doi.org/10.4028/www.scientific.net/amm.373-375.323.

Pełny tekst źródła

Streszczenie:

As the different QoS requirements of different businesses in wireless sensor networks, we proposed a QoS routing algorithm-EAQoS. The algorithm built multiple paths to sink node by recording the minimum hops of neighbors to sink. Then data was sent by the path that satisfied its QoS requirements and had enough residual energy. According to the comparisons with the SAR routing algorithm, this algorithm has obvious advantages in providing different services and prolonging the lifetime of network.

Style APA, Harvard, Vancouver, ISO itp.

26

Mohammad, Reza Karami Nejad. "USING LEARNING AUTOMATA AND GENETIC ALGORITHMS TO IMPROVE THE QUALITY OF SERVICES IN MULTICAST ROUTING PROBLEM." International Journal of Computer Science, Engineering and Applications (IJCSEA) 2, october (2019): 10. https://doi.org/10.5281/zenodo.3234450.

Pełny tekst źródła

Streszczenie:

A hybrid learning automata–genetic algorithm (HLGA) is proposed to solve QoS routing optimization problem of next generation networks. The algorithm complements the advantages of the learning Automato Algorithm(LA) and Genetic Algorithm(GA). It firstly uses the good global search capability of LA to generate initial population needed by GA, then it uses GA to improve the Quality of Service(QoS) and acquiring the optimization tree through new algorithms for crossover and mutation operators which are an NP–Complete problem. In the proposed algorithm, the connectivity matrix of edges

Style APA, Harvard, Vancouver, ISO itp.

27

Meraihi, Yassine, Dalila Acheli, and Amar Ramdane-Cherif. "An Improved Chaotic Binary Bat Algorithm for QoS Multicast Routing." International Journal on Artificial Intelligence Tools 25, no. 04 (2016): 1650025. http://dx.doi.org/10.1142/s0218213016500251.

Pełny tekst źródła

Streszczenie:

The quality of service (QoS) multicast routing problem is one of the main issues for transmission in communication networks. It is known to be an NP-hard problem, so many heuristic algorithms have been employed to solve the multicast routing problem and find the optimal multicast tree which satisfies the requirements of multiple QoS constraints such as delay, delay jitter, bandwidth and packet loss rate. In this paper, we propose an improved chaotic binary bat algorithm to solve the QoS multicast routing problem. We introduce two modification methods into the binary bat algorithm. First, we us

Style APA, Harvard, Vancouver, ISO itp.

28

Liu, Xiu Ju. "Application of Improved Ant Colony Algorithm in QoS Routing Optimization." Advanced Materials Research 108-111 (May 2010): 353–58. http://dx.doi.org/10.4028/www.scientific.net/amr.108-111.353.

Pełny tekst źródła

Streszczenie:

QoS routing for the characteristics of the ant colony algorithm is improved. First of all defect from the ant colony algorithm and to increase Network Node bound, As well as to speed up global convergence analysis of the three areas of the ant colony algorithm to improve thinking; And by improving the ant colony algorithm in the QoS routing optimization application, the details of the ant colony algorithm to improve the design and implementation steps. Finally, simulation results show that: According to the algorithm for solving the problem and get the optimal solution of the ratio of full pro

Style APA, Harvard, Vancouver, ISO itp.

29

Ge, Jun Wei, Jin Xin Deng, and Yi Qiu Fang. "Multiple Constrained QoS Routing Algorithm Based on Genetic Algorithm in Overlay Network." Applied Mechanics and Materials 347-350 (August 2013): 2067–70. http://dx.doi.org/10.4028/www.scientific.net/amm.347-350.2067.

Pełny tekst źródła

Streszczenie:

How to depend on different services provide different guarantee of QoS, and to ensure the effective use of network resources will become an important task in overlay network. In this paper, we consider constraints of network bandwidth, delay, loss rate, cost ,and base on the resources of current global network, as well as user-specific QoS metric needs to choose the best QoS route based on genetic algorithm. Experiments show that the algorithm is feasible in overlay network routing,and it has the better global load balancing capabilities.

Style APA, Harvard, Vancouver, ISO itp.

30

Zhang, Guoan, Min Wu, Wei Duan, and Xinming Huang. "Genetic Algorithm Based QoS Perception Routing Protocol for VANETs." Wireless Communications and Mobile Computing 2018 (June 11, 2018): 1–10. http://dx.doi.org/10.1155/2018/3897857.

Pełny tekst źródła

Streszczenie:

A genetic algorithm (GA) based QoS perception routing protocol (GABR) is proposed to guarantee the quality of service (QoS) influenced by broken links between vehicles and the failure of packets transmission in a vehicular ad hoc network (VANET). With the observation that all improvable paths are probed by the intersection based routing protocol, the genetic GA is utilized to optimize the global available paths which satisfies the QoS requirement. Moreover, by means of the numerical results, it is shown that the proposed scheme is significantly improved compared with protocols of the intersect

Style APA, Harvard, Vancouver, ISO itp.

31

Wang, Sunan, Rong Song, Xiangyu Zheng, Wanwei Huang, and Hongchang Liu. "A3C-R: A QoS-Oriented Energy-Saving Routing Algorithm for Software-Defined Networks." Future Internet 17, no. 4 (2025): 158. https://doi.org/10.3390/fi17040158.

Pełny tekst źródła

Streszczenie:

With the rapid growth of Internet applications and network traffic, existing routing algorithms are usually difficult to guarantee the quality of service (QoS) indicators such as delay, bandwidth, and packet loss rate as well as network energy consumption for various data flows with business characteristics. They have problems such as unbalanced traffic scheduling and unreasonable network resource allocation. Aiming at the above problems, this paper proposes a QoS-oriented energy-saving routing algorithm A3C-R in the software-defined network (SDN) environment. Based on the asynchronous update

Style APA, Harvard, Vancouver, ISO itp.

32

Et. al., S. Arivarasan,. "An Energy Efficient Qos Routing Protocol Based On Red Deer Algorithm In MANET." Turkish Journal of Computer and Mathematics Education (TURCOMAT) 12, no. 5 (2021): 1461–71. http://dx.doi.org/10.17762/turcomat.v12i5.2112.

Pełny tekst źródła

Streszczenie:

MANETs (Mobile ad hoc networks) are overloaded with their heavy usage choking traffic. Recent studies have been attempting to find feasibility of routes in these networks. Most proposed schemes have failed to consider the network traffic or MANET requirements. MANET routing done by RPs (Routing Protocols) would perform better when they adhere to QoS (Quality of Service) or application requirements. As a result, RPs must satisfy numerous QoS metrics at a time where soft computing algorithm based RPs are a solution to QoS routing problems. Evolutionary algorithm based routing do not achieve enou

Style APA, Harvard, Vancouver, ISO itp.

33

Wang, Jun Wei, and Yu Hui Zhao. "A Probability Theory Based Intelligent QoS Multicast Routing Algorithm." Advanced Materials Research 403-408 (November 2011): 2309–12. http://dx.doi.org/10.4028/www.scientific.net/amr.403-408.2309.

Pełny tekst źródła

Streszczenie:

In this paper, taking the characteristics of NGI (Next Generation Internet) into account, and base on its network model and mathematical model, a probability theory based intelligent QoS multicast routing algorithm is presented. Under inaccurate information of QoS parameters, using fast searching ability of DE (Differential Evolution), the proposed algorithm tries to find a multicast routing tree with the maximum probability of meeting with QoS requirement under the given cost. Simulation results have shown that the proposed algorithm is both feasible and effective.

Style APA, Harvard, Vancouver, ISO itp.

34

Hernández Riaño, Velssy Liliana, Jorge Mario López Pereira, and Helman Enrique Hernández Riaño. "Minimización del retraso extremo a extremo en redes Unicast utilizando técnicas metaheurísticas." Entre Ciencia e Ingeniería 7, no. 14 (2013): 66–71. https://doi.org/10.31908/19098367.616.

Pełny tekst źródła

Streszczenie:

This paper adopts a new metaheuristic (Ebola) to solve the QoS Unicast Routing Problem. We performed a hypothesis test to compare the delays obtained by the proposed algorithm compared to genetic algorithm in solving instances. The implementation results show that the proposed algorithm is an efficient algorithm for QoS routing.

Style APA, Harvard, Vancouver, ISO itp.

35

Wang, Jun Wei, and Jing Hao. "Population Adaptive Immune Algorithm Based Trustworthy QoS Routing Algorithm." Applied Mechanics and Materials 411-414 (September 2013): 647–52. http://dx.doi.org/10.4028/www.scientific.net/amm.411-414.647.

Pełny tekst źródła

Streszczenie:

The trustworthiness of data transmission is a very important parameter in the future network. In this paper, considering the optimal ability of population adaptive immune and the trustworthiness demand of the network, a trustworthy QoS routing algorithm is proposed. The interval is used to describe the user requirement in order to adapt to the fuzziness of the user QoS and trust demand, and the sliding window is adopted to implement the trust evaluation and control mechanism. With satisfaction degree function introduced, it tries to find the optimal path which satisfies the user requirement ba

Style APA, Harvard, Vancouver, ISO itp.

36

Wan, Jun, and La Yuan Li. "A QoS Routing Protocol Based on ACO in Wireless Multimedia Sensor Network." Applied Mechanics and Materials 373-375 (August 2013): 317–22. http://dx.doi.org/10.4028/www.scientific.net/amm.373-375.317.

Pełny tekst źródła

Streszczenie:

In view of the complexity, higher power consumption and other shortcomings of current wireless multimedia sensor networks (WMSN)QoS routing protocol algorithm, this paper proposes the Ant Colony Optimization (ACO) to improve the WMSN routing protocol. First of all, a routing model for multimedia sensor networks QoS was presented and then a routing algorithm (WMSN-ANT) was brought forward, which uses the network restrict condition to update the pheromone concentration. The forward ants (Fant) collects the link bandwidth, delay, packet loss rate and other parameters, along with the elite strateg

Style APA, Harvard, Vancouver, ISO itp.

37

Hu, Jia, and Jin He Zhou. "The Implementation of Energy-Efficient and QoS Balancing Routing Based on OpenFlow Networks." Applied Mechanics and Materials 411-414 (September 2013): 697–702. http://dx.doi.org/10.4028/www.scientific.net/amm.411-414.697.

Pełny tekst źródła

Streszczenie:

In this paper an energy-efficient management routing algorithm is presented. We provide a new idea and some solutions to balance the energy-efficient and QoS. Within the scope of QoS requirements, the routers consider energy-efficient and QoS at the same time, and choose a minimum energy consumption path. The proposed routing algorithm is then implemented with OpenFlow, which is an expandable, customizable, controllable and programmable experimental platform. The result indicates that proposed algorithm works well, and can balances between energy-efficient and QoS.

Style APA, Harvard, Vancouver, ISO itp.

38

Salman et al., Mustafa I. "Software Defined Network of Video Surveillance System Based on Enhanced Routing Algorithms." Baghdad Science Journal 17, no. 1(Suppl.) (2020): 0391. http://dx.doi.org/10.21123/bsj.2020.17.1(suppl.).0391.

Pełny tekst źródła

Streszczenie:

Software Defined Network (SDN) is a new technology that separate the ‎control plane from the data plane. SDN provides a choice in automation and ‎programmability faster than traditional network. It supports the ‎Quality of Service (QoS) for video surveillance application. One of most ‎significant issues in video surveillance is how to find the best path for routing the packets ‎between the source (IP cameras) and destination (monitoring center). The ‎video surveillance system requires fast transmission and reliable delivery ‎and high QoS. To improve the QoS and to achieve the optimal path, the

Style APA, Harvard, Vancouver, ISO itp.

39

Li, Li Fen. "MCL and ACO Based QoS Routing Algorithm for WSN Used in Power Line Monitoring." Applied Mechanics and Materials 672-674 (October 2014): 2033–36. http://dx.doi.org/10.4028/www.scientific.net/amm.672-674.2033.

Pełny tekst źródła

Streszczenie:

This paper presents a new cross-layer QoS routing algorithm for wireless sensor networks. Basing on the principle of cross-layer design, the algorithm adopts delay, nodes’ load and link quality as QoS metrics. The QoS routing metrics are regarded as heuristics correction factors in ant colony algorithm (ACA). The ants are divided into a number of different populations. Through the interaction of pheromone between multi populations, the routing algorithm searches for the feasible paths in parallel and updates the pheromone in time. To overcome the slow convergence of ant colony algorithm, membe

Style APA, Harvard, Vancouver, ISO itp.

40

Garg, Roopali, and Guneet Kaur. "Multipath Routing protocol: NCPR and QAMR." INTERNATIONAL JOURNAL OF COMPUTERS & TECHNOLOGY 11, no. 10 (2013): 3065–70. http://dx.doi.org/10.24297/ijct.v11i10.2975.

Pełny tekst źródła

Streszczenie:

Mobile ad hoc network is an assembly of mobile nodes with no centralized server. Due to mobility of nodes and decentralized network it is difficult to maintain the quality of service (QoS) in routing the packets from source to destination.Â QoS can be defined in terms of various metrics like delay, bandwidth, packet loss, routing overhead, jitter. Routing can be unicast, multicast or multipath.Â This paper presents the description about the QoS multipath routing algorithm.

Style APA, Harvard, Vancouver, ISO itp.

41

Yang, Mingchuan, Xinye Shao, Guanchang Xue, and Yingzhe Dou. "Swarm and Location-Based QoS Routing Algorithm in MEO/LEO Double-Layered Satellite Networks." Wireless Communications and Mobile Computing 2023 (February 17, 2023): 1–10. http://dx.doi.org/10.1155/2023/4897698.

Pełny tekst źródła

Streszczenie:

In this paper, we mainly research on the QoS (Quality of Service) routing algorithms for MEO/LEO (medium Earth orbit/low Earth orbit) double-layered satellite networks. In this type of networks, the rapidly changing network topology due to relative motion of satellites is one of the main challenges when designing an efficient routing algorithm. Specifically, the issues of high rerouting overhead and traffic routing with diverse QoS requirements remain to be resolved. This paper proposed a M-BMDP (modified bandwidth constrained minimum delay path) routing algorithm based on swarm and location f

Style APA, Harvard, Vancouver, ISO itp.

42

Salman, Adil M., H. I. Wahhab, Aseel B. Alnajjar, Bourair Al-Attar, Ravi Sekhar, and Nilisha Itankar. "Revolutionizing Wireless Sensor Networks through an Effective Approach for Quality of Service Enhancement." Applied Data Science and Analysis 2025 (April 28, 2025): 144–54. https://doi.org/10.58496/adsa/2025/012.

Pełny tekst źródła

Streszczenie:

Data Collection of Wireless Sensor Networks (WSN) are integral parts of modern technology in various fields. Nonetheless, due to inherent limitations like energy, bandwidth, and computation, a prominent challenge that arises is providing Quality of service (QoS). WSNs consist of constrained resource networks of sensors (e.g., batteries); thus, routing and deployment techniques are significant for improving the QoS performance of WSNs. We have introduced a new method of High Secure Parallel Particle Swarm Routing Algorithm (HS-PPSRA) in this work to enhance the QoS in WSNs. The approach with th

Style APA, Harvard, Vancouver, ISO itp.

43

Liu, Jin Yang, Xing Wei Wang, and Min Huang. "A Trustworthy QoS Unicast Routing Scheme Based on Population Adaptive Based Immune Algorithm." Applied Mechanics and Materials 602-605 (August 2014): 3084–87. http://dx.doi.org/10.4028/www.scientific.net/amm.602-605.3084.

Pełny tekst źródła

Streszczenie:

In this paper, a trustworthy QoS unicast routing scheme based on trustworthy network is proposed. First, a cognitive network model is designed, referring to the intelligence of artificial immune system. Then, trustworthiness of each node is evaluated by deploying sliding window mechanism and analyzing the behavior record of each node. Finally, a population adaptive based immune of trustworthy QoS unicast routing algorithm is proposed, referring to the adaptive process of antibody identifying antigen. We verify the effectiveness of our scheme by using large-scale computer emulation experiments

Style APA, Harvard, Vancouver, ISO itp.

44

Shi, Rui, and Hui Zhao. "An Improved Anycast QoS Routing Algorithm Based on Chaos Genetic Algorithm." Applied Mechanics and Materials 513-517 (February 2014): 2157–60. http://dx.doi.org/10.4028/www.scientific.net/amm.513-517.2157.

Pełny tekst źródła

Streszczenie:

To overcome the problem of tending to converge to part in anycast QoS routing based on Genetic Algorithm, a new improved anycast QoS routing algorithm based on Genetic Algorithm is proposed which adopt the improved chaotic disturbance operator. The simulated result shows that this algorithm has a good ability of global search, and it can find a set of low-cost paths with bandwidth constraints and delay requirements efficiently and quickly. By comparing the simulation data, the success rate of finding the optimal solutions is improved, and the larger network scale, its advantage is more obvious

Style APA, Harvard, Vancouver, ISO itp.

45

Wang, Jun Wei, and Wen Yi Sun. "Improved HEED Based Trust Routing Algorithm for WSNs." Advanced Materials Research 989-994 (July 2014): 4405–8. http://dx.doi.org/10.4028/www.scientific.net/amr.989-994.4405.

Pełny tekst źródła

Streszczenie:

In Wireless Sensor Networks (WSNs), besides the energy efficient, trust and Quality of Service (QoS) supported should be considered under some circumstances. All of them unveil additional challenges for routing scheme design. Based on Hybrid Energy - Efficient Distributed clustering (HEED) protocol, this paper presents a trust QoS routing algorithm for WSNs. Hierarchical structure is adopted and the trust value of the node is constructed by the direct trust value and the indirect trust value. In HEED, the combination of the trust value and residual energy as the main parameter and the propagat

Style APA, Harvard, Vancouver, ISO itp.

46

Sun, Quan, and Horst Langendörfer. "An efficient delay‐constrained multicast routing algorithm." Journal of High Speed Networks 7, no. 1 (1998): 43–55. https://doi.org/10.3233/hsn-1998-137.

Pełny tekst źródła

Streszczenie:

An efficient delay‐constrained multicast routing algorithm computing low cost delay‐constrained multicast trees with small algorithm complexity is proposed in this paper. The proposed algorithm can be used to compare cost performances of the existing or future multicast routing algorithms that provide quality of service (QoS) guarantees, especially in multicast routing simulation environments which simulate relatively large networks and consider realistic network conditions. The proposed algorithm is also useful for routing real‐time multicast data in high‐speed networks if adequate global inf

Style APA, Harvard, Vancouver, ISO itp.

47

Li, Tao Shen, and Zhang Cai Li. "An Anycast Routing Algorithm Based on the Combination of Genetic Algorithm and Ant Colony Algorithm." Applied Mechanics and Materials 239-240 (December 2012): 1324–30. http://dx.doi.org/10.4028/www.scientific.net/amm.239-240.1324.

Pełny tekst źródła

Streszczenie:

To solve anycast routing problem with multiple QoS constraints, a improved hybrid algorithm which combines genetic algorithm and ant colony algorithm is proposed. In the initial period of hybrid algorithm, genetic algorithm was used to distribute pheromones in links and code and optimize control parameters of ant colony algorithm. Through judgment function, this algorithm can judge the time to combine the genetic algorithm with ant colony algorithm, and initialize the pheromones and start the ant colony algorithm at the last period of hybrid algorithm. To avoid hybrid algorithm falling into lo

Style APA, Harvard, Vancouver, ISO itp.

48

Cai, Zhi Qiang, Rong Sheng Lv, and Shi Wen Sun. "One QoS Routing Algorithm for Load Balancing in IP Backbone Networks: Design and Simulation." Applied Mechanics and Materials 427-429 (September 2013): 2664–67. http://dx.doi.org/10.4028/www.scientific.net/amm.427-429.2664.

Pełny tekst źródła

Streszczenie:

Quality of Service (QoS) routing is intent to find feasible routes according to QoS constraints and optimize utilization of whole network resources. In order to solve bandwidth-guaranteed QoS routing problem, a simple but effective routing algorithm based on precomputation scheme with load balancing consideration, is proposed. The algorithm is implemented and simulated using Network Simulator (NS2). Research results showed that the proposal can keep some links free from becoming bottlenecks earlier, avoid congestion caused by unbalanced traffic load distribution, and improve performance of IP

Style APA, Harvard, Vancouver, ISO itp.

49

Rama Rao, A., V. Valli Kumari, and Ch Satyananda Reddy. "Exponential Genetic Algorithm-Based Stable and Load-Aware QoS Routing Protocol for MANET." Journal of Intelligent Systems 26, no. 4 (2017): 669–82. http://dx.doi.org/10.1515/jisys-2016-0031.

Pełny tekst źródła

Streszczenie:

AbstractAs the actual links in mobile ad hoc networks (MANETs) are dynamic, the feasible path generated may not exist during the transmission of multimedia data. There is a need for generating multiple paths for guaranteed transmission. The multi-path finding can be achieved through a genetic-based algorithm that faces the major challenge in quality-of-service (QoS)-aware routing. To enhance the QoS communication over the MANETs, an exponential genetic algorithm (GA)-based stable and load-aware QoS routing protocol (SLAQR) is proposed in this paper. This paper chiefly focuses on the enhancemen

Style APA, Harvard, Vancouver, ISO itp.

50

Huang, Hong Bo, and Yong Zhi Wang. "An Improved QoS Routing Algorithm in Internet." Applied Mechanics and Materials 443 (October 2013): 487–93. http://dx.doi.org/10.4028/www.scientific.net/amm.443.487.

Pełny tekst źródła

Streszczenie:

An Efficient Routing Algorithm for Improving the QoS in Internet has been proposed and presented in this paper. The algorithm is a kind of Multi Constrained Path algorithm. The routing take place based on more than one link weight components. To avoid the NP complete problem and to increase the computational efficiency some advancement are added. These include the definition of Non Linear Path Length, where the sub paths may not be the shortest path, having k no of shortest paths in a node instead of having only the shortest path, then removing the path dominancy for state space reduction. As

Style APA, Harvard, Vancouver, ISO itp.

Oferujemy zniżki na wszystkie plany premium dla autorów, których prace zostały uwzględnione w tematycznych zestawieniach literatury. Skontaktuj się z nami, aby uzyskać unikalny kod promocyjny!