Relevant bibliographies by topics / Routing congestion

Contents

  1. Journal articles
  2. Dissertations / Theses
  3. Books
  4. Book chapters
  5. Conference papers
  6. Reports

Academic literature on the topic 'Routing congestion'

Author: Grafiati
Published: 5 June 2025
Last updated: 15 July 2025

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

Select a source type:

Consult the lists of relevant articles, books, theses, conference reports, and other scholarly sources 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.

Journal articles on the topic "Routing congestion"

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
More sources

Dissertations / Theses on the topic "Routing congestion"

1

Fabregat, Gesa Ramon. "Congestion probability routing in virtual path ATM network." Doctoral thesis, Universitat de Girona, 1998. http://hdl.handle.net/10803/31897.

Full text
Abstract:
This dissertation focuses on the problem of providing mechanisms for routing point to point and multipoint connections in ATM networks. In general the notion of multipoint connection refers to connections that involve a group of users with more than two members. The main objective of this dissertation is to contribute to design efficient routing protocols with alterative routes in fully connected VP-based ATM Networks for call establishment of point to point and multipoint VC connections. An efficient route should be computed during this connection establishment phase.
APA, Harvard, Vancouver, ISO, and other styles
2

Krishna, Bharat. "Congestion driven global routing and cross point assignment." Related electronic resource: Current Research at SU : database of SU dissertations, recent titles available full text, 2005. http://wwwlib.umi.com/cr/syr/main.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

Chen, Xiaoqiang. "Congestion control and routing in integrated broadband networks." Thesis, University of Cambridge, 1992. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.240046.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

Faion, Victor. "Congestion avoidance in overlay networks through multipath routing." Thesis, Imperial College London, 2013. http://hdl.handle.net/10044/1/24672.

Full text
Abstract:
Overlay networks relying on traditional multicast routing approaches use only a single path between a sender and a receiver. This path is selected based on latency, with the goal of achieving fast delivery. Content is routed through links with low latency, ignoring slower links of the network which remain unused. With the increasing size of content on the Internet, this leads to congestion, messages are dropped and have to be retransmitted. A multicast multipath congestion-avoidance routing scheme which uses multiple bottleneck-disjoint paths between senders and receivers was developed, as was
APA, Harvard, Vancouver, ISO, and other styles
5

Zhang, Fan. "Parallelization of Negotiated Congestion Algorithm in FPGA Routing." University of Cincinnati / OhioLINK, 2013. http://rave.ohiolink.edu/etdc/view?acc_num=ucin1367936094.

Full text
APA, Harvard, Vancouver, ISO, and other styles
6

Bartlett, Kelly K. "Congestion-aware dynamic routing in automated material handling systems." Diss., Georgia Institute of Technology, 2014. http://hdl.handle.net/1853/53013.

Full text
Abstract:
In semiconductor manufacturing, automated material handling systems (AMHSs) transport wafers through a complex re-entrant manufacturing process. In some systems, Overhead Hoist Transport (OHT) vehicles move throughout the facility on a ceiling-mounted track system, delivering wafers to machines and storage locations. To improve efficiency in such systems, this thesis proposes an adaptive dynamic routing approach that allows the system to self-regulate, reducing steady-state travel times by 4-6% and avoiding excessive congestion and deadlock. Our approach allows vehicles to be rerouted while i
APA, Harvard, Vancouver, ISO, and other styles
7

Glazer, D. W. (David W. ). "On routing and congestion control in computer communications networks." Thesis, McGill University, 1986. http://digitool.Library.McGill.CA:80/R/?func=dbin-jump-full&object_id=66146.

Full text
APA, Harvard, Vancouver, ISO, and other styles
8

Voice, Thomas David. "Stability of congestion control algorithms with multi-path routing and linear stochastic modelling of congestion control." Thesis, University of Cambridge, 2006. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.614022.

Full text
APA, Harvard, Vancouver, ISO, and other styles
9

Lim, Sejoon. "Congestion-aware traffic routing for large-scale mobile agent systems." Thesis, Massachusetts Institute of Technology, 2012. http://hdl.handle.net/1721.1/78452.

