subject:(Routing)

Université de Neuchâtel

1. Serbu, Sabina. Load management in peer-to-peer systems: structures and algorithms.

Degree: 2010, Université de Neuchâtel

► Dans cette thèse, nous présentons plusieurs techniques inédites pour la gestion de charge dans les systèmes pair-à-pair. Nous abordons deux types de systèmes pair-à-pair: les… (more)

▼ Dans cette thèse, nous présentons plusieurs techniques inédites pour la gestion de charge dans les systèmes pair-à-pair. Nous abordons deux types de systèmes pair-à-pair: les systèmes de recherche d’information (en particulier DHTs), où nous définissons de nouvelles solutions pour l’équilibrage de charge, et les systèmes de diffusion d’information, où nous définissons de nouvelles méthodes de réduction de charge. Tout d’abord, nous présentons le contexte des systèmes pair-à-pair et nous élaborons sur les solutions existantes en matière de gestion de charge. Nous les classifions en trois différentes catégories: le placement des objets, le trafic de routage et la sous-couche (underlay). Bien que les deux premières catégories visent avant tout les systèmes de recherche d’information, portant sur l’affectation objet-à-nœud et sur les stratégies de routage appliquées pour la recherche d’objet, la dernière catégorie est plus générale. Tout recouvrement (overlay), quel que soit son applicabilité, doit avoir une certaine connaissance de son sous-couche afin de pouvoir gérer sa charge de trafic. Nous apportons trois solutions à la gestion de charge dans les systèmes pair-à-pair. Nous proposons HyPeer, un recouvrement de type DHT avec équilibrage dans l’espace de noms qui offre un choix flexible entre plusieurs stratégies de routage. à cette fin, nous avons construit la structure de HyPeer uniforme et régulière, où les nœuds sont consciencieusement placés. Le but est de fournir une <i>redondance des chemins</i> (path redundancy), où les chemins ont des longueurs similaires. Avec plusieurs chemins entre deux nœuds, de nombreuses différentes stratégies de routage peuvent être appliquées. Nous proposons quatre stratégies visant les plus communs objectifs: chemin court, délai faible, tolérance de panne et, le plus important dans notre contexte, équilibrage de charge de routage. Nos stratégies atteignent toutes de très bons résultats au coût de juste quelques calculs locaux pour déterminer le saut suivant dans le chemin. En outre, le recouvrement soutient la définition de nouvelles stratégies de routage ou le raffinage des stratégies de routage existantes avec de nouvelles métriques. Pour les autres DHTs existants, nous proposons une solution d’équilibrage de charge de routage qui peut ˆêtre appliquée à tout recouvrement qui permet une flexibilité dans le choix des voisins. Notre solution est adaptative et elle est basée sur la <i>réorganisation des liens</i> (link reorganization): en fonction de la fluctuation de charge dans le système, les voisins les plus chargés sont écartés, le trafic étant dirigé vers des pairs moins chargés. Cette solution a peu de frais, ne génère pas de messages supplémentaires et la réorganisation des liens est déclenché que lorsque la charge atteint des valeurs trop élevées. Dans les systèmes de diffusion d’information, nous proposons une nouvelle stratégie pour réduire la charge au niveau sous-couche. Nous n’utilisons pas le hasard comme les stratégies classiques le font, ce qui génère une charge de… Advisors/Committee Members: Peter (Dir.).

Subjects/Keywords: routing

Record Details Similar Records Cite « Share

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^th Edition):

Serbu, S. (2010). Load management in peer-to-peer systems: structures and algorithms. (Thesis). Université de Neuchâtel. Retrieved from http://doc.rero.ch/record/18097

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16^th Edition):

Serbu, Sabina. “Load management in peer-to-peer systems: structures and algorithms.” 2010. Thesis, Université de Neuchâtel. Accessed February 24, 2021. http://doc.rero.ch/record/18097.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^th Edition):

Serbu, Sabina. “Load management in peer-to-peer systems: structures and algorithms.” 2010. Web. 24 Feb 2021.

Vancouver:

Serbu S. Load management in peer-to-peer systems: structures and algorithms. [Internet] [Thesis]. Université de Neuchâtel; 2010. [cited 2021 Feb 24]. Available from: http://doc.rero.ch/record/18097.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Serbu S. Load management in peer-to-peer systems: structures and algorithms. [Thesis]. Université de Neuchâtel; 2010. Available from: http://doc.rero.ch/record/18097

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

NSYSU

2. Tsai, Ming-jia. Multipath Routing Based on Real-Time Traffic Information in VANET.

Degree: Master, Computer Science and Engineering, 2010, NSYSU

URL: http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0725110-233833

► VANET (Vehicular Ad-hoc NETwork) is a subclass of MANET (Mobile Ad-hoc NETwork). Since nodes in a VANET are usually high-speed mobile vehicles, the network topology… (more)

Subjects/Keywords: Vanet; Routing

Record Details Similar Records Cite « Share

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^th Edition):

Tsai, M. (2010). Multipath Routing Based on Real-Time Traffic Information in VANET. (Thesis). NSYSU. Retrieved from http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0725110-233833

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16^th Edition):

Tsai, Ming-jia. “Multipath Routing Based on Real-Time Traffic Information in VANET.” 2010. Thesis, NSYSU. Accessed February 24, 2021. http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0725110-233833.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^th Edition):

Tsai, Ming-jia. “Multipath Routing Based on Real-Time Traffic Information in VANET.” 2010. Web. 24 Feb 2021.

Vancouver:

Tsai M. Multipath Routing Based on Real-Time Traffic Information in VANET. [Internet] [Thesis]. NSYSU; 2010. [cited 2021 Feb 24]. Available from: http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0725110-233833.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Tsai M. Multipath Routing Based on Real-Time Traffic Information in VANET. [Thesis]. NSYSU; 2010. Available from: http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0725110-233833

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Victoria University of Wellington

3. Shepherd, Deb. Developing the Fringe Routing Protocol.

Degree: 2011, Victoria University of Wellington

URL: http://hdl.handle.net/10063/1981

► An ISP style network often has a particular traffic pattern not typically seen in other networks and which is a direct result of the ISP’s… (more)

Subjects/Keywords: Computer networking; Routing; Fringe routing protocol

Record Details Similar Records Cite « Share

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^th Edition):

Shepherd, D. (2011). Developing the Fringe Routing Protocol. (Masters Thesis). Victoria University of Wellington. Retrieved from http://hdl.handle.net/10063/1981

Chicago Manual of Style (16^th Edition):

Shepherd, Deb. “Developing the Fringe Routing Protocol.” 2011. Masters Thesis, Victoria University of Wellington. Accessed February 24, 2021. http://hdl.handle.net/10063/1981.

MLA Handbook (7^th Edition):

Shepherd, Deb. “Developing the Fringe Routing Protocol.” 2011. Web. 24 Feb 2021.

Vancouver:

Shepherd D. Developing the Fringe Routing Protocol. [Internet] [Masters thesis]. Victoria University of Wellington; 2011. [cited 2021 Feb 24]. Available from: http://hdl.handle.net/10063/1981.

Council of Science Editors:

Shepherd D. Developing the Fringe Routing Protocol. [Masters Thesis]. Victoria University of Wellington; 2011. Available from: http://hdl.handle.net/10063/1981

4. Gnanambal I. Optimization of traffic routing and Handling of network congestion;.

Degree: Optimization of traffic routing and Handling of network congestion, 2014, Anna University

URL: http://shodhganga.inflibnet.ac.in/handle/10603/26724

►

The problem of finding efficient routing algorithms has been a field newlineof research in the area of data network Routing is the act of moving… (more)

Subjects/Keywords: Data network Routing

Record Details Similar Records Cite « Share

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^th Edition):

I, G. (2014). Optimization of traffic routing and Handling of network congestion;. (Thesis). Anna University. Retrieved from http://shodhganga.inflibnet.ac.in/handle/10603/26724

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16^th Edition):

I, Gnanambal. “Optimization of traffic routing and Handling of network congestion;.” 2014. Thesis, Anna University. Accessed February 24, 2021. http://shodhganga.inflibnet.ac.in/handle/10603/26724.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^th Edition):

I, Gnanambal. “Optimization of traffic routing and Handling of network congestion;.” 2014. Web. 24 Feb 2021.

Vancouver:

I G. Optimization of traffic routing and Handling of network congestion;. [Internet] [Thesis]. Anna University; 2014. [cited 2021 Feb 24]. Available from: http://shodhganga.inflibnet.ac.in/handle/10603/26724.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

I G. Optimization of traffic routing and Handling of network congestion;. [Thesis]. Anna University; 2014. Available from: http://shodhganga.inflibnet.ac.in/handle/10603/26724

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

