Acceder

Bibliografías temáticas / Adaptive routing algorithm / Artículos de revistas

Siga este enlace para ver otros tipos de publicaciones sobre el tema: Adaptive routing algorithm.

Artículos de revistas sobre el tema "Adaptive routing algorithm"

Autor: Grafiati

Publicado: 4 de junio de 2021

Última modificación: 1 de febrero de 2022

Crea una cita precisa en los estilos APA, MLA, Chicago, Harvard y otros

Elija tipo de fuente:

Consulte los 50 mejores artículos de revistas para su investigación sobre el tema "Adaptive routing algorithm".

Junto a cada fuente en la lista de referencias hay un botón "Agregar a la bibliografía". Pulsa este botón, y generaremos automáticamente la referencia bibliográfica para la obra elegida en el estilo de cita que necesites: APA, MLA, Harvard, Vancouver, Chicago, etc.

También puede descargar el texto completo de la publicación académica en formato pdf y leer en línea su resumen siempre que esté disponible en los metadatos.

Explore artículos de revistas sobre una amplia variedad de disciplinas y organice su bibliografía correctamente.

1

Fu Chang and Lancelot Wu. "An optimal adaptive routing algorithm." IEEE Transactions on Automatic Control 31, no. 8 (1986): 690–700. http://dx.doi.org/10.1109/tac.1986.1104381.

Texto completo

Los estilos APA, Harvard, Vancouver, ISO, etc.

2

Chen, M. S., and J. S. Meditch. "A distributed adaptive routing algorithm." Computers & Electrical Engineering 13, no. 2 (1987): 105–15. http://dx.doi.org/10.1016/0045-7906(87)90004-8.

Texto completo

Los estilos APA, Harvard, Vancouver, ISO, etc.

3

Chakrabarty, Amitabha, Martin Collier, and Sourav Mukhopadhyay. "Adaptive Routing Strategy for Large Scale Rearrangeable Symmetric Networks." International Journal of Grid and High Performance Computing 2, no. 2 (2010): 53–63. http://dx.doi.org/10.4018/jghpc.2010040105.

Texto completo

Resumen

This paper proposes an adaptive unicast routing algorithm for large scale symmetric networks comprising 2 × 2 switch elements such as Bene?s networks. This algorithm trades off the probability of blocking against algorithm execution time. Deterministic algorithms exploit the rearrangeability property of Bene?s networks to ensure a zero blocking probability for unicast connections, at the expense of extensive computation. The authors’ algorithm makes its routing decisions depending on the status of each switching element at every stage of the network, hence the name adaptive routing. This metho

Los estilos APA, Harvard, Vancouver, ISO, etc.

4

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.

Texto completo

Resumen

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

Los estilos APA, Harvard, Vancouver, ISO, etc.

5

SHINJO, K., S. SHIMOGAWA, J. YAMADA, and K. OIDA. "A STRATEGY OF DESIGNING ROUTING ALGORITHMS BASED ON IDEAL ROUTINGS." International Journal of Modern Physics C 10, no. 01 (1999): 63–94. http://dx.doi.org/10.1142/s012918319900005x.

Texto completo

Resumen

This paper proposes a strategy of designing routing algorithms for connectionless packet-switched networks. This strategy consists of three design elements as follows: [A] the notion of ideal routings is introduced to provide the upper performance limits attained by improving routing algorithm and it serves as a standard to measure the performance of other algorithms; [B] a method of constructing simple algorithms is presented under implementation conditions from ideal routings; [C] a method is described to enhance the performance limits of [A]. By using these elements, simple algorithms with

Los estilos APA, Harvard, Vancouver, ISO, etc.

6

Une, Hiroyuki, Fei Qian, and Hironori Hirata. "Adaptive routing algorithm for network load balancing." IEEJ Transactions on Electrical and Electronic Engineering 6, no. 5 (2011): 441–49. http://dx.doi.org/10.1002/tee.20680.

Texto completo