Full text
Abstract:
Thesis (Ph. D.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer Science, 2012.<br>Cataloged from PDF version of thesis.<br>Includes bibliographical references (p. 191-201).<br>Traffic congestion is a serious world-wide problem. Drivers have little knowledge of historical and real-time traffic congestion for the paths they take and often tend to drive suboptimal routes. Congestion phenomena are sure to be influenced by the coming of autonomous cars. This thesis presents route planning algorithms and a system for either autonomous or human-driven cars in road
APA, Harvard, Vancouver, ISO, and other styles
10

Su, Pu. "QOS IN COGNITIVE PACKET NETWORKS: ADAPTIVE ROUTING, FLOW AND CONGESTION CONTROL." Doctoral diss., University of Central Florida, 2005. http://digital.library.ucf.edu/cdm/ref/collection/ETD/id/4286.

Full text
Abstract:
With the emergence of various applications that have different Quality of Service (QoS) requirements, the capability of a network to support QoS becomes more and more important and necessary. This dissertation explores QoS in Cognitive Packet Networks (CPN) by using adaptive routing, flow and congestion control. We present a detailed description and analysis of our proposed routing algorithms based on single and multiple QoS constraints. An online estimation of packet loss rate over a path is introduced. We implement and evaluate the adaptive routing scheme in an experimental CPN test-bed. Our
APA, Harvard, Vancouver, ISO, and other styles
More sources

Books on the topic "Routing congestion"

1

Ignaciuk, Przemysław. Congestion Control in Data Transmission Networks: Sliding Mode and Other Designs. Springer London, 2013.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
2

1968-, Rovithakis George A., ed. End to end adaptive congestion control in TCP/IP networks. Taylor & Francis, 2012.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
3

Routing Congestion in VLSI Circuits: Estimation and Optimization. Springer US, 2007. http://dx.doi.org/10.1007/0-387-48550-3.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

Saxena, Prashant, Rupesh S. Shelar, and Sachin Sapatnekar. Routing Congestion in VLSI Circuits: Estimation and Optimization. Springer, 2010.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
5

Saxena, Prashant, Rupesh S. Shelar, and Sachin Sapatnekar. Routing Congestion in VLSI Circuits: Estimation and Optimization. Springer, 2007.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
6

Arika, Rebecca Nyasuguta, A. Mindila, and W. Cheruiyot. Evaluation of Node Weight-Based Congestion Adaptive Routing Algorithm in Manet Packet Routing. GRIN Verlag GmbH, 2017.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
7

Wang, Jianxin. Congestion Control in Computer Networks: Theory, Protocols and Applications. Nova Science Publishers, Inc., 2013.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
8

Routing Congestion in VLSI Circuits: Estimation and Optimization (Series on Integrated Circuits and Systems). Springer, 2007.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
9

Houmkozlis, Christos N., and George A. Rovithakis. End-To-End Adaptive Congestion Control in TCP/IP Networks. Taylor & Francis Group, 2017.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
10

Houmkozlis, Christos N., and George A. Rovithakis. End-To-End Adaptive Congestion Control in TCP/IP Networks. Taylor & Francis Group, 2017.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
More sources

Book chapters on the topic "Routing congestion"

1

Kachroo, Pushkin, and Kaan M. A. Özbay. "Feedback Routing via Congestion Pricing." In Advances in Industrial Control. Springer International Publishing, 2018. http://dx.doi.org/10.1007/978-3-319-69231-9_10.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Al-Kashoash, Hayder. "Congestion-Aware Routing Protocol for 6LoWPANs." In Congestion Control for 6LoWPAN Wireless Sensor Networks: Toward the Internet of Things. Springer International Publishing, 2019. http://dx.doi.org/10.1007/978-3-030-17732-4_4.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

Peng, Jun, and Biplab Sikdar. "Routing-Based Video Multicast Congestion Control." In Management of Multimedia on the Internet. Springer Berlin Heidelberg, 2002. http://dx.doi.org/10.1007/3-540-45812-3_26.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

Busch, Costas, and Malik Magdon-Ismail. "Atomic Routing Games on Maximum Congestion." In Algorithmic Aspects in Information and Management. Springer Berlin Heidelberg, 2006. http://dx.doi.org/10.1007/11775096_9.

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

Narayan, Onuttom, Iraj Saniee, and Vladimir Marbukh. "Congestion Due to Random Walk Routing." In Complex Networks & Their Applications IX. Springer International Publishing, 2020. http://dx.doi.org/10.1007/978-3-030-65347-7_46.

Full text
APA, Harvard, Vancouver, ISO, and other styles
6

Banner, Ron, and Ariel Orda. "Multipath Routing Algorithms for Congestion Minimization." In NETWORKING 2005. Networking Technologies, Services, and Protocols; Performance of Computer and Communication Networks; Mobile and Wireless Communications Systems. Springer Berlin Heidelberg, 2005. http://dx.doi.org/10.1007/11422778_43.

Full text
APA, Harvard, Vancouver, ISO, and other styles
7

Heller, Steve. "Congestion-Free routing on the CM-5 data router." In Parallel Computer Routing and Communication. Springer Berlin Heidelberg, 1994. http://dx.doi.org/10.1007/3-540-58429-3_36.

Full text
APA, Harvard, Vancouver, ISO, and other styles
8

Kathiravelu, Thabotharan, and Nalin Ranasinghe. "Congestion-Aware Adaptive Routing for Opportunistic Networks." In Opportunistic Networks. Chapman and Hall/CRC, 2018. http://dx.doi.org/10.1201/9780429453434-6.

Full text
APA, Harvard, Vancouver, ISO, and other styles
9

Hyatt, Craig, and Dharma P. Agrawal. "Congestion Control in the Wormhole-Routed Torus With Clustering and Delayed Deflection." In Parallel Computer Routing and Communication. Springer Berlin Heidelberg, 1998. http://dx.doi.org/10.1007/3-540-69352-1_3.

Full text
APA, Harvard, Vancouver, ISO, and other styles
10

Shakkottai, Srinivas, and R. Srikant. "Communication Networks: Pricing, Congestion Control, Routing, and Scheduling." In Handbook of Dynamic Game Theory. Springer International Publishing, 2018. http://dx.doi.org/10.1007/978-3-319-44374-4_29.

Full text
APA, Harvard, Vancouver, ISO, and other styles

Conference papers on the topic "Routing congestion"

1

Chang, Tianfang, and Lin Cai. "Multipath Routing Compatible Congestion Control." In 2024 IEEE 100th Vehicular Technology Conference (VTC2024-Fall). IEEE, 2024. https://doi.org/10.1109/vtc2024-fall63153.2024.10757972.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Serra, Cristiano, Emilio Paolini, Roger Immich, Alessio Sacco, Guido Marchetto, and Flavio Esposito. "Flecto: Cross-Layer Adaptive Congestion Control with Reinforcement Learning." In 2025 IEEE 26th International Conference on High Performance Switching and Routing (HPSR). IEEE, 2025. https://doi.org/10.1109/hpsr64165.2025.11038888.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

Xu, Sheng, Binzhang Fu, Mingyu Chen, and Lixin Zhang. "Congestion-Aware Adaptive Routing with Quantitative Congestion Information." In 2016 IEEE 18th International Conference on High Performance Computing and Communications; IEEE 14th International Conference on Smart City; IEEE 2nd International Conference on Data Science and Systems (HPCC/SmartCity/DSS). IEEE, 2016. http://dx.doi.org/10.1109/hpcc-smartcity-dss.2016.0040.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

Cavalieri, Salvatore. "Estimating KNXnet/IP routing congestion." In 2011 IEEE 20th International Symposium on Industrial Electronics (ISIE). IEEE, 2011. http://dx.doi.org/10.1109/isie.2011.5984329.

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

Chen, Tom, and Alkan Cengiz. "Measuring routing congestion for multi-layer global routing." In the 10th Great Lakes Symposium. ACM Press, 2000. http://dx.doi.org/10.1145/330855.330968.

Full text
APA, Harvard, Vancouver, ISO, and other styles
6

Al-Shabibi, Ali, and Brian Martin. "MultiRoute - a congestion-aware multipath routing protocol." In 2010 International Conference on High Performance Switching and Routing (HPSR). IEEE, 2010. http://dx.doi.org/10.1109/hpsr.2010.5580280.

Full text
APA, Harvard, Vancouver, ISO, and other styles
7

Tseng, Shih-Hao, Chiun Lin Lim, Ning Wu, and Ao Tang. "Time-aware congestion-free routing reconfiguration." In 2016 IFIP Networking Conference (IFIP Networking) and Workshops. IEEE, 2016. http://dx.doi.org/10.1109/ifipnetworking.2016.7497252.

Full text
APA, Harvard, Vancouver, ISO, and other styles
8

Saeedi, Mehdi, Morteza Saheb Zamani, and Ali Jahanian. "Prediction and reduction of routing congestion." In the 2006 international symposium. ACM Press, 2006. http://dx.doi.org/10.1145/1123008.1123023.

Full text
APA, Harvard, Vancouver, ISO, and other styles
9

Shrivastav, Laxmi, Geetam Singh Tomar, and Frank Z. Wang. "An Advanced Congestion Adaptive Routing Mechanism." In 2012 4th International Conference on Computational Intelligence, Communication Systems and Networks (CICSyN 2012). IEEE, 2012. http://dx.doi.org/10.1109/cicsyn.2012.37.

Full text
APA, Harvard, Vancouver, ISO, and other styles
10

Hadsell, Raia T., and Patrick H. Madden. "Improved global routing through congestion estimation." In the 40th conference. ACM Press, 2003. http://dx.doi.org/10.1145/775832.775842.

Full text
APA, Harvard, Vancouver, ISO, and other styles

Reports on the topic "Routing congestion"

1

Leighton, F. T., Bruce M. Maggs, and Andrea W. Richa. Fast Algorithms for Finding O(Congestion + Dilation) Packet Routing Schedules,. Defense Technical Information Center, 1996. http://dx.doi.org/10.21236/ada311323.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Goldberg, L. A., P. D. MacKenzie, and D. S. Greenberg. Network congestion can be controlled: Routing algorithms in optical networks and Ethernets. Office of Scientific and Technical Information (OSTI), 1997. http://dx.doi.org/10.2172/565650.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

Meerkov, Semyon M., and Lotfi Benmohamed. Congestion/Flow Control and Routing in Data Networks: A Control- Theoretic Approach. Defense Technical Information Center, 1993. http://dx.doi.org/10.21236/ada271121.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

Hunt, Fern Y., and Vladimir Marbukh. A model of joint congestion control and routing through random assignment of paths. National Institute of Standards and Technology, 2010. http://dx.doi.org/10.6028/nist.ir.7590.

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

She, Ruifeng, and Yanfeng Ouyang. Analysis of Drone-based Last-mile Delivery Systems under Aerial Congestion: A Continuum Approximation Approach. Illinois Center for Transportation, 2023. http://dx.doi.org/10.36501/0197-9191/23-014.

Full text
Abstract:
This paper presents a systematic analysis and design framework for a spectrum of last-mile delivery systems that leverage unmanned aerial vehicles (UAVs). Four distinct modes are considered: (1) direct drone deliveries from a fixed depot; (2) drone deliveries from parked trucks that carry bulk parcels to customer neighborhoods; (3) drone deliveries from nonstopping trucks that tour customer neighborhoods; and (4) as a benchmark, traditional truck-based home deliveries. We present a new continuum-approximation approach that is used for analysis of both truck routing and aerial-UAV traffic. We c
APA, Harvard, Vancouver, ISO, and other styles
6

Deng, Zhuohang, Zhiliang Luo, Neil Hockaday, Ahmed Farid, and Anurag Pande. Evaluation of Left Shoulder as Part-Time Travel Lane Design Alternatives and Transportation Management Center Staff Training Module Development. Mineta Transportation Institute, 2023. http://dx.doi.org/10.31979/mti.2023.2153.

Full text
Abstract:
Permanent capacity expansion, such as adding new lanes, is no longer a viable strategy to address traffic congestion in California; hence, ITS (Intelligent Transportation System) strategies, such as part-time use of the shoulder as a travel lane, need to be explored. The use of the shoulder as a travel lane during peak traffic hours has limited applications in the US, and most use the right shoulder as a part-time travel lane even though either the right or left shoulder (but not both) may be used. Caltrans District 5 is exploring the use of Left Shoulder as a Part-time Travel Lane (LSPTTL) as
APA, Harvard, Vancouver, ISO, and other styles
7

Cargo Consolidation, Routing, and Location Optimization to Reduce Traffic Congestion by Minimizing Commercial Heavy Vehicle Trips. University of South Florida, 2024. http://dx.doi.org/10.5038/cutr-nicr-y3-2-7.

Full text
APA, Harvard, Vancouver, ISO, and other styles
You might also be interested in the extended bibliographies on the topic 'Routing congestion' for particular source types:
Journal articles Dissertations / Theses Books
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!

To the bibliography