Log in

Relevant bibliographies by topics / Routing congestion / Journal articles

To see the other types of publications on this topic, follow the link: Routing congestion.

Journal articles on the topic 'Routing congestion'

Author: Grafiati

Published: 5 June 2025

Last updated: 1 August 2025

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 'Routing congestion.'

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

Hu, Jiang, and Sachin S. Sapatnekar. "Performance Driven Global Routing Through Gradual Refinement." VLSI Design 15, no. 3 (2002): 595–604. http://dx.doi.org/10.1080/1065514021000012219.

Full text

Abstract:

We propose a heuristic for VLSI interconnect global routing that can optimize routing congestion, delay and number of bends, which are often competing objectives. Routing flexibilities under timing constraints are obtained and exploited to reduce congestion subject to timing constraints. The wire routes are determined through gradual refinement according to probabilistic estimation on congestions so that the congestion is minimized while the number of bends on wires is limited. The experiments on both random generated circuits and benchmark circuits confirm the effectiveness of this method.

APA, Harvard, Vancouver, ISO, and other styles

2

Oh, Eun-Kyung, and Sung-Woo Hur. "Routing Congestion Driven Placement." KIPS Transactions:PartA 13A, no. 1 (2006): 57–70. http://dx.doi.org/10.3745/kipsta.2006.13a.1.057.

Full text

APA, Harvard, Vancouver, ISO, and other styles

3

Ash, J., and G. Choudhury. "PNNI routing congestion control." IEEE Communications Magazine 42, no. 11 (2004): 154–60. http://dx.doi.org/10.1109/mcom.2004.1362559.

Full text

APA, Harvard, Vancouver, ISO, and other styles

4

Ho, Yao Hua, Meng Chang Chen, and Han Chieh Chao. "Congestion avoidance routing for MANETs." International Journal of Ad Hoc and Ubiquitous Computing 16, no. 1 (2014): 26. http://dx.doi.org/10.1504/ijahuc.2014.062489.

Full text

APA, Harvard, Vancouver, ISO, and other styles

5

Gu, Ming, Fei He, Lerong Cheng, Xiaoyu Song, and Guowu Yang. "Congestion estimation for hexagonal routing." International Journal of Computer Mathematics 83, no. 3 (2006): 263–72. http://dx.doi.org/10.1080/00207160600682051.

Full text

APA, Harvard, Vancouver, ISO, and other styles

6

Chien, A. A. "Congestion control in routing networks." Computers & Security 7, no. 5 (1988): 515. http://dx.doi.org/10.1016/0167-4048(88)90241-6.

Full text

APA, Harvard, Vancouver, ISO, and other styles

7

Rakai, Logan, Laleh Behjat, Shawki Areibi, and Tamas Terlaky. "A Multilevel Congestion-Based Global Router." VLSI Design 2009 (November 17, 2009): 1–13. http://dx.doi.org/10.1155/2009/537341.

Full text

Abstract:

Routing in nanometer nodes creates an elevated level of importance for low-congestion routing. At the same time, advances in mathematical programming have increased the power to solve complex problems, such as the routing problem. Hence, new routing methods need to be developed that can combine advanced mathematical programming and modeling techniques to provide low-congestion solutions. In this paper, a hierarchical mathematical programming-based global routing technique that considers congestion is proposed. The main contributions presented in this paper include (i) implementation of congest

APA, Harvard, Vancouver, ISO, and other styles

8

Kumar, Jogendra. "Enhancing Congestion Control using a Load-Balanced Routing Algorithm for Distributed Networks." International journal of Computer Networks & Communications 17, no. 1 (2025): 11–27. https://doi.org/10.5121/ijcnc.2025.17102.

Full text

Abstract:

Ad hoc networks frequently encounter congestion due to packet loss, link failures, and limited bandwidth. These issues lead to significant energy and time expenditures for congestion recovery, ultimately degrading network performance. Various techniques exist to mitigate the effects of congestion, and this paper introduces a novel routing protocol named Load-Balanced Congestion-Adaptive Routing (LBCAR) protocol, which incorporates a random route point model in Mobile Ad Hoc Networks. The paper promotes an adaptive load-balanced routing approach combined with congestion control. A hybrid protoc

APA, Harvard, Vancouver, ISO, and other styles

9

ijcn. "Enhancing Congestion Control using a Load-Balanced Routing Algorithm for Distributed Networks." Enhancing Congestion Control using a Load-Balanced Routing Algorithm for Distributed Networks 17, no. 1 (2025): 978–1. https://doi.org/10.5121/ijcnc.2025.17102.

Full text

Abstract:

Ad hoc networks frequently encounter congestion due to packet loss, link failures, and limited bandwidth. These issues lead to significant energy and time expenditures for congestion recovery, ultimately degrading network performance. Various techniques exist to mitigate the effects of congestion, and this paper introduces a novel routing protocol named Load-Balanced Congestion-Adaptive Routing (LBCAR) protocol, which incorporates a random route point model in Mobile Ad Hoc Networks. The paper promotes an adaptive load-balanced routing approach combined with congestion control. A hybrid protoc

APA, Harvard, Vancouver, ISO, and other styles

10

Pan, Min, Yue Xu, Yanheng Zhang, and Chris Chu. "FastRoute: An Efficient and High-Quality Global Router." VLSI Design 2012 (August 9, 2012): 1–18. http://dx.doi.org/10.1155/2012/608362.

Full text

Abstract:

Modern large-scale circuit designs have created great demand for fast and high-quality global routing algorithms to resolve the routing congestion at the global level. Rip-up and reroute scheme has been employed by the majority of academic and industrial global routers today, which iteratively resolve the congestion by recreating the routing path based on current congestion. This method is proved to be the most practical routing framework. However, the traditional iterative maze routing technique converges very slowly and easily gets stuck at local optimal solutions. In this work, we propose a

APA, Harvard, Vancouver, ISO, and other styles

11

Sun, Lina, Ning Huang, Yue Zhang, and Yannan Bai. "An improved global dynamic routing strategy for scale-free network with tunable clustering." Modern Physics Letters B 30, no. 22 (2016): 1650302. http://dx.doi.org/10.1142/s0217984916503024.

Full text

Abstract:

An efficient routing strategy can deliver packets quickly to improve the network capacity. Node congestion and transmission path length are inevitable real-time factors for a good routing strategy. Existing dynamic global routing strategies only consider the congestion of neighbor nodes and the shortest path, which ignores other key nodes’ congestion on the path. With the development of detection methods and techniques, global traffic information is readily available and important for the routing choice. Reasonable use of this information can effectively improve the network routing. So, an imp

APA, Harvard, Vancouver, ISO, and other styles

12

Németh, Gábor. "On the Competitiveness of Oblivious Routing: A Statistical View." Applied Sciences 11, no. 20 (2021): 9408. http://dx.doi.org/10.3390/app11209408.

Full text

Abstract:

Oblivious routing is a static algorithm for routing arbitrary user demands with the property that the competitive ratio, the proportion of the maximum congestion to the best possible congestion, is minimal. Oblivious routing turned out surprisingly efficient in this worst-case sense: in undirected graphs, we pay only a logarithmic performance penalty, and this penalty is usually smaller than 2 in directed graphs as well. However, compared to an optimal adaptive algorithm, which never causes congestion when subjected to a routable demand, oblivious routing surely has congestion. The open questi

APA, Harvard, Vancouver, ISO, and other styles

13

Ahmad, Khurshid, Muhammad Athar Javed Sethi, Rehmat Ullah, et al. "Congestion-Aware Routing Algorithm for NoC Using Data Packets." Wireless Communications and Mobile Computing 2021 (August 18, 2021): 1–11. http://dx.doi.org/10.1155/2021/8588646.

Full text