University of Ottawa

5. Ebada, Mohamed. Multipath Routing for Wireless Sensor Networks: A Hybrid Between Source Routing and Diffusion Techniques .

Degree: 2011, University of Ottawa

URL: http://hdl.handle.net/10393/19887

► 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… (more)

Subjects/Keywords: Multipath Routing; Wireless Sensor Networks; WSN; Source Routing; Diffusion Routing; Hybrid Routing

Record Details Similar Records Cite « Share

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^th Edition):

Ebada, M. (2011). Multipath Routing for Wireless Sensor Networks: A Hybrid Between Source Routing and Diffusion Techniques . (Thesis). University of Ottawa. Retrieved from http://hdl.handle.net/10393/19887

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16^th Edition):

Ebada, Mohamed. “Multipath Routing for Wireless Sensor Networks: A Hybrid Between Source Routing and Diffusion Techniques .” 2011. Thesis, University of Ottawa. Accessed February 24, 2021. http://hdl.handle.net/10393/19887.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^th Edition):

Ebada, Mohamed. “Multipath Routing for Wireless Sensor Networks: A Hybrid Between Source Routing and Diffusion Techniques .” 2011. Web. 24 Feb 2021.

Vancouver:

Ebada M. Multipath Routing for Wireless Sensor Networks: A Hybrid Between Source Routing and Diffusion Techniques . [Internet] [Thesis]. University of Ottawa; 2011. [cited 2021 Feb 24]. Available from: http://hdl.handle.net/10393/19887.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Ebada M. Multipath Routing for Wireless Sensor Networks: A Hybrid Between Source Routing and Diffusion Techniques . [Thesis]. University of Ottawa; 2011. Available from: http://hdl.handle.net/10393/19887

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Delft University of Technology

6. van Wee, Bas (author). Mapping of quantum algorithms on a quantum chip: 2D topology with nearest neighbor interaction.

Degree: 2017, Delft University of Technology

URL: http://resolver.tudelft.nl/uuid:7c6c37df-2ca8-44a7-9b85-efcd7df0e077

►

Quantum algorithms can be described by quantum circuits which consist of quantum bits (qubits) and quantum gates. Such a circuit description assumes that any kind… (more)

▼

Quantum algorithms can be described by quantum circuits which consist of quantum bits (qubits) and quantum gates. Such a circuit description assumes that any kind of interaction between qubits is possible. However, quantum chips have limited qubits connectivity only allowing, for instance, nearest-neighbor (NN) interactions. That means, qubits need to be placed in adjacent positions for performing a two-qubit gate. In this thesis, a routing algorithm is proposed where physical qubits or planar-based logical qubits are routed to obey this nearest neighbor constraint in a 2D qubit topology. This algorithm tries to minimize the circuit latency or communication overhead. The proposed routing algorithm is based on a sliding window principle. Different paths, found by using an adapted breadth-first search algorithm, are evaluated based on the interleaving of the corresponding routing instructions, e.g., SWAP operations with previous instructions, and by looking at the disordering of future qubits. The path that will add the lowest number of cycles to the algorithm is then selected and efficiently inserted with the rest of the instructions. This process continues until all the instructions inside the quantum algorithm obey the nearest neighbor constraints. The routing algorithm is tested for several real quantum algorithms taken from QLib and ScaffCC, as well as for random generated benchmarks. Taking different alternative paths into account and evaluating those paths for possible interleaving with previous instructions, always has a positive effect to minimize the number of added cycles. The results concerning the evaluation of the disordering of future qubits could have a positive or negative effect on the circuit latency depending on the quantum circuit.

Electrical Engineering / Microelectronics

Advisors/Committee Members: García Almudever, Carmina (mentor), Bertels, Koen (mentor), Möller, Matthias (graduation committee), Delft University of Technology (degree granting institution).

Subjects/Keywords: Quantum; Mapping; Routing

Record Details Similar Records Cite « Share

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^th Edition):

van Wee, B. (. (2017). Mapping of quantum algorithms on a quantum chip: 2D topology with nearest neighbor interaction. (Masters Thesis). Delft University of Technology. Retrieved from http://resolver.tudelft.nl/uuid:7c6c37df-2ca8-44a7-9b85-efcd7df0e077

Chicago Manual of Style (16^th Edition):

van Wee, Bas (author). “Mapping of quantum algorithms on a quantum chip: 2D topology with nearest neighbor interaction.” 2017. Masters Thesis, Delft University of Technology. Accessed February 24, 2021. http://resolver.tudelft.nl/uuid:7c6c37df-2ca8-44a7-9b85-efcd7df0e077.

MLA Handbook (7^th Edition):

van Wee, Bas (author). “Mapping of quantum algorithms on a quantum chip: 2D topology with nearest neighbor interaction.” 2017. Web. 24 Feb 2021.

Vancouver:

van Wee B(. Mapping of quantum algorithms on a quantum chip: 2D topology with nearest neighbor interaction. [Internet] [Masters thesis]. Delft University of Technology; 2017. [cited 2021 Feb 24]. Available from: http://resolver.tudelft.nl/uuid:7c6c37df-2ca8-44a7-9b85-efcd7df0e077.

Council of Science Editors:

van Wee B(. Mapping of quantum algorithms on a quantum chip: 2D topology with nearest neighbor interaction. [Masters Thesis]. Delft University of Technology; 2017. Available from: http://resolver.tudelft.nl/uuid:7c6c37df-2ca8-44a7-9b85-efcd7df0e077

Victoria University of Wellington

7. Iqbal, Aun Haji. Development of Osix - A Peering Point in a Box.

Degree: 2013, Victoria University of Wellington

URL: http://hdl.handle.net/10063/2699

► Sending traffic over international communication links is much more expensive than sending traffic locally. Unfortunately, there are situations where two local networks end up using… (more)

Subjects/Keywords: Peering; Exchange; Routing

Record Details Similar Records Cite « Share

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^th Edition):

Iqbal, A. H. (2013). Development of Osix - A Peering Point in a Box. (Masters Thesis). Victoria University of Wellington. Retrieved from http://hdl.handle.net/10063/2699

Chicago Manual of Style (16^th Edition):

Iqbal, Aun Haji. “Development of Osix - A Peering Point in a Box.” 2013. Masters Thesis, Victoria University of Wellington. Accessed February 24, 2021. http://hdl.handle.net/10063/2699.

MLA Handbook (7^th Edition):

Iqbal, Aun Haji. “Development of Osix - A Peering Point in a Box.” 2013. Web. 24 Feb 2021.

Vancouver:

Iqbal AH. Development of Osix - A Peering Point in a Box. [Internet] [Masters thesis]. Victoria University of Wellington; 2013. [cited 2021 Feb 24]. Available from: http://hdl.handle.net/10063/2699.

Council of Science Editors:

Iqbal AH. Development of Osix - A Peering Point in a Box. [Masters Thesis]. Victoria University of Wellington; 2013. Available from: http://hdl.handle.net/10063/2699

University of Kentucky

8. Mahmood, Baban A. Routing and Security in Mobile Ad Hoc Networks.

Degree: 2016, University of Kentucky

URL: https://uknowledge.uky.edu/cs_etds/53

► A Mobile Ad hoc Network (MANET) consists of a set of nodes which can form a network among themselves. MANETs have applications in areas such… (more)

▼ A Mobile Ad hoc Network (MANET) consists of a set of nodes which can form a network among themselves. MANETs have applications in areas such as military, disaster rescue operations, monitoring animal habitats, etc. where establishing fixed communication infrastructure is not feasible. Routing protocols designed for MANETs can be broadly classified as position-based (geographic), topology-based and hybrid. Geographic routing uses location information of nodes to route messages. Topology-based routing uses network state information for route discovery and maintenance. Hybrid routing protocols use features in both position-based and topology-based approaches. Position-based routing protocols route packets towards the destination using greedy forwarding (i.e., an intermediate node forwards packets to a neighbor that is closer to the destination than itself). If a node has no neighbor that is closer to the destination than itself, greedy forwarding fails. In this case, we say there is void. Different position-based routing protocols use different methods for dealing with voids. Topology-based routing protocols can be classified into on-demand (reactive) routing protocols and proactive routing protocols. Generally, on-demand routing protocols establish routes when needed by flooding route requests throughout the entire network, which is not a scalable approach. Reactive routing protocols try to maintain routes between every pair of nodes by periodically exchanging messages with each other which is not a scalable approach also. This thesis addresses some of these issues and makes the following contribution. First, we present a position-based routing protocol called Greedy Routing Protocol with Backtracking (GRB) which uses a simple backtracking technique to route around voids, unlike existing position-based routing protocols which construct planarized graph of the local network to route around voids. We compare the performance of our protocol with the well known Greedy Perimeter Stateless Routing (GPSR) protocol and the Ad-Hoc On-demand Distance Vector (AODV) routing protocol as well as the Dynamic Source Routing (DSR) protocol. Performance evaluation shows that our protocol has less control overhead than those of DSR, AODV, and GPSR. Performance evaluation also shows that our protocol has a higher packet-delivery ratio, lower end-to-end delay, and less hop count, on average, compared to AODV, DSR and GPSR. We then present an on-demand routing protocol called ``Hybrid On-demand Greedy Routing Protocol with Backtracking for Mobile Ad-Hoc Networks" which uses greedy approach for route discovery. This prevents flooding route requests, unlike the existing on-demand routing protocols. This approach also helps in finding routes that have lower hop counts than AODV and DSR. Our performance evaluation confirms that our protocol performs better than AODV and DSR, on average, with respect to hop count, packet-delivery ratio and control overhead. In MANETs, all nodes need to cooperate to establish routes. Establishing secure and valid…

Subjects/Keywords: MANET; Position-Based Routing; On-demand Routing; Hybrid Routing; Secure Routing; Other Engineering

Record Details Similar Records Cite « Share

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^th Edition):

Mahmood, B. A. (2016). Routing and Security in Mobile Ad Hoc Networks. (Doctoral Dissertation). University of Kentucky. Retrieved from https://uknowledge.uky.edu/cs_etds/53

Chicago Manual of Style (16^th Edition):

Mahmood, Baban A. “Routing and Security in Mobile Ad Hoc Networks.” 2016. Doctoral Dissertation, University of Kentucky. Accessed February 24, 2021. https://uknowledge.uky.edu/cs_etds/53.

MLA Handbook (7^th Edition):

Mahmood, Baban A. “Routing and Security in Mobile Ad Hoc Networks.” 2016. Web. 24 Feb 2021.

Vancouver:

Mahmood BA. Routing and Security in Mobile Ad Hoc Networks. [Internet] [Doctoral dissertation]. University of Kentucky; 2016. [cited 2021 Feb 24]. Available from: https://uknowledge.uky.edu/cs_etds/53.

Council of Science Editors:

Mahmood BA. Routing and Security in Mobile Ad Hoc Networks. [Doctoral Dissertation]. University of Kentucky; 2016. Available from: https://uknowledge.uky.edu/cs_etds/53

Universidade Nova

9. Chalaça, João Pedro Gonçalves. Multipath policy routing in packet switched networks.

Degree: 2013, Universidade Nova

URL: http://www.rcaap.pt/detail.jsp?id=oai:run.unl.pt:10362/10716

►

Dissertação apresentada para obtenção do Grau de Mestre em Engenharia Electrotécnica e de Computadores, pela Universidade Nova de Lisboa, Faculdade de Ciências e Tecnologia

Nowadays,… (more)

Subjects/Keywords: Multipath routing; Policy routing; Algebraic models; Routing problem

Record Details Similar Records Cite « Share

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^th Edition):

