Log in

Relevant bibliographies by topics / Routing congestion / Dissertations / Theses

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

Dissertations / Theses 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 top 50 dissertations / theses 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 dissertations / theses on a wide variety of disciplines and organise your bibliography correctly.

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

11

Kotze, Daniel Johannes Van Wyk. "Minimum congestion routing for a 17 GHz wireless ad hoc network." Thesis, Stellenbosch : University of Stellenbosch, 2011. http://hdl.handle.net/10019.1/6510.

Full text

Abstract:

Thesis (MScEng (Electrical and Electronic Engineering))--University of Stellenbosch, 2011.<br>ENGLISH ABSTRACT: An investigation is made to ﬁnd a suitable routing protocol for a millimeter wave ad hoc wireless network. It is discovered that a hierarchical routing protocol is ideal for a high node density. Due to the high bandwidth that is possibly available, with millimeter wave transmission, packets are used to keep links between nodes active and to control data packet congestion. Cluster leaders are elected and use token packets to provide nodes with more queued messages with more trans

APA, Harvard, Vancouver, ISO, and other styles

12

Suryasaputra, Robert, and rsuryasaputra@gmail com. "Congestion Removal in the Next Generation Internet." RMIT University. Electrical and Computer Engineering, 2007. http://adt.lib.rmit.edu.au/adt/public/adt-VIT20080521.114723.

Full text

Abstract:

The ongoing development of new and demanding Internet applications requires the Internet to deliver better service levels that are significantly better than the best effort service that the Internet currently provides and was built for. These improved service levels include guaranteed delays, jitter and bandwidth. Through extensive research into Quality of Service and Differentiated Service (DiffServ) it has become possible to provide guaranteed services, however this turns out to be inadequate without the application of Traffic Engineering methodologies and principles. Traffic Engineering is

APA, Harvard, Vancouver, ISO, and other styles

13

So, Keith Kam-Ho Computer Science &amp Engineering Faculty of Engineering UNSW. "Lexicographic path searches for FPGA routing." Publisher:University of New South Wales. Computer Science & Engineering, 2008. http://handle.unsw.edu.au/1959.4/41295.

Full text

Abstract:

This dissertation reports on studies of the application of lexicographic graph searches to solve problems in FPGA detailed routing. Our contributions include the derivation of iteration limits for scalar implementations of negotiation congestion for standard floating point types and the identification of pathological cases for path choice. In the study of the routability-driven detailed FPGA routing problem, we show universal detailed routability is NP-complete based on a related proof by Lee and Wong. We describe the design of a lexicographic composition operator of totally-ordered monoids as

APA, Harvard, Vancouver, ISO, and other styles

14

Chouikha, Wahida. "Congestion control using dynamic routing and flow control in store-and-forward computer networks." Thesis, University of Ottawa (Canada), 1991. http://hdl.handle.net/10393/7766.

Full text

Abstract:

In this thesis, the problem of congestion control in computer communication networks is studied. The method employed consists of a combination of a dynamic routing policy that minimizes the delay, and buffer management schemes to control the flow of data. These schemes include (1) Complete Sharing, (2) Square Root Sharing, and (3) Sharing with Minimum Allocation. A dynamic model for a computer queueing network with finite buffer size, stochastic input and random channel errors, is used. Simulations using linear programming have been carried out on a simple 3-node network, under balanced and un

APA, Harvard, Vancouver, ISO, and other styles

15

THELAPURATH, SHRINATH. "DESIGN OF HEURISTICS FOR CONGESTION CONTROL IN 3-DIMENSIONAL ROUTING FOR MULTI-CHIP MODULES." University of Cincinnati / OhioLINK, 2001. http://rave.ohiolink.edu/etdc/view?acc_num=ucin981478715.

Full text

APA, Harvard, Vancouver, ISO, and other styles

16

Wang, Kongxun. "Performance optimization with integrated consideration of routing, flow control, and congestion control in packet-switched networks." Diss., Georgia Institute of Technology, 1991. http://hdl.handle.net/1853/8305.

Full text

APA, Harvard, Vancouver, ISO, and other styles

17

Mansoor, Ali K. P. "Application of multipath routing for congestion control, load balancing and QoS provisioning in mobile ad hoc networks." Thesis, Glasgow Caledonian University, 2017. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.726789.

