Tesis sobre el tema "Traffic Routing"
Crea una cita precisa en los estilos APA, MLA, Chicago, Harvard y otros
Consulte los 50 mejores tesis para su investigación sobre el tema "Traffic Routing".
Junto a cada fuente en la lista de referencias hay un botón "Agregar a la bibliografía". Pulsa este botón, y generaremos automáticamente la referencia bibliográfica para la obra elegida en el estilo de cita que necesites: APA, MLA, Harvard, Vancouver, Chicago, etc.
También puede descargar el texto completo de la publicación académica en formato pdf y leer en línea su resumen siempre que esté disponible en los metadatos.
Explore tesis sobre una amplia variedad de disciplinas y organice su bibliografía correctamente.
Yang, Xinan. "Top-percentile traffic routing problem". Thesis, University of Edinburgh, 2012. http://hdl.handle.net/1842/5883.
Texto completoMazandu, Gaston Kuzamunu. "Traffic Engineering using Multipath Routing Approaches". Thesis, Link to the online version, 2007. http://hdl.handle.net/10019/679.
Texto completoGuedrez, Rabah. "Enabling traffic engineering over segment routing". Thesis, Ecole nationale supérieure Mines-Télécom Atlantique Bretagne Pays de la Loire, 2018. http://www.theses.fr/2018IMTA0116/document.
Texto completoMost major operators use MPLS technology to manage their network via signalling and label distribution protocols. However, these protocols are complex to deploy, maintain and troubleshooting is often very difficult. The IETF has initiated the standardization of a segment routing architecture based on a simple control plane, lightweight, easyto-manage and instantiated on MPLS or IPv6. This architecture is based on the concept of source routing, in which the packet header carries the indications of the path to follow to reach its destination. Suitable for simple use cases and natively resistant to failure, more complex use cases require the resolution of technological issues for which we offer several solutions.In this thesis carried out within Orange Labs, we were interested in the instantiation of the Segment Routing architecture on the MPLS transfer plan and more particularly in traffic engineering, particularly with resource reservation. We have proposed solutions to the problems related to the hardware limitation of current routers that do not allow the expression of all constrained paths. This work is divided into two parts : (i) the proposal of algorithms for computing and encoding segment routing paths in order to bypass hardware limitations. (ii) the definition of architectural requirements and the construction of a functional proof of concept. Finally, this thesis proposes new research issues to consolidate traffic engineering tools for segment routing
Lindblad, Andreas. "Routing of traffic in an IP-network using combined routing patterns". Thesis, Linköpings universitet, Optimeringslära, 2015. http://urn.kb.se/resolve?urn=urn:nbn:se:liu:diva-119973.
Texto completoHe, Jenny Jing. "Optical flow routing : a routing and switching paradigm for the core optical networks". Thesis, University of Essex, 2002. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.248654.
Texto completoGellman, Michael. "Quality of service routing for real-time traffic". Thesis, Imperial College London, 2007. http://hdl.handle.net/10044/1/12026.
Texto completoTillotson, Peter J. "Multi-agent learning for TCP/IP traffic routing". Thesis, University of Liverpool, 2002. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.399051.
Texto completoSengupta, Sudipta 1974. "Efficient and robust routing of highly variable traffic". Thesis, Massachusetts Institute of Technology, 2005. http://hdl.handle.net/1721.1/35532.
Texto completoIncludes bibliographical references (p. 316-324).
Many emerging applications for the Internet are characterized by highly variable traffic behavior over time that is difficult to predict. Classical approaches to network design rely on a model in which a single traffic matrix is estimated. When actual traffic does not conform to such assumptions, desired bandwidth guarantees cannot be provided to the carried traffic. Currently, Internet Service Providers (ISPs) use gross capacity over-provisioning and manual routing adaptation to avoid network congestion caused by unpredictable traffic. These lead to increased network equipment and operational costs. Development of routing infrastructures that optimize network resources while accommodating extreme traffic unpredictability in a robust and efficient manner will be one of the defining themes in the next phase of expansion of the Internet. This thesis proposes two-phase routing as a capacity efficient and robust strategy for handling highly variable traffic. The scheme allows preconfiguration of the network such that all traffic patterns permissible within the network's natural ingress-egress capacity constraints can be routed with bandwidth guarantees without requiring detection of traffic changes in real-time or reconfiguring the network in response to it.
(cont.) The scheme routes traffic in two phases -- traffic entering the network is sent from the source to a set of intermediate nodes in predetermined split ratios that depend on the intermediate nodes, and then from the intermediate nodes to the final destination. The scheme has the desirable properties of supporting static optical layer provisioning in IP-over-Optical networks and indirection in specialized service overlay models unlike previous approaches -- like direct source-destination path routing - for handling variable traffic. This thesis represents the first comprehensive study, problem formulation, and algorithm design for many aspects of two-phase routing. Our contributions can be grouped into three broad parts. First, we consider the problems of minimum cost network design and maximum throughput network routing for the scheme. We give a simple solution for minimum cost network design. For maximum throughput network routing. we design linear program.ling based and combinatorial algorithms. We show how the algorithms can handle a total cost constraint for maximum throughput two-phase routing. This can be used to solve the link capacitate version of minimum cost two-phase routing.
(cont.) We establish theoretical bounds on the resource requirements of two-phase routing under throughput and cost models with respect to the optimal scheme that is allowed to make the routing dynamically dependent on the current traffic matrix. We also generalize the traffic split ratios to depend not only on the intermediate nodes but also on source and destination of traffic and solve the corresponding optimization problems. Second, we consider making two-phase routing resilient to network failures. Two-phase routing in IP-over-Optical networks can be protected against router node failures through redistribution of traffic split ratio for the failed router node to other intermediate nodes. We propose two different schemes for provisioning the optical layer to handle router node failures. We develop linear programming formulations for both schemes and a fast combinatorial algorithm for the second scheme so as to maximize network throughput. Two-phase routing can be made resilient against link failures by protecting the first and second phase paths using pre-provisioned restoration mechanisms. We consider three such restoration mechanisms - local (link/span) restoration, K-route path restoration, and shared backup path restoration.
(cont.) We provide linear programming formulations and combinatorial algorithms for maximum throughput two-phase routing with local restoration and K-route path restoration. We show that the problem of maximum throughput two-phase routing with shared backup path restoration is JVP-hard. Assuming an approximation oracle for a certain disjoint paths problem (which we also show to be AP-hard), we design a combinatorial algorithm with provable guarantees. Third, we consider the application of two-phase routing to multi-hop Wireless Mesh Networks (WMNs). These networks have recently been of much research interest due to their lowered need for wired infrastructure support and due to envisaged new applications like community wireless networks. We extend our optimization framework for maximum throughput two-phase routing in wired networks to handle routing and scheduling constraints that are peculiar to WMNs and arise from the requirement to handle radio transmit/receive diversity and the phenomenon of wireless link interference. We evaluate various aspects of two-phase routing on actual ISP topologies using the developed algorithms. For the WMN application, we use randomly generated WMN topologies for the evaluations.
by Sudipta Sengupta.
Ph.D.
Tajtehranifard, Hasti. "Incident duration modelling and system optimal traffic re-routing". Thesis, Queensland University of Technology, 2017. https://eprints.qut.edu.au/110525/1/Hasti_Tajtehranifard_Thesis.pdf.
Texto completoGao, Ruomei. "Interdomain Traffic Engineering for Multi-homed Networks". Diss., Georgia Institute of Technology, 2007. http://hdl.handle.net/1853/19732.
Texto completoSheu, Hsin-Teng. "A coordinated decentralized flow and routing control algorithm for an automated highway system /". The Ohio State University, 1987. http://rave.ohiolink.edu/etdc/view?acc_num=osu148758564557836.
Texto completoTeixeira, António Edgar Carvalho. "Simple and stable dynamic traffic engineering for provider scale ethernet". Master's thesis, Faculdade de Ciências e Tecnologia, 2010. http://hdl.handle.net/10362/4998.
Texto completoThe high speeds and decreasing costs of Ethernet solutions has motivated providers’ interest in using Ethernet as the link layer technology in their backbone and aggregation networks. Provider scale Ethernet offers further advantages, providing not only an easy to manage solution for multicast traffic, but also transparent interconnection between clients’ LANs. These Ethernet deployments face altogether different design issues, requiring support for a significantly higher number of hosts. This support relies on hierarquization, separating address and virtual network spaces of customers and providers. In addition, large scale Ethernet solutions need to grant forwarding optimality. This can be achieved using traffic engineering approaches. Traffic engineering defines the set of engineering methods and techniques used to optimize the flow of network traffic. Static traffic engineering approaches enjoy widespread use in provider networks, but their performance is greatly penalized by sudden load variations. On the other hand, dynamic traffic engineering is tailored to adapt to load changes. However, providers are skeptical to adopt dynamic approaches as these induce problems such as routing instability, and as a result, network performance decreases. This dissertation presents a Simple and Stable Dynamic Traffic Engineering framework (SSD-TE), which addresses these concerns in a provider scale Ethernet scenario. The validation results show that SSD-TE achieves better or equal performance to static traffic engineering approaches, whilst remaining both stable and responsive to load variations.
Guo, Yu. "Multi-plane routing for fast failure recovery and traffic engineering". Thesis, University of Surrey, 2011. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.538032.
Texto completoAl-Qassas, Raad S. "On the performance of traffic-aware reactive routing in MANETs". Thesis, University of Glasgow, 2007. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.443330.
Texto completoStaats, Richard C. (Richard Charles). "Integration of predictive routing information with dynamic traffic signal control". Thesis, Massachusetts Institute of Technology, 1994. http://hdl.handle.net/1721.1/35433.
Texto completoIncludes bibliographical references (leaves 306-310).
by Richard C. Staats.
Ph.D.
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.
Texto completoCataloged from PDF version of thesis.
Includes bibliographical references (p. 191-201).
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 networks dealing with travel time uncertainty and congestion. First, a stochastic route planning algorithm is presented that finds the best path for a group of multiple agents. Our algorithm provides mobile agents with optimized routes to achieve time-critical goals. Optimal selections of agent and visit locations are determined to guarantee the highest probability of task achievement while dealing with uncertainty of travel time. Furthermore, we present an efficient approximation algorithm for stochastic route planning based on pre-computed data for stochastic networks. Second, we develop a distributed congestion-aware multi-agent path planning algorithm that achieves the social optimum, minimizing aggregate travel time of all the agents in the system. As the number of agents grows, congestion created by agents' path choices should be considered. Using a data-driven congestion model that describes the travel time as a function of the number of agents on a road segment, we develop a practical method for determining the optimal paths for all the agents in the system to achieve the social optimum. Our algorithm uses localized information and computes the paths in a distributed manner. We implement the algorithm in multi-core computers and demonstrate that the algorithm has a good scalability. Third, a path planning system using traffic sensor data is then implemented. We predict the traffic speed and flow for each location from a large set of sensor data collected from roving taxis and inductive loop detectors. Our system uses a data-driven traffic model that captures important traffic patterns and conditions using the two sources of data. We evaluate the system using a rich set of GPS traces from 16,000 taxis in Singapore and show that the city-scale congestion can be mitigated by planning drivers' routes, while incorporating the congestion effects generated by their route choices.
by Sejoon Lim.
Ph.D.
Day, Jeffrey. "Management of railroad impedances for shortest path-based routing". Diss., Georgia Institute of Technology, 2002. http://hdl.handle.net/1853/25483.
Texto completoPrete, Joseph Michael. "Aircraft routing in the presence of hazardous weather". Online access, 2007. http://hdl.handle.net/1951/44608.
Texto completoThis official electronic copy is part of the DSpace Stony Brook theses & dissertations collection maintained by the University Libraries, Special Collections & University Archives on behalf of the Stony Brook Graduate School. It is stored in the SUNY Digital Institutional Repository and can be accessed through the website. Presented to the Stony Brook University Graduate School in partial fulfillment of the requirements for the degree of Doctor of Philosophy in Computer Science; as recommended and accepted by the candidate's degree sponsor, the Dept. of Computer Science. Includes bibliographical references (p. 92-99).
Barros, Joyce Moniz Martim. "Models and methods for Traffic Engineering problems with single-path routing". Doctoral thesis, Universite Libre de Bruxelles, 2016. http://hdl.handle.net/2013/ULB-DIPOT:oai:dipot.ulb.ac.be:2013/238366.
Texto completoDoctorat en Sciences
info:eu-repo/semantics/nonPublished
Darshana, Dipika. "DELAY SENSITIVE ROUTING FOR REAL TIME TRAFFIC OVER AD-HOC NETWORKS". Master's thesis, University of Central Florida, 2008. http://digital.library.ucf.edu/cdm/ref/collection/ETD/id/2802.
Texto completoM.S.
School of Electrical Engineering and Computer Science
Engineering and Computer Science
Computer Engineering MSCpE
Gao, Song 1976. "Optimal adaptive routing and traffic assignment in stochastic time-dependent networks". Thesis, Massachusetts Institute of Technology, 2005. http://hdl.handle.net/1721.1/30188.
Texto completoIncludes bibliographical references (p. 233-237).
A stochastic time-dependent (STD) network is defined by treating all link travel times at all time periods as random variables, with possible time-wise and link-wise stochastic dependency. A routing policy is a decision rule which specifies what node to take next out of the current node based on the current time and online information. A formal framework is established for optimal routing policy problems in STD networks, including generic optimality conditions, and a comprehensive taxonomy with insights into variants of the problem. A variant pertinent to road traffic networks is studied in detail, where a discrete joint distribution of link travel times is used to accommodate the most general stochastic dependency among link travel times, and the access to perfect online information about link travel times is assumed. Both exact and approximation solution algorithms are designed and tested. The criteria of optimality are then extended to reliability measures, such as travel time variance and expected early/late schedule delays. The first routing-policy-based stochastic dynamic traffic assignment (DTA) model is established. A general framework is provided and the equilibrium problem is formulated as a fixed point problem with three components: the optimal routing policy generation module, the routing policy choice model and the policy-based dynamic network loader. An MSA (method of successive averages) heuristic is designed. Computational tests are carried out in a. hypothetical network, where random incidents are the source of stochasticity. The heuristic converges satisfactorily in the test network under the proposed test settings. The' adaptiveness in the routing policy based model leads to travel time savings at equilibrium.
(cont.) As a byproduct, travel time reliability is also enhanced. The value of online information is an increasing function of the incident probability. Travel time savings are high when market penetrations are low. However, the function of travel time saving against market penetration is not monotonic. This suggests that in a travelers' information system or route guidance system, the information penetration needs to be chosen carefully to maximize benefits.
by Song Gao.
Ph.D.
Cheng, Yufei y Egemen K. Çetinkaya. "Performance Comparison of Routing Protocols for Transactional Traffic over Aeronautical Networks". International Foundation for Telemetering, 2011. http://hdl.handle.net/10150/595682.
Texto completoEmerging airborne telemetry networks present several challenges such that traditional MANET protocols do not perform well. On the other hand, application traffic characteristics are expected to be identical in this domain. Transactional application traffic performance has been studied for traditional MANETs, however this type of traffic has not been studied for domain-specific MANET scenarios. We present the simulation model for transactional traffic used in highly-mobile environments. Using the ns-3 simulator, we examine the performance of a domain-specific routing protocol, AeroRP, to route transactional traffic over the aeronautical environment and present performance comparison with two reactive (AODV and DSR) and two proactive (DSDV and OLSR) MANET routing protocols.
Yee, George Carleton University Dissertation Information and Systems Science. "Optimal routing in dimensioning communication networks with time-varying traffic demand". Ottawa, 1985.
Buscar texto completoZhou, Ji Zhe. "Modeling and dynamic routing for traffic flow through multi-agent system". Thesis, University of Macau, 2018. http://umaclib3.umac.mo/record=b3950602.
Texto completoPai, Arun S. "Development of deterministic collision-avoidance algorithms for routing automated guided vehicles /". Online version of thesis, 2008. http://hdl.handle.net/1850/7289.
Texto completoSørensen, Anette Ostbø. "An Investigation Into Braess' Paradox and Selfish Routing in Traffic Flow : Solving the non-linear traffic program with linear cost functions on traffic networks". Thesis, Norges teknisk-naturvitenskapelige universitet, Institutt for matematiske fag, 2014. http://urn.kb.se/resolve?urn=urn:nbn:no:ntnu:diva-25619.
Texto completoTekdogan, Ridvan. "Improving Throughput By Traffic Aware Routing In Non-transparent Ieee 802.16j Networks". Master's thesis, METU, 2010. http://etd.lib.metu.edu.tr/upload/3/12611806/index.pdf.
Texto completoKhalaf, Gamal Abdel-Fadeel Mohamed. "Traffic estimation, routing and bandwidth allocation in packet-based speech communication networks". Thesis, Imperial College London, 1990. http://hdl.handle.net/10044/1/46388.
Texto completoThiessen, Christian. "Resilient routing and spectrum assignment in Elastic Optical Networks under Dynamic Traffic". Thesis, KTH, Skolan för informations- och kommunikationsteknik (ICT), 2014. http://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-155684.
Texto completoTransparenta Elastiska Optiska Nätverk (EON) ses som en lovande lösning för framtida optiska transportnät för att hänga med Internettrafikens tillväxt, eftersom de möjliggör att tillhandahålla förbindelser med olika krav på bandbredd på ett effektivt sätt. För att uppnå hög spektrumeffektivitet i dessa nätverk är det viktigt att fatta bra beslut vad avser routing, modulering och spektrumtilldelning (Routing, Modulation Level and Spectrum Assignment, RMLSA). Eftersom fiberavbrott är vanliga, så är tåligheten mot enstaka länkfel et annat viktigt ämne. Detta kan ske effektivt genom att skydda gemensamma reservvägar (Shared Path Protection, SPP), vilket dock försvårar RMLSA-problemet. Befintliga routing, modulering och spektrumtilldelningsalgoritmer för SPP fokuserar på strategier i två steg, där först de primära vägarna väljs oberoende av deras backupalternativ. Att välja en annan primär väg, kan dock möjliggöra en bättre reservväg med bättre delning av backupresurser om i stället par av primära och sekundära vägar bedöms tillsammans. Tidigare studier på SPP i EONs anser främst statiska trafikscenarier. I ett dynamiskt trafikscenario, där oförutsägbara anslutningsbegäranden inkommer och avslutas över tiden, så kommer fragmenteringen av spektrala resurser ha en betydande inverkan på nätverkets prestanda. I denna avhandling föreslås en ny algoritm för SPP i EONs för hantering av enskilda länkfel, där par av primära och sekundära vägar väljs gemensamt, vilket minimerar fragmentering och maximerar delning vilket leder till bättre nätverksprestanda i form av minskat blockering. Till skillnad från befintliga algoritmer beslutas den primära och sekundära vägen och spektrum samtidigt från en uppsättning av par av kandidatvägar och spektrumtilldelningen görs med en hybrid-kostnadsfunktion. Funktionen är en viktad kombination av befintliga mått som integrerar fragmentering och delning till en multi-objektiv målfunktion. Med användning av nätverkstrafiksimuleringar i två referensnätverk studeras effekten av olika kostnadsfunktioner på algoritmens beteende och en optimal uppsättning av vikter bestäms. Med dessa parametrar, trafiksimuleringar i en reducerad US-nätverkstopologi med belastningsvärden på 190-240 Erlang, motsvarande blockeringssannolikheter på 0,1 - 1%, visar en genomsnittlig förbättring under referensalgoritmen på 79% i blockeringens sannolikhet, 6.9% i delning och 5,9% i fragmentering. Det visas också att det mesta av denna förbättring beror på det samtidiga tilldelning av primära och reservlänkar. Hybridkostnadsfunktionen minskar blockeringen med ytterligare 10%.
Karaer, Alican. "Effects of Traffic Incidents on Adjacent Facilities and Alternative Re-Routing Strategies". UNF Digital Commons, 2018. https://digitalcommons.unf.edu/etd/781.
Texto completoShek, Lai-yee Liza y 石麗儀. "Ad Hoc routing and time-slot scheduling in bluetooth networks". Thesis, The University of Hong Kong (Pokfulam, Hong Kong), 2002. http://hub.hku.hk/bib/B29699393.
Texto completoZhu, Lei. "Routing Map Topology Analysis and Application". Diss., The University of Arizona, 2014. http://hdl.handle.net/10150/347053.
Texto completoMuchanga, Americo Francisco. "Interdomain Traffic Engineering and Faster Restoration in Optical Networks". Doctoral thesis, KTH, Elektronik- och datorsystem, ECS, 2006. http://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-4220.
Texto completoQC 20100913
Ehrenkranz, Toby y Toby Ehrenkranz. "Ensuring a Valid Source and Destination for Internet Traffic". Thesis, University of Oregon, 2012. http://hdl.handle.net/1794/12445.
Texto completoAl-Momin, Mohammed M. Saeed Abdullah. "QoS-aware content oriented flow routing in optical computer network". Thesis, Brunel University, 2013. http://bura.brunel.ac.uk/handle/2438/7670.
Texto completoGrzybwska, Hanna. "Combination of vehicle routing models and dynamic traffic simulation for city logistics applications". Doctoral thesis, Universitat Politècnica de Catalunya, 2012. http://hdl.handle.net/10803/125067.
Texto completoLa red urbana es un sistema altamente dinámico. Por lo tanto, la gestión moderna y eficiente de la flota en las zonas urbanas debe tener en cuenta la dinámica de las condiciones del tráfico, la variabilidad en los tiempos de viaje y los cambios en la disponibilidad de la demanda y de la flota, ya que afectan de manera significativa en la distribución de bienes y la prestación de servicios. Como consecuencia, los enfoques para optimizar las operaciones de carga deben basarse en las estimaciones de los tiempos de viaje dependientes del tiempo y no en los valores medios estáticos comúnmente empleados como datos de entrada. Las decisiones competentes de gestión dinámica de las flotas necesitan tener en cuenta todos los factores que condicionan el problema abordado. Por lo tanto, hay que considerar las características de las peticiones y las condiciones de servicio de los clientes (demanda, ventanas de tiempo, etc.), las condiciones operacionales de la flota empleada (disponibilidad de los vehículos, estatus, ubicación, ocupación actual del espacio de transporte, etc.) y las condiciones de tráfico. Esta información puede ser proporcionada en tiempo real a un precio asequible por las aplicaciones de las TIC y herramientas tales como: ATIS, GPS, GPRS u otros. En lugar de confiar exclusivamente en la experiencia de un distribuidor, también sería correcto basar las decisiones de gestión de transporte de mercancías en la información proporcionada por un sistema profesional de apoyo a la toma de decisiones que facilita la consideración de todos los factores que condicionan el problema abordado. El objetivo de esta tesis es proponer, implementar y validar computacionalmente en base a la simulación, la arquitectura de un Sistema de Apoyo a la Toma de Decisiones para la gestión de transporte de mercancías en tiempo real capaz de considerar todos los factores dinámicos previamente mencionados. Su diseño se basa en la integración de un modelo seleccionado de rutas de vehículos con recogida y entrega y modelos de simulación de tráfico dinámicos cuyo propósito es emular detalladamente las condiciones de tráfico que cambian con el paso del tiempo. Las rutas y los horarios dinámicos óptimos para una flota de vehículos que transporta mercancías se obtienen de las modificaciones dinámicas de un plan actual de rutas y horarios en base a la nueva información recibida que condiciona el problema abordado. Los resultados obtenidos de los experimentos computacionales demuestran que el rendimiento de la flota de transporte de mercancías depende en gran medida de la información de tráfico utilizada para crear el plan de rutas y los horarios. Debido al carácter especial de las operaciones de transporte realizadas en las áreas metropolitanas, a pesar de una solución inicial factible que se crea sobre la base de los datos históricos de los tiempos de viaje, es posible que no todos los clientes sean servidos. Por lo tanto, hay una necesidad de implementar estrategias de cambios de rutas en tiempo real, que permiten modificar las rutas originales con el fin de cumplir las tareas de enrutamiento viables. Además, más estrictas son las limitaciones que especifican las ventanas del tiempo de los clientes y más alto es el número de solicitudes de servicio que aparecen de forma dinámica, mayor será el coste final de las prestaciones del servicio y el nivel de utilización de la flota de transporte de mercancías.
Kim, Minseok. "A heuristic for routing hazmat transport given real-time weather and traffic information". College Park, Md. : University of Maryland, 2006. http://hdl.handle.net/1903/3530.
Texto completoThesis research directed by: Dept. of Civil and Environmental Engineering. Title from t.p. of PDF. Includes bibliographical references. Published by UMI Dissertation Services, Ann Arbor, Mich. Also available in paper.
Khajuriwala, Burhanuddin F. "Dynamic adaptive routing for traffic management and fault tolerance in high speed networks". Thesis, National Library of Canada = Bibliothèque nationale du Canada, 1999. http://www.collectionscanada.ca/obj/s4/f2/dsk1/tape7/PQDD_0015/MQ49383.pdf.
Texto completoKayahan, Hüseyin. "Treatment Framework : Traffic Steering via Source-Routing in SDN for Service Function Chaining". Thesis, KTH, Skolan för elektroteknik och datavetenskap (EECS), 2019. http://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-247926.
Texto completoDet har länge varit känt att arkitektur baserad på mellanliggande utrustning, s.k.middlebox-arkitektur, inte alltid rimmar väl med Internet i övrigt. Nätverksfunktioner som implmenteras i middleboxar tenderar att leda till olika typer av förbindelser, modifierande av pakethuvuden eller nya uppkopplingar, vilket medför att det blir utmanande att verkställa olika typer av policy. Middlebox-lösningar är dessutom tätt kopplade till olika typer av metadata vilket innebär svårigheter för dess distribuerade fortlevnad och hindrar ett flexibelt utnyttjande och skalbar utbyggnad middleboxresurser under varierande trafiklast. Befintliga försök att mildra sådana problem inkluderar placering av mellanliggande utrustning, paketmärkning och migration av metadata; vart och ett av dessa löser endast delar av problemet.TRF (Treatment Framework) drar nytta av den utbyggbarhet som finns i IPv6 och använder vägval som styrs helt från avsändaren tillsammans med diskretionär adressrymd. IP-paketen traverserar en behandlings-domän och ett utökat pakethuvud används inom domänen. Det utökade pakethuvudet läggs till när paketet är på väg in i domänen och tas bort när paketet lämnar domänen. Inom domänen används information i det utökade pakethuvudet för att styra vidarebefordringen av paketet. Mekanismerna för vidarebefordring av paket använder sig av SDN och består av en match-operation och tre OpenFlow-åtgärder, varmed TRF kringgår behov av en underliggande transport. En anpass-ningsbart adressrymd gör det möjligt för leverantörer att skräddarsy vägvalsaggregering till sin middlebox-lösning, vilket gör att antalet trafikregler i kärnan av deras nät kan reduceras till förinställbara storlekar.En middlebox-lösning i en behandlings-domän matchar trafik mot respektive lokal policy baserad på information kodad i det utökade pakethuvudet. Tekniken med utökat pakethuvud är inbyggd i IPv6 och standardiserad vilket göra att paketmodifiering i en middlebox kan adresseras utan att kräva ändringar eller insyn i proprietär programvara. Ramverket löser problemet med verkställa olika typer av policy i sin helhet och medger skapandet av assymtriska kedjor av paketbehandlingstjänster. Tiden för att sätta upp paketflöden i kärnan av nätet kan elimineras, men det fotavtryck som ramverket ger i ingressdelen av domänen, där det utökade pakethuvudet skapas och läggs till inkommand paket, kan bli betydande med avseende på flödeshastigheten.
Gao, Song 1976. "Routing problems in stochastic time-dependent networks with applications in dynamic traffic assignment". Thesis, Massachusetts Institute of Technology, 2002. http://hdl.handle.net/1721.1/8310.
Texto completoIncludes bibliographical references (p. 155-157).
Stochasticity is prevalent in transportation networks in general, and traffic networks in particular. The overall objective of this thesis is to study implications and significance of stochasticity in the development of models and algorithms for dynamic traffic flows in road networks. There are two major parts in this thesis. We first study the best routing policy problems in stochastic and time-dependent networks, and then develop policy-based stochastic dynamic traffic assignment models and algorithms. Routing problems are not only useful to develop dynamic traffic assignment (DTA) methods, but are also fundamental network optimization problems with a wider application domain. We define the problem in general and give a framework, which we believe is the first in the literature. We give a comprehensive taxonomy and an indepth discussion of most of the variants of the problem. We study in detail a variant pertinent to the traffic in road networks. We give an exact solution algorithm to this variant, analyze its running time complexity and point out the importance of finding good approximation algorithms. We then present several approximations, and study their effectiveness against the exact algorithm, both theoretically and computationally. We proceed to develop a policy-based stochastic dynamic traffic assignment model. We give a conceptual framework and then develop models for users' choice of policies and the dynamic network loading problem. These models are two major components of the overall DTA model. We give solution algorithms for these models, and present a heuristic algorithm to solve the proposed policy-based DTA model. Using an example, we show that policy-based DTA models have solutions that are different in expected travel times than the path-based models.
by Song Gao.
S.M.
MAHAPATRA, ABINASH. "QOS AND ENERGY AWARE ROUTING FOR REAL TIME TRAFFIC IN WIRELESS SENSOR NETWORKS". University of Cincinnati / OhioLINK, 2003. http://rave.ohiolink.edu/etdc/view?acc_num=ucin1070555178.
Texto completoKolar, Vinay. "Routing and traffic-engineering in multi-hop wireless networks an optimization based approach /". Diss., Online access via UMI:, 2007.
Buscar texto completo胡玉蓉 y Yurong Hu. "Datagram routing for low earth orbit satellite networks". Thesis, The University of Hong Kong (Pokfulam, Hong Kong), 2001. http://hub.hku.hk/bib/B31224441.
Texto completoHeidari, Fariba. "Quality of service routing using decentralized learning". Thesis, McGill University, 2009. http://digitool.Library.McGill.CA:80/R/?func=dbin-jump-full&object_id=115672.
Texto completoWe investigate the performance degradation due to decentralized routing as opposed to centralized optimal routing policies in practical scenarios. The system optimal and the Nash bargaining solutions are two centralized benchmarks used in this study. We provide nonlinear programming formulations of these problems along with a distributed recursive approach to compute the solutions. An on-line partially-decentralized control architecture is also proposed to achieve the system optimal and the Nash bargaining solution performances. Numerical results in some practical scenarios with well engineered networks, where the network resources and traffic demand are well matched, indicate that decentralized learning techniques provide efficient, stable and scalable approaches for routing the bandwidth guaranteed paths.
In the context of on-line learning, we propose a new algorithm to track the best action-selection policy when it abruptly changes over time. The proposed algorithm employs change detection mechanisms to detect the sudden changes and restarts the learning process on the detection of an abrupt change. The performance analysis of this study reveals that when all the changes are detectable by the change detection mechanism, the proposed tracking the best action-selection policy algorithm is rate optimal. On-line routing of bandwidth guaranteed paths with the potential occurrence of network shocks such as significant changes in the traffic demand is one of the applications of the devised algorithm. Simulation results show the merit of the proposed algorithm in tracking the optimal routing policy when it abruptly changes.
Sawant, Uttara. "Grid-based Coordinated Routing in Wireless Sensor Networks". Thesis, University of North Texas, 2006. https://digital.library.unt.edu/ark:/67531/metadc5437/.
Texto completoKammenhuber, Nils [Verfasser]. "Traffic-adaptive routing / Nils Kammenhuber". 2008. http://d-nb.info/991745469/34.
Texto completoCho, Woon Hyung. "TIDR traffic-aware inter-domain routing /". 2007. http://etd.lib.fsu.edu/theses/available/etd-07092007-213717.
Texto completoAdvisor: Zhenhai Duan, Florida State University, College of Arts and Sciences, Dept. of Computer Science. Title and description from dissertation home page (viewed Oct. 8, 2007). Document formatted into pages; contains vii, 25 pages. Includes bibliographical references.
Chang, Hsien-Cheng y 張晛承. "Exploiting Traffic Patterns for Real-Time Traffic Prediction and Vehicle Routing". Thesis, 2013. http://ndltd.ncl.edu.tw/handle/58543183899669637088.
Texto completo國立清華大學
資訊工程學系
101
Real-time traffic prediction is a fundamental capability of reducing traffic congestion and improving traffic mobility. Recently, the traffic information in the urban area of the Taipei city is available from Institute of Transportation, Ministry of Transportation and Communications, Taiwan. Given this information, it is possible to analyze and extract some traffic patterns. In this paper, we use these patterns to design a semi-parametric prediction model which provides an efficient mean to estimate accurately the future traffic conditions. Furthermore, we propose a novel vehicle routing algorithm which can plan routes with less delay for the drivers. The vehicle routing algorithm is composed of our proposed prediction model and the existing shortest path algorithm. Finally, in the performance evaluation, we show the capability of our methodology to predict future traffic conditions accurately and to enable the drivers to arrive the destinations within less time.
Chen, Yun-Wen y 陳韻文. "QoS Routing Algorithms for Multiple Traffic Classes". Thesis, 2000. http://ndltd.ncl.edu.tw/handle/06201570684456489166.
Texto completo國立中正大學
資訊工程研究所
88
One of the most important features of the next generation Internet is the ability to provide quality of service (QOS) guarantee. Recent developments in Internet provide at least two types of service. For example, guaranteed service and controlled load service in Integrated services networks, and expedited forwarding and assured forwarding in Differentiated services networks. Providing guaranteed service and expedited service, referred to as bandwidth-guaranteed traffic, requires reservation of a fixed amount of bandwidth while controlled load service and assured forwarding service, referred to as fair-shared traffic, requires reservation of a minimum amount of bandwidth to ensure finite queue length. Routing in a network with these two types of service should take their traffic and QOS characteristics into consideration. In this paper, we propose three routing algorithms that use different cost functions and routing strategies when routing different class of traffic. Our simulation results show that the proposed algorithms are able to yield low blocking probability for bandwidth-guaranteed traffic and high max-min fair share rate for fair-shared traffic under various traffic conditions.
洪夢麟. "Finding Link Disjoint Routing Paths Based on Traffic Intensity for Alternate Routing". Thesis, 2007. http://ndltd.ncl.edu.tw/handle/27775067472401303114.
Texto completo國立清華大學
資訊工程學系
95
An alternate routing algorithm requires a set of predetermined routing paths for each sourcedestination pair. To reduce the connection blocking probability, it is desirable that the predetermined routing paths between each source-destination pair be link-disjoint. The predetermined routing paths used in previous works on alternate routing are the k-shortest paths in terms of hop count. However, depending on the traffic requirements of all source-destination pairs, hop count based k-shortest paths may not be the best choice for the predetermined routing paths. This thesis proposes a method to find a set of link-disjoint routing paths for each sourcedestination pair to be used by an alternate routing algorithm in order to reduce the connection blocking probability. The key idea is to utilize the routing paths that are used by the optimal traffic pattern in the network. Then, for each source-destination pair, we select a set of link-disjoint routing paths from the routing paths that are used by the optimal traffic pattern such that the selected set of link-disjoint routing paths carries the most of the traffic between the source-destination pair. Simulations are performed to compare the performance of two alternate routing algorithms that use the link-disjoint routing paths found by the proposed method as the predetermined routing paths and those of the same alternate routing algorithms that employ the hop count based k-shortest link-disjoint paths as the predetermined routing paths. Our simulation results show that using the link-disjoint routing paths found by the proposed method yields significantly lower connection blocking probability than employing the hop count based k-shortest link-disjoint paths.