Log in

Relevant bibliographies by topics / To Routing / Dissertations / Theses

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

Dissertations / Theses on the topic 'To Routing'

Author: Grafiati

Published: 4 June 2021

Last updated: 1 February 2022

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

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

Mühlbauer, Wolfgang. "Inter domain routing under scrutiny : routing models and alternative routing architectures /." kostenfrei, 2009. http://opus.kobv.de/tuberlin/volltexte/2010/2514/.

Full text

APA, Harvard, Vancouver, ISO, and other styles

2

Bereketli, Alper. "On Qos Multicast Routing Routing Protocols." Master's thesis, METU, 2005. http://etd.lib.metu.edu.tr/upload/12606446/index.pdf.

Full text

Abstract:

Multicasting is a technique used for distributing data packets from one or more sources to a set of receivers on interconnected networks. Currently developing network applications bring specific quality of service (QoS) requirements like bounded delay, minimum bandwidth, and maximum data loss rate. Providing the required quality of service addresses routing and resource reservation concepts. In this study, a literature survey is carried out on traditional and QoS multicast routing protocols, and the need for QoS routing protocols is investigated. QoS multicast routing protocols are classified

APA, Harvard, Vancouver, ISO, and other styles

3

Mourgaya, Virapatrin Magalie. "The periodic vehicle routing problem : planning before routing." Bordeaux 1, 2004. http://www.theses.fr/2004BOR12843.

Full text

Abstract:

Le problème de tournées de véhicules multipériodiques consisté à planifier des visites client sur un horizon de temps donné en les affectant à des tournées de véhicule. Les fréquences de visites ou espacement entre elles sont prescrits. Ces contraintes peuvent prendre la forme de scénarios de visites admissibles. Nous étudions les différentes variantes de ce problème et proposons une classification. Nous présentons ensuite un algorithme heuristique pour un modèle de planification tactique qui optimise la répartition de la charge et la régionalisation des tournées. L'objectif traditionnel de mi

APA, Harvard, Vancouver, ISO, and other styles

4

Andersson, Johan, and 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.

Full text

Abstract:

När datatrafik färdas genom ett nätverk så passerar det routrar och switcharsamtidigt som dessa enheter visar åt vilket håll paketet ska skickas. Detta kallas förrouting. För att paketen ska hitta rätt väg så använder man sig av routingprotokoll,som vägleder trafiken dit de ska, och olika protokoll har olika fördelar samtidigtsom de används vid olika tillfällen. Målet var att skapa ett stort enhetligt nätverksom tål höga belastningar, har en hög uppkopplingsprocent samtidigt som det skavara lätt att expandera i framtiden. Det största problemet var hur trafiken färdasmellan varje kontor, men pr

APA, Harvard, Vancouver, ISO, and other styles

5

Campbell, Ann Melissa. "Inventory routing." Diss., Georgia Institute of Technology, 2000. http://hdl.handle.net/1853/25530.

Full text

APA, Harvard, Vancouver, ISO, and other styles

6

Roughgarden, 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.

Full text

APA, Harvard, Vancouver, ISO, and other styles

7

Chaudhray, Kamal. "VLSI routing." Thesis, University of Cambridge, 1990. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.359367.

Full text

APA, Harvard, Vancouver, ISO, and other styles

8

Madapatha, 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.

Full text

Abstract:

<p>The 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

APA, Harvard, Vancouver, ISO, and other styles

9

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.

Full text

APA, Harvard, Vancouver, ISO, and other styles

10

Rincon, Garcia Nicolas. "Freight transport, routing software and time-dependent vehicle routing models." Thesis, University of Southampton, 2016. https://eprints.soton.ac.uk/397141/.

Full text

Abstract:

Routing and scheduling software is part of the Information and Technology systems available to support the transport industry, and uses complex algorithms along with geographical representations of the road network to allow better planning of daily collection and delivery schedules. This research reviews the evolution of routing and scheduling software, the algorithms used along with reported barriers to wider take-up and potential industry driven improvements that could be made. A survey of transport companies in the United Kingdom was conducted in order to validate and prioritize the softwar

APA, Harvard, Vancouver, ISO, and other styles

11

Fošner, Ajda. "MATRICES AND ROUTING." Saechsische Landesbibliothek- Staats- und Universitaetsbibliothek Dresden, 2012. http://nbn-resolving.de/urn:nbn:de:bsz:14-qucosa-79772.

Full text

Abstract:

The study of matrices have been of interest to mathematicians for some time. Recently the use of matrices has assumed greater importance also in the fields of management, social science, and natural science because they are very useful in the organization and presentation of data and in the solution of linear equations. The theory of matrices is yet another type of mathematical model which we can use to solve many problems that arise in these fields. The aim of this paper is to show how we can use matrices and their mathematical model to solve some problems in the process of routing. First we

APA, Harvard, Vancouver, ISO, and other styles

12

Song, Jin-Hwa. "Inventory Routing Investigations." Diss., Georgia Institute of Technology, 2004. http://hdl.handle.net/1853/5028.

Full text

Abstract:

The elimination of distribution inefficiencies, occurring due to the timing of customers' orders is an important reason for companies to introduce vendor managed inventory programs. By managing their customers' inventories, suppliers may be able to reduce demand variability and therefore distribution costs. We develop technology to measure the effectiveness of distribution strategies. We develop a methodology that allows the computation of tight lower bounds on the total mileage required to satisfy customer demand over a period of time. As a result, companies will be able to gain insight into

APA, Harvard, Vancouver, ISO, and other styles

13

Fischer, Simon. "Dynamic selfish routing." [S.l.] : [s.n.], 2007. http://deposit.ddb.de/cgi-bin/dokserv?idn=985433612.

Full text

APA, Harvard, Vancouver, ISO, and other styles

14

Oertel, Peter. "Routing with reloads." [S.l. : s.n.], 2000. http://deposit.ddb.de/cgi-bin/dokserv?idn=962299820.

Full text

APA, Harvard, Vancouver, ISO, and other styles

15

Milway, D. R. "Binary routing networks." Thesis, University of Cambridge, 1986. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.373685.

Full text

APA, Harvard, Vancouver, ISO, and other styles

16

Fox, Michael (Michael Robert) Carleton University Dissertation Mathematics. "Random alternative routing." Ottawa, 1994.

Find full text

APA, Harvard, Vancouver, ISO, and other styles

17

Franz, Patrick. "Minimum Risk Routing." [S.l. : s.n.], 2007. http://nbn-resolving.de/urn:nbn:de:bsz:747-opus-245.

Full text

APA, Harvard, Vancouver, ISO, and other styles

18

Fulgham, Melanie L. "Multicomputer routing techniques /." Thesis, Connect to this title online; UW restricted, 1997. http://hdl.handle.net/1773/7021.

Full text

APA, Harvard, Vancouver, ISO, and other styles

19

Avgouleas, Kyriakos. "Optimal ship routing." Thesis, Massachusetts Institute of Technology, 2008. http://hdl.handle.net/1721.1/44861.

Full text

Abstract:

Thesis (Nav. E. and S.M.)--Massachusetts Institute of Technology, Dept. of Mechanical Engineering, 2008.<br>Includes bibliographical references (p. 114-118).<br>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-Atlan

APA, Harvard, Vancouver, ISO, and other styles

20

Adamek, Jordan Matthew. "Concurrent Geometric Routing." Kent State University / OhioLINK, 2017. http://rave.ohiolink.edu/etdc/view?acc_num=kent1501087573328402.

Full text

APA, Harvard, Vancouver, ISO, and other styles

21

Okonor, O. "Green backbone routing." Thesis, University of Surrey, 2016. http://epubs.surrey.ac.uk/809529/.