Full text

APA, Harvard, Vancouver, ISO, and other styles

18

Özbay, Kaan. "A framework for dynamic traffic diversion during non-recurrent congestion: models and algorithms." Diss., Virginia Tech, 1996. http://hdl.handle.net/10919/39210.

Full text

Abstract:

Real-time control of traffic diversion during non-recurrent congestion continues to be a challenging topic. Especially, with the advent of Intelligent Transportation Systems (ITS), the need for models and algorithms that will control the diversion in real-time, responding to the current traffic conditions has become evident. Several researchers have tried to solve this on-line control problem by adopting different approaches such as, expert systems, feedback control, and mathematical programming. In order to ensure the effectiveness of real-time traffic diversion, an implementation framework

APA, Harvard, Vancouver, ISO, and other styles

19

Marinis, Artelaris Spyridon. "Performance evaluation of routing protocols for Wireless Mesh Networks." Thesis, Linnéuniversitetet, Institutionen för datavetenskap (DV), 2016. http://urn.kb.se/resolve?urn=urn:nbn:se:lnu:diva-49745.

Full text

Abstract:

Wireless Mesh Networks provide an organisation or a community with the means to extend or create a network independent of infrastructure. However, the network’s dynamic topology along with the fact that devices in the network might be mobile and move randomly, brings tolight various kind of problems on the network, with the most common being the routing. In this report, the problem of routing is examined in terms of throughput, routing overhead, end-to-end delay and packet delivery ratio on two chosen algorithms, namely the Dynamic MANET On-demand (DYMO) and the Better Approach To Mobile Adhoc

APA, Harvard, Vancouver, ISO, and other styles

20

Gliksberg, John. "New routing algorithms for heterogeneous exaflopic supercomputers." Electronic Thesis or Diss., université Paris-Saclay, 2022. http://www.theses.fr/2022UPASG068.

Full text

Abstract:

La construction de supercalculateurs performants nécessite d'optimiser les communications, et leur échelle exaflopique amène un risque inévitable de pannes relativement fréquentes.Pour un cluster avec un réseau et des équipements donnés, on améliore les performances en s'assurant que l'on sélectionne une bonne route pour chaque message tout en minimisant les conflits d'accès aux resources entre messages.Cette thèse se concentre sur la famille des réseaux fat-trees, pour laquelle nous donnons quelques grandes caractéristiques afin de mieux prendre en compte une classe réaliste de cette topologi

APA, Harvard, Vancouver, ISO, and other styles

21

Soua, Ahmed. "Vehicular ad hoc networks : dissemination, data collection and routing : models and algorithms." Phd thesis, Institut National des Télécommunications, 2013. http://tel.archives-ouvertes.fr/tel-00919774.

Full text

Abstract:

Each day, Humanity loses thousands of persons on roads when they were traveling to work, to study or even to distract. The financial cost of these injuries is also terrifying: Some statistics evaluate the financial cost of vehicle accidents at 160 billion Euro in Europe each year. These alarming figures have driven researchers, automotive companies and public governments to improve the safety of our transportation systems and communication technologies aiming at offering safer roads and smooth driving to human beings. In this context, Vehicular Adhoc Networks, where vehicles are able to commun

APA, Harvard, Vancouver, ISO, and other styles

22

Song, Lin. "Multipath approaches to avoiding TCP Incast." Diss., University of Iowa, 2017. https://ir.uiowa.edu/etd/6859.

Full text

Abstract:

TCP was conceived to ensure reliable node-to-node communication in moderate-bandwidth, moderate-latency, WANs. As it is now a mature Internet standard, it is the default connection-oriented protocol in networks built from commodity components, including Internet data centers. Data centers, however, rely on high-bandwidth, low-latency networks for communication. Moreover, their communication patterns, especially those generated by distributed applications such as MapReduce, often take the form of synchronous multi-node to node bursts. Under the right conditions, the network switch buffer overfl

APA, Harvard, Vancouver, ISO, and other styles

23

Sun, Yan, Martin Hrusovsky, Chen Zhang, and Maoxiang Lang. "A Time-Dependent Fuzzy Programming Approach for the Green Multimodal Routing Problem with Rail Service Capacity Uncertainty and Road Traffic Congestion." Hindawi Limited, 2018. http://dx.doi.org/10.1155/2018/8645793.