Los estilos APA, Harvard, Vancouver, ISO, etc.

7

Navidi, Fatemeh, Prabhanjan Kambadur, and Viswanath Nagarajan. "Adaptive Submodular Ranking and Routing." Operations Research 68, no. 3 (2020): 856–77. http://dx.doi.org/10.1287/opre.2019.1889.

Texto completo

Resumen

Many applications of stochastic optimization involve making sequential decisions until some stopping criterion is satisfied. For example, in medical diagnosis, a doctor needs to perform an adaptive sequence of tests on a patient in order to diagnose a disease. Being adaptive allows the doctor to choose the next test based on the outcomes of prior tests. Given an a priori probability distribution over diseases, the goal is to minimize the expected cost of tests. In “Adaptive Submodular Ranking and Routing,” Navidi, Kambadur, and Nagarajan formulate a general stochastic optimization problem in w

Los estilos APA, Harvard, Vancouver, ISO, etc.

8

Mohite, Priya. "Adaptive Data Fusion for Energy Efficient Routing in Wireless Sensor Network." International Journal of Energy Optimization and Engineering 4, no. 1 (2015): 1–17. http://dx.doi.org/10.4018/ijeoe.2015010101.

Texto completo

Resumen

The data fusion process has led to an evolution for emerging Wireless Sensor Networks (WSNs) and examines the impact of various factors on energy consumption. Significantly there has always been a constant effort to enhance network efficiency without decreasing the quality of information. Based on Adaptive Fusion Steiner Tree (AFST), this paper proposes a heuristic algorithm called Modified Adaptive Fusion Steiner Tree (M-AFST) for energy efficient routing which not only does adaptively adjusts the information routes but also receives the required information from data sources and uses an extr

Los estilos APA, Harvard, Vancouver, ISO, etc.

9

Cho, Ying-Chiang. "A novel approach of adaptive socially aware routing algorithm in delay tolerant networks." Tehnicki vjesnik - Technical Gazette 22, no. 1 (2015): 61–70. http://dx.doi.org/10.17559/tv-20150210223223.

Texto completo

Los estilos APA, Harvard, Vancouver, ISO, etc.

10

Khusnandar, Wahyudi, Fransiscus Ati Halim, and Felix Lokananta. "Design of TTL Based Routing Algorithm on UTAR Network on Chip Communication Architecture." International Journal of New Media Technology 5, no. 1 (2018): 54–57. http://dx.doi.org/10.31937/ijnmt.v5i1.738.

Texto completo

Resumen

XY adaptive routing protocol is a routing protocol used on UTAR NoC communication architecture. This routing algorithm adapts shrotest-path first algorithm, which will forward will not be able to work optimally if the closest route no longer have enough bandwidth to continue the packet. Packet will be stored inside the router and forwarded to the nearest router when closest route has enough bandwidth. This paper suggest TTL based routing algorithm to resolve this issue. TTL based routing algorithm adapts XY adaptive routing protocol by adding several parameters on RTL UTAR NoC and additional b

Los estilos APA, Harvard, Vancouver, ISO, etc.

11

Chen, Zhongping. "A Routing Optimization Adaptive Hybrid Genetic Algorithm Research." Journal of Software Engineering 10, no. 3 (2016): 253–62. http://dx.doi.org/10.3923/jse.2016.253.262.

Texto completo

Los estilos APA, Harvard, Vancouver, ISO, etc.

12

Wang, Feng, Dingde Jiang, and Sheng Qi. "An adaptive routing algorithm for integrated information networks." China Communications 16, no. 7 (2019): 195–206. http://dx.doi.org/10.23919/jcc.2019.07.015.

Texto completo

Los estilos APA, Harvard, Vancouver, ISO, etc.

13

ELBABLY, M. E. "ADAPTIVE ALGORITHM FOR ROUTING AND PLACEMENT IN FPGA." JES. Journal of Engineering Sciences 36, no. 6 (2008): 1499–511. http://dx.doi.org/10.21608/jesaun.2007.119579.