Full text

Abstract:

Reducing energy consumption in the Telecom industry has become a major research challenge to the Internet community due to high level of energy waste on redundant network devices. In search for a paradigm shift, recent research efforts have been focusing on time-driven sleep-mode reconfiguration of network elements during periods of low traffic demand. However, due to the routing re-convergence issue of today's traditional IP routing protocols, frequent network reconfigurations are generally deemed to be harmful as a result of routing table re-convergence. Furthermore, diurnal traffic behaviou

APA, Harvard, Vancouver, ISO, and other styles

22

Ganhão, Francisco José Dinis de Sousa Fernandes. "Multi-region routing." Master's thesis, FCT - UNL, 2009. http://hdl.handle.net/10362/2394.

Full text

Abstract:

Dissertação apresentada na Faculdade de Ciências e Tecnologia da Universidade Nova de Lisboa para a obtenção do grau de Mestre em Engenharia Electrotécnica e de Computadores<br>This 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 Intern

APA, Harvard, Vancouver, ISO, and other styles

23

Tamrakar, 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.

Full text

Abstract:

<p>With 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 net

APA, Harvard, Vancouver, ISO, and other styles

24

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.

Full text

APA, Harvard, Vancouver, ISO, and other styles

25

Kim, 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.

Full text

APA, Harvard, Vancouver, ISO, and other styles

26

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.

Full text

Abstract:

In IP networks using the OPSF-principle together with the ECMP-principle, thetraffic is routed in all shortest paths. Weights on links are set by an administrator,not knowing how the resulting routing pattern will become. In this final thesis, I givea heuristic solution to the problem of changing a set of desired routing patterns inan ordered way to make them compatible with each other. An implementation of thealgorithm has been made and some testing with provided data for performance is alsopresented.

APA, Harvard, Vancouver, ISO, and other styles

27

Ebada, 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.

Full text

Abstract:

In this thesis, an investigation of the performance of multipath routing in Wireless Sensor Networks (WSN) is performed. The communication in the network under study is to take place from individual nodes to the sink node. The investigation involved multipath finding methods in WSN. Also, it involves investigating the weight assignment, traffic splitting and route selection methods for the different paths discovered by each node in the WSN. Also, a comparison between Hybrid Routing Protocol, Source Routing Protocol and Diffusion Routing Protocol is performed. A simple traffic routing algori

APA, Harvard, Vancouver, ISO, and other styles

28

Bonezzi, 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/.

Full text

Abstract:

La maggior parte dei servizi di routing, sia web che mobile, quando fornisce un percorso per arrivare ad una determinata destinazione, suggerisce spesso il percorso più breve. L’obbiettivo di questo progetto di tesi è dimostrare che è possibile creare un servizio di routing che non indichi solamente il percorso più breve tra 2 punti, ma anche quello più emotivamente piacevole, rilassante, che aumenti il benessere di chi lo percorre. Per rendere ciò possibile, ci si è basati sull’utilizzo di foto geotaggate presenti su un sistema di archiviazione e condivisione foto online: Flickr. Si ipotizza

APA, Harvard, Vancouver, ISO, and other styles

29

Lu, Zhenxin, and 蘆振鑫. "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.

Full text

APA, Harvard, Vancouver, ISO, and other styles

30

Toler, 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.

Full text

APA, Harvard, Vancouver, ISO, and other styles

31

Macintosh, 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/.

Full text

Abstract:

A Mobile Ad Hoc Network (MANET) comprises mobile nodes (MNs), equipped with wireless communications devices; which form a temporary communication network without fixed network infrastructure or topology. The characteristics of MANET are: limited bandwidth; limited radio range; high mobility; and vulnerability to attacks that degrade the signal to noise ratio and bit error rates. These characteristics create challenges to MANET routing protocols. In addition, the mobility pattern of the MNs also has major impact on the MANET routing protocols. The issue of routing and maintaining packets betwee