Abstract:

Network on Chip (NoC) is a communication framework for the Multiprocessor System on Chip (MPSoC). It is a router-based communication system. In NoC architecture, nodes of MPSoC are communicating through the network. Different routing algorithms have been developed by researchers, e.g., XY, intermittent XY, DyAD, and DyXY. The main problems in these algorithms are congestion and faults. Congestion and faults cause delay, which degrades the performance of NoC. A congestion-aware algorithm is used for the distribution of traffic over NoC and for the avoidance of congestion. In this paper, a conge

APA, Harvard, Vancouver, ISO, and other styles

14

Alshaheen, Hisham Shaalan Saiwan. "Fuzzy System Based Routing in computer Networks." University of Thi-Qar Journal of Science 4, no. 1 (2013): 122–28. http://dx.doi.org/10.32792/utq/utjsci/v4i1.585.

Full text

Abstract:

This paper presented fuzzy system to solve the routing problem. The proposed method is used two different metrics; link delay and congestion level to make routing decision and to manage congestion control. The fuzzy system is decides the selection level of neighbor node. So, the selection level of each neighbor node can be determined. The routing system selects best neighbor node, that has less value of link delay and congestion level from source to till destination. In this paper a performance improvement of fuzzy system is presented by adding a congestion level to together with link delay. T

APA, Harvard, Vancouver, ISO, and other styles

15

刘, 立. "NDN Routing Policy Converged Congestion Control." Computer Science and Application 12, no. 07 (2022): 1781–94. http://dx.doi.org/10.12677/csa.2022.127179.

Full text

APA, Harvard, Vancouver, ISO, and other styles

16

Juarez, Ruben, and Michael Wu. "Routing-Proofness in Congestion-Prone Networks." Games 10, no. 2 (2019): 17. http://dx.doi.org/10.3390/g10020017.

Full text

Abstract:

We consider the problem of sharing the cost of connecting a large number of atomless agents in a network. The centralized agency elicits the target nodes that agents want to connect, and charges agents based on their demands. We look for a cost-sharing mechanism that satisfies three desirable properties: efficiency which charges agents based on the minimum total cost of connecting them in a network, stand-alone core stability which requires charging agents not more than the cost of connecting by themselves directly, and limit routing-proofness which prevents agents from profitable reporting as

APA, Harvard, Vancouver, ISO, and other styles

17

Dalal, Sandeep, and Renu Ruhil. "Routing based Congestion Control Metric: RFR." International Journal of Computer Applications 99, no. 11 (2014): 20–24. http://dx.doi.org/10.5120/17417-8201.

Full text

APA, Harvard, Vancouver, ISO, and other styles

18

Banner, Ron, and Ariel Orda. "Multipath Routing Algorithms for Congestion Minimization." IEEE/ACM Transactions on Networking 15, no. 2 (2007): 413–24. http://dx.doi.org/10.1109/tnet.2007.892850.

Full text

APA, Harvard, Vancouver, ISO, and other styles

19

O. "Congestion Free Routing in Adhoc Networks." Journal of Computer Science 8, no. 6 (2012): 971–77. http://dx.doi.org/10.3844/jcssp.2012.971.977.

Full text

APA, Harvard, Vancouver, ISO, and other styles

20

Jinan Lou, S. Thakur, S. Krishnamoorthy, and H. S. Sheng. "Estimating routing congestion using probabilistic analysis." IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems 21, no. 1 (2002): 32–41. http://dx.doi.org/10.1109/43.974135.

Full text

APA, Harvard, Vancouver, ISO, and other styles

21

Akhoondian Amiri, Saeed, Stephan Kreutzer, Dániel Marx, and Roman Rabinovich. "Routing with congestion in acyclic digraphs." Information Processing Letters 151 (November 2019): 105836. http://dx.doi.org/10.1016/j.ipl.2019.105836.

Full text

APA, Harvard, Vancouver, ISO, and other styles

22

