Log in

Relevant bibliographies by topics / Quality of Service routing algorithms / Journal articles

To see the other types of publications on this topic, follow the link: Quality of Service routing algorithms.

Journal articles on the topic 'Quality of Service routing algorithms'

Author: Grafiati

Published: 4 June 2021

Last updated: 16 February 2022

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

Select a source type:

Consult the top 50 journal articles for your research on the topic 'Quality of Service routing algorithms.'

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 journal articles on a wide variety of disciplines and organise your bibliography correctly.

1

Albalas, F. W., B. A. Abu-Alhaija, A. Awajan, A. Awajan, and Khalid Al-Begain. "Quality of Service for Multimedia and Real-Time Services." International Journal of Information Technology and Web Engineering 5, no. 4 (2010): 1–22. http://dx.doi.org/10.4018/jitwe.2010100101.

Full text

Abstract:

New web technologies have encouraged the deployment of various network applications that are rich with multimedia and real-time services. These services demand stringent requirements are defined through Quality of Service (QoS) parameters such as delay, jitter, loss, etc. To guarantee the delivery of these services QoS routing algorithms that deal with multiple metrics are needed. Unfortunately, QoS routing with multiple metrics is considered an NP-complete problem that cannot be solved by a simple algorithm. This paper proposes three source based QoS routing algorithms that find the optimal p

APA, Harvard, Vancouver, ISO, and other styles

2

Prakash Raj, E. George Dharma, Sinthu JanitaPrakash, and S. V. Kasmir Raja. "Analysis of Quality of Service Routing Algorithms." International Journal of Information Technology and Web Engineering 4, no. 2 (2009): 78–89. http://dx.doi.org/10.4018/jitwe.2009040105.

Full text

APA, Harvard, Vancouver, ISO, and other styles

3

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.

Full text

Abstract:

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

APA, Harvard, Vancouver, ISO, and other styles

4

Meongchul Song and S. Sahni. "Approximation algorithms for multiconstrained quality-of-service routing." IEEE Transactions on Computers 55, no. 5 (2006): 603–17. http://dx.doi.org/10.1109/tc.2006.67.

Full text

APA, Harvard, Vancouver, ISO, and other styles

5

Xin Yuan. "Heuristic algorithms for multiconstrained quality-of-service routing." IEEE/ACM Transactions on Networking 10, no. 2 (2002): 244–56. http://dx.doi.org/10.1109/90.993305.

Full text

APA, Harvard, Vancouver, ISO, and other styles

6

Reeve, J., P. Mars, and T. Hodgkinson. "Learning algorithms for quality of service multicast routing." Electronics Letters 34, no. 12 (1998): 1195. http://dx.doi.org/10.1049/el:19980882.

Full text

APA, Harvard, Vancouver, ISO, and other styles

7

Mahseur, Mohammed, and Abdelmadjid Boukra. "Quality of Service (QoS) Optimization in a Multicast Routing." International Journal of Applied Metaheuristic Computing 10, no. 2 (2019): 27–54. http://dx.doi.org/10.4018/ijamc.2019040102.

Full text

Abstract:

Optimizing the QoS of multicast routing with multiple constraints is a NP-hard problem. Thus, the use of approximate methods is unavoidable. This article proposes to modify Bat Algorithm (BA) to solve such problem. BA is a metaheuristic that has been applied to several issues of various fields and has given good results, which has owned him a good reputation in terms of robustness and performance. Like any metaheuristic, BA can be trapped in a local optimum. In order to avoid such problem, the authors propose to hybridize BA with the quantum principle and introduce the chaotic map in the calcu

APA, Harvard, Vancouver, ISO, and other styles

8

Szymanski, Andrzej, Artur Lason, Jacek Rzasa, and Andrzej Jajszczyk. "Grade-of-service-based routing in optical networks [Quality-of-Service-Based Routing Algorithms for Heterogeneous Networks]." IEEE Communications Magazine 45, no. 2 (2007): 82–87. http://dx.doi.org/10.1109/mcom.2007.313400.

Full text

APA, Harvard, Vancouver, ISO, and other styles

9

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.

Full text

Abstract:

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

APA, Harvard, Vancouver, ISO, and other styles

10