Chalaça, J. P. G. (2013). Multipath policy routing in packet switched networks. (Thesis). Universidade Nova. Retrieved from http://www.rcaap.pt/detail.jsp?id=oai:run.unl.pt:10362/10716

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16^th Edition):

Chalaça, João Pedro Gonçalves. “Multipath policy routing in packet switched networks.” 2013. Thesis, Universidade Nova. Accessed February 24, 2021. http://www.rcaap.pt/detail.jsp?id=oai:run.unl.pt:10362/10716.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^th Edition):

Chalaça, João Pedro Gonçalves. “Multipath policy routing in packet switched networks.” 2013. Web. 24 Feb 2021.

Vancouver:

Chalaça JPG. Multipath policy routing in packet switched networks. [Internet] [Thesis]. Universidade Nova; 2013. [cited 2021 Feb 24]. Available from: http://www.rcaap.pt/detail.jsp?id=oai:run.unl.pt:10362/10716.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Chalaça JPG. Multipath policy routing in packet switched networks. [Thesis]. Universidade Nova; 2013. Available from: http://www.rcaap.pt/detail.jsp?id=oai:run.unl.pt:10362/10716

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Universidade Nova

10. Vitorino, Tiago Miguel Mendes Ferreira. Planning and verification of multipath routing protocols.

Degree: 2015, Universidade Nova

URL: http://www.rcaap.pt/detail.jsp?id=oai:run.unl.pt:10362/14110

► Conventionally the problem of the best path in a network refers to the shortest path problem. However, for the vast majority of networks present nowadays… (more)

▼ Conventionally the problem of the best path in a network refers to the shortest path problem. However, for the vast majority of networks present nowadays this solution has some limitations which directly affect their proper functioning, as well as an inefficient use of their potentialities. Problems at the level of large networks where graphs of high complexity are commonly present as well as the appearing of new services and their respective requirements, are intrinsically related to the inability of this solution. In order to overcome the needs present in these networks, a new approach to the problem of the best path must be explored. One solution that has aroused more interest in the scientific community considers the use of multiple paths between two network nodes, where they can all now be considered as the best path between those nodes. Therefore, the routing will be discontinued only by minimizing one metric, where only one path between nodes is chosen, and shall be made by the selection of one of many paths, thereby allowing the use of a greater diversity of the present paths (obviously, if the network consents). The establishment of multi-path routing in a given network has several advantages for its operation. Its use may well improve the distribution of network traffic, improve recovery time to failure, or it can still offer a greater control of the network by its administrator. These factors still have greater relevance when networks have large dimensions, as well as when their constitution is of high complexity, such as the Internet, where multiple networks managed by different entities are interconnected. A large part of the growing need to use multipath protocols is associated to the routing made based on policies. Therefore, paths with different characteristics can be considered with equal level of preference, and thus be part of the solution for the best way problem. To perform multi-path routing using protocols based only on the destination address has some limitations but it is possible. Concepts of graph theory of algebraic structures can be used to describe how the routes are calculated and classified, enabling to model the routing problem. This thesis studies and analyzes multi-path routing protocols from the known literature and derives a new algebraic condition which allows the correct operation of these protocols without any network restriction. It also develops a range of software tools that allows the planning and the respective verification/validation of new protocols models according to the study made. Advisors/Committee Members: Amaral, Pedro.

Subjects/Keywords: Multipath routing; Routing policies; Routing problems; Algebraic models

Record Details Similar Records Cite « Share

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^th Edition):

Vitorino, T. M. M. F. (2015). Planning and verification of multipath routing protocols. (Thesis). Universidade Nova. Retrieved from http://www.rcaap.pt/detail.jsp?id=oai:run.unl.pt:10362/14110

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16^th Edition):

Vitorino, Tiago Miguel Mendes Ferreira. “Planning and verification of multipath routing protocols.” 2015. Thesis, Universidade Nova. Accessed February 24, 2021. http://www.rcaap.pt/detail.jsp?id=oai:run.unl.pt:10362/14110.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^th Edition):

Vitorino, Tiago Miguel Mendes Ferreira. “Planning and verification of multipath routing protocols.” 2015. Web. 24 Feb 2021.

Vancouver:

Vitorino TMMF. Planning and verification of multipath routing protocols. [Internet] [Thesis]. Universidade Nova; 2015. [cited 2021 Feb 24]. Available from: http://www.rcaap.pt/detail.jsp?id=oai:run.unl.pt:10362/14110.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Vitorino TMMF. Planning and verification of multipath routing protocols. [Thesis]. Universidade Nova; 2015. Available from: http://www.rcaap.pt/detail.jsp?id=oai:run.unl.pt:10362/14110

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Colorado State University

11. Bartlett, Jason D. Representing BGP and routing flows in XML.

Degree: MS(M.S.), Computer Science, 2013, Colorado State University

URL: http://hdl.handle.net/10217/79008

► Monitoring routing in the Internet is a significant aspect of network security today. Incorrect information that is introduced into the system can result in problems… (more)