Busch, Costas, and Malik Magdon-Ismail. "Atomic routing games on maximum congestion." Theoretical Computer Science 410, no. 36 (2009): 3337–47. http://dx.doi.org/10.1016/j.tcs.2009.04.015.

Full text

APA, Harvard, Vancouver, ISO, and other styles

23

Hać, Anna, and Dongmei Wang. "A Multicast Routing Algorithm Reducing Congestion." International Journal of Network Management 7, no. 3 (1997): 147–63. http://dx.doi.org/10.1002/(sici)1099-1190(199705/06)7:3<147::aid-nem249>3.0.co;2-j.

Full text

APA, Harvard, Vancouver, ISO, and other styles

24

Seligman, Matthew, Kevin Fall, and Padma Mundur. "Storage routing for DTN congestion control." Wireless Communications and Mobile Computing 7, no. 10 (2007): 1183–96. http://dx.doi.org/10.1002/wcm.521.

Full text

APA, Harvard, Vancouver, ISO, and other styles

25

G. Srinivasan. "Fuzzy based Congestion Control and Congestion Aware Routing Technique for IoT Networks." Journal of Information Systems Engineering and Management 10, no. 13s (2025): 160–65. https://doi.org/10.52783/jisem.v10i13s.2016.

Full text

Abstract:

Introduction: In Internet of Things (IoT) networks, the existing congestion control mechanisms did not often scale efficiently or maintain the heterogeneity of devices, causing performance bottlenecks and uneven network performance. Existing congestion control protocols may not adjust well to these dynamics, causing increased packet loss, suboptimal performance, and higher latency. Objectives: The main objectives of this work are to detect congestion at node level or link level and to determine congestion aware routing paths. Methods: A Fuzzy-based congestion control and congestion aware routi

APA, Harvard, Vancouver, ISO, and other styles

26

Radhika, A., and D. Haritha. "Performance Analysis of TBC-ACO Routing Protocol with Existing Routing Protocols of Wireless Sensor Networks." International Journal of Advanced Research in Computer Science and Software Engineering 7, no. 8 (2017): 169. http://dx.doi.org/10.23956/ijarcsse.v7i8.46.

Full text

Abstract:

Wireless Sensor Networks, have witnessed significant amount of improvement in research across various areas like Routing, Security, Localization, Deployment and above all Energy Efficiency. Congestion is a problem of importance in resource constrained Wireless Sensor Networks, especially for large networks, where the traffic loads exceed the available capacity of the resources . Sensor nodes are prone to failure and the misbehaviour of these faulty nodes creates further congestion. The resulting effect is a degradation in network performance, additional computation and increased energy consump

APA, Harvard, Vancouver, ISO, and other styles

27

LI, TSENG-KUEI, JIMMY J. M. TAN, LIH-HSING HSU, and TING-YI SUNG. "OPTIMUM CONGESTED ROUTING STRATEGY ON TWISTED CUBES." Journal of Interconnection Networks 01, no. 02 (2000): 115–34. http://dx.doi.org/10.1142/s0219265900000081.

Full text

Abstract:

Given a shortest path routing algorithm of an interconnection network, the edge congestion is one of the important factors to evaluate the performance of this algorithm. In this paper, we consider the twisted cube, a variation of the hypercube with some better properties, and review the existing shortest path routing algorithm8. We find that its edge congestion under the routing algorithm is high. Then, we propose a new shortest path routing algorithm and show that our algorithm has optimum time complexity O(n) and optimum edge congestion 2n. Moreover, we calculate the bisection width of the t

APA, Harvard, Vancouver, ISO, and other styles

28

Istikmal, Istikmal, Adit Kurniawan, and Hendrawan Hendrawan. "Joint Routing and Congestion Control in Multipath Channel based on Signal to Noise Ratio with Cross Layer Scheme." International Journal of Electrical and Computer Engineering (IJECE) 8, no. 4 (2018): 2207. http://dx.doi.org/10.11591/ijece.v8i4.pp2207-2219.