Mellouk, Abdelhamid, Pascal Lorenz, Azzedine Boukerche, and Moon Ho Lee. "Quality of service based routing algorithms for heterogeneous networks [Guest editorial]." IEEE Communications Magazine 45, no. 2 (2007): 65–66. http://dx.doi.org/10.1109/mcom.2007.313396.

Full text

APA, Harvard, Vancouver, ISO, and other styles

11

Militani, Davi Ribeiro, Hermes Pimenta de Moraes, Renata Lopes Rosa, Lunchakorn Wuttisittikulkij, Miguel Arjona Ramírez, and Demóstenes Zegarra Rodríguez. "Enhanced Routing Algorithm Based on Reinforcement Machine Learning—A Case of VoIP Service." Sensors 21, no. 2 (2021): 504. http://dx.doi.org/10.3390/s21020504.

Full text

Abstract:

The routing algorithm is one of the main factors that directly impact on network performance. However, conventional routing algorithms do not consider the network data history, for instances, overloaded paths or equipment faults. It is expected that routing algorithms based on machine learning present advantages using that network data. Nevertheless, in a routing algorithm based on reinforcement learning (RL) technique, additional control message headers could be required. In this context, this research presents an enhanced routing protocol based on RL, named e-RLRP, in which the overhead is r

APA, Harvard, Vancouver, ISO, and other styles

12

Griffin, David, Jason Spencer, Jonas Griem, et al. "Interdomain routing through QoS-class planes [Quality-of-Service-Based Routing Algorithms for Heterogeneous Networks]." IEEE Communications Magazine 45, no. 2 (2007): 88–95. http://dx.doi.org/10.1109/mcom.2007.313401.

Full text

APA, Harvard, Vancouver, ISO, and other styles

13

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.

Full text

Abstract:

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

APA, Harvard, Vancouver, ISO, and other styles

14

Jiawei, Wu, Qiao Xiuquan, and Nan Guoshun. "Dynamic and adaptive multi-path routing algorithm based on software-defined network." International Journal of Distributed Sensor Networks 14, no. 10 (2018): 155014771880568. http://dx.doi.org/10.1177/1550147718805689.

Full text

Abstract:

Recently, there has been a surge of the video services over the Internet. However, service providers still have difficulties in providing high-quality video streaming due to the problem of scheduling efficiency and the wide fluctuations of end-to-end delays in the existing multi-path algorithms. To solve these two problems affecting video transmission quality, networks are expected to have the capability of dynamically managing the network nodes for satisfying quality-of-service requirements, which is a challenging issue for media streaming applications. Against this changing network landscape

APA, Harvard, Vancouver, ISO, and other styles

15

Li, Xiaoling, and Hai Hu. "QoS Routing Algorithm Based on Entropy Granularity in the Network Transmission." Cybernetics and Information Technologies 19, no. 4 (2019): 61–72. http://dx.doi.org/10.2478/cait-2019-0036.

Full text

Abstract:

Abstract With the rapid development of computer networks, more hosts are connected to the Internet where they could communicate with each other. The need for network service has exceeded the service capacity of the network, and the Quality of Service (QoS) is gradually declining. Based on existing Shortest Path First (SPF) algorithm, this paper proposes a new QoS required transmission path approach by considering the overhead balance of network resources. This paper uses the entropy granularity as the main line in the application of routing protocols. Firstly, it researches the optimization of

APA, Harvard, Vancouver, ISO, and other styles

16

Yang, Wen-Lin. "Optimal and heuristic algorithms for quality-of-service routing with multiple constraints." Performance Evaluation 57, no. 3 (2004): 261–78. http://dx.doi.org/10.1016/j.peva.2003.11.002.

Full text

APA, Harvard, Vancouver, ISO, and other styles

17

Saravanan, M., and K.A.Sundararaman. "Metaheuristic Approaches for Vehicle Routing Problems." International Journal of Information Systems and Supply Chain Management 6, no. 2 (2013): 17–32. http://dx.doi.org/10.4018/jisscm.2013040102.

Full text

Abstract:

Routing of service vehicles are the heart of many service operations. Exclusively vehicle routing problem (VRP) plays a central role in the optimization of distribution networks. The routing of service vehicles has a major impact on the quality of the service provided. In distribution of goods and services, it is time and again required to determine a combination of least cost vehicle routes through a set of geographically scattered customers, subject to side constraints. The case most commonly studied is where all vehicles are identical. Due to the complexity involved in solving the VRP, most

APA, Harvard, Vancouver, ISO, and other styles

18

Chen, Liang Bin, Qiang Li, and Xiang Feng. "Research on Multicast Routing Algorithm for P2P Overlay Network." Applied Mechanics and Materials 347-350 (August 2013): 2293–97. http://dx.doi.org/10.4028/www.scientific.net/amm.347-350.2293.

Full text

Abstract:

Multicast routing is a critical problem in the P2P network. The main task for multicast routing is to establish a multicast tree with good performance, to satisfy the various qualities of service requirements, such as improving the streaming media service quality, and the utilization rate of cyber source. Many efficient overlay multicast routing algorithms are proposed to face the new challenge in current P2P network. This paper attempts to survey the current problems, the solutions for overlay multicast routing algorithms, and points out the further research directions.

APA, Harvard, Vancouver, ISO, and other styles

19

Thanh Long, Nguyen. "Research on Applying Hierachical Clustered Based Routing Technique Using Artificial Intelligence Algorithms for Quality of Service of Service Based Routing." Internet of Things and Cloud Computing 3, no. 3 (2015): 14. http://dx.doi.org/10.11648/j.iotcc.s.2015030601.11.

Full text

APA, Harvard, Vancouver, ISO, and other styles

20

AL-SHARHAN, S., and W. GUEAIEB. "A FAST HYBRID ALGORITHM FOR MULTICAST ROUTING IN WIRELESS NETWORKS." International Journal on Artificial Intelligence Tools 16, no. 01 (2007): 45–68. http://dx.doi.org/10.1142/s0218213007003199.

Full text

Abstract:

This paper tackles the issue of constrained multicast routing in wireless networks using a hybrid soft computing-based algorithm. Recent developments in multimedia applications and the dynamic and rapidly changed environment of the wireless networks make the constrained multicast routing a real challenge. The problem can be formulated as minimizing a multicast tree cost under several constraints or Quality of Service (QoS) metrics. This problem has been proven to be NP-complete. The proposed hybrid algorithm is based on a population based incremental learning algorithm that combines in an effi

APA, Harvard, Vancouver, ISO, and other styles

21

Przystupa, Krzysztof, Julia Pyrih, Mykola Beshley, et al. "Improving the Efficiency of Information Flow Routing in Wireless Self-Organizing Networks Based on Natural Computing." Energies 14, no. 8 (2021): 2255. http://dx.doi.org/10.3390/en14082255.

Full text

Abstract:

With the constant growth of requirements to the quality of infocommunication services, special attention is paid to the management of information transfer in wireless self-organizing networks. The clustering algorithm based on the Motley signal propagation model has been improved, resulting in cluster formation based on the criterion of shortest distance and maximum signal power value. It is shown that the use of the improved clustering algorithm compared to its classical version is more efficient for the route search process. Ant and simulated annealing algorithms are presented to perform rou

APA, Harvard, Vancouver, ISO, and other styles

22

Tahir, Muhammad Atif, Asif Jamshed, Habib-ur Rehman, and Yassine Daadaa. "Tabu Search for Low-Cost Dynamic Multicast Tree Generation with Quality of Service Guarantees." Journal of Intelligent Systems 24, no. 4 (2015): 479–89. http://dx.doi.org/10.1515/jisys-2014-0043.

Full text

Abstract:

AbstractIn a communication network with a source node, a multicast tree is defined as a tree rooted at the source node and all its leaves being recipients of the multicast originating at the source. The tree or bandwidth cost is normally measured by its utilization of tree links along with the quality of service (QoS) measures such as delay constraint and end-to-end delay. However, if nodes are allowed to join or leave the multicast group at any time during the lifetime of the multicast connection, then the problem is known as dynamic multicast routing problem. In this article, we combine a gr

APA, Harvard, Vancouver, ISO, and other styles

23