Texto completo

Los estilos APA, Harvard, Vancouver, ISO, etc.

14

Ardakani, Mostafa K., and Lu Sun. "Decremental algorithm for adaptive routing incorporating traveler information." Computers & Operations Research 39, no. 12 (2012): 3012–20. http://dx.doi.org/10.1016/j.cor.2012.03.006.

Texto completo

Los estilos APA, Harvard, Vancouver, ISO, etc.

15

Pei, Yujie, Hongbo Wang, and Shiduan Cheng. "A self-adaptive key flow routing adjustment algorithm." Frontiers of Electrical and Electronic Engineering in China 4, no. 3 (2009): 287–94. http://dx.doi.org/10.1007/s11460-009-0048-4.

Texto completo

Los estilos APA, Harvard, Vancouver, ISO, etc.

16

Verdoscia, L., and R. Vaccaro. "An Adaptive Routing Algorithm for WK-Recursive Topologies." Computing 63, no. 2 (1999): 171–84. http://dx.doi.org/10.1007/s006070050057.

Texto completo

Los estilos APA, Harvard, Vancouver, ISO, etc.

17

Ardabili, Ahad Khaleghi, Zied Othman Ahmed, and Ali Layth Abbood. "Solving Routing Problem Using Improved Camel Herds Algorithm." International Journal on Perceptive and Cognitive Computing 6, no. 2 (2020): 53–59. http://dx.doi.org/10.31436/ijpcc.v6i2.157.

Texto completo

Resumen

This paper introduces a new adaptive, distributed routing algorithm based on the Improved Camel Herds Algorithm (CHA). It is an intelligent, multi-agent optimization algorithm that is inspired by the behavior of camels and how they search for food in their desert environment. We examine its ability to solve the routing problem in switched networks: finding the shortest path in the process of transferring data packets between networks. Many meta-heuristic algorithms have been previously proposed to address the routing problem, and this proposed approach is compared with three well-known algorit

Los estilos APA, Harvard, Vancouver, ISO, etc.

18

Cinque, Marcello, and Catello Di Martino. "Adaptive Modeling of Routing Algorithms for Wireless Sensor Networks." International Journal of Adaptive, Resilient and Autonomic Systems 1, no. 1 (2010): 21–40. http://dx.doi.org/10.4018/jaras.2010071702.

Texto completo

Resumen

Recent years have witnessed a proliferation of routing algorithms for Wireless Sensor Networks (WSNs), hence complicating the choice of the proper algorithm to be used for a given application. Simulation frameworks represent a viable solution to anticipate crucial choices, however existing solutions do not encompass the impact of changes (e.g., route updates, node crashes) on the nodes behavior and vice-versa. This article proposes a novel adaptive modeling approach to master the complexity of the thorough simulation of routing algorithms for WSN. Experimental results are provided showing the

Los estilos APA, Harvard, Vancouver, ISO, etc.

19

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.

Texto completo

Resumen

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

Los estilos APA, Harvard, Vancouver, ISO, etc.

20

Jogunola, Olamide, Bamidele Adebisi, Kelvin Anoh, et al. "Distributed Adaptive Primal Algorithm for P2P-ETS over Unreliable Communication Links." Energies 11, no. 9 (2018): 2331. http://dx.doi.org/10.3390/en11092331.

Texto completo

Resumen

Algorithms for distributed coordination and control are increasingly being used in smart grid applications including peer-to-peer energy trading and sharing to improve reliability and efficiency of the power system. However, for realistic deployment of these algorithms, their designs should take into account the suboptimal conditions of the communication network, in particular the communication links that connect the energy trading entities in the energy network. This study proposes a distributed adaptive primal (DAP) routing algorithm to facilitate communication and coordination among proacti

Los estilos APA, Harvard, Vancouver, ISO, etc.

21