Full text

Abstract:

Routing protocol and congestion control in Transmission Control Protocol (TCP) have important roles in wireless mobile network performance. In wireless communication, the stability of the path and successful data transmission will be influenced by the channel condition. This channel condition constraints come from path loss and the multipath channel fading. With these constraints, the algorithm in the routing protocol and congestion control is confronted with the uncertainty of connection quality and probability of successful packet transmission, respectively. It is important to investigate th

APA, Harvard, Vancouver, ISO, and other styles

29

Istikmal, Kurniawan Adit, and Hendrawan. "Joint Routing and Congestion Control in Multipath Channel based on Signal to Noise Ratio with Cross Layer Scheme." International Journal of Electrical and Computer Engineering (IJECE) 8, no. 4 (2018): 2207–19. https://doi.org/10.11591/ijece.v8i4.pp2207-2219.

Full text

Abstract:

Routing protocol and congestion control in Transmission Control Protocol (TCP) have important roles in wireless mobile network performance. In wireless communication, the stability of the path and successful data transmission will be influenced by the channel condition. This channel condition constraints come from path loss and the multipath channel fading. With these constraints, the algorithm in the routing protocol and congestion control is confronted with the uncertainty of connection quality and probability of successful packet transmission, respectively. It is important to investigate th

APA, Harvard, Vancouver, ISO, and other styles

30

Sanu, Thomas, and Mathew Thomaskutty. "Congestion bottleneck avoid routing in wireless sensor networks." International Journal of Electrical and Computer Engineering (IJECE) 9, no. 6 (2019): 4804–14. https://doi.org/10.11591/ijece.v9i6.pp4804-4814.

Full text

Abstract:

A new efficient method for detecting congested bottleneck nodes and avoiding them in the route formation in a wireless sensor network is described. Sensor nodes with a higher degree of congestion are excluded while determining the best routing path from a given source to destination in a multi-hop transmission. In a scenario where different communication paths have different maximum congestion levels, selecting that path which has least maximum congestion, is a challenging task. A modified Bellman-Ford algorithm is proposed to solve this problem efficiently. The proposed technique is very much

APA, Harvard, Vancouver, ISO, and other styles

31

Tang, Ming Hua. "A Novel Performance Metric of Routing Algorithm." Advanced Materials Research 760-762 (September 2013): 2177–82. http://dx.doi.org/10.4028/www.scientific.net/amr.760-762.2177.

Full text

Abstract:

The widely used routing algorithm performance metric of adaptiveness cannot precisely measure performance of routing algorithm. In this paper, we propose a new metric of routing pressure for measuring routing algorithm performance. It has higher precision of measuring routing algorithm performance than degree of adaptiveness. Performance of routing algorithm can be evaluated through routing pressure without simulation. It can explain why congestion takes place in network. In addition, where and when congestion takes place can be pointed out without simulation.

APA, Harvard, Vancouver, ISO, and other styles

32

Gorgues, Miguel, and Jose Flich. "End-Point Congestion Filter for Adaptive Routing with Congestion-Insensitive Performance." IEEE Computer Architecture Letters 15, no. 1 (2016): 9–12. http://dx.doi.org/10.1109/lca.2015.2429130.

Full text

APA, Harvard, Vancouver, ISO, and other styles

33

Jun, Fan. "Wireless Sensor Networks Data Transmission Based on Congestion by Cognized Routing Protocol." Advanced Materials Research 433-440 (January 2012): 3692–702. http://dx.doi.org/10.4028/www.scientific.net/amr.433-440.3692.

Full text

Abstract:

In wireless sensor networks (WSNs), sensor nodes share wireless channels to communicate with each other. So, link congestion often occurs and induces data retransmission easily. To avoid these issues, data transmission efficiency would be greatly enhanced and the energy consumption of network would save a lot. Based on this idea, we have designed a transmission-effective congestion-cognized (TECC) routing protocol in the paper. Routings are selected probabilistically and real-timely, according to the out-bound nodes’ satisfactory degrees of forwarding. Also, time stamps are used to control nod