Yang, Kun, Yumin Wu, and Hsiao-hwa Chen. "QoS-aware routing in emerging heterogeneous wireless networks[Quality-of-Service-Based Routing Algorithms for Heterogeneous Networks]." IEEE Communications Magazine 45, no. 2 (2007): 74–80. http://dx.doi.org/10.1109/mcom.2007.313398.

Full text

APA, Harvard, Vancouver, ISO, and other styles

24

Yu, Kairong, Yang Liu, and Ashutosh Sharma. "Analyze the Effectiveness of the Algorithm for Agricultural Product Delivery Vehicle Routing Problem Based on Mathematical Model." International Journal of Agricultural and Environmental Information Systems 12, no. 3 (2021): 26–38. http://dx.doi.org/10.4018/ijaeis.2021070103.

Full text

Abstract:

With the recent development in the economic system, the requirement for logistic services has also increased gradually. This increased the demand for efficient and cost-effective delivery services without compromising the quality and timeliness. This has become a challenge to the logistic service providers to maintain the high-quality standards along with reliable delivery services. A mathematical equation model is proposed in this work to solve the problem of random quantity of agricultural products collected/distributed by working vehicle collection/distribution path planning. This article p

APA, Harvard, Vancouver, ISO, and other styles

25

He, Shiming He, Kun Xie, Xuhui Zhou, Thabo Semong, and Jin Wang. "Multi-Source Reliable Multicast Routing with QoS Constraints of NFV in Edge Computing." Electronics 8, no. 10 (2019): 1106. http://dx.doi.org/10.3390/electronics8101106.

Full text

Abstract:

Edge Computing (EC) allows processing to take place near the user, hence ensuring scalability and low latency. Network Function Virtualization (NFV) provides the significant convenience of network layout and reduces the service operation cost in EC and data center. Nowadays, the interests of the NFV layout focus on one-to-one communication, which is costly when applied to multicast or group services directly. Furthermore, many artificial intelligence applications and services of cloud and EC are generally communicated through groups and have special Quality of Service (QoS) and reliable requir

APA, Harvard, Vancouver, ISO, and other styles

26

Prakash, P. S. "A Multi Constrained Path Quality of Service Routing Algorithm." Asian Journal of Research in Social Sciences and Humanities 6, no. 6 (2016): 276. http://dx.doi.org/10.5958/2249-7315.2016.00211.2.

Full text

APA, Harvard, Vancouver, ISO, and other styles

27

Mellouk, Abdelhamid, Said Hoceini, and Sherali Zeadally. "A Bio-Inspired Quality of Service (QoS) Routing Algorithm." IEEE Communications Letters 15, no. 9 (2011): 1016–18. http://dx.doi.org/10.1109/lcomm.2011.071211.110741.

Full text

APA, Harvard, Vancouver, ISO, and other styles

28

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.

Full text

Abstract:

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

APA, Harvard, Vancouver, ISO, and other styles

29

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.

Full text

Abstract:

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

APA, Harvard, Vancouver, ISO, and other styles

30

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.

Full text

Abstract:

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

APA, Harvard, Vancouver, ISO, and other styles

31

Aissa, Mohamed, Adel Ben Mnaouer, Rion Murray, and Abdelfettah Belghith. "New Strategies and Extensions in Kruskal’s Algorithm in Multicast Routing." International Journal of Business Data Communications and Networking 7, no. 4 (2011): 32–51. http://dx.doi.org/10.4018/jbdcn.2011100103.

Full text

Abstract:

Multimedia applications are expected to guarantee end-to-end quality of service (QoS) and are characterized by stringent constraints on delay, delay-jitter, bandwidth, cost, and so forth. The authors observe that Kruskal’s algorithm is limited to minimal (maximal) spanning unconstrained tree. As such, the authors extend Kruskal’s algorithm to incorporate the delay bound constraint. Consequently, a novel algorithm is proposed, called EKRUS (Extended Kruskal), for constructing multicast trees. The EKRUS’ distinguishing features consists of a better management of Kruskal’s priority queues, and in

APA, Harvard, Vancouver, ISO, and other styles

32