APA, Harvard, Vancouver, ISO, and other styles

32

Kassahun, 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.

Full text

Abstract:

Fully distributed systems offer the highest level of freedom for the users. For this reason, in today’s Internet, it is recorded that more than 50% of the packets moving in and out belong to this type of network. Huge networks of this kind are built on the top of DHTs, which follow a more structured communication compared to the other small peer-to-peer networks. Although nature always favors freedom and independ-ence, security issues force consumers to set up their network in a cen-trally controlled manner. One of security threats posed on such net-works is lookup attacks. A lookup attacks ar

APA, Harvard, Vancouver, ISO, and other styles

33

Hampson, Ernest III. "High Speed Routing Table Lookups for Current and Next Generation Internet Routing." NSUWorks, 2002. http://nsuworks.nova.edu/gscis_etd/563.

Full text

Abstract:

This dissertation develops a new and efficient method of routing table lookups for the current and next generation Internet Protocols (IP). A router performs a table lookup to determine the next hop address on a data packet's path to its destination host. Next hop data is aggregated on variable-length prefixes that are derived from a destination host's network and sub-network (subnet) identifiers based on the Classless Inter-Domain Routing (CIDR) strategy. Since CIDR prefix length is arbitrary, a longest matching prefix (LMP) search must be performed to determine the next hop. Conventional sea

APA, Harvard, Vancouver, ISO, and other styles

34

Ozdemir, Emrah. "The Campaign Routing Problem." Master's thesis, METU, 2009. http://etd.lib.metu.edu.tr/upload/12610955/index.pdf.

Full text

Abstract:

In this study, a new selective and time-window routing problem is defined for the first time in the literature, which is called the campaign routing problem (CRP). The two special cases of the CRP correspond to the two real-life problems, namely political campaign routing problem (PCRP) and the experiments on wheels routing problem (EWRP). The PCRP is based on two main decision levels. In the first level, a set of campaign regions is selected according to a given criteria subject to the special time-window constraints. In the second level, a pair of selected regions or a single region is assig

APA, Harvard, Vancouver, ISO, and other styles

35

Werth, Thomas [Verfasser]. "Routing Games / Thomas Werth." München : Verlag Dr. Hut, 2014. http://d-nb.info/1051550041/34.

Full text

APA, Harvard, Vancouver, ISO, and other styles

36

Ahmed, Mustaq. "Ordered Interval Routing Schemes." Thesis, University of Waterloo, 2004. http://hdl.handle.net/10012/1137.

Full text

Abstract:

An <i>Interval Routing Scheme (IRS)</i> represents the routing tables in a network in a space-efficient way by labeling each vertex with an unique integer address and the outgoing edges at each vertex with disjoint subintervals of these addresses. An IRS that has at most <i>k</i> intervals per edge label is called a <i>k-IRS</i>. In this thesis, we propose a new type of interval routing scheme, called an <i>Ordered Interval Routing Scheme (OIRS)</i>, that uses an ordering of the outgoing edges at each vertex and allows nondisjoint intervals in the labels of those edges. Our results on a

APA, Harvard, Vancouver, ISO, and other styles

37

Zhang, Xinglong. "Network vehicle routing problems." Diss., Georgia Institute of Technology, 1998. http://hdl.handle.net/1853/21710.

Full text

APA, Harvard, Vancouver, ISO, and other styles

38

Geng, Yue. "On warehouse routing problems /." View abstract or full-text, 2005. http://library.ust.hk/cgi/db/thesis.pl?IEEM%202005%20GENG.

Full text

APA, Harvard, Vancouver, ISO, and other styles

39

Karaoglu, 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.

Full text

APA, Harvard, Vancouver, ISO, and other styles

40

Ahmed, Mustaq. "Ordered interal routing schemes." Waterloo, Ont. : University of Waterloo, 2004. http://etd.uwaterloo.ca/etd/m6ahmed2004.pdf.