APA, Harvard, Vancouver, ISO, and other styles

34

D, Bhavya, D. S. Vinod, S. P. Shiva Prakash, and Kirill Krinkin. "Enhancing routing efficiency in social internet of things: R-OPTICS and vEBT based congestion free model." International Journal of Electrical and Computer Engineering (IJECE) 14, no. 3 (2024): 3475. http://dx.doi.org/10.11591/ijece.v14i3.pp3475-3484.

Full text

Abstract:

The emergence of the social internet of things (SIoT) network has brought forth distinctive challenges, including node mobility and varying densities, leading to congestion and hampered network efficiency. To overcome these issues, a congestion-free routing model for SIoT is proposed. This model combines the relationship-ordering points to identify the clustering structure (R-OPTICS) algorithm for intelligent node clustering based on relationships and ordering,along with a van emde boas tree (vEBT) for efficient path selection. R-OPTICS enables effective network management by clustering nodes

APA, Harvard, Vancouver, ISO, and other styles

35

Jyothi M Shirur, Dr Yasha, and Nagavalli S. Nagavalli S. "Implementation of Machine Learning In VLSI Global Routing." International Journal of Engineering and Science Invention 13, no. 10 (2024): 09–20. http://dx.doi.org/10.35629/6734-13100920.

Full text

Abstract:

Machine learning (ML) plays a transformative role in VLSI design by automating complex decision-making processes, which traditionally rely on heuristic or rule-based methods. In particular, ML helps address challenges in optimizing parameters like wire length, signal delay, and congestion, which are critical for enhancing design efficiency. Without ML, global routing in VLSI becomes time-consuming and less adaptive to modern design complexity, leading to suboptimal results. In this paper, we have discussed the implementation of ML for congestion prediction using congestion datasets from Circui

APA, Harvard, Vancouver, ISO, and other styles

36

Mounica, P., R. Umamaheswari, and R. Madhavi R. Nischala N. Ramesh Babu. "Design A Congestion Aware Routing Algorithm for Synchronous Cam Design." International Journal of Trend in Scientific Research and Development Volume-2, Issue-3 (2018): 1596–99. http://dx.doi.org/10.31142/ijtsrd11547.

Full text

APA, Harvard, Vancouver, ISO, and other styles

37

Zhang, Xue Yan, and Ke Zhang. "Study on Pre-Deflection Routing in OBS Network Based on Congestion Avoidance." Applied Mechanics and Materials 556-562 (May 2014): 5863–68. http://dx.doi.org/10.4028/www.scientific.net/amm.556-562.5863.

Full text

Abstract:

Burst contention is the key issue to solve for optical burst switching (OBS), deflection routing is researched as an effective contention resolution approach. A pre-deflection Routing (CAPDR) algorithm based on Congestion Avoidance is proposed in the paper, using periodic feedback network congestion information, the algorithm deflects in advance parts of the bursts in some probability. Compared with the traditional shortest path deflection routing, the new algorithm can avoid congestion and also balance the load of the network. Simulation results show that the proposed algorithm outperforms sh

APA, Harvard, Vancouver, ISO, and other styles

38

Lim, Chansook. "A Survey on Congestion Control for RPL-Based Wireless Sensor Networks." Sensors 19, no. 11 (2019): 2567. http://dx.doi.org/10.3390/s19112567.

Full text

Abstract:

RPL (IPv6 routing protocol for low power and lossy networks) proposed by the IETF (Internet Engineering Task Force) ROLL (routing over low-power and lossy networks) working group is a de facto standard routing protocol for IoT environments. Since the standardization was proposed, RPL has been extensively improved for diverse application scenarios and environments. Congestion control is one of the most important reasons why RPL has been improved. In an LLN (low power and lossy network), congestion may even lead to network lifetime reduction. In resource-constrained networks where end-to-end con

