Tesis sobre el tema "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 "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.
Mühlbauer, Wolfgang. "Inter domain routing under scrutiny : routing models and alternative routing architectures /". kostenfrei, 2009. http://opus.kobv.de/tuberlin/volltexte/2010/2514/.
Texto completoBereketli, Alper. "On Qos Multicast Routing Routing Protocols". Master's thesis, METU, 2005. http://etd.lib.metu.edu.tr/upload/12606446/index.pdf.
Texto completoMourgaya, Virapatrin Magalie. "The periodic vehicle routing problem : planning before routing". Bordeaux 1, 2004. http://www.theses.fr/2004BOR12843.
Texto completoRoughgarden, Tim. "Selfish routing". online access from Digital Dissertation Consortium access full-text, 2002. http://libweb.cityu.edu.hk/cgi-bin/er/db/ddcdiss.pl?3050436.
Texto completoAndersson, Johan y Marcus Kleihs. "Routing Interior". Thesis, Högskolan i Halmstad, Sektionen för Informationsvetenskap, Data– och Elektroteknik (IDE), 2013. http://urn.kb.se/resolve?urn=urn:nbn:se:hh:diva-21647.
Texto completoCampbell, Ann Melissa. "Inventory routing". Diss., Georgia Institute of Technology, 2000. http://hdl.handle.net/1853/25530.
Texto completoChaudhray, Kamal. "VLSI routing". Thesis, University of Cambridge, 1990. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.359367.
Texto completoMadapatha, Samira Anupama. "Energy efficient hierarchical wireless routing protocol (EEHW routing protocol)". Thesis, California State University, Long Beach, 2015. http://pqdtopen.proquest.com/#viewpdf?dispub=1597778.
Texto completoThe areas of WSNs (Wireless Sensor Networks) and Internet of Things (IoT) are considered to be the highly embryonic and most emerging arenas in research in the industrial or technical world now. This has brought about the inevitability of introducing or developing highly reliable, highly efficient, low cost, and low power sensor nodes to the market. Primary emphasis of wireless sensor network routing protocol is now on the coup of power preservation. Most of the modern publications have exposed so many protocols primarily intended to mineralize the energy consumption in wireless sensor networks. This thesis work recommends an enhancement to the gradient base hierarchical routing protocol technique introduced by Dr. Mozumdar in 2011. Proposed method introduces active/ idle mode for end devices with time division multiplexing to cut down the energy usage of battery powered sensor nodes. At the same time data aggregation at the access point and also backup route has been introduced to end devices to send data back to the base station when the parent node fails to communicate. It is easy to perceive from simulation results that the enhanced protocol has higher lifetime compared to the original protocol. As a closing section, boosted energy efficient hieratical routing protocol (EEHW protocol) is implemented in Contiki OS.
BANTAN, NOUMAN. "A ROUTING PROTOCOL AND ROUTING ALGORITHM FOR SPACE COMMUNICATION". Kent State University / OhioLINK, 2007. http://rave.ohiolink.edu/etdc/view?acc_num=kent1172099125.
Texto completoRincon, Garcia Nicolas. "Freight transport, routing software and time-dependent vehicle routing models". Thesis, University of Southampton, 2016. https://eprints.soton.ac.uk/397141/.
Texto completoFischer, Simon. "Dynamic selfish routing". [S.l.] : [s.n.], 2007. http://deposit.ddb.de/cgi-bin/dokserv?idn=985433612.
Texto completoOertel, Peter. "Routing with reloads". [S.l. : s.n.], 2000. http://deposit.ddb.de/cgi-bin/dokserv?idn=962299820.
Texto completoFošner, Ajda. "MATRICES AND ROUTING". Saechsische Landesbibliothek- Staats- und Universitaetsbibliothek Dresden, 2012. http://nbn-resolving.de/urn:nbn:de:bsz:14-qucosa-79772.
Texto completoSong, Jin-Hwa. "Inventory Routing Investigations". Diss., Georgia Institute of Technology, 2004. http://hdl.handle.net/1853/5028.
Texto completoMilway, D. R. "Binary routing networks". Thesis, University of Cambridge, 1986. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.373685.
Texto completoAvgouleas, Kyriakos. "Optimal ship routing". Thesis, Massachusetts Institute of Technology, 2008. http://hdl.handle.net/1721.1/44861.
Texto completoIncludes bibliographical references (p. 114-118).
Fuel savings in ship navigation has always been a popular subject in the maritime industry as well as the world's largest Navies. Oil prices and environmental considerations drive the effort for more fuel-efficient navigation. This thesis addresses the problem of deterministic minimum fuel routing by applying optimal control theory in conjunction with state of the art hydrodynamic and weather forecasting tools. A fictitious trans-Atlantic route is established and the optimal combination of speed and heading is determined, so that fuel consumption is minimized while certain safety constraints are met. The safety constraints are defined as the probabilities of slamming and deck wetness, both of which are not allowed to exceed prescribed limiting values. The problem formulation adopted in the thesis lies in the framework of Dynamic Programming, which is most suitable for computer implementation. The hydrodynamic performance of the ship is computed through the use of SWAN1, an advanced frequency domain CFD code. With the aid of SWAN1, ship motions and resistance can be accurately calculated. The latter includes the estimation of mean added resistance in waves, which has a major effect on the fuel consumption of ships sailing in rough seas. Wave and swell forecasts are provided in a deterministic setting by a third generation numerical wave model, the WAM cycle 4, developed at the European Center for Medium-Range Weather Forecasts (ECMWF). Utilizing the hydrodynamic results and the output of the wave model a computer program is developed in MATLAB®, which employs the Iterative Dynamic Programming algorithm to solve the optimal control problem.
by Kyriakos Avgouleas.
Nav.E.and S.M.
Ganhão, Francisco José Dinis de Sousa Fernandes. "Multi-region routing". Master's thesis, FCT - UNL, 2009. http://hdl.handle.net/10362/2394.
Texto completoThis thesis proposes a new inter-domain routing protocol. The Internet's inter-domain routing protocol Border Gateway Protocol (BGP) provides a reachability solution for all domains; however it is also used for purposes outside of routing. In terms of routing BGP su ers from serious problems, such as slow routing convergence and limited scalability. The proposed architecture takes into consideration the current Internet business model and structure. It bene ts from a massively multi-homed Internet to perform multipath routing. The main foundation of this thesis was based on the Dynamic Topological Information Architecture (DTIA). We propose a division of the Internet in regions to contain the network scale where DTIA's routing algorithm is applied. An inter-region routing solution was devised to connect regions; formal proofs were made in order to demonstrate the routing convergence of the protocol. An implementation of the proposed solution was made in the network simulator 2 (ns-2). Results showed that the proposed architecture achieves faster convergence than BGP. Moreover, this thesis' solution improves the algorithm's scalability at the inter-region level, compared to the single region case.
Adamek, Jordan Matthew. "Concurrent Geometric Routing". Kent State University / OhioLINK, 2017. http://rave.ohiolink.edu/etdc/view?acc_num=kent1501087573328402.
Texto completoOkonor, O. "Green backbone routing". Thesis, University of Surrey, 2016. http://epubs.surrey.ac.uk/809529/.
Texto completoFox, Michael (Michael Robert) Carleton University Dissertation Mathematics. "Random alternative routing". Ottawa, 1994.
Buscar texto completoFranz, Patrick. "Minimum Risk Routing". [S.l. : s.n.], 2007. http://nbn-resolving.de/urn:nbn:de:bsz:747-opus-245.
Texto completoFulgham, Melanie L. "Multicomputer routing techniques /". Thesis, Connect to this title online; UW restricted, 1997. http://hdl.handle.net/1773/7021.
Texto completoTamrakar, Sandeep. "Study of TCP friendliness of CEAS routing system in comparison with Distance Vector Routing and Link State Routing". Thesis, Norwegian University of Science and Technology, Department of Telematics, 2009. http://urn.kb.se/resolve?urn=urn:nbn:no:ntnu:diva-9043.
Texto completoWith the continuous development of the Internet technologies new routing requirements have surfaced. In response, several adaptive, stochastic routing algorithms have been purposed. The Cross Entropy Ant System (CEAS) is an adaptive, robust and distributed routing and management system based on the swarm intelligence. Several prototype implementations and enhancements have been made on this system, however the level of TCP friendliness the CEAS may provide is yet an important issue. In order to investigate the level of TCP friendliness, the behavior of the CEAS system during different network dynamics needs to be understood. For this reason, the behavior of the CEAS system under different network event and its corresponding effects on TCP performance is examined first using a simple network. Later the level of TCP performance is measured on complex networks. Also the load sharing capabilities of the CEAS system is investigated the efficiency of the system to manage and update according to the network load. Additionally the results are compared against the results obtained from the standard Link State Routing protocol and the Distance Vector Routing protocol under similar conditions. In this work, we find that the update process in response to the change in network dynamics is slower on CEAS compared to the other systems. However, the update process speeds up with the increase in the ant rates. During such period the use of multiple path reduces the TCP performance. We also find that large amount of packets loop around some links during link failures. Such looping reduces the TCP performance significantly. However, implementing previous hop memory technique removes such loops and also help TCP resume transmission immediately after the link failure. Compare to the LSRP and the DVR, we find that CEAS manages network resources more efficiently to produce higher TCP performance. We find that the CEAS diverts the data traffic on the basis of the quality of the path rather than the length of the path. We also find that the CEAS system handles multiple TCP stream independently with equal priority. But the smaller transition delay on the ants compared to the data packet reduces the TCP performance to some extent. However, forcing the ants to experience longer queuing delay according to the traffic load improves the TCP performance as well as helps CEAS update more accurately.
Gibbens, Richard John. "Dynamic routing in circuit-switched networks : the dynamic alternative routing strategy". Thesis, University of Cambridge, 1988. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.292765.
Texto completoKim, Tae Hyun Sun Min-Te. "Bandwidth-aware routing tree (BART) for underwater 3-D geographic routing". Auburn, Ala, 2008. http://hdl.handle.net/10415/1548.
Texto completoLindblad, 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 completoBonezzi, Mirko. "GEO PHOTO ROUTING: Progettazione ed implementazione di una applicazione per routing pedonale". Bachelor's thesis, Alma Mater Studiorum - Università di Bologna, 2017. http://amslaurea.unibo.it/14427/.
Texto completoKassahun, Mebratu. "Secure Routing in Structured P2P Overlay : Simulating Secure Routing on Chord DHT". Thesis, Mittuniversitetet, Avdelningen för informations- och kommunikationssystem, 2015. http://urn.kb.se/resolve?urn=urn:nbn:se:miun:diva-24265.
Texto completoLu, Zhenxin y 蘆振鑫. "Location-aware routing with reduced location maintenance routing for Ad hoc networks". Thesis, The University of Hong Kong (Pokfulam, Hong Kong), 2004. http://hub.hku.hk/bib/B29737308.
Texto completoHampson, Ernest III. "High Speed Routing Table Lookups for Current and Next Generation Internet Routing". NSUWorks, 2002. http://nsuworks.nova.edu/gscis_etd/563.
Texto completoToler, Charles T. "The cost effectiveness of multiple routing versus single routing of school buses /". free to MU campus, to others for purchase, 1998. http://wwwlib.umi.com/cr/mo/fullcit?p9904879.
Texto completoMacintosh, Adam. "Local area dynamic routing protocol : a position based routing protocol for MANET". Thesis, London South Bank University, 2015. http://researchopen.lsbu.ac.uk/2070/.
Texto completoPICCONI, MASSIMILIANO. "Technologies, routing policies and relationships between autonomous systems in inter-domain routing". Doctoral thesis, Università degli Studi di Cagliari, 2011. http://hdl.handle.net/11584/265901.
Texto completoEbada, Mohamed. "Multipath Routing for Wireless Sensor Networks: A Hybrid Between Source Routing and Diffusion Techniques". Thèse, Université d'Ottawa / University of Ottawa, 2011. http://hdl.handle.net/10393/19887.
Texto completoBerlati, Alessandro. "Opportunistic Contact Graph Routing". Bachelor's thesis, Alma Mater Studiorum - Università di Bologna, 2016. http://amslaurea.unibo.it/11327/.
Texto completoGeng, Yue. "On warehouse routing problems /". View abstract or full-text, 2005. http://library.ust.hk/cgi/db/thesis.pl?IEEM%202005%20GENG.
Texto completoKaraoglu, Hasan T. "Link state contract routing". abstract and full text PDF (UNR users only), 2009. http://0-gateway.proquest.com.innopac.library.unr.edu/openurl?url_ver=Z39.88-2004&rft_val_fmt=info:ofi/fmt:kev:mtx:dissertation&res_dat=xri:pqdiss&rft_dat=xri:pqdiss:1472958.
Texto completoAhmed, Mustaq. "Ordered interal routing schemes". Waterloo, Ont. : University of Waterloo, 2004. http://etd.uwaterloo.ca/etd/m6ahmed2004.pdf.
Texto completo"A thesis presented to the University of Waterloo in fulfilment of the thesis requirements for the degree of Master of Mathematics in Computer Science." Includes bibliographical references.
Ozdemir, Emrah. "The Campaign Routing Problem". Master's thesis, METU, 2009. http://etd.lib.metu.edu.tr/upload/12610955/index.pdf.
Texto completoWerth, Thomas [Verfasser]. "Routing Games / Thomas Werth". München : Verlag Dr. Hut, 2014. http://d-nb.info/1051550041/34.
Texto completoAhmed, Mustaq. "Ordered Interval Routing Schemes". Thesis, University of Waterloo, 2004. http://hdl.handle.net/10012/1137.
Texto completoRamany, Swaminathan. "Routing in wormhole networks". Thesis, National Library of Canada = Bibliothèque nationale du Canada, 1996. http://www.collectionscanada.ca/obj/s4/f2/dsk3/ftp04/nq23912.pdf.
Texto completoRoumani, Ali Mohamad. "QoS-based multicast routing". Thesis, National Library of Canada = Bibliothèque nationale du Canada, 2000. http://www.collectionscanada.ca/obj/s4/f2/dsk1/tape3/PQDD_0034/MQ52943.pdf.
Texto completoZhang, Xinglong. "Network vehicle routing problems". Diss., Georgia Institute of Technology, 1998. http://hdl.handle.net/1853/21710.
Texto completoWindmill, Christopher Mark. "Hierarchical network topographical routing". Thesis, University of Glasgow, 2013. http://theses.gla.ac.uk/4607/.
Texto completoTwigg, Andrew David. "Compact forbidden-set routing". Thesis, University of Cambridge, 2006. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.614363.
Texto completoSharma, Divya Alok. "Routing in opportunistic networks". Thesis, McGill University, 2014. http://digitool.Library.McGill.CA:80/R/?func=dbin-jump-full&object_id=121530.
Texto completoLe réseautage opportuniste est utilisé dans les scénarios où l'existence de routes de communication entre agents ne peut pas être présumé dû à l'altération constante de la topologie du réseau. Dans ces réseaux, l'information est acheminée grâce à une procédure de "sauvegarde-report" qui exploite les opportunités de communication transitoires qui ont lieu lorsque des agents équippés d'interface sans-fil à petite portée entrent dans leurs périmètres de portée respectifs. Établir des plans de communication efficaces dans le contexte de réseaux opportunistes est un défi puisque ceux-ci font face à un compromis entre performance de livraison et consommation de ressources. Dans cette thèse, nous proposons un algorithme de routage opportuniste original qui addresse ce compromis en incorporant l'information liée aux contacts entre noeuds du réseau. Assembler les évènements de contacts dans un graphe pondéré nous permet de détecter les communautés et d'apprendre le voisinage de chaque noeud. Cette information est utilisée par notre algorithme afin d'évaluer l'utilité de chaque opportunité de communication qui se présente. Une analyse de la performance de l'algorithme proposé montre qu'il est capable d'atteindre une bonne performance de livraison tout en consommant significativement moins de ressources lorsque comparé aux algorithmes de routage opportuniste actuels.
Philpott, Mark Stuart. "Convoy routing under uncertainty". Thesis, University of East Anglia, 2004. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.405399.
Texto completoMaley, F. Miller. "Single-layer wire routing". Thesis, Massachusetts Institute of Technology, 1987. http://hdl.handle.net/1721.1/14657.
Texto completoKey, Jonathan Ramsay 1976. "Routing in probabilistic networks". Thesis, Massachusetts Institute of Technology, 2004. http://hdl.handle.net/1721.1/29387.
Texto completoIncludes bibliographical references (p. 143-146).
This thesis considers tlhe problem of routing in a network where the travel times along the arcs are modeled as independent random variables. A standard approach to routing in such networks is to select a path with the least expected travel time. One of the problems with this approach is that it does not take into consideration factors such as the travel time variance. Additionally. such an approach implicitly assumes each user in the network has the same routing objective. In this thesis we develop an approach to routing in probabilistic networks in which these problems are addressed. The fundamental concept in our approach is that, for a given user with a set of routing options at a given node. we approximate the distributions of travel time for these options. Using these approximate distributions, the options are compared according to a user-specified routing objective, and the best option is selected. The primary benefit of this approach is that one is not limited to a particular routing objective as the computed distributions of travel time allow us to efficiently determine an effective routing option for a arbitrary routing objective that depends on factors of random travel time other than the mean. The distribution of travel time adopted in this thesis is the minimum travel time probability distribution. which is the distribution of travel time over all fastest paths. In a class of networks termed as series-parallel networks. the minimum travel time distribution can be calculated efficiently.
(cont.) For general, non-series-parallel networks. the approximation we adopt is the minimum travel time distribution obtained from a related series-parallel network. The performance and the benefits of this approach to routing are illustrated on three networks. The numerical results are obtained using an efficient implementation of the algorithms proposed in this thesis. We also consider the problem of generating an acyclic graph from a cyclic graph, and we propose a data structure that allows for the efficient calculation of the sum and minimum of independent random variables.
by Jonathan Ramsay Key.
S.M.