▼ Monitoring routing in the Internet is a significant aspect of network security today. Incorrect information that is introduced into the system can result in problems ranging from a particular service or website becoming temporarily inaccessible, to large blocks of network addresses becoming cut off from the rest of the Internet, to potentially-sensitive user information being redirected to a malicious actor. Current monitoring projects generate a huge dataset for users for sift through. A single collection point collecting routing data from a dozen routers can archive 1800 update messages every 15 minutes. The largest current monitoring projects have 12-16 collection points, some of which can have several dozen routers feeding data into them, and some of which have been saving data for a decade or more. These archives are stored in a binary format called MRT that appends metadata about the particular routing session being monitored to the raw data received by a router. They also depend on tools to convert the binary into usable, but rigid, ASCII formats. Ideally, this data could be represented in a standardized ASCII format that both human user and machine application can make use of. Furthermore, such a format ought to be able to be easily extended, whether to represent new features in the underlying data or to transport user-specific annotations, without creating compatibility problems. XML and XSD provide the mechanisms necessary to accomplish this and the framework necessary to do it in such a way that the resulting definitions can become standardized. This work presents an XSD-based generic format for representing the flow of routing data between arbitrary routers. To provide a concrete realization of this idea, additional schema are defined to describe Border Gateway Protocol messages and several common networking datatypes. All of these schema are defined to provide validation of their underlying data, but are also flexible enough to accommodate extensions within the data and additional datatypes not already included in the schema. Advisors/Committee Members: Massey, Daniel F. (advisor), Papadopoulos, Christos (committee member), Hayne, Stephen C. (committee member).

Subjects/Keywords: BGP; Internet routing; network security; routing monitoring; routing protocols; XML

Record Details Similar Records Cite « Share

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^th Edition):

Bartlett, J. D. (2013). Representing BGP and routing flows in XML. (Masters Thesis). Colorado State University. Retrieved from http://hdl.handle.net/10217/79008

Chicago Manual of Style (16^th Edition):

Bartlett, Jason D. “Representing BGP and routing flows in XML.” 2013. Masters Thesis, Colorado State University. Accessed February 24, 2021. http://hdl.handle.net/10217/79008.

MLA Handbook (7^th Edition):

Bartlett, Jason D. “Representing BGP and routing flows in XML.” 2013. Web. 24 Feb 2021.

Vancouver:

Bartlett JD. Representing BGP and routing flows in XML. [Internet] [Masters thesis]. Colorado State University; 2013. [cited 2021 Feb 24]. Available from: http://hdl.handle.net/10217/79008.

Council of Science Editors:

Bartlett JD. Representing BGP and routing flows in XML. [Masters Thesis]. Colorado State University; 2013. Available from: http://hdl.handle.net/10217/79008

University of Southern California

12. Train, Joshua D. Routing fountains: leveraging broadcast channels to improve the dissemination of control information for large inter-domain networks.

Degree: PhD, Computer Engineering, 2014, University of Southern California

URL: http://digitallibrary.usc.edu/cdm/compoundobject/collection/p15799coll3/id/208853/rec/5662

► The utility of a large inter-domain network depends on neighboring networks exchanging routing control information and using that information to compute next-hop forwarding decisions. While… (more)

