To see the other types of publications on this topic, follow the link: Routing.
Dissertations / Theses on the topic 'Routing'
Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles
Consult the top 50 dissertations / theses for your research on the topic '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
Mü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
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 textAbstract:
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 and compared according to their multicast tree construction and resource reservation approaches. Two QoS protocols, QROUTE and QMBF, are selected, and their performances are experimentally compared using the network simulation tool Network Simulator-2 (ns-2). The objective of the simulations is to compare the QoS routing algorithms and their tree construction efficiencies. The first contribution of the thesis is the survey and classification of traditional and QoS multicast routing protocols. Another contribution is the ns-2 implementation of two QoS multicast routing protocols. The final contribution of the thesis is the performance evaluation of the recent protocols from a different perspective.
3
Mourgaya, Virapatrin Magalie. "The periodic vehicle routing problem : planning before routing." Bordeaux 1, 2004. http://www.theses.fr/2004BOR12843.
Full textAbstract:
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 minimisation des distances parcourues est reporté au niveau des décisions opérationnelles. Cette approche nous a permis d'obtenir des solutions pratiques pour un problème industriel avec 16658 visites à planifier sur un horizon de 20 jours. Nous proposons enfin un heuristique d'arrondi basé sur la méthode de génération de colonnes. Cette méthode basée sur l'optimisation globale permet d'obtenir des solutions de meilleure qualité pour les problèmes de planification à court terme avec de l'ordre de 50 clients.
4
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
5
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 textAbstract:
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 problem som hur användarna ska vara uppkopplade tillInternet tas upp i rapporten. Nätverket använder sig av OSPF som routingprotokoll.Varje kontor delas in i områden, totallystubby area, vilket kortar nedroutingtabellen i Stockholm. Resultatet blir att snabba beslut tas när paket skaskickas inom ett kontor och när det ska utanför ett kontor så används en defaultroute. Samtidigt som kontoren är lätta att bygga ut då totallystubby area har endefault route till Stockholm.
6
Campbell, Ann Melissa. "Inventory routing." Diss., Georgia Institute of Technology, 2000. http://hdl.handle.net/1853/25530.
Full text
7
Chaudhray, Kamal. "VLSI routing." Thesis, University of Cambridge, 1990. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.359367.
Full text
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 textAbstract:
<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 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.
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
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 textAbstract:
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 software capabilities that require the most development according to the new challenges that the industry is facing. Responses suggested that companies required improved route optimization to tackle congestion based on time-dependent data and models, and greater accuracy in the representation of the road network. Not considering congestion leads to the underestimation of travel times and the production of inaccurate schedules. Literature shows that operational research techniques are available to solve problems that represent real world conditions, but research into the relative merits of using time-dependent models needs to be undertaken. Although exact methods have been developed to solve the Vehicle Routing Problem, they cannot cope with large instances and rich variants that are required by the industry. Therefore, metaheuristic algorithms are usually implemented in routing software. A reported barrier in metaheuristic algorithms is the lack of accuracy (the difference between optimal or best-known values and the result of the proposed algorithm). In this research an algorithm was developed using elements of Large Neighbourhood Search that is capable to substantially improve the state of the art for the time-dependent Vehicle Routing Problem. Comparison of results with available test instances shows that the proposed algorithm is capable of obtaining a reduction in the number of vehicles (4.15%), travel distance (10.88%) and travel time (12.00%) compared to previous implementations in reasonable time. A variant that considers the Rules on Drivers’ hours required in the scheduling of vehicles over 3.5 tons in the European Union and the UK is also introduced. Analysis of results show result improvements in number of vehicles (19.0%), travel distance (17.7%) and route duration (4.4%) compared to previous implementations.
11
Fischer, Simon. "Dynamic selfish routing." [S.l.] : [s.n.], 2007. http://deposit.ddb.de/cgi-bin/dokserv?idn=985433612.
Full text
12
Oertel, Peter. "Routing with reloads." [S.l. : s.n.], 2000. http://deposit.ddb.de/cgi-bin/dokserv?idn=962299820.
Full text
13
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 textAbstract:
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 will introduce the term of routing and the new approach in the process of selecting paths. We will show some simple examples. We will also pint out how we can learn about matrices in the classroom. At the end we will discuss about advantages and potential disadvantages that may occur in the described technique.
14
Song, Jin-Hwa. "Inventory Routing Investigations." Diss., Georgia Institute of Technology, 2004. http://hdl.handle.net/1853/5028.
Full textAbstract:
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 the effectiveness of their distribution strategy. This technology can also be used to suggest desirable delivery patterns and to analyze tactical and strategic decisions.
Secondly, we study the inventory routing problem with continuous moves (IRP-CM). The typical inventory routing problem deals with the repeated distribution of a single product, from a single facility, with an unlimited supply, to a set of customers that can all be reached with out-and-back trips. Unfortunately, this is not always the reality. We introduce the IRP-CM to study two important real-life complexities: limited product
availabilities at facilities and customers that cannot be served using out-and-back tours. We need to design delivery tours spanning several days, covering huge geographic areas, and involving product pickups at different facilities. We develop a heuristic and an optimization algorithm to construct distribution
plans. The heuristic is an innovative randomized greedy algorithm, which includes linear programming based postprocessing technology. To solve the IRP-CM to optimality, we give a time-discretized integer programming model and develop a branch-and-cut algorithm. As instances of time-discretized models tend to be large we discuss several possibilities for reducing the problem size. We introduce a set of valid inequalities, called delivery cover inequalities, in order to tighten the bounds given by the LP relaxation of the time-discretized model. We also introduce
branching schemes exploiting the underlying structure of the IRP-CM. An extensive computational study demonstrates the effectiveness of the optimization algorithm. Finally, we present an integrated approach using heuristics and optimization algorithms providing effective and efficient technology for solving inventory problems with continuous moves.
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
16
Avgouleas, Kyriakos. "Optimal ship routing." Thesis, Massachusetts Institute of Technology, 2008. http://hdl.handle.net/1721.1/44861.
Full textAbstract:
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-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.<br>by Kyriakos Avgouleas.<br>Nav.E.and S.M.
17
Ganhão, Francisco José Dinis de Sousa Fernandes. "Multi-region routing." Master's thesis, FCT - UNL, 2009. http://hdl.handle.net/10362/2394.
Full textAbstract:
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 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.
18
Adamek, Jordan Matthew. "Concurrent Geometric Routing." Kent State University / OhioLINK, 2017. http://rave.ohiolink.edu/etdc/view?acc_num=kent1501087573328402.
Full text
19
Okonor, O. "Green backbone routing." Thesis, University of Surrey, 2016. http://epubs.surrey.ac.uk/809529/.
Full textAbstract:
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 behaviours are unpredictable and can lead to network congestion as a result of the reduced network resources. This thesis presents novel event-driven green backbone routing schemes for network managements which are capable of saving energy in fixed IP networks (using both regular and non-regular traffic matrix) without inhibiting its performance. First, a Link Wake-up Optimisation Technique (LiWOT) is proposed during energy saving periods when the pruned topology is applied. The key novelty here is that LiWOT selects the minimum number of router's line cards to wake-up when the network is congestion is detected. This is contrary to the norms of reverting to the full network topology or on-the-fly network reconfigurations in the case of even minor traffic surge and thereby sacrificing energy savings. In order to mitigate the effect of routing re-convergence in networks, LiWOT prioritises the waking up of non-disruptive sleeping links. This scheme was further extended to a fully disruption-free scheme. The second proposed scheme is the Green Link Weight Disruption-Free Energy-aware Traffic Engineering which limits its wake-up operation to only non-disruptive links. In order to maximise the energy savings, the number of this type of links are maximised in an offline manner. Using a genetic algorithm based approach, a new link weight optimisation scheme is proposed and this forms the basis of the second research contribution. Finally, a completely dynamic link sleeping reconfigurations (DLSR) for green traffic engineering is proposed. The scheme coordinates the sleep and wake-up operations in a dynamic way such that operations are based on the current traffic. The key contribution is that DLSR is oblivious of historical traffic conditions like the previous schemes and can enhance energy savings by putting back woken-up links to sleeping mode during low traffic. The performances of the three schemes were evaluated using the publicly accessible traffic traces of both GEANT and Abilene network respectively over a period of one week and the obtained results show a substantial amount of energy saving.
20
Fox, Michael (Michael Robert) Carleton University Dissertation Mathematics. "Random alternative routing." Ottawa, 1994.
Find full text
21
Franz, Patrick. "Minimum Risk Routing." [S.l. : s.n.], 2007. http://nbn-resolving.de/urn:nbn:de:bsz:747-opus-245.
Full text
22
Fulgham, Melanie L. "Multicomputer routing techniques /." Thesis, Connect to this title online; UW restricted, 1997. http://hdl.handle.net/1773/7021.
Full text
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 textAbstract:
<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 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.</p>
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
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
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 textAbstract:
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.
27
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 textAbstract:
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 che un luogo geografico in cui sono state scattate molte fotografie, sia allora un luogo piacevole da visitare o da cui transitare. Questa ipotesi fondamentale guida quindi alla creazione di un percorso secondario, più piacevole, che passi da determinati punti di interesse.
In questo elaborato viene descritta l’implementazione e la progettazione di una piattaforma che abbia l’obbiettivo di mettere a disposizione degli utenti il servizio di routing appena descritto. È stato utilizzato un server Apache sul quale alcuni script PHP si occupano di gestire le richieste del Client e calcolare, tramite un opportuno algoritmo, il percorso adatto alle loro richieste. Inoltre è stata sviluppata un’applicazione Android, Client-side, su cui l’utente può effettuare richieste e visualizzare percorsi.
28
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 textAbstract:
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 are kind of attacks which targets on disrupting the healthy routing process of the DHTs. Even though the freedom of peer-to-peer networks comes at the cost of securi-ty, it is quite attainable to make the network more secure, especially, it is quite achievable to gain performance on this level of attack according to the experiments carried out in this thesis. The secure routing techniques introduced have been found to outperform those without the techniques under investigation. The simulation performed for default Chord overly and the modified Chord, yielded interesting results, for dropper nodes, random lookup routs and colluding sub-ring attacks.
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
30
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 textAbstract:
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 search techniques do not work well for LMP search. However, if lookups are not done efficiently, a bottleneck develops at the router, and the performance of the network is degraded. Although research into lookup strategies has progressed over the last decade, no method has been proven to perform well for both current IP routing, IP version 4 (IPv4), and next generation IP (IPng or IPv6). Furthermore, most researchers ignore dynamic updates to the routing table and their effect on the actual throughput rate. The method advanced in this dissertation is based in software, scales well with regards to the length of the address, and supports multi-gigabit routing even with updates included. To achieve this notable improvement, an original scheme called PHASE, for perfect hashing across segmented expansions, was constructed. PHASE stores prefixes in a hierarchy of segment tables, partitioning each prefix into discrete segments. The algorithm expands each segment such that every segment in a table is of uniform length. A search progresses by segmenting the target address and using single-displacement perfect hashing to perform lookups across the segment tables. The result is a bounded worst-case performance of two accesses for IPv4 and eight accesses for IPv6. The IPv6 worst-case is comparable to that of some contemporary IPv4 techniques. Additionally, PHASE provides a dynamic update method that performs two orders of magnitude better than other suggested techniques, and eliminates memory fragmentation.
31
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
32
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 textAbstract:
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 between MNs in the mobile ad hoc networks (MANETs) has always been a challenge; i.e. encountering broadcast storm under high node density, geographically constrained broadcasting of a service discovery message and local minimum problem under low node density. This requires an efficient design and development of a lightweight routing algorithm which can be handled by those GPS equipped devices. Most proposed location based routing protocols however, rely on a single route for each data transmission. They also use a location based system to find the destination address of MNs which over time, will not be accurate and may result in routing loop or routing failure. Our proposed lightweight protocol, ‘Local Area Network Dynamic Routing’ (LANDY) uses a localized routing technique which combines a unique locomotion prediction method and velocity information of MNs to route packets. The protocol is capable of optimising routing performance in advanced mobility scenarios, by reducing the control overhead and improving the data packet delivery. In addition, the approach of using locomotion prediction, has the advantage of fast and accurate routing over other position based routing algorithms in mobile scenarios. Recovery with LANDY is faster than other location protocols, which use mainly greedy algorithms, (such as GPRS), no signalling or configuration of the intermediate nodes is required after a failure. The key difference is that it allows sharing of locomotion and velocity information among the nodes through locomotion table. The protocol is designed for applications in which we expect that nodes will have access to a position service (e.g., future combat system). Simulation results show that LANDY`s performance improves upon other position based routing protocols.
33
PICCONI, 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.
Full textAbstract:
A deep exploration of the issues related to routing decisions in inter-domain routing is the scope of this thesis, through the analysis of the interconnection structure and the network hierarchy, the examination of the inter-domain routing protocol used to exchange network reachability information with other systems, the examination of the routing decision process between the entities according to their attributes and policies, the study of the topology generators of the AS relationships, reviewing the most interesting proposals in this area, describing why these issues are difficult to solve, and proposing solutions allowing to better understand the routing process and optimally solve the trade-off of implementing a Peering Engagement between two Autonomous Systems, against the extra cost that this solution represent.
More specifically this thesis introduces a new scheme for the routing decision in a BGP speaker through a formalization of the routing decision process, and proposes a formulation of a real and exhaustive mathematical model of a Peering Engagement between Autonomous Systems, to be solved as a problem of maximization with an ad-hoc built Decision Support System (XESS) able to find an optimal reduced set of solutions to the proposed problem. --------------------------------------------------------------------------
ABSTRACT [IT]
Un’analisi approfondita delle tematiche inerenti le decisioni di routing nel routing interdominio è oggetto di questa tesi, attraverso l’esame della struttura di interconnessione e delle gerarchia del network, lo studio del protocollo utilizzato nel routing interdominio per scambiare le informazioni di reachability con gli altri sistemi, l’analisi del processo decisionale tra le entità coinvolte nello scambio di tali informazioni in accordo con le politiche e gli attributi, lo studio delle topologie sintetiche derivate dallo studio delle relazioni tra gli AS, attraverso i lavori di ricerca in quest’area, la descrizione dei problemi e delle difficoltà, e offrendo un contributo atto a fornire una maggiore comprensione del processo decisionale nel routing interdominio e una soluzione per l’implementazione di un processo di Peering tra Autonomous System.
In particolare, questa tesi introduce un nuovo modello per il processo decisionale in uno speaker BGP attraverso la formalizzazione del routing decision process, e propone un modello matematico esaustivo delle meccaniche legate al processo di Peering Engagement tra Autonomous System, da analizzare come problema di massimizzazione e da risolvere con un Decision Support System (XESS) creato per trovare un sottoinsieme ottimo di soluzioni al problema matematico proposto.
34
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 textAbstract:
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 algorithm for each routing protocol has been developed to conceptualize how the network traffic is routed on a set of active paths. The investigation of the Hybrid, Source and Diffusion Routing Protocol involved using multiple paths simultaneously to transmit messages that belong to the same flow by using a weight assigned to each path and transmit each message as a whole. Finally, the power consumption and the QoS in terms of message delays for a WSN were investigated and compared between different protocols.
35
Berlati, Alessandro. "Opportunistic Contact Graph Routing." Bachelor's thesis, Alma Mater Studiorum - Università di Bologna, 2016. http://amslaurea.unibo.it/11327/.
Full textAbstract:
L'ambiente di questa tesi è quello del Delay and Disruption Tolerant Networks (DTN), un'architettura di rete di telecomunicazioni avente come obiettivo le comunicazioni tra nodi di reti dette “challenged”, le quali devono affrontare problemi come tempi di propagazione elevati, alto tasso di errore e periodi di perdita delle connessioni. Il Bunde layer, un nuovo livello inserito tra trasporto e applicazione nell’architettura ISO/OSI, ed il protocollo ad esso associato, il Bundle Protocol (BP), sono stati progettati per rendere possibili le comunicazioni in queste reti. A volte fra la ricezione e l’invio può trascorrere un lungo periodo di tempo, a causa della indisponibilità del collegamento successivo; in questo periodo il bundle resta memorizzato in un database locale. Esistono varie implementazioni dell'architettura DTN come DTN2, implementazione di riferimento, e ION (Interplanetary Overlay Network), sviluppata da NASA JPL, per utilizzo in applicazioni spaziali; in esse i contatti tra i nodi sono deterministici, a differenza delle reti terrestri nelle quali i contatti sono generalmente opportunistici (non noti a priori). Per questo motivo all’interno di ION è presente un algoritmo di routing, detto CGR (Contact Graph Routing), progettato per operare in ambienti con connettività deterministica. È in fase di ricerca un algoritmo che opera in ambienti non deterministici, OCGR (Opportunistic Contact Graph Routing), che estende CGR.
L’obiettivo di questa tesi è quello di fornire una descrizione dettagliata del funzionamento di OCGR, partendo necessariamente da CGR sul quale è basato, eseguire dei test preliminari, richiesti da NASA JPL, ed analizzarne i risultati per verificare la possibilità di utilizzo e miglioramento dell’algoritmo. Sarà inoltre descritto l’ambiente DTN e i principali algoritmi di routing per ambienti opportunistici. Nella parte conclusiva sarà presentato il simulatore DTN “The ONE” e l’integrazione di CGR e OCGR al suo interno.
36
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
37
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
38
Ahmed, Mustaq. "Ordered interal routing schemes." Waterloo, Ont. : University of Waterloo, 2004. http://etd.uwaterloo.ca/etd/m6ahmed2004.pdf.
Full textAbstract:
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.
39
Ozdemir, Emrah. "The Campaign Routing Problem." Master's thesis, METU, 2009. http://etd.lib.metu.edu.tr/upload/12610955/index.pdf.
Full textAbstract:
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 assigned to a campaign day. In the EWRP, a single selected region (school) is assigned to a campaign day. These two problems are modeled using classical mathematical programming and bi-level programming methods, and a two-step heuristic approach is developed for the solution of the problems. Implementation of the solution methods is done using the test instances that are compiled from the real-life data. Computational results show that the solution methods developed generate good solutions in reasonable time.
40
Werth, Thomas [Verfasser]. "Routing Games / Thomas Werth." München : Verlag Dr. Hut, 2014. http://d-nb.info/1051550041/34.
Full text
41
Ahmed, Mustaq. "Ordered Interval Routing Schemes." Thesis, University of Waterloo, 2004. http://hdl.handle.net/10012/1137.
Full textAbstract:
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 number of graphs show that using an OIRS instead of an IRS reduces the size of the routing tables in the case of <i>optimal</i> routing, i. e. , routing along shortest paths. We show that optimal routing in any <i>k</i>-tree is possible using an OIRS with at most 2<sup>k-1</sup> intervals per edge label, although the best known result for an IRS is 2<sup>k+1</sup> intervals per edge label. Any torus has an optimal 1-OIRS, although it may not have an optimal 1-IRS. We present similar results for the Petersen graph, <i>k</i>-garland graphs and a few other graphs.
42
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
43
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
44
Zhang, Xinglong. "Network vehicle routing problems." Diss., Georgia Institute of Technology, 1998. http://hdl.handle.net/1853/21710.
Full text
45
Windmill, Christopher Mark. "Hierarchical network topographical routing." Thesis, University of Glasgow, 2013. http://theses.gla.ac.uk/4607/.
Full textAbstract:
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 through existing IP models the work takes a fresh look at Internet routing through a hierarchical model in order to highlight the benefits that can be gained with a new structural Internet or through similar modifications to the existing IP model. The work is divided into three major sections: investigating the existing UK based Internet structure as compared to the traditional Autonomous System (AS) Internet structural model; a localised hierarchical network topographical routing model; and intelligent distributed localised service models. The work begins by looking at the United Kingdom (UK) Internet structure as an example of a current generation technical and economic model with shared access to the last mile connectivity and a large scale wholesale network between Internet Service Providers (ISPs) and the end user. This model combined with the Internet Protocol (IP) address allocation and transparency of the wholesale network results in an enforced inefficiency within the overall network restricting the ability of ISPs to collaborate. From this model a core / edge separation hierarchical virtual tree based routing protocol based on the physical network topography (layers 2 and 3) is developed to remove this enforced inefficiency by allowing direct management and control at the lowest levels of the network. This model acts as the base layer for further distributed intelligent services such as management and content delivery to enable both ISPs and third parties to actively collaborate and provide content from the most efficient source.
46
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
47
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 textAbstract:
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 novel opportunistic routing algorithm that addresses this trade-off by incorporating information about the node contact pattern in the network. Aggregating contact events into a weighted graph enables us to detect communities and learn about the neighbourhoods of nodes. This information is utilized by our algorithm to assess the usefulness of every forwarding opportunity that arises. Performance evaluation of the proposed algorithm shows that it is capable of achieving good delivery performance while consuming significantly fewer resources in comparison to the existing opportunistic routing algorithms.<br>Le 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.
48
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
49
Maley, F. Miller. "Single-layer wire routing." Thesis, Massachusetts Institute of Technology, 1987. http://hdl.handle.net/1721.1/14657.
Full text
50
Key, Jonathan Ramsay 1976. "Routing in probabilistic networks." Thesis, Massachusetts Institute of Technology, 2004. http://hdl.handle.net/1721.1/29387.
Full textAbstract:
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 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.<br>(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.<br>by Jonathan Ramsay Key.<br>S.M.