Selyukov, A., Y. Khmelnitsky, D. Kovpa, and O. Lisovskiy. "ANALYSIS OF MODELS AND PROGNOSTICATION OF RISKS OF FUNCTIONING OF CONTROL SYSTEM OF SDN OF ARCHITECTURE." Collection of scientific works of the Military Institute of Kyiv National Taras Shevchenko University, no. 64 (2019): 113–23. http://dx.doi.org/10.17721/2519-481x/2019/64-11.

Full text

Abstract:

The article deals with the analysis of models and algorithms of the system control SDN of architecture for providing of more quality work of network. Great diversity of most hardware implementation of the data devices SDN architecture leads to the fact that different switches may not support some features or support them with limited performance. In the process network, this can significantly affect the throughput of an individual data flow or whole network domains. Routing flow transfer is carried out by criterion of quality of service and the criterion of balanced loads of network resources

APA, Harvard, Vancouver, ISO, and other styles

33

Thanh Long, Nguyen. "Research on Innovating and Applying Evolutionary Algorithms Based Hierarchical Clustering and Multiple Paths Routing for Guaranteed Quality of Service on Service Based Routing." Internet of Things and Cloud Computing 3, no. 3 (2015): 22. http://dx.doi.org/10.11648/j.iotcc.s.2015030601.12.

Full text

APA, Harvard, Vancouver, ISO, and other styles

34

Nucamendi-Guillén, Samuel, Diego Flores-Díaz, Elias Olivares-Benitez, and Abraham Mendoza. "A Memetic Algorithm for the Cumulative Capacitated Vehicle Routing Problem Including Priority Indexes." Applied Sciences 10, no. 11 (2020): 3943. http://dx.doi.org/10.3390/app10113943.

Full text

Abstract:

This paper studies the Cumulative Capacitated Vehicle Routing Problem, including Priority Indexes, a variant of the classical Capacitated Vehicle Routing Problem, which serves the customers according to a certain level of preference. This problem can be effectively implemented in commercial and public environments where customer service is essential, for instance, in the delivery of humanitarian aid or in waste collection systems. For this problem, we aim to minimize two objectives simultaneously, the total latency and the total tardiness of the system. A Mixed Integer formulation is developed

APA, Harvard, Vancouver, ISO, and other styles

35

Rajasekaran, M. "Performance and evaluation of location energy aware trusted distance source routing protocol for secure routing in WSNs." Indian Journal of Science and Technology 13, no. 39 (2020): 4092–108. http://dx.doi.org/10.17485/ijst/v13i39.1522.

Full text

Abstract:

Objectives: To propose a suitable algorithm for improving the network lifetime of Wireless Sensor Networks (WSNs). Methods/Findings: We proposed a suitable Location and Energy Aware Trusted Distance Source Routing (LEATDSR) algorithm. Here, the energy consumption, location and the data quality are equalized by the Quality of Service (QoS) based routing algorithms. In addition to this algorithm, an existing clustering algorithm is also incorporates for grouping the sensor nodes based on the trust, location, energy and distance. In this LEATDSR is capable of deciding the evaluation metrics which

APA, Harvard, Vancouver, ISO, and other styles

36

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.

Full text

Abstract:

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

APA, Harvard, Vancouver, ISO, and other styles

37

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.

Full text

Abstract:

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,

APA, Harvard, Vancouver, ISO, and other styles

38

Jiang, Haifeng, Guangzhi Han, He Wang, Xinping Li, and Guopeng Zhang. "Fuzzy-logic-based data-differentiated service supported routing protocol for emergency communication networks in underground mines." International Journal of Distributed Sensor Networks 15, no. 7 (2019): 155014771986476. http://dx.doi.org/10.1177/1550147719864762.

Full text

Abstract:

Hybrid wireless mesh networks are suitable to construct emergency communication networks after disasters in underground mines. The routing decision in emergency scene is more difficult to give an accurate mathematical description due to the constraints of various data types, different data transmission requirements, and multi-parameters. Based on the fuzzy decision theory, this article has proposed a fuzzy-logic-based data-differentiated service supported routing protocol. Through the use of the adaptive fuzzy decision system, fuzzy-logic-based data-differentiated service supported routing pro

APA, Harvard, Vancouver, ISO, and other styles

39

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.

Full text

Abstract:

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

APA, Harvard, Vancouver, ISO, and other styles

40