APA, Harvard, Vancouver, ISO, and other styles

39

Devangavi, Anil D., and Rajendra Gupta. "Adaptive Congestion Controlled Multipath Routing in VANET." International Journal of Agent Technologies and Systems 9, no. 1 (2017): 43–68. http://dx.doi.org/10.4018/ijats.2017010103.

Full text

Abstract:

This article describes how in the VANET environment, routes are broken owing to node mobility. Moreover, the usage of wireless links for data communication leads to inherent unreliability and are error prone. Single path routing uses a prediction mechanism to compute a reliable path considering vehicle velocity and vehicle direction. Nevertheless, this methodology does not deal with major real-world traffic conditions. Hence, to address the aforementioned problems and to enhance reliability and fault tolerance, multipath routing protocols are employed. However existing multipath routing protoc

APA, Harvard, Vancouver, ISO, and other styles

40

Islam, Muhammad Arshad, Muhammad Azhar Iqbal, Muhammad Aleem, Zahid Halim, Gautam Srivastava, and Jerry Chun-Wei Lin. "Evaluation of Congestion Aware Social Metrics for Centrality-Based Routing." Wireless Communications and Mobile Computing 2021 (June 19, 2021): 1–14. http://dx.doi.org/10.1155/2021/5581259.

Full text

Abstract:

Opportunistic networks utilize pocket switching for routing where each node forwards its messages to a suitable next node. The selection of the forwarder node is crucial for the efficient performance of a routing protocol. In any opportunistic network, some nodes have a paramount role in the routing process and these nodes could be identified with the assistance of the existing centrality measures available in network theory. However, the central nodes tend to suffer from congestion because a large number of nodes that are relatively less central attempt to forward their payload to the central

APA, Harvard, Vancouver, ISO, and other styles

41

Dr., Atul M. Gosai, and M. Raval Lakshdeep. "Grid Based Multipath with Congestion Avoidance Routing Protocol." International Journal of Trend in Scientific Research and Development 1, no. 3 (2017): 8–16. https://doi.org/10.31142/ijtsrd72.

Full text

Abstract:

This Paper gives information about Grid base multipath wireless sensor network. We give a brief introduction about wireless sensor network, how sensor works in this network. How the Routing is done and if there is congestion detected in sensors networks and then how it can be solved. Routing protocols are also classified in several types like Proactive, Reactive, and Hybrid in also given here the details of that. Also here we describe various routing techniques like Traditional and Current techniques. In flooding based techniques, sensor broadcast the information and the destination sensor rec

APA, Harvard, Vancouver, ISO, and other styles

42

Fang, Juan, Di Zhang, and Xiaqing Li. "ParRouting: An Efficient Area Partition-Based Congestion-Aware Routing Algorithm for NoCs." Micromachines 11, no. 12 (2020): 1034. http://dx.doi.org/10.3390/mi11121034.

Full text

Abstract:

Routing algorithms is a key factor that determines the performance of NoC (Networks-on-Chip) systems. Regional congestion awareness routing algorithms have shown great potential in improving the performance of NoC. However, it incurs a significant queuing latency when practitioners use existing regional congestion awareness routing algorithms to make routing decisions, thus degrading the performance of NoC. In this paper, we propose an efficient area partition-based congestion-aware routing algorithm, ParRouting, which aims at increasing the throughput and reducing the latency for NoC systems.

APA, Harvard, Vancouver, ISO, and other styles

43

Mathad, Channabasayya, Paramesha Paramesha, and D. Srinivasa Rao. "Congestion Control for Fault Tolerant Multicast Routing in MANET." INTERNATIONAL JOURNAL OF COMPUTERS & TECHNOLOGY 15, no. 9 (2016): 7041–48. http://dx.doi.org/10.24297/ijct.v15i9.194.

Full text

Abstract:

Mobile Ad hoc Network (MANET) is a collection of two or more devices or nodes or terminals with wireless communications and networking capability that communicate with each other without the aid of any centralized administrator a dynamic network consisting of several mobile nodes communicating wirelessly. MANET is an infrastructure less network and each member node is free to move in and out of the network in a random manner. Congestion may occur in any node when data packets travel from source to destination. Controlling congestion is critical to ensure adequate network operation and performa

APA, Harvard, Vancouver, ISO, and other styles

44

D, Bhavya, D. S. Vinod, Prakash S. P. Shiva, and Kirill Krinkin. "Enhancing routing efficiency in social internet of things: R-OPTICS and vEBT based congestion free model." Enhancing routing efficiency in social internet of things: R-OPTICS and vEBT based congestion free model 14, no. 3 (2024): 3475–84. https://doi.org/10.11591/ijece.v14i3.pp3475-3484.

Full text

Abstract:

The emergence of the social internet of things (SIoT) network has brought forth distinctive challenges, including node mobility and varying densities, leading to congestion and hampered network efficiency. To overcome these issues,  a congestion-free routing model for SIoT is proposed. This model combines the relationship-ordering points to identify the clustering structure (R-OPTICS) algorithm for intelligent node clustering based on relationships and ordering, along with a van emde boas tree (vEBT) for efficient path selection. R-OPTICS enables effective ne

APA, Harvard, Vancouver, ISO, and other styles

45

Venugopal, Kala, and T. G. Basavaraju. "Congestion and Energy Aware Multipath Load Balancing Routing for LLNs." International journal of Computer Networks & Communications 15, no. 3 (2023): 71–92. http://dx.doi.org/10.5121/ijcnc.2023.15305.

Full text

Abstract:

The Internet of Things (IoT) is presently in its golden era with its current technological evolution towards digital transformation. Low-power and Lossy Networks (LLNs) form the groundwork for IoT, where the IPv6 Routing Protocol for Low-Power and Lossy Networks (RPL) is designated by Internet Engineering Task Force as the benchmark protocol for routing. Although RPL, with its unique capabilities, has addressed many IoT routing requirements, Load balancing and Congestion control are the outliers. This paper builds on the RPL protocol and proposes a multipath Congestion and Energy Aware RPL (CE

APA, Harvard, Vancouver, ISO, and other styles

46

Sharma, Tripti, and Vivek Kumar. "Congestion Aware Link Cost Routing for MANETS." International journal of Computer Networks & Communications 8, no. 3 (2016): 167–79. http://dx.doi.org/10.5121/ijcnc.2016.8312.

Full text

APA, Harvard, Vancouver, ISO, and other styles

47

Chuzhoy, Julia. "Routing in Undirected Graphs with Constant Congestion." SIAM Journal on Computing 45, no. 4 (2016): 1490–532. http://dx.doi.org/10.1137/130910464.

Full text

APA, Harvard, Vancouver, ISO, and other styles

48

Yao, Hailong, Yici Cai, and Xianlong Hong. "Congestion-driven multilevel full-chip routing framework." Tsinghua Science and Technology 13, no. 6 (2008): 843–49. http://dx.doi.org/10.1016/s1007-0214(08)72210-7.

Full text

APA, Harvard, Vancouver, ISO, and other styles

49

Saeedi, Mehdi, Morteza Saheb Zamani, and Ali Jahanian. "Evaluation, prediction and reduction of routing congestion." Microelectronics Journal 38, no. 8-9 (2007): 942–58. http://dx.doi.org/10.1016/j.mejo.2007.07.122.

Full text

APA, Harvard, Vancouver, ISO, and other styles

50

Anuradha, S., and G. Raghu Ram. "Dynamic Congestion Control using MDB-Routing Algorithm." Journal of The Institution of Engineers (India): Series B 95, no. 1 (2014): 37–41. http://dx.doi.org/10.1007/s40031-014-0075-2.

Full text

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!