Li, Da Wei, and Ping Wang. "A Traffic-Flow-Phase Adaptive Routing Algorithm for VANETs." Applied Mechanics and Materials 241-244 (December 2012): 2343–49. http://dx.doi.org/10.4028/www.scientific.net/amm.241-244.2343.

Texto completo

Resumen

Vehicular ad-hoc Networks (VANETs) has become a hot topic in recent years, where the routing protocol has also become research focus. The vast majority of the existing routing protocols are designed for a single scenario, thus it is difficult for them to be extended for the complicated traffic environment. In this paper we propose a new routing algorithm X-CAST for vehicular communication on highway, which can be adaptive to different phases of traffic flow and guarantee reliable transmission in different environments. The experimental results reveal that X-CAST performs much better than other

Los estilos APA, Harvard, Vancouver, ISO, etc.

22

Chen, Shaopei, Ji Yang, Yong Li, and Jingfeng Yang. "Multiconstrained Network Intensive Vehicle Routing Adaptive Ant Colony Algorithm in the Context of Neural Network Analysis." Complexity 2017 (2017): 1–9. http://dx.doi.org/10.1155/2017/8594792.

Texto completo

Resumen

Neural network models have recently made significant achievements in solving vehicle scheduling problems. Adaptive ant colony algorithm provides a new idea for neural networks to solve complex system problems of multiconstrained network intensive vehicle routing models. The pheromone in the path is changed by adjusting the volatile factors in the operation process adaptively. It effectively overcomes the tendency of the traditional ant colony algorithm to fall easily into the local optimal solution and slow convergence speed to search for the global optimal solution. The multiconstrained netwo

Los estilos APA, Harvard, Vancouver, ISO, etc.

23

DUATO, JOSÉ. "ON THE DESIGN OF DEADLOCK-FREE ADAPTIVE MULTICAST ROUTING ALGORITHMS." Parallel Processing Letters 03, no. 04 (1993): 321–33. http://dx.doi.org/10.1142/s0129626493000368.

Texto completo

Resumen

Multicast communication refers to the delivery of the same message from one source node to an arbitrary number of destination nodes. Two multicast wormhole routing methods have been presented in [13] for multicomputers with 2D-mesh and hypercube topologies. Also, a theory for the design of deadlock-free adaptive routing algorithms for wormhole networks has been proposed in [7, 8]. This theory supplies the sufficient conditions for an adaptive routing algorithm to be deadlock-free, even when there are cyclic dependencies between channels. This paper analyses the additional channel dependencies

Los estilos APA, Harvard, Vancouver, ISO, etc.

24

Jia, Jia, Duan Zhou, and Jian Xian Zhang. "A Novel Adaptive Routing Algorithm for Network-On-Chip." Key Engineering Materials 474-476 (April 2011): 413–16. http://dx.doi.org/10.4028/www.scientific.net/kem.474-476.413.

Texto completo

Resumen

In this paper, we propose a novel adaptive routing algorithm to solve the communication congestion problem for Network-on-Chip (NoC). The strategy competing for output ports in both X and Y directions is employed to utilize the output ports of the router sufficiently, and to reduce the transmission latency and improve the throughput. Experimental results show that the proposed algorithm is very effective in relieving the communication congestion, and a reduction in average latency by 45.7% and an improvement in throughput by 44.4% are achieved compared with the deterministic XY routing algorit

Los estilos APA, Harvard, Vancouver, ISO, etc.

25

Fakhrali, Saleh, and Hamid R. Zarandi. "Double Stairs: A Fault-Tolerant Routing Algorithm for Networks-on-Chip." Journal of Circuits, Systems and Computers 25, no. 06 (2016): 1650065. http://dx.doi.org/10.1142/s0218126616500651.

Texto completo

Resumen

Reliability is one of the main concerns in the design of networks-on-chip (NoCs) due to the use of deep submicron technologies in fabrication of such products. This paper presents a new fault-tolerant routing algorithm called double stairs for NoCs. Double stairs routing algorithm is a low overhead routing that has the ability to deal with fault. The proposed routing algorithm makes a redundant copy of each packet at the source node and routes the original and redundant packets in a new partially adaptive routing algorithm. The method is evaluated for various packet injection rates and fault r