Yang, Xiaoqing. "A Quality of Service Routing Algorithm in Wireless Sensor Networks." International Journal of Online Engineering (iJOE) 13, no. 07 (2017): 47. http://dx.doi.org/10.3991/ijoe.v13i07.7280.

Full text

Abstract:

<span style="font-family: 'Times New Roman',serif; font-size: 10pt; mso-ansi-language: EN-US; mso-fareast-font-family: 宋体; mso-fareast-language: ZH-CN; mso-bidi-language: AR-SA;" lang="EN-US">An Quality of Service(QOS) secure routing algorithm based on ant colony optimization is put forward to solve a variety of security problems in wireless sensor networks. The algorithm combines the ant colony optimization algorithm with the cr</span><span style="font-family: 'Times New Roman',serif; font-size: 10pt; mso-ansi-language: EN-US; mso-fareast-font-family: 'Times New Roman'; mso-far

APA, Harvard, Vancouver, ISO, and other styles

41

M, Sujeethnanda. "Quality of Service Routing Algorithm for Cognitive Wireless Sensor Network." Bonfring International Journal of Networking Technologies and Applications 2, no. 1 (2013): 01–09. http://dx.doi.org/10.9756/bijnta.3089.

Full text

APA, Harvard, Vancouver, ISO, and other styles

42

Gupta, Amit, Mahesh Motwani, and J. L. Rana. "Cluster Formation and Maintenance Techniques for Mobile Adhoc Networks with Improved Quality of Service." International Journal of Emerging Technology and Advanced Engineering 11, no. 8 (2021): 97–110. http://dx.doi.org/10.46338/ijetae0821_12.

Full text

Abstract:

— In an Adhoc Network, every node is mobile and self-contained. As these networks lack infrastructure, highly adaptive algorithms are required to deal with frequent mobility changes by member nodes as well as Cluster Head (CH) nodes. The weighted clustering algorithms contribute significantly to cluster-based routing. In these algorithms, the selection of cluster heads is the most important task. In weighted clustering methods, the selected CH did their best to serve the network. However, the CH may become overloaded due to the arrival of nodes greater than their desired threshold value. In th

APA, Harvard, Vancouver, ISO, and other styles

43

Qadir, A., M. T. Arefin, and H. E. Sandström. "Reliable IPTV Service Delivery Using PIM-SSM Routing." Journal of Scientific Research 1, no. 3 (2009): 495–507. http://dx.doi.org/10.3329/jsr.v1i3.2633.

Full text

Abstract:

Internet Protocol Television (IPTV) is a service where digital TV signal data is delivered by using Internet protocol (IP). Telecom and network operators focus on IPTV service for its fastest growth, lower price for operators and market economy. With the improvement of broadband connection and technology, IPTV will get more and more importance. Main challenge for IPTV service is resiliency and Quality of Service (QoS) to meet the users Service Level Agreement (SLA). The design space for IPTV service in terms of resilient backbone design, routing algorithms and fast failure restoration shall be

APA, Harvard, Vancouver, ISO, and other styles

44

Dong, Fang, Ou Li, and Min Tong. "Intelligent Routing Control for MANET Based on Reinforcement Learning." MATEC Web of Conferences 232 (2018): 04002. http://dx.doi.org/10.1051/matecconf/201823204002.

Full text

Abstract:

With the rapid development and wide use of MANET, the quality of service for various businesses is much higher than before. Aiming at the adaptive routing control with multiple parameters for universal scenes, we propose an intelligent routing control algorithm for MANET based on reinforcement learning, which can constantly optimize the node selection strategy through the interaction with the environment and converge to the optimal transmission paths gradually. There is no need to update the network state frequently, which can save the cost of routing maintenance while improving the transmissi

APA, Harvard, Vancouver, ISO, and other styles

45

Mahseur, Mohammed, Abdelmadjid Boukra, and Yassine Meraihi. "Solving Multi-Objective Multicast Routing Problem Using a New Hybrid Approach." International Journal of Applied Evolutionary Computation 9, no. 4 (2018): 22–36. http://dx.doi.org/10.4018/ijaec.2018100102.

Full text

Abstract:

Multicast routing is the problem of finding the spanning tree of a set of destinations whose roots are the source node and its leaves are the set of destination nodes by optimizing a set of quality of service parameters and satisfying a set of transmission constraints. This article proposes a new hybrid multicast algorithm called Hybrid Multi-objective Multicast Algorithm (HMMA) based on the Strength Pareto Evolutionary Algorithm (SPEA) to evaluate and classify the population in dominated solutions and non-dominated solutions. Dominated solutions are evolved by the Bat Algorithm, and non-domin

APA, Harvard, Vancouver, ISO, and other styles

46

Zhang, Xiaoxia, Xin Shen, and Ziqiao Yu. "A Novel Hybrid Ant Colony Optimization for a Multicast Routing Problem." Algorithms 12, no. 1 (2019): 18. http://dx.doi.org/10.3390/a12010018.

Full text

Abstract:

Quality of service multicast routing is an important research topic in networks. Research has sought to obtain a multicast routing tree at the lowest cost that satisfies bandwidth, delay and delay jitter constraints. Due to its non-deterministic polynomial complete problem, many meta-heuristic algorithms have been adopted to solve this kind of problem. The paper presents a new hybrid algorithm, namely ACO&CM, to solve the problem. The primary innovative point is to combine the solution generation process of ant colony optimization (ACO) algorithm with the Cloud model (CM). Moreover, within

APA, Harvard, Vancouver, ISO, and other styles

47

Meng, Xiangli, Lingda Wu, and Shaobo Yu. "Multi-Topology Routing Algorithms in SDN-Based Space Information Networks." Future Internet 11, no. 1 (2019): 15. http://dx.doi.org/10.3390/fi11010015.

Full text

Abstract:

Aiming at the complex structure of the space information networks (SIN) and the dynamic change of network topology, in order to design an efficient routing strategy, this paper establishes a SIN management architecture based on Software-defined Networking (SDN). A routing algorithm flow of the spatial information network based on a snapshot sequence is designed. For different spatial tasks with different Quality of Service (QoS) requirements, the concept of integrated link weight is proposed. The Warshall–Floyd algorithm is used to design the optimal routing strategy. A Task-oriented Bandwidth

APA, Harvard, Vancouver, ISO, and other styles

48

Ren, Zhi, Shuang Peng, Hong Jiang Lei, and Ji Bi Li. "Game Theory-Based Routing Algorithms for Wireless Multi-Hop Networks." Advanced Materials Research 756-759 (September 2013): 1244–48. http://dx.doi.org/10.4028/www.scientific.net/amr.756-759.1244.

Full text

Abstract:

In wireless multi-hop networks, the quality of service provided by the system heavily depends on the cooperation between nodes. However, nodes are reluctant to cooperate with each other to save their limited resources. This tendency will put a limit on the application of the current wireless multi-hop networks. Therefore, game theory, which can analyze the strategic interactions among autonomous decision makers, becomes an ideal candidate to solve the above problem. In this paper, we first introduce the basic concept of game theory. Then, the game-theory-based routing algorithms for wireless m

APA, Harvard, Vancouver, ISO, and other styles

49

Masip-Bruin, Xavi, Marcelo Yannuzzi, Rene Serral-Gracia, et al. "The EuQoS system: a solution for QoS routing in heterogeneous networks [Quality of Service based Routing Algorithms for Heterogeneous Networks]." IEEE Communications Magazine 45, no. 2 (2007): 96–103. http://dx.doi.org/10.1109/mcom.2007.313402.

Full text

APA, Harvard, Vancouver, ISO, and other styles

50

Tan, Jing. "Design and Simulation of Cloud Computing Intelligent Routing Algorithms Based on Optical Network." Journal of Nanoelectronics and Optoelectronics 14, no. 12 (2019): 1717–24. http://dx.doi.org/10.1166/jno.2019.2698.

Full text

Abstract:

In the current communication technology, optical technology has been applied to the network to obtain optical network technology. Among them, optical network technology is optical wavelength division multiplexing (WDM), which can play a larger transmission capacity under lower energy consumption. Further breakthroughs in intelligent optical networks require improvements in routing issues. In this study, firstly, the optical network architecture is analyzed, including wavelength division multiplexing optical network and elastic optical network. Then, the routing problem in optical networks is a

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!