Full text

Abstract:

This study explores an operational-level container routing problem in the road-rail multimodal service network. In response to the demand for an environmentally friendly transportation, we extend the problem into a green version by using both emission charging method and bi-objective optimization to optimize the CO2 emissions in the routing. Two uncertain factors, including capacity uncertainty of rail services and travel time uncertainty of road services, are formulated in order to improve the reliability of the routes. By using the triangular fuzzy numbers and time-dependent travel time

APA, Harvard, Vancouver, ISO, and other styles

24

Soua, Ahmed. "Vehicular ad hoc networks : dissemination, data collection and routing : models and algorithms." Electronic Thesis or Diss., Evry, Institut national des télécommunications, 2013. http://www.theses.fr/2013TELE0028.

Full text

Abstract:

Chaque jour, l'humanité perd des milliers de personnes sur les routes pendant qu'ils se rendaient à travailler, à étudier ou même à se distraire. Ce nombre alarmant s'accumule avec le coût financier terrifiant de ces décès: Certaines statistiques évaluent le coût à 160 milliards d'euros par an en Europe. Dans ce contexte, les réseaux véhiculaires (VANETs) émergent comme une technologie sans fil prometteuse capable d'améliorer la vision des conducteurs et ainsi offrir un horizon télématique plus vaste. Les applications de sécurité routière exigent que le message d'alerte soit propagé de proche

APA, Harvard, Vancouver, ISO, and other styles

25

Chen, Kai. "Mitigating Congestion by Integrating Time Forecasting and Realtime Information Aggregation in Cellular Networks." FIU Digital Commons, 2011. http://digitalcommons.fiu.edu/etd/412.

Full text

Abstract:

An iterative travel time forecasting scheme, named the Advanced Multilane Prediction based Real-time Fastest Path (AMPRFP) algorithm, is presented in this dissertation. This scheme is derived from the conventional kernel estimator based prediction model by the association of real-time nonlinear impacts that caused by neighboring arcs’ traffic patterns with the historical traffic behaviors. The AMPRFP algorithm is evaluated by prediction of the travel time of congested arcs in the urban area of Jacksonville City. Experiment results illustrate that the proposed scheme is able to significantly re

APA, Harvard, Vancouver, ISO, and other styles

26

Pandey, Manoj Kumar. "A Hop-by-Hop Architecture for Multicast Transport in Ad Hoc Wireless Networks." Diss., CLICK HERE for online access, 2009. http://contentdm.lib.byu.edu/ETD/image/etd3119.pdf.

Full text

APA, Harvard, Vancouver, ISO, and other styles

27

Nesveda, Marek. "Efektivní využití konvergované sítě." Master's thesis, Vysoké učení technické v Brně. Fakulta elektrotechniky a komunikačních technologií, 2011. http://www.nusl.cz/ntk/nusl-218847.

Full text

Abstract:

The Master´s thesis deals with the field of converged networks and their effective utilization, focusing specifically on telematic networks. For modelling of a specific application, the field of vehicle telematics has been chosen. The thesis consists of two series of simulations performed in Opnet Modeler network simulator. The first theoretic part gave an overview of protocols used in converged networks, with a more detailed description of routing protocols. The attention also centred on the mechanisms for assuring the quality of service in IP. The subsequent practical part consisted in creat

APA, Harvard, Vancouver, ISO, and other styles

28

Goudarzi, Forough. "Non-cooperative beaconing control in vehicular ad hoc networks." Thesis, Brunel University, 2017. http://bura.brunel.ac.uk/handle/2438/15608.

Full text

Abstract:

The performance of many protocols and applications of Vehicular Ad hoc Networks (VANETs), depends on vehicles obtaining enough fresh information on the status of their neighbouring vehicles. This should be fulfilled by exchanging Basic Safety Messages (BSMs) also called beacons using a shared channel. In dense vehicular conditions, many of the beacons are lost due to channel congestion. Therefore, in such conditions, it is necessary to control channel load at a level that maximizes BSM dissemination. To address the problem, in this thesis algorithms for adaptation of beaconing to control chann

APA, Harvard, Vancouver, ISO, and other styles

29

Tall, Hamadoun. "Load balancing in multichannel data collection wireless sensor networks." Thesis, Université Clermont Auvergne‎ (2017-2020), 2018. http://www.theses.fr/2018CLFAC006/document.