Los estilos APA, Harvard, Vancouver, ISO, etc.

26

Barros, M. Taynnan, P. R. Lins Junior, and M. Sampaio Alencar. "CSA: A Route Clonal Selection Algorithm for Dynamic WDM Networks." Journal of Communications Software and Systems 7, no. 4 (2011): 121. http://dx.doi.org/10.24138/jcomss.v7i4.173.

Texto completo

Resumen

The minimization of blocking probability is an important problem for the design of next generation high speednetworks. This problem is usually approached with an adaptive routing algorithm with traffic grooming, that is costly regarding improvements on network equipment. This paper presents the Clonal Selection Adaptive Routing Algorithm (CSA), a new routing algorithm for use in dynamic optical network. The algorithm uses a fitness function which adapts the route selection cost, minimizing the blocking. Its performance was evaluated considering the blocking probability with three different top

Los estilos APA, Harvard, Vancouver, ISO, etc.

27

Shanmuganathan, T., and U. Ramachandraiah. "AOCR: adaptive on chip router algorithm for multicore domain controller platform." International Journal of Engineering & Technology 7, no. 4 (2018): 2246. http://dx.doi.org/10.14419/ijet.v7i4.13477.

Texto completo

Resumen

In the recent years, with the rapid development of semiconductor technologies and increasing demand for more effective multi-Core Domain Controller platforms, there is a clear demand for effective routing algorithms that can be used to route the packets between these platforms, while enhancing an on chip network performance, achieving a better latency and throughput. This paper proposes an adaptive on Chip Router algorithm with a simple adaptive routing algorithm based on runtime weighted arbitration and resource allocation methodology, where the routing decisions are minimized for application

Los estilos APA, Harvard, Vancouver, ISO, etc.

28

Xu, Qiang, Le Chang Sun, Min Zhang, and Ting Zhao. "Enhancing the Flexibility of Kademlia under Churn." Advanced Materials Research 255-260 (May 2011): 2121–25. http://dx.doi.org/10.4028/www.scientific.net/amr.255-260.2121.

Texto completo

Resumen

Churn is a great challenge for the development and deployment of Distributed Hash Table networks, but current churn treatments ignore the effect of adapting the size of routing table flexibly to handle churn. In this paper, we research the routing table self-adaptive mechanism for Kademlia. Based on quantifying the influence ofK, the parameter representing the size of ak-bucket, on routing performance, a self-adaptive algorithm of K is proposed. This algorithm adapts K to the variation of churn rate which is estimated by the validity of data in routing table. Simulation results show that it ca

Los estilos APA, Harvard, Vancouver, ISO, etc.

29

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.

Texto completo

Resumen

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

Los estilos APA, Harvard, Vancouver, ISO, etc.

30

DAY, KHALED, and ABDEL-ELAH AL-AYYOUB. "ADAPTIVE FAULT-TOLERANT ROUTING IN STAR NETWORKS." Journal of Interconnection Networks 02, no. 02 (2001): 213–31. http://dx.doi.org/10.1142/s0219265901000336.

Texto completo

Resumen

We take advantage of the hierarchical structure of the star graph network to obtain an efficient method for constructing node-disjoint paths between arbitrary pairs of nodes in the network. A distributed fault-tolerant routing algorithm for the star network based on this construction method is then presented and evaluated. The proposed algorithm adapts the routing decisions in response to node failures. Node failure and repair conditions may arise dynamically (at any time) provided that the total number of faulty nodes at any given time is less than the node-connectivity n - 1 of the n-star. W

Los estilos APA, Harvard, Vancouver, ISO, etc.

31

Tsai, Ming-Jer. "Fault-Tolerant Routing in Wormhole Meshes." Journal of Interconnection Networks 04, no. 04 (2003): 463–95. http://dx.doi.org/10.1142/s0219265903000970.