▼ The utility of a large inter-domain network depends on neighboring networks exchanging routing control information and using that information to compute next-hop forwarding decisions. While this approach of hop-by-hop information dissemination has proven very useful for the incremental expansion of the Internet, it is limited in providing the necessary performance to accommodate for future network growth, mobility, and security. ❧ To address these challenges, we present a novel architecture that leverages broadcast channels for disseminating routing information. The key components of our architecture are devices called `Routing Fountains' that perform the task of collecting routing information from each of the participant networks and then simultaneously redistributing this information back to the greater set of networks through a wide area broadcast channel, like a satellite downlink. By complementing existing routing infrastructures with Routing Fountains, we augment the route distribution graph in a way that: 1.) Drastically reduces the number of transmissions needed to communicate routing updates, 2.) Provides synchronization to the route distribution process, and 3.) Facilitates the validation of routing data. Our architecture is designed to augment and therefore coexist with current routing infrastructures so that incremental performance gains can be achieved without disruption to existing infrastructures. ❧ Utilizing a broadcast based architecture provides compelling opportunities to improve the performance of today's inter-domain routing architectures. To demonstrate the utility of this approach we have applied it to the following three inter-domain routing tasks: 1.) Distributing routing updates across the entire Internet topology, 2.) Facilitating minimal loss network transitions for mobile networks while maintaining shortest path connectivity, and 3.) Protecting against the distribution of fictitious routing information. The results from our Internet graph and routing traffic analysis, simulations, and testbed prototypes demonstrate that utilizing broadcast channels has remarkable value in improving the performance and robustness of existing route distribution infrastructures, even when only a subset of the larger network is actively receiving the broadcasted information. Advisors/Committee Members: Raghavendra, Cauligi S. (Committee Chair), Silvester, John (Committee Member), Kesselman, Carl K. (Committee Member), Bannister, Joseph (Committee Member).

Subjects/Keywords: routing; BGP; networks; inter domain routing; broadcast routing

Record Details Similar Records Cite « Share

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^th Edition):

Train, J. D. (2014). Routing fountains: leveraging broadcast channels to improve the dissemination of control information for large inter-domain networks. (Doctoral Dissertation). University of Southern California. Retrieved from http://digitallibrary.usc.edu/cdm/compoundobject/collection/p15799coll3/id/208853/rec/5662

Chicago Manual of Style (16^th Edition):

Train, Joshua D. “Routing fountains: leveraging broadcast channels to improve the dissemination of control information for large inter-domain networks.” 2014. Doctoral Dissertation, University of Southern California. Accessed February 24, 2021. http://digitallibrary.usc.edu/cdm/compoundobject/collection/p15799coll3/id/208853/rec/5662.

MLA Handbook (7^th Edition):

Train, Joshua D. “Routing fountains: leveraging broadcast channels to improve the dissemination of control information for large inter-domain networks.” 2014. Web. 24 Feb 2021.

Vancouver:

Train JD. Routing fountains: leveraging broadcast channels to improve the dissemination of control information for large inter-domain networks. [Internet] [Doctoral dissertation]. University of Southern California; 2014. [cited 2021 Feb 24]. Available from: http://digitallibrary.usc.edu/cdm/compoundobject/collection/p15799coll3/id/208853/rec/5662.

Council of Science Editors:

Train JD. Routing fountains: leveraging broadcast channels to improve the dissemination of control information for large inter-domain networks. [Doctoral Dissertation]. University of Southern California; 2014. Available from: http://digitallibrary.usc.edu/cdm/compoundobject/collection/p15799coll3/id/208853/rec/5662

13. Soran, Ahmet. Multi-Core Parallel Routing.

Degree: 2017, University of Nevada – Reno

URL: http://hdl.handle.net/11714/2027

► The recent increase in the amount of data (i.e., big data) led to higher data volumes to be transferred and processed over the network. Also,… (more)

Subjects/Keywords: Multi-path Routing; Network; Network Management; Routing; Routing Protocols; Traffic Engineering

Record Details Similar Records Cite « Share

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^th Edition):

Soran, A. (2017). Multi-Core Parallel Routing. (Thesis). University of Nevada – Reno. Retrieved from http://hdl.handle.net/11714/2027

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16^th Edition):

Soran, Ahmet. “Multi-Core Parallel Routing.” 2017. Thesis, University of Nevada – Reno. Accessed February 24, 2021. http://hdl.handle.net/11714/2027.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^th Edition):

Soran, Ahmet. “Multi-Core Parallel Routing.” 2017. Web. 24 Feb 2021.

Vancouver:

Soran A. Multi-Core Parallel Routing. [Internet] [Thesis]. University of Nevada – Reno; 2017. [cited 2021 Feb 24]. Available from: http://hdl.handle.net/11714/2027.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Soran A. Multi-Core Parallel Routing. [Thesis]. University of Nevada – Reno; 2017. Available from: http://hdl.handle.net/11714/2027

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Universidade Nova

14. Amaral, Pedro Miguel Figueiredo. Multipath inter-domain policy routing.

Degree: 2012, Universidade Nova

URL: http://www.rcaap.pt/detail.jsp?id=oai:run.unl.pt:10362/8797

►

Dissertação submetida para a obtenção do grau de Doutor em Engenharia Electrotécnica e de Computadores

Routing can be abstracted to be a path nding problem… (more)

▼

Dissertação submetida para a obtenção do grau de Doutor em Engenharia Electrotécnica e de Computadores

Routing can be abstracted to be a path nding problem in a graph that models the network. The problem can be modelled using an algebraic approach that describes the way routes are calculated and ranked. The shortest path problem is the most common form and consists in nding the path with the smallest cost. The inter-domain scenario introduces some new challenges to the routing problem: the routing is performed between independently con gured and managed networks; the ranking of the paths is not based on measurable metrics but on policies; and the forwarding is destination based hop-by-hop. In this thesis we departed from the Border gateway Protocol (BGP) identifying its main problems and elaborating on some ideal characteristics for a routing protocol suited for the inter-domain reality. The main areas and contributions of this work are the following: The current state of the art in algebraic modeling of routing problems is used to provide a list of possible alternative conditions for the correct operation of such protocols. For each condition the consequences in terms of optimality and network restrictions are presented. A routing architecture for the inter-domain scenario is presented. It is proven that it achieves a multipath routing solution in nite time without causing forwarding loops. We discuss its advantages and weaknesses. A tra c-engineering scheme is designed to take advantage of the proposed architecture. It works using only local information and cooperation of remote ASes to minimize congestion in the network with minimal signalling. Finally a general model of a routing protocol based on hierarchical policies is used to study how e cient is the protocol operation when the correctness conditions are met. This results in some conclusions on how the policies should be chosen and applied in order to achieve speci c goals.

Portuguese Science and Technology Foundation -(FCT/MCTES)grant SFRH/BD/44476/2008; CTS multi-annual funding project PEst OE/EEI/UI0066/2011; MPSat project PTDC/EEA TEL/099074/2008; OPPORTUNISTICCR project PTDC/EEA-TEL/115981/2009; Fentocells project PTDC/EEA TEL/120666/2010

Advisors/Committee Members: Pinto, Paulo.

Subjects/Keywords: Inter-domain routing; Multipath routing; Algebraic models; Graph theory; Tra c engineering; Routing problem

Record Details Similar Records Cite « Share

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^th Edition):

Amaral, P. M. F. (2012). Multipath inter-domain policy routing. (Thesis). Universidade Nova. Retrieved from http://www.rcaap.pt/detail.jsp?id=oai:run.unl.pt:10362/8797

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16^th Edition):

Amaral, Pedro Miguel Figueiredo. “Multipath inter-domain policy routing.” 2012. Thesis, Universidade Nova. Accessed February 24, 2021. http://www.rcaap.pt/detail.jsp?id=oai:run.unl.pt:10362/8797.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^th Edition):

Amaral, Pedro Miguel Figueiredo. “Multipath inter-domain policy routing.” 2012. Web. 24 Feb 2021.

Vancouver:

Amaral PMF. Multipath inter-domain policy routing. [Internet] [Thesis]. Universidade Nova; 2012. [cited 2021 Feb 24]. Available from: http://www.rcaap.pt/detail.jsp?id=oai:run.unl.pt:10362/8797.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Amaral PMF. Multipath inter-domain policy routing. [Thesis]. Universidade Nova; 2012. Available from: http://www.rcaap.pt/detail.jsp?id=oai:run.unl.pt:10362/8797

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Univerzitet u Beogradu

15. Antić, Marija D. 1980-. Optimizacija neblokirajućih paketskih mreža upotrebom praktičnog protokola za rutiranje sa balansiranjem saobraćaja.

Degree: Elektrotehnički fakultet, 2016, Univerzitet u Beogradu

URL: https://fedorabg.bg.ac.rs/fedora/get/o:11428/bdef:Content/get

►

Tehničke nauke, elektrotehnika - Telekomunikacije / Technical science, electrical engineering - Telecommunications

Kvalitetan odabir strategije rutiranja u paketskoj mreži u velikoj meri utiče na pouzdanost… (more)

▼

Tehničke nauke, elektrotehnika - Telekomunikacije / Technical science, electrical engineering - Telecommunications

Kvalitetan odabir strategije rutiranja u paketskoj mreži u velikoj meri utiče na pouzdanost mreže i kvalitet prenosa podataka u njoj. Odabrana strategija rutiranja utiče i na stepen iskorišćenja različitih mrežnih resursa. Loše odabrano rutiranje može prouzrokovati stvaranje uskih grla u mreži i dovesti do blokade određenih linkova. Takođe, od primenjene strategije rutiranja zavisi kašnjenje pri prenosu paketa, kao i cena mreže. U cilju odabiranja ispravne strategije rutiranja za neku mrežnu topologiju i date korisničke zahteve, vrši se optimizacija rutiranja u mreži. Proces optimizacije rutiranja za cilj ima određivanje putanja paketa tako da se postigne što bolja vrednost neke od mrežnih performansi. U zavisnosti od problema koji se rešava, optimizacija rutiranja može imati za cilj maksimizaciju propusne moći mreže, minimizaciju cene mreže, minimizaciju kašnjenja u prenosu i slično. U ovome radu bavićemo se problemima optimizacije rutiranja u cilju maksimizacije propusne moći i minimizacije cene mreže. Pri tome, želimo da komunikaciona mreža bude neblokirajuća. To znači da mreža mora garantovati servis za sve korisnike koji generišu ili primaju saobraćaj u okviru dozvoljenih granica. Nezavisno od trenutnog stanja saobraćaja u mreži, korisnički zahtevi za slanje ili prijem paketa moraju biti usluženi, ukoliko ne izlaze iz okvira dozvoljenih vrednosti. Okosnicu ovog rada predstavlja predlog nove šema rutiranja zasnovane na balansiranju saobraćaja i rutiranju po najkraćoj putanji, koju nazivamo rutiranje sa balansiranjem saobraćaja (RBS). Predložena šema rutiranja može se optimizovati tako da se ostvari maksimalna propusna moć mreže ili minimalna cena mreže, a za optimizaciju se koristi linearno programiranje. Glavnu prednost predložene strategije rutiranja predstavlja realna mogućnost njene implementacije. Naime, rutiranje po najkraćoj putanji je u širokoj primeni, a predložena šema rutiranja je modifikacija koja se relativno lako realizuje. Dimenzija linearnog programa koji koristimo je prihvatljiva za praktičnu primenu, kao i vreme...

Advisors/Committee Members: Smiljanić, Aleksandra. 1970-.

Subjects/Keywords: non-blocking packet networks; routing; shortest path routing; load balancing; routing optimization; reliability

Record Details Similar Records Cite « Share

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^th Edition):

Antić, M. D. 1. (2016). Optimizacija neblokirajućih paketskih mreža upotrebom praktičnog protokola za rutiranje sa balansiranjem saobraćaja. (Thesis). Univerzitet u Beogradu. Retrieved from https://fedorabg.bg.ac.rs/fedora/get/o:11428/bdef:Content/get

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16^th Edition):

Antić, Marija D 1980-. “Optimizacija neblokirajućih paketskih mreža upotrebom praktičnog protokola za rutiranje sa balansiranjem saobraćaja.” 2016. Thesis, Univerzitet u Beogradu. Accessed February 24, 2021. https://fedorabg.bg.ac.rs/fedora/get/o:11428/bdef:Content/get.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^th Edition):

Antić, Marija D 1980-. “Optimizacija neblokirajućih paketskih mreža upotrebom praktičnog protokola za rutiranje sa balansiranjem saobraćaja.” 2016. Web. 24 Feb 2021.

Vancouver:

Antić MD1. Optimizacija neblokirajućih paketskih mreža upotrebom praktičnog protokola za rutiranje sa balansiranjem saobraćaja. [Internet] [Thesis]. Univerzitet u Beogradu; 2016. [cited 2021 Feb 24]. Available from: https://fedorabg.bg.ac.rs/fedora/get/o:11428/bdef:Content/get.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Antić MD1. Optimizacija neblokirajućih paketskih mreža upotrebom praktičnog protokola za rutiranje sa balansiranjem saobraćaja. [Thesis]. Univerzitet u Beogradu; 2016. Available from: https://fedorabg.bg.ac.rs/fedora/get/o:11428/bdef:Content/get

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

NSYSU

16. Kho, Kuan-ping. Hybrid Routing Protocol Based on k-hop Clustering Structure in MANETs.

Degree: Master, Electrical Engineering, 2009, NSYSU

URL: http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0824109-191148

► This paper proposes a hybrid routing protocol based on the k-hop clustering structure for MANETs. The source sends packets to the destination directly if it… (more)

Subjects/Keywords: clustering structure; hybrid routing protocol

Record Details Similar Records Cite « Share

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^th Edition):

Kho, K. (2009). Hybrid Routing Protocol Based on k-hop Clustering Structure in MANETs. (Thesis). NSYSU. Retrieved from http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0824109-191148

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16^th Edition):

Kho, Kuan-ping. “Hybrid Routing Protocol Based on k-hop Clustering Structure in MANETs.” 2009. Thesis, NSYSU. Accessed February 24, 2021. http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0824109-191148.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^th Edition):

Kho, Kuan-ping. “Hybrid Routing Protocol Based on k-hop Clustering Structure in MANETs.” 2009. Web. 24 Feb 2021.

Vancouver:

Kho K. Hybrid Routing Protocol Based on k-hop Clustering Structure in MANETs. [Internet] [Thesis]. NSYSU; 2009. [cited 2021 Feb 24]. Available from: http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0824109-191148.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Kho K. Hybrid Routing Protocol Based on k-hop Clustering Structure in MANETs. [Thesis]. NSYSU; 2009. Available from: http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0824109-191148

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

17. 林, 卓磨. モバイルメッシュネットワーク環境における移動端末を追従可能なデータ配送方式の提案 : Efficient Data Delivery to a Moving Node in Mobile Mesh Networks; モバイルメッシュネットワークカンキョウニオケルイドウタンマツニツイジュウカノウナデータハイソウホウシキノテイアン.

Degree: Nara Institute of Science and Technology / 奈良先端科学技術大学院大学

URL: http://hdl.handle.net/10061/5086

Subjects/Keywords: Opportunistic Routing

Record Details Similar Records Cite « Share

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^th Edition):

林, �. (n.d.). モバイルメッシュネットワーク環境における移動端末を追従可能なデータ配送方式の提案 : Efficient Data Delivery to a Moving Node in Mobile Mesh Networks; モバイルメッシュネットワークカンキョウニオケルイドウタンマツニツイジュウカノウナデータハイソウホウシキノテイアン. (Thesis). Nara Institute of Science and Technology / 奈良先端科学技術大学院大学. Retrieved from http://hdl.handle.net/10061/5086

Note: this citation may be lacking information needed for this citation format:
No year of publication.
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16^th Edition):

林, 卓磨. “モバイルメッシュネットワーク環境における移動端末を追従可能なデータ配送方式の提案 : Efficient Data Delivery to a Moving Node in Mobile Mesh Networks; モバイルメッシュネットワークカンキョウニオケルイドウタンマツニツイジュウカノウナデータハイソウホウシキノテイアン.” Thesis, Nara Institute of Science and Technology / 奈良先端科学技術大学院大学. Accessed February 24, 2021. http://hdl.handle.net/10061/5086.

Note: this citation may be lacking information needed for this citation format:
No year of publication.
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^th Edition):

林, 卓磨. “モバイルメッシュネットワーク環境における移動端末を追従可能なデータ配送方式の提案 : Efficient Data Delivery to a Moving Node in Mobile Mesh Networks; モバイルメッシュネットワークカンキョウニオケルイドウタンマツニツイジュウカノウナデータハイソウホウシキノテイアン.” Web. 24 Feb 2021.

Note: this citation may be lacking information needed for this citation format:
No year of publication.

Vancouver:

林 �. モバイルメッシュネットワーク環境における移動端末を追従可能なデータ配送方式の提案 : Efficient Data Delivery to a Moving Node in Mobile Mesh Networks; モバイルメッシュネットワークカンキョウニオケルイドウタンマツニツイジュウカノウナデータハイソウホウシキノテイアン. [Internet] [Thesis]. Nara Institute of Science and Technology / 奈良先端科学技術大学院大学; [cited 2021 Feb 24]. Available from: http://hdl.handle.net/10061/5086.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
No year of publication.

Council of Science Editors:

林 �. モバイルメッシュネットワーク環境における移動端末を追従可能なデータ配送方式の提案 : Efficient Data Delivery to a Moving Node in Mobile Mesh Networks; モバイルメッシュネットワークカンキョウニオケルイドウタンマツニツイジュウカノウナデータハイソウホウシキノテイアン. [Thesis]. Nara Institute of Science and Technology / 奈良先端科学技術大学院大学; Available from: http://hdl.handle.net/10061/5086

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
No year of publication.

University of California – Berkeley

18. Ganichev, Igor. Interdomain Multipath Routing.

Degree: Electrical Engineering & Computer Sciences, 2011, University of California – Berkeley

URL: http://www.escholarship.org/uc/item/6ks1r90m

► While astonishingly successful, Internet is still less reliable than the phone system and supports very limited user choice and control. As many researchers observed, multipath… (more)

Subjects/Keywords: Computer science; interdomain; multipath; routing

Record Details Similar Records Cite « Share

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^th Edition):

Ganichev, I. (2011). Interdomain Multipath Routing. (Thesis). University of California – Berkeley. Retrieved from http://www.escholarship.org/uc/item/6ks1r90m

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16^th Edition):

Ganichev, Igor. “Interdomain Multipath Routing.” 2011. Thesis, University of California – Berkeley. Accessed February 24, 2021. http://www.escholarship.org/uc/item/6ks1r90m.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^th Edition):

Ganichev, Igor. “Interdomain Multipath Routing.” 2011. Web. 24 Feb 2021.

Vancouver:

Ganichev I. Interdomain Multipath Routing. [Internet] [Thesis]. University of California – Berkeley; 2011. [cited 2021 Feb 24]. Available from: http://www.escholarship.org/uc/item/6ks1r90m.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Ganichev I. Interdomain Multipath Routing. [Thesis]. University of California – Berkeley; 2011. Available from: http://www.escholarship.org/uc/item/6ks1r90m

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

University of California – Berkeley

19. Liu, Junda. Routing Along DAGs.

Degree: Computer Science, 2011, University of California – Berkeley

URL: http://www.escholarship.org/uc/item/1c5705w4

► Since the invention of packet switching networks, routing is an important, if not the most fundamental, component of networking. Over decades, both academia and industry… (more)

Subjects/Keywords: Computer science; reliability; routing

Record Details Similar Records Cite « Share

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^th Edition):

Liu, J. (2011). Routing Along DAGs. (Thesis). University of California – Berkeley. Retrieved from http://www.escholarship.org/uc/item/1c5705w4

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16^th Edition):

Liu, Junda. “Routing Along DAGs.” 2011. Thesis, University of California – Berkeley. Accessed February 24, 2021. http://www.escholarship.org/uc/item/1c5705w4.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^th Edition):

Liu, Junda. “Routing Along DAGs.” 2011. Web. 24 Feb 2021.

Vancouver:

Liu J. Routing Along DAGs. [Internet] [Thesis]. University of California – Berkeley; 2011. [cited 2021 Feb 24]. Available from: http://www.escholarship.org/uc/item/1c5705w4.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Liu J. Routing Along DAGs. [Thesis]. University of California – Berkeley; 2011. Available from: http://www.escholarship.org/uc/item/1c5705w4

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Rochester Institute of Technology

20. Liu, Ziyang. Renewable Energy-Aware Routing in the Internet.

Degree: MS, Computer Engineering, 2017, Rochester Institute of Technology

URL: https://scholarworks.rit.edu/theses/9661

► The increasing power consumption of the Internet infrastructure has attracted a lot of world-wide attention because of the severe impact on the environment. Many… (more)

Subjects/Keywords: BGP; Renewable energy; Routing algorithm

Record Details Similar Records Cite « Share

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^th Edition):

Liu, Z. (2017). Renewable Energy-Aware Routing in the Internet. (Masters Thesis). Rochester Institute of Technology. Retrieved from https://scholarworks.rit.edu/theses/9661

Chicago Manual of Style (16^th Edition):

Liu, Ziyang. “Renewable Energy-Aware Routing in the Internet.” 2017. Masters Thesis, Rochester Institute of Technology. Accessed February 24, 2021. https://scholarworks.rit.edu/theses/9661.

MLA Handbook (7^th Edition):

Liu, Ziyang. “Renewable Energy-Aware Routing in the Internet.” 2017. Web. 24 Feb 2021.

Vancouver:

Liu Z. Renewable Energy-Aware Routing in the Internet. [Internet] [Masters thesis]. Rochester Institute of Technology; 2017. [cited 2021 Feb 24]. Available from: https://scholarworks.rit.edu/theses/9661.

Council of Science Editors:

Liu Z. Renewable Energy-Aware Routing in the Internet. [Masters Thesis]. Rochester Institute of Technology; 2017. Available from: https://scholarworks.rit.edu/theses/9661

University of Alberta

21. Kollias, Aristotelis. Thermoelectric Harvesting and Seasonal Routing in Wireless Sensor Networks.

Degree: MS, Department of Computing Science, 2016, University of Alberta

URL: https://era.library.ualberta.ca/files/c2v23vt42k

► We propose the use of embedded in-wall thermoelectric harvester to power the nodes of a wireless sensor network. We exploit significant temperature differences of indoor… (more)

Subjects/Keywords: Seasonal Routing; Thermoelectric Harvesting

Record Details Similar Records Cite « Share

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^th Edition):

Kollias, A. (2016). Thermoelectric Harvesting and Seasonal Routing in Wireless Sensor Networks. (Masters Thesis). University of Alberta. Retrieved from https://era.library.ualberta.ca/files/c2v23vt42k

Chicago Manual of Style (16^th Edition):

Kollias, Aristotelis. “Thermoelectric Harvesting and Seasonal Routing in Wireless Sensor Networks.” 2016. Masters Thesis, University of Alberta. Accessed February 24, 2021. https://era.library.ualberta.ca/files/c2v23vt42k.

MLA Handbook (7^th Edition):

Kollias, Aristotelis. “Thermoelectric Harvesting and Seasonal Routing in Wireless Sensor Networks.” 2016. Web. 24 Feb 2021.

Vancouver:

Kollias A. Thermoelectric Harvesting and Seasonal Routing in Wireless Sensor Networks. [Internet] [Masters thesis]. University of Alberta; 2016. [cited 2021 Feb 24]. Available from: https://era.library.ualberta.ca/files/c2v23vt42k.

Council of Science Editors:

Kollias A. Thermoelectric Harvesting and Seasonal Routing in Wireless Sensor Networks. [Masters Thesis]. University of Alberta; 2016. Available from: https://era.library.ualberta.ca/files/c2v23vt42k

University of Alberta

22. Mahmood, Abdullah-Al. Non-bifurcated routing and scheduling in wireless mesh networks.

Degree: PhD, Department of Computing Science, 2010, University of Alberta

URL: https://era.library.ualberta.ca/files/qz20st52j

► Multi-hop wireless mesh networks (WMNs) provide a cost-effective means to enable broadband wireless access (BWA) services to end users. Such WMNs are required to support… (more)

▼ Multi-hop wireless mesh networks (WMNs) provide a cost-effective means to enable broadband wireless access (BWA) services to end users. Such WMNs are required to support different classes of traffic where each class requires certain quality of service (QoS) levels. The research direction undertaken in this thesis considers the development of enhanced routing and scheduling algorithms that enable WMNs to support various QoS metrics for the served traffic. A fundamental class of routing problems in WMNs asks whether a given end-to-end flow that requires certain bandwidth, and benefits from routing over a single path (also called non-bifurcated routing), can be routed given that some ongoing flows are being served in the network. In the thesis, we focus on the development of combinatorial algorithms for solving such incremental non-bifurcated problems for two types of WMNs: 1. WMNs where mesh routers use contention-based protocol for medium access control (MAC), and 2. WMNs where mesh routers use time division multiple access (TDMA) for MAC. For WMNs employing contention-based MAC protocols, we present a novel non-bifurcated routing algorithm that employs techniques from the theory of network flows. The main ingredient in our algorithm is a method for computing interference-constrained flow augmenting paths for routing subscriber demands in the network. For WMNs employing TDMA, we develop a number of joint routing and scheduling algorithms, and investigate the use of such algorithms to maximize the number of served flows. In chapter 4, we consider a throughput maximization problem in the well-known class of grid WMNs. We present an iterative algorithm that strives to achieve high throughput by considering routing and scheduling a pair of distinct flows simultaneously to the gateway in each iteration. In chapter 5, we explore joint routing and scheduling in TDMA-based WMNs with arbitrary topologies, and devise an algorithm that can deal with arbitrary interference relations among pairs of transmission links. In particular, our devised algorithm solves a generalized problem where a cost value is associated with using any possible time-slot on any transmission link, and a minimum cost route is sought along which a new flow can be scheduled without perturbing existing slot assignments.

Subjects/Keywords: Scheduling; Routing; Wireless Mesh Network

Record Details Similar Records Cite « Share

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^th Edition):

Mahmood, A. (2010). Non-bifurcated routing and scheduling in wireless mesh networks. (Doctoral Dissertation). University of Alberta. Retrieved from https://era.library.ualberta.ca/files/qz20st52j

Chicago Manual of Style (16^th Edition):

Mahmood, Abdullah-Al. “Non-bifurcated routing and scheduling in wireless mesh networks.” 2010. Doctoral Dissertation, University of Alberta. Accessed February 24, 2021. https://era.library.ualberta.ca/files/qz20st52j.

MLA Handbook (7^th Edition):

Mahmood, Abdullah-Al. “Non-bifurcated routing and scheduling in wireless mesh networks.” 2010. Web. 24 Feb 2021.

Vancouver:

Mahmood A. Non-bifurcated routing and scheduling in wireless mesh networks. [Internet] [Doctoral dissertation]. University of Alberta; 2010. [cited 2021 Feb 24]. Available from: https://era.library.ualberta.ca/files/qz20st52j.

Council of Science Editors:

Mahmood A. Non-bifurcated routing and scheduling in wireless mesh networks. [Doctoral Dissertation]. University of Alberta; 2010. Available from: https://era.library.ualberta.ca/files/qz20st52j

University of Alberta

23. Ravinder, Sunil. Cache architectures to improve IP lookups.

Degree: MS, Department of Computing Science, 2009, University of Alberta

URL: https://era.library.ualberta.ca/files/bv73c126f

► IP address lookup is an important processing function of Internet routers. The challenge lies in finding the longest prefix that matches the packet’s destination address.… (more)

Subjects/Keywords: IP lookups, Routing, Switching, Caching

Record Details Similar Records Cite « Share

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^th Edition):

Ravinder, S. (2009). Cache architectures to improve IP lookups. (Masters Thesis). University of Alberta. Retrieved from https://era.library.ualberta.ca/files/bv73c126f

Chicago Manual of Style (16^th Edition):

Ravinder, Sunil. “Cache architectures to improve IP lookups.” 2009. Masters Thesis, University of Alberta. Accessed February 24, 2021. https://era.library.ualberta.ca/files/bv73c126f.

MLA Handbook (7^th Edition):

Ravinder, Sunil. “Cache architectures to improve IP lookups.” 2009. Web. 24 Feb 2021.

Vancouver:

Ravinder S. Cache architectures to improve IP lookups. [Internet] [Masters thesis]. University of Alberta; 2009. [cited 2021 Feb 24]. Available from: https://era.library.ualberta.ca/files/bv73c126f.

Council of Science Editors:

Ravinder S. Cache architectures to improve IP lookups. [Masters Thesis]. University of Alberta; 2009. Available from: https://era.library.ualberta.ca/files/bv73c126f

Cornell University

24. Reilly, Allison. Game Theory Based Identification Of Facility Use Prohibitions For The Movement Of Hazardous Materials Under Terrorist Threat.

Degree: PhD, Civil and Environmental Engineering, 2011, Cornell University

URL: http://hdl.handle.net/1813/29193

► The modeling tools that have been developed over the last 25 years for the identification of routes for hazmat shipments emphasize the tradeoffs between cost… (more)

Subjects/Keywords: hazardous materials; routing; game theory

Record Details Similar Records Cite « Share

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^th Edition):

Reilly, A. (2011). Game Theory Based Identification Of Facility Use Prohibitions For The Movement Of Hazardous Materials Under Terrorist Threat. (Doctoral Dissertation). Cornell University. Retrieved from http://hdl.handle.net/1813/29193

Chicago Manual of Style (16^th Edition):

Reilly, Allison. “Game Theory Based Identification Of Facility Use Prohibitions For The Movement Of Hazardous Materials Under Terrorist Threat.” 2011. Doctoral Dissertation, Cornell University. Accessed February 24, 2021. http://hdl.handle.net/1813/29193.

MLA Handbook (7^th Edition):

Reilly, Allison. “Game Theory Based Identification Of Facility Use Prohibitions For The Movement Of Hazardous Materials Under Terrorist Threat.” 2011. Web. 24 Feb 2021.

Vancouver:

Reilly A. Game Theory Based Identification Of Facility Use Prohibitions For The Movement Of Hazardous Materials Under Terrorist Threat. [Internet] [Doctoral dissertation]. Cornell University; 2011. [cited 2021 Feb 24]. Available from: http://hdl.handle.net/1813/29193.

Council of Science Editors:

Reilly A. Game Theory Based Identification Of Facility Use Prohibitions For The Movement Of Hazardous Materials Under Terrorist Threat. [Doctoral Dissertation]. Cornell University; 2011. Available from: http://hdl.handle.net/1813/29193

Vanderbilt University

25. Srikrishnan Kashyap, Anand. Broadcast and multicast routing in ad-hoc networks with predetermined clustering.

Degree: MS, Computer Science, 2010, Vanderbilt University

URL: http://hdl.handle.net/1803/12870

► A mobile ad-hoc network (MANET) is a self-configuring network of mobile devices connected by wireless links in which each device or node is free to… (more)

Subjects/Keywords: MANET Routing

Record Details Similar Records Cite « Share

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^th Edition):

Srikrishnan Kashyap, A. (2010). Broadcast and multicast routing in ad-hoc networks with predetermined clustering. (Thesis). Vanderbilt University. Retrieved from http://hdl.handle.net/1803/12870

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16^th Edition):

Srikrishnan Kashyap, Anand. “Broadcast and multicast routing in ad-hoc networks with predetermined clustering.” 2010. Thesis, Vanderbilt University. Accessed February 24, 2021. http://hdl.handle.net/1803/12870.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^th Edition):

Srikrishnan Kashyap, Anand. “Broadcast and multicast routing in ad-hoc networks with predetermined clustering.” 2010. Web. 24 Feb 2021.

Vancouver:

Srikrishnan Kashyap A. Broadcast and multicast routing in ad-hoc networks with predetermined clustering. [Internet] [Thesis]. Vanderbilt University; 2010. [cited 2021 Feb 24]. Available from: http://hdl.handle.net/1803/12870.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Srikrishnan Kashyap A. Broadcast and multicast routing in ad-hoc networks with predetermined clustering. [Thesis]. Vanderbilt University; 2010. Available from: http://hdl.handle.net/1803/12870

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Vanderbilt University

26. Samal, Chinmaya. Time-dependent and Privacy-Preserving Decentralized Routing using Federated Learning.

Degree: MS, Computer Science, 2019, Vanderbilt University

URL: http://hdl.handle.net/1803/13627

► With rapid urbanization, route planning is gaining more importance. As transportation networks become more complex and mobility in our society more important, the demand for… (more)

Subjects/Keywords: routing; shortest path; mobility; transportation

Record Details Similar Records Cite « Share

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^th Edition):

Samal, C. (2019). Time-dependent and Privacy-Preserving Decentralized Routing using Federated Learning. (Thesis). Vanderbilt University. Retrieved from http://hdl.handle.net/1803/13627

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16^th Edition):

Samal, Chinmaya. “Time-dependent and Privacy-Preserving Decentralized Routing using Federated Learning.” 2019. Thesis, Vanderbilt University. Accessed February 24, 2021. http://hdl.handle.net/1803/13627.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^th Edition):

Samal, Chinmaya. “Time-dependent and Privacy-Preserving Decentralized Routing using Federated Learning.” 2019. Web. 24 Feb 2021.

Vancouver:

Samal C. Time-dependent and Privacy-Preserving Decentralized Routing using Federated Learning. [Internet] [Thesis]. Vanderbilt University; 2019. [cited 2021 Feb 24]. Available from: http://hdl.handle.net/1803/13627.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Samal C. Time-dependent and Privacy-Preserving Decentralized Routing using Federated Learning. [Thesis]. Vanderbilt University; 2019. Available from: http://hdl.handle.net/1803/13627

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

27. Saminadan V. A study on signal quality based Dynamic RWA in all optical WDM Networks;.

Degree: A study on signal quality based Dynamic RWA in all optical WDM Networks, 2014, Anna University

URL: http://shodhganga.inflibnet.ac.in/handle/10603/26584

►

All optical wavelength routed networks have emerged as a popular newlinearchitectural solution for the backbone of wide area networks Establishing a newlineconnection in a wavelength… (more)

Subjects/Keywords: Routing and Wavelength Assignment

Record Details Similar Records Cite « Share

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^th Edition):

V, S. (2014). A study on signal quality based Dynamic RWA in all optical WDM Networks;. (Thesis). Anna University. Retrieved from http://shodhganga.inflibnet.ac.in/handle/10603/26584

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16^th Edition):

V, Saminadan. “A study on signal quality based Dynamic RWA in all optical WDM Networks;.” 2014. Thesis, Anna University. Accessed February 24, 2021. http://shodhganga.inflibnet.ac.in/handle/10603/26584.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^th Edition):

V, Saminadan. “A study on signal quality based Dynamic RWA in all optical WDM Networks;.” 2014. Web. 24 Feb 2021.

Vancouver:

V S. A study on signal quality based Dynamic RWA in all optical WDM Networks;. [Internet] [Thesis]. Anna University; 2014. [cited 2021 Feb 24]. Available from: http://shodhganga.inflibnet.ac.in/handle/10603/26584.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

V S. A study on signal quality based Dynamic RWA in all optical WDM Networks;. [Thesis]. Anna University; 2014. Available from: http://shodhganga.inflibnet.ac.in/handle/10603/26584

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Anna University

28. Anithar. Design implementation and Performance evaluation of network On chip communication link router;.

Degree: Design implementation and Performance evaluation of network On chip communication link router, 2015, Anna University

URL: http://shodhganga.inflibnet.ac.in/handle/10603/39833

►

In today s mobile and communication world Router plays a newlinesignificant role to select classify and forward the data from source node to newlinedestination node… (more)

Subjects/Keywords: Fixed routing scheme; Interconnect infrastructure

Record Details Similar Records Cite « Share

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^th Edition):

Anithar. (2015). Design implementation and Performance evaluation of network On chip communication link router;. (Thesis). Anna University. Retrieved from http://shodhganga.inflibnet.ac.in/handle/10603/39833

Note: this citation may be lacking information needed for this citation format:
Author name may be incomplete
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16^th Edition):

Anithar. “Design implementation and Performance evaluation of network On chip communication link router;.” 2015. Thesis, Anna University. Accessed February 24, 2021. http://shodhganga.inflibnet.ac.in/handle/10603/39833.

Note: this citation may be lacking information needed for this citation format:
Author name may be incomplete
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^th Edition):

Anithar. “Design implementation and Performance evaluation of network On chip communication link router;.” 2015. Web. 24 Feb 2021.

Note: this citation may be lacking information needed for this citation format:
Author name may be incomplete

Vancouver:

Anithar. Design implementation and Performance evaluation of network On chip communication link router;. [Internet] [Thesis]. Anna University; 2015. [cited 2021 Feb 24]. Available from: http://shodhganga.inflibnet.ac.in/handle/10603/39833.

Note: this citation may be lacking information needed for this citation format:
Author name may be incomplete
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Anithar. Design implementation and Performance evaluation of network On chip communication link router;. [Thesis]. Anna University; 2015. Available from: http://shodhganga.inflibnet.ac.in/handle/10603/39833

Note: this citation may be lacking information needed for this citation format:
Author name may be incomplete
Not specified: Masters Thesis or Doctoral Dissertation

Texas A&M University

29. Kim, Min-seok. Associative skew clock routing for difficult instances.

Degree: MS, Computer Engineering (CEEN), 2006, Texas A&M University

URL: http://hdl.handle.net/1969.1/3856

► This thesis studies the associative skew clock routing problem, which seeks a clock routing tree such that zero skew is preserved only within identified groups… (more)

Subjects/Keywords: clock routing

Record Details Similar Records Cite « Share

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^th Edition):

Kim, M. (2006). Associative skew clock routing for difficult instances. (Masters Thesis). Texas A&M University. Retrieved from http://hdl.handle.net/1969.1/3856

Chicago Manual of Style (16^th Edition):

Kim, Min-seok. “Associative skew clock routing for difficult instances.” 2006. Masters Thesis, Texas A&M University. Accessed February 24, 2021. http://hdl.handle.net/1969.1/3856.

MLA Handbook (7^th Edition):

Kim, Min-seok. “Associative skew clock routing for difficult instances.” 2006. Web. 24 Feb 2021.

Vancouver:

Kim M. Associative skew clock routing for difficult instances. [Internet] [Masters thesis]. Texas A&M University; 2006. [cited 2021 Feb 24]. Available from: http://hdl.handle.net/1969.1/3856.

Council of Science Editors:

Kim M. Associative skew clock routing for difficult instances. [Masters Thesis]. Texas A&M University; 2006. Available from: http://hdl.handle.net/1969.1/3856

Penn State University

30. Xu, Bei. Optimization of A Vehicle Routing Problem with Backhauls.

Degree: 2015, Penn State University

URL: https://submit-etda.libraries.psu.edu/catalog/27310

► For all the industries associated with logistics and transportations, an efficient vehicle routing plan plays a significant role in reducing operational cost and increasing service… (more)

Subjects/Keywords: Vehicle Routing Problem; Backhauls; MILP

Record Details Similar Records Cite « Share

❌

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6^th Edition):

Xu, B. (2015). Optimization of A Vehicle Routing Problem with Backhauls. (Thesis). Penn State University. Retrieved from https://submit-etda.libraries.psu.edu/catalog/27310

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16^th Edition):

Xu, Bei. “Optimization of A Vehicle Routing Problem with Backhauls.” 2015. Thesis, Penn State University. Accessed February 24, 2021. https://submit-etda.libraries.psu.edu/catalog/27310.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7^th Edition):

Xu, Bei. “Optimization of A Vehicle Routing Problem with Backhauls.” 2015. Web. 24 Feb 2021.

Vancouver:

Xu B. Optimization of A Vehicle Routing Problem with Backhauls. [Internet] [Thesis]. Penn State University; 2015. [cited 2021 Feb 24]. Available from: https://submit-etda.libraries.psu.edu/catalog/27310.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Xu B. Optimization of A Vehicle Routing Problem with Backhauls. [Thesis]. Penn State University; 2015. Available from: https://submit-etda.libraries.psu.edu/catalog/27310

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

		in
And / Or
		in
And / Or
		in
And / Or
		in

Open Access Theses and Dissertations