Full text

Abstract:

Les Réseaux de Capteurs Sans Fil (RCSF) sont de plus en plus exploités par des applications diverses grâce à leur facilité de déploiement et d’auto-configuration. Les applications de collecte de données qui utilisent les RCSF ont souvent un profil convergecast : l’ensemble des données récoltées par tous les capteurs du réseau sont acheminées vers un puits de collecte, grâce à une communication multi-saut. Pendant l’acheminement des données des nœuds de collecte vers le puits, des goulots d’étranglement sont fréquemment observés, principalement au voisinage du puits. Cela est du à la congestion

APA, Harvard, Vancouver, ISO, and other styles

30

Inanloo, Bahareh. "A Multi-Criteria GIS-Based Route Selection Tool for Hazardous Material Transport: Consideration of Environmental Consequence, Traffic Congestions and Costs." FIU Digital Commons, 2015. http://digitalcommons.fiu.edu/etd/2262.

Full text

Abstract:

Hazardous materials are substances that, if not regulated, can pose a threat to human populations and their environmental health, safety or property when transported in commerce. About 1.5 million tons of hazardous material shipments are transported by truck in the US annually, with a steady increase of approximately 5% per year. The objective of this study was to develop a routing tool for hazardous material transport in order to facilitate reduced environmental impacts and less transportation difficulties, yet would also find paths that were still compelling for the shipping carriers as a ma

APA, Harvard, Vancouver, ISO, and other styles

31

Gang, Yi. "Conception d'un micro-réseau intégré NOC tolérant les fautes multiples statiques et dynamiques." Thesis, Université Grenoble Alpes (ComUE), 2015. http://www.theses.fr/2015GREAT103/document.

Full text

Abstract:

Les progrès dans les technologies à base de semi-conducteurs et la demande croissante de puissance de calcul poussent vers une intégration dans une même puce de plus en plus de processeurs intégrés. Par conséquent les réseaux sur puce remplacent progressivement les bus de communication, ceux-ci offrant plus de débit et permettant une mise à l'échelle simplifiée. Parallèlement, la réduction de la finesse de gravure entraine une augmentation de la sensibilité des circuits au processus de fabrication et à son environnement d'utilisation. Les défauts de fabrication et le taux de défaillances penda

APA, Harvard, Vancouver, ISO, and other styles

32

Namboothiri, Rajeev. "Planning Container Drayage Operations at Congested Seaports." Diss., Georgia Institute of Technology, 2006. http://hdl.handle.net/1853/11482.

Full text

Abstract:

This dissertation considers daily operations management for a fleet of trucks providing container pickup and delivery service to a port. Truck congestion at access points for ports may lead to serious inefficiencies in drayage operations, and the resultant cost impact to the intermodal supply chain can be significant. Recognizing that port congestion is likely to continue to be a major problem for drayage operations given the growing volume of international containerized trade, this research seeks to develop optimization approaches for maximizing the productivity of drayage firms operating at

APA, Harvard, Vancouver, ISO, and other styles

33

Gungor, Vehbi Cagri. "Real-Time and Reliable Communication in Wireless Sensor and Actor Networks." Diss., Georgia Institute of Technology, 2007. http://hdl.handle.net/1853/16366.

Full text

Abstract:

Wireless Sensor and Actor Networks (WSANs) are composed of heterogeneous nodes referred to as sensors and actors. Sensors are low-cost, low-power, multi-functional devices that communicate untethered in short distances. Actors collect and process sensor data and perform appropriate actions on the environment. Hence, actors are resource-rich devices equipped with higher processing and transmission capabilities, and longer battery life. In WSANs, the collaborative operation of the sensors enables the distributed sensing of a physical phenomenon. After sensors detect an event in the deployment fi

APA, Harvard, Vancouver, ISO, and other styles

34

Gorgues, Alonso Miguel. "Improving Network-on-Chip Performance in Multi-Core Systems." Doctoral thesis, Universitat Politècnica de València, 2018. http://hdl.handle.net/10251/107336.

Full text

Abstract:

La red en el chip (NoC) se han convertido en el elemento clave para la comunicación eficiente entre los núcleos dentro de los chip multiprocesador (CMP). Tanto el uso de aplicaciones paralelas en los CMPs como el incremento de la cantidad de memoria necesitada por las aplicaciones, ha impulsado que la red de comunicación gane una mayor importancia. La NoC es la encargada de transportar toda la información requerida por los núcleos. Además, el incremento en el número de núcleos en los CMPs impulsa las NoC a ser diseñadas de forma escalable, pero al mismo tiempo sin que esto afecte a las presta

APA, Harvard, Vancouver, ISO, and other styles

35

Hatchi, Roméo. "Analyse mathématique de modèles de trafic routier congestionné." Thesis, Paris 9, 2015. http://www.theses.fr/2015PA090048/document.

Full text

Abstract:

Cette thèse est dédiée à l'étude mathématique de quelques modèles de trafic routier congestionné. La notion essentielle est l'équilibre de Wardrop. Elle poursuit des travaux de Carlier et Santambrogio avec des coauteurs. Baillon et Carlier ont étudié le cas de grilles cartésiennes dans $\RR^2$ de plus en plus denses, dans le cadre de la théorie de $\Gamma$-convergence. Trouver l'équilibre de Wardrop revient à résoudre des problèmes de minimisation convexe. Dans le chapitre 2, nous regardons ce qui se passe dans le cas de réseaux généraux, de plus en plus denses, dans $\RR^d$. Des difficultés n

APA, Harvard, Vancouver, ISO, and other styles

36

Mnassri, Radhia. "Réseaux de Petri Lots Triangulaires pour la modélisation mésoscopique et l'étude de la congestion dans le trafic routier." Thesis, Aix-Marseille, 2015. http://www.theses.fr/2015AIXM4376.

Full text

Abstract:

L'usage excessif des routes peut entraîner de nombreux inconvénients dont la pollution, les accidents et la congestion. Une solution accessible à court terme consiste à mettre en œuvre des systèmes de gestion de trafic. Dans ce cadre, nous proposons un formalisme, appelé Réseaux de Petri Lots Triangulaire, qui permet la modélisation et la simulation du trafic routier au niveau mésoscopique comme un système à événements discrets. Le RdPLots Triangulaire permet ainsi de décrire les caractéristiques globales du trafic routier: flux, densité et vitesse à travers la proposition d'une relation flux-

APA, Harvard, Vancouver, ISO, and other styles

37

Nguyen, Thai Phu. "Conception et application d'un modèle de l'information routière et ses effets sur le trafic." Phd thesis, Université Paris-Est, 2010. http://tel.archives-ouvertes.fr/tel-00626631.

Full text

Abstract:

Les conditions de circulation sur un réseau routier subissent souvent de la congestion. Selon ses sources, la congestion routière peut être classée en deux catégories : la congestion récurrente déterminée par les lois de trafic et la congestion non-récurrente due aux incidents, accidents ou autres aléas sur la route. Grâce à l'avancement des technologies, notamment en informatique, communication et techniques de traitement des données, l'exploitant est devenu capable de détecter les perturbations, de mesurer les effets et même d'anticiper l'état du trafic afin de mieux adapter ses actions d'ex

APA, Harvard, Vancouver, ISO, and other styles

38

Mariotte, Guilhem. "Dynamic Modeling of Large-Scale Urban Transportation Systems." Thesis, Lyon, 2018. http://www.theses.fr/2018LYSET010/document.

Full text

Abstract:

La congestion en milieu urbain est un enjeu majeur que ce soit d’un point vue économique, social ou environnemental. À court et moyen terme, l’utilisation de la simulation dynamique du trafic routier peut permettre d’analyser et de guider des politiques d’optimisation des infrastructures existantes. Aujourd’hui, du fait de la complexité des systèmes de transport, les outils de modélisation classiques sont limités à des échelles géographiques peu étendues (de l’ordre du quartier). À grande échelle, le temps de calcul devient rapidement un facteur limitant tout comme le calibrage et la scénarisa

APA, Harvard, Vancouver, ISO, and other styles

39

Zhang, Ming-Yu. "Apports des systèmes d'information à l'exploitation des réseaux de voies rapides. Le cas du réseau d'Ile-de-France." Phd thesis, Ecole Nationale des Ponts et Chaussées, 1995. http://tel.archives-ouvertes.fr/tel-00529501.

Full text

Abstract:

La présente recherche pluridisciplinaire a pour objectif principal d'analyser et d'évaluer de nouvelles potentialités de l'amélioration du fonctionnement des réseaux de voies rapides (RVR) avec leur maillage progressif et en particulier avec le développement des systèmes d'information des usagers. Cette recherche s'appuie principalement sur le cas concret du RVR d'Ile-de-France, représentatif par sa complexité structurelle et par les problèmes rencontrés lors de son exploitation et notamment ceux liés à la mise en œuvre opérationnelle du système d'exploitation : SIRIUS. L'examen de l'approche

APA, Harvard, Vancouver, ISO, and other styles

40

Peng, Zhen-Yu, and 彭振宇. "A Parallel Routing Congestion Estimator." Thesis, 2013. http://ndltd.ncl.edu.tw/handle/34235073920312180213.

Full text

Abstract:

碩士<br>國立清華大學<br>資訊工程學系<br>101<br>Routability has become very challenging with designs scaling down. Recently, many placement tools adopt routing congestion estimators (RCEs) to guide their algorithms, and designers can adopt RCEs to judge whether their designs are routable in the early design stage. Thus, industry desires a fast and accurate RCE to reduce the design cost and speed up time-to-market. Typically, RCEs can be categorized into two types, the probability-based and the global-routing-based (GR-based) methods. Because GR-based RCEs are more accurate than probability-based RCEs in cong

APA, Harvard, Vancouver, ISO, and other styles

41

Lin, Shun-Hua, and 林順華. "Congestion-Driven Global Routing Based on Timing-Constrained Routing Flexibilities." Thesis, 2004. http://ndltd.ncl.edu.tw/handle/96067162656203833288.

Full text

Abstract:

碩士<br>中華大學<br>資訊工程學系碩士班<br>92<br>Because the semiconducting processing technology progresses, and system-on-a-chip design has became a workable design model. Today a chip can accommodate more than hundreds million of transistors. And all of the signals inside a chip must be transmitted by routing wire. Hence routing plays a key role in the chip’s world. Now the congestion of routing wire will generate harmful effect. Hence the problem must be solved during routing plan. And today chips have strict restriction of timing constraint. Thereby timing constraint and congestion must concur

APA, Harvard, Vancouver, ISO, and other styles

42

Haung, Zhi-Hao. "Congestion Aware Buffer Insertion with Re-routing." 2006. http://www.cetd.com.tw/ec/thesisdetail.aspx?etdun=U0016-1303200709294441.

Full text

APA, Harvard, Vancouver, ISO, and other styles

43

Ryu, Jung Ho. "Congestion control and routing over challenged networks." Thesis, 2011. http://hdl.handle.net/2152/ETD-UT-2011-12-4620.

Full text

Abstract:

This dissertation is a study on the design and analysis of novel, optimal routing and rate control algorithms in wireless, mobile communication networks. Congestion control and routing algorithms upto now have been designed and optimized for wired or wireless mesh networks. In those networks, optimal algorithms (optimal in the sense that either the throughput is maximized or delay is minimized, or the network operation cost is minimized) can be engineered based on the classic time scale decomposition assumption that the dynamics of the network are either fast enough so that these algorithms

APA, Harvard, Vancouver, ISO, and other styles

44

Haung, Zhi-Hao, and 黃致豪. "Congestion Aware Buffer Insertion with Re-routing." Thesis, 2006. http://ndltd.ncl.edu.tw/handle/98312285749938032099.

Full text

Abstract:

碩士<br>國立清華大學<br>資訊工程學系<br>94<br>With the rapidly progress of VLSI technology, the complexity of a chip critically increases and the enormously growth of wires and gates, it becomes difficult to place buffers and route wires to meet timing in a limited space. In addition, it becomes necessary to consider congestion management intelligently while we insert buffers and route wires automatically. In this thesis, our contribution is to propose a new algorithm called CABIR to reduce the routing congestion cost by re-routing the initial Steiner tree and to generate some buffer candidate locations wit

APA, Harvard, Vancouver, ISO, and other styles

45

KUMAR, S. P. AJITH. "ROUTING AND CONGESTION CONTROL IN OPPORTUNISTIC NETWORKS." Thesis, 2016. http://dspace.dtu.ac.in:8080/jspui/handle/repository/14606.

Full text

Abstract:

ABSTRACT Opportunistic networks are one of the most interesting evolutions of MANETs. Mobile nodes are enabled to communicate with each other in opportunistic networks even if there is no route to connect them. Also, nodes are not having knowledge about the network topology, which (instead) is necessary in MANET routing protocols. In this network routes are building dynamically, whenever messages are en route between the sender and the destination(s), and any potential node can be opportunistically used as the next hop, provided it is bringing the message nearer to the destination. Th

APA, Harvard, Vancouver, ISO, and other styles

46

Mohammadi, Farhangi Ali. "Congestion Driven Clock Tree Routing with Via Minimization." Thesis, 2011. http://spectrum.library.concordia.ca/7734/1/Farhangi_MASc_F2011.pdf.

Full text

Abstract:

Physical routability constraints such as legal location checking and excessive number of vias are usually ignored in most of the clock tree algorithms. These Constraints could make an abstract clock tree difficult to route in practice and cause important manufacturability and reliability challenges. Therefore the final clock tree layout specifications can be seriously deviated from the expected ones. Vias have major impact on circuit reliability and manufacturing yield. The variability in via resistance is becoming an increasing concern in nanotechnologies. In this thesis a practical frame wor

APA, Harvard, Vancouver, ISO, and other styles

47

Chen, Chun Hung, and 陳俊宏. "Unified Routing and Congestion control for Golbal Fairness." Thesis, 2008. http://ndltd.ncl.edu.tw/handle/03481738889122061779.

Full text

Abstract:

碩士<br>國立交通大學<br>電信工程系所<br>96<br>In the thesis, we consider a user who has multiple choices to route his data traffic into network. From user’s perspective, they always choose the path with highest bandwidth. However, if all people take the same strategy for routing their traffic, all the paths may be saturated and the concept of available bandwidth is no longer applied. To solve the problem, we must consider that choose the path that will allocate highest bandwidth if the traffic is routed over the path. So, the request of knowing the bandwidth to be allocated is necessary. Taking this kind of

APA, Harvard, Vancouver, ISO, and other styles

48

Huang, Ming-Ching, and 黃明欽. "Timing-Constrained Congestion-Driven X-Based Global Routing." Thesis, 2007. http://ndltd.ncl.edu.tw/handle/39164418634485164730.

Full text

Abstract:

碩士<br>中華大學<br>資訊工程學系(所)<br>95<br>As the era of DSM technology is coming, interconnect delay has become a quite important factor in the high performance IC design. In other words, a routing technique which can reduce the wirelength in a design is essential to such tendency. Therefore we proposed an X-based routing technique to achieve such concept in this paper. Because the difference in wirelength between X-based and Manhattan routing architecture is that X-based routing architecture allow the +45o and -45o wiring to reduce the interconnect delay. Nowadays the congestion of routing wire is

APA, Harvard, Vancouver, ISO, and other styles

49

Wang, Yu-hsun, and 王煜勛. "Analytical-Driven Placement by Reducing Peak Routing Congestion." Thesis, 2015. http://ndltd.ncl.edu.tw/handle/94725731713840208747.

Full text

Abstract:

碩士<br>國立中央大學<br>電機工程學系<br>103<br>As the VLSI technology advances, the design complexity has increased rapidly and induces many problems in physical design. Placement, an important stage in electronic design automation, has to consider many issues to determine the placement of standard cells. During cell placement, the global placement results will greatly affect the results of the entire placement stage. Previous wirelength-driven placement may cause high routing congestion or produce an unroutable placement. Therefore, most of the global placement focus on improving the routability. The quali

APA, Harvard, Vancouver, ISO, and other styles

50

Wang, Chin-Hui, and 王欽輝. "An Effective Congestion- and Crosstalk-Driven Routing System." Thesis, 2004. http://ndltd.ncl.edu.tw/handle/3tu24s.

Full text

Abstract:

碩士<br>中原大學<br>資訊工程研究所<br>92<br>As fabrication technology entered deep sub-micron (DSM) era, the complexity of routing problem is increasing dramatically along with the growth on demand of net density. Since routing problem incur the phenomenon of chip performance degradation and chip function failure, to consider routing problem for reducing their effect during the process of routing has become a very important topic. In this thesis, we propose a new algorithm that takes detailed routing into consideration at global routing stage to minimize both wire congestion and crosstalk. Our algorithm ca

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!