Texto completo

Resumen

In wormhole meshes, many a routing algorithm prevents a deadlock by enclosing unlimited number of faulty nodes with faulty blocks and dividing a physical interconnection network into a fixed number of virtual ones; none of them, however, is able to tolerate two faulty blocks with a distance of two, no less, in at least one dimension by use of only two virtual interconnection networks. To fill this gap, an adaptive and fault-tolerant routing algorithm is proposed. The algorithm is fully-adaptive until encountering a faulty block. It then detours the blocked message around the faulty block. Arra

Los estilos APA, Harvard, Vancouver, ISO, etc.

32

KHONSARI, A., H. SARBAZI-AZAD, and M. OULD-KHAOUA. "A Performance Model of Software-Based Deadlock Recovery Routing Algorithm in Hypercubes." Parallel Processing Letters 15, no. 01n02 (2005): 153–68. http://dx.doi.org/10.1142/s012962640500212x.

Texto completo

Resumen

Recent studies have revealed that deadlocks are generally infrequent in the network. Thus the hardware resources, e.g. virtual channels, dedicated for deadlock avoidance are not utilised most of the time. This consideration has motivated the development of novel adaptive routing algorithms with deadlock recovery. This paper describes a new analytical model to predict message latency in hypercubes with a true fully adaptive routing algorithm with progressive deadlock recovery. One of the main features of the proposed model is the use of results from queueing systems with impatient customers to

Los estilos APA, Harvard, Vancouver, ISO, etc.

33

CHEN, Jin-yuan, and Li-min PENG. "Adaptive routing algorithm for multi-channel wireless mesh networks." Journal of Computer Applications 29, no. 5 (2009): 1211–13. http://dx.doi.org/10.3724/sp.j.1087.2009.01211.

Texto completo

Los estilos APA, Harvard, Vancouver, ISO, etc.

34

ZHANG, Heng-Yang, Ling WANG, Yun-Hui LIU, and Xuan-Ping CAI. "Route-Sign-Based Adaptive Void Handling Geographical Routing Algorithm." Journal of Software 20, no. 10 (2009): 2744–51. http://dx.doi.org/10.3724/sp.j.1001.2009.03628.

Texto completo

Los estilos APA, Harvard, Vancouver, ISO, etc.

35

Al-Bdour, Hamed S. "An Adaptive Routing Algorithm for Ad hoc Mobile Networks." Journal of Computer Science 1, no. 2 (2005): 215–20. http://dx.doi.org/10.3844/jcssp.2005.215.220.

Texto completo

Los estilos APA, Harvard, Vancouver, ISO, etc.

36

Mohammad, Qatawneh. "Adaptive Fault Tolerant Routing Algorithm for Tree-Hypercube Multicomputer." Journal of Computer Science 2, no. 2 (2006): 124–26. http://dx.doi.org/10.3844/jcssp.2006.124.126.

Texto completo

Los estilos APA, Harvard, Vancouver, ISO, etc.

37

YANG, Xiaoya, and Wansheng HE. "Adaptive nonlinear RED algorithm based on routing queue resources." Journal of Computer Applications 33, no. 3 (2013): 621–24. http://dx.doi.org/10.3724/sp.j.1087.2013.00621.

Texto completo

Los estilos APA, Harvard, Vancouver, ISO, etc.

38

SHIH, JAU-DER. "AN ADAPTIVE FAULT-TOLERANT WORMHOLE ROUTING ALGORITHM FOR HYPERCUBES." International Journal of High Speed Computing 11, no. 03 (2000): 151–66. http://dx.doi.org/10.1142/s012905330000014x.

Texto completo

Los estilos APA, Harvard, Vancouver, ISO, etc.

39

Ebrahimi, Masoumeh, Hannu Tenhunen, and Masoud Dehyadegari. "Fuzzy-based Adaptive Routing Algorithm for Networks-on-Chip." Journal of Systems Architecture 59, no. 7 (2013): 516–27. http://dx.doi.org/10.1016/j.sysarc.2013.03.006.