Full text

Abstract:

Thesis (MMath)--University of Waterloo, 2004.<br>"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.

APA, Harvard, Vancouver, ISO, and other styles

41

Ramany, 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.

Full text

APA, Harvard, Vancouver, ISO, and other styles

42

Roumani, 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.

Full text

APA, Harvard, Vancouver, ISO, and other styles

43

Windmill, Christopher Mark. "Hierarchical network topographical routing." Thesis, University of Glasgow, 2013. http://theses.gla.ac.uk/4607/.

Full text

Abstract:

Within the last 10 years the content consumption model that underlies many of the assumptions about traffic aggregation within the Internet has changed; the previous short burst transfer followed by longer periods of inactivity that allowed for statistical aggregation of traffic has been increasingly replaced by continuous data transfer models. Approaching this issue from a clean slate perspective; this work looks at the design of a network routing structure and supporting protocols for assisting in the delivery of large scale content services. Rather than approaching a content support model t

APA, Harvard, Vancouver, ISO, and other styles

44

Twigg, Andrew David. "Compact forbidden-set routing." Thesis, University of Cambridge, 2006. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.614363.

Full text

APA, Harvard, Vancouver, ISO, and other styles

45

Sharma, Divya Alok. "Routing in opportunistic networks." Thesis, McGill University, 2014. http://digitool.Library.McGill.CA:80/R/?func=dbin-jump-full&object_id=121530.

Full text

Abstract:

Opportunistic networking is employed in scenarios where end-to-end communication paths between nodes cannot be assumed due to continuously changing network topology. In these networks, data is routed in a "store-carry-forward" fashion by exploiting the transient communication opportunities that arise when mobile nodes equipped with short-range wireless interfaces come within each other's transmission range. Designing efficient routing schemes for opportunistic networks is challenging as they face a trade-off between delivery performance and resource consumption. In this thesis, we propose a no

APA, Harvard, Vancouver, ISO, and other styles

46

Philpott, Mark Stuart. "Convoy routing under uncertainty." Thesis, University of East Anglia, 2004. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.405399.

Full text

APA, Harvard, Vancouver, ISO, and other styles

47

Rinklef, Michael. "Fault tolerant routing service." [S.l. : s.n.], 1999. http://www.bsz-bw.de/cgi-bin/xvms.cgi?SWB8862197.

Full text

APA, Harvard, Vancouver, ISO, and other styles

48

Uyar, Emrah. "Routing in stochastic environments." Diss., Atlanta, Ga. : Georgia Institute of Technology, 2008. http://hdl.handle.net/1853/26554.

Full text

Abstract:

Thesis (Ph.D)--Industrial and Systems Engineering, Georgia Institute of Technology, 2009.<br>Committee Co-Chair: Erera, Alan L.; Committee Co-Chair: Savelsbergh, Martin W. P.; Committee Member: Ergun, Ozlem; Committee Member: Ferguson, Mark; Committee Member: Kleywegt, Anton J.. Part of the SMARTech Electronic Thesis and Dissertation Collection.

APA, Harvard, Vancouver, ISO, and other styles

49

Maley, F. Miller. "Single-layer wire routing." Thesis, Massachusetts Institute of Technology, 1987. http://hdl.handle.net/1721.1/14657.

Full text

APA, Harvard, Vancouver, ISO, and other styles

50

Key, Jonathan Ramsay 1976. "Routing in probabilistic networks." Thesis, Massachusetts Institute of Technology, 2004. http://hdl.handle.net/1721.1/29387.

Full text

Abstract:

Thesis (S.M.)--Massachusetts Institute of Technology, Dept. of Civil and Environmental Engineering; and, (S.M.)--Massachusetts Institute of Technology, Operations Research Center, 2004.<br>Includes bibliographical references (p. 143-146).<br>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 t

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!