Texto completo

Los estilos APA, Harvard, Vancouver, ISO, etc.

40

Lan, Y. "An adaptive fault-tolerant routing algorithm for hypercube multicomputers." IEEE Transactions on Parallel and Distributed Systems 6, no. 11 (1995): 1147–52. http://dx.doi.org/10.1109/71.476186.

Texto completo

Los estilos APA, Harvard, Vancouver, ISO, etc.

41

Wang, Na, Yihao Sun, and Hongfeng Wang. "An Adaptive Memetic Algorithm for Dynamic Electric Vehicle Routing Problem with Time-Varying Demands." Mathematical Problems in Engineering 2021 (March 4, 2021): 1–10. http://dx.doi.org/10.1155/2021/6635749.

Texto completo

Resumen

Dynamic electric vehicle routing problem (DEVRP) is an extension of the electric vehicle routing problem (EVRP) into dynamic logistical transportation system such that the demand of customer may change over time. The routing decision of DEVRP must concern with the driving range limitation of electric vehicle (EV) in a dynamic environment since both load degree and battery capacity are variable according to the time-varying demands. This paper proposes an adaptive memetic algorithm, where a special encoding strategy, an adaptive local search operator, and an economical random immigrant scheme a

Los estilos APA, Harvard, Vancouver, ISO, etc.

42

Wang, Chao, Shengchuan Zhou, Yang Gao, and Chao Liu. "A self-adaptive bat algorithm for the truck and trailer routing problem." Engineering Computations 35, no. 1 (2018): 108–35. http://dx.doi.org/10.1108/ec-11-2016-0408.

Texto completo

Resumen

Purpose The purpose of this paper is to provide an effective solution method for the truck and trailer routing problem (TTRP) which is one of the important NP-hard combinatorial optimization problems owing to its multiple real-world applications. It is a generalization of the famous vehicle routing problem (VRP), involving a group of geographically scattered customers served by the vehicle fleet including trucks and trailers. Design/methodology/approach The meta-heuristic solution approach based on bat algorithm (BA) in which a local search procedure performed by five different neighborhood st

Los estilos APA, Harvard, Vancouver, ISO, etc.

43

Ji, Xiao-Fang, Jeng-Shyang Pan, Shu-Chuan Chu, Pei Hu, Qing-Wei Chai, and Ping Zhang. "Adaptive Cat Swarm Optimization Algorithm and Its Applications in Vehicle Routing Problems." Mathematical Problems in Engineering 2020 (April 21, 2020): 1–14. http://dx.doi.org/10.1155/2020/1291526.

Texto completo

Resumen

This paper proposes a novel hybrid algorithm named Adaptive Cat Swarm Optimization (ACSO). It combines the benefits of two swarm intelligence algorithms, CSO and APSO, and presents better search results. Firstly, some strategies are implemented to improve the performance of the proposed hybrid algorithm. The tracing radius of the cat group is limited, and the random number parameter r is adaptive adjusted. In addition, a scaling factor update method, called a memory factor y, is introduced into the proposed algorithm. They can be learnt very well so as to jump out of local optimums and speed u

Los estilos APA, Harvard, Vancouver, ISO, etc.

44

Khan, Muhammad Fahad, Muqaddas Bibi, Farhan Aadil, and Jong-Weon Lee. "Adaptive Node Clustering for Underwater Sensor Networks." Sensors 21, no. 13 (2021): 4514. http://dx.doi.org/10.3390/s21134514.

Texto completo

Resumen

Monitoring of an underwater environment and communication is essential for many applications, such as sea habitat monitoring, offshore investigation and mineral exploration, but due to underwater current, low bandwidth, high water pressure, propagation delay and error probability, underwater communication is challenging. In this paper, we proposed a sensor node clustering technique for UWSNs named as adaptive node clustering technique (ANC-UWSNs). It uses a dragonfly optimization (DFO) algorithm for selecting ideal measure of clusters needed for routing. The DFO algorithm is inspired by the sw

Los estilos APA, Harvard, Vancouver, ISO, etc.

45

Parane, Khyamling, B. M. Prabhu Prasad, and Basavaraj Talawar. "YaNoC: Yet Another Network-on-Chip Simulation Acceleration Engine Supporting Congestion-Aware Adaptive Routing Using FPGAs." Journal of Circuits, Systems and Computers 28, no. 12 (2019): 1950202. http://dx.doi.org/10.1142/s0218126619502025.

Texto completo

Resumen

Many-core systems employ the Network on Chip (NoC) as the underlying communication architecture. To achieve an optimized design for an application under consideration, there is a need for fast and flexible NoC simulator. This paper presents an FPGA-based NoC simulation acceleration framework supporting design space exploration of standard and custom NoC topologies considering a full set of microarchitectural parameters. The framework is capable of designing custom routing algorithms, various traffic patterns such as uniform random, transpose, bit complement and random permutation are supported

Los estilos APA, Harvard, Vancouver, ISO, etc.

46

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.

Texto completo

Resumen

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

Los estilos APA, Harvard, Vancouver, ISO, etc.

47

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.

Texto completo

Resumen

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

Los estilos APA, Harvard, Vancouver, ISO, etc.

48

Lu, Yu, Liu Chang, Jingwen Luo, and Jia Wu. "Routing Algorithm Based on User Adaptive Data Transmission Scheme in Opportunistic Social Networks." Electronics 10, no. 10 (2021): 1138. http://dx.doi.org/10.3390/electronics10101138.

Texto completo

Resumen

With the rapid popularization of 5G communication and internet of things technologies, the amount of information has increased significantly in opportunistic social networks, and the types of messages have become more and more complex. More and more mobile devices join the network as nodes, making the network scale increase sharply, and the tremendous amount of datatransmission brings a more significant burden to the network. Traditional opportunistic social network routing algorithms lack effective message copy management and relay node selection methods, which will cause problems such as hig

Los estilos APA, Harvard, Vancouver, ISO, etc.

49

Quan, Bi Sheng, Hui Li, and Zi Chun Le. "An Adaptive Routing and Resource Assignment Algorithm with Load Balancing in WDM-TDM Networks." Applied Mechanics and Materials 303-306 (February 2013): 1996–2001. http://dx.doi.org/10.4028/www.scientific.net/amm.303-306.1996.

Texto completo

Resumen

All-optical WDM networks are the most promising candidate for the next generation wideband backbone networks. To improve the utilization of wavelength, TDM technology is introduced into it. The routing, wavelength and time-slots assignment (RWTA) problem was studied in such time-space switched networks. A new adaptive algorithm was proposed which adopt adaptive network link weights and distribute slots of the session request on multiple different wavelengths adaptively with the remainder resource of the network. The effectiveness of the proposed algorithm is demonstrated by simulations and res

Los estilos APA, Harvard, Vancouver, ISO, etc.

50

Shin, Yong Woo, Misganaw Abebe, Yoojeong Noh, et al. "Near-Optimal Weather Routing by Using Improved A* Algorithm." Applied Sciences 10, no. 17 (2020): 6010. http://dx.doi.org/10.3390/app10176010.

Texto completo

Resumen

With soaring oil prices worldwide, determining the most optimal routes for economical ship operation has become an important issue. Optimizing ship routes is economically important for ship operation, but it is also essential to meet the standards of environmental regulations recently imposed by the International Maritime Organization. For this purpose, various algorithms for determining ship routes have been developed to ensure the economical operation of ships via utilization of marine climate data and Automatic Identification System (AIS) data. However, such algorithms require a large amoun

Los estilos APA, Harvard, Vancouver, ISO, etc.

Ofrecemos descuentos en todos los planes premium para autores cuyas obras están incluidas en selecciones literarias temáticas. ¡Contáctenos para obtener un código promocional único!