You searched for subject:(Routing).
Showing records 1 – 30 of
2404 total matches.
◁ [1] [2] [3] [4] [5] … [81] ▶
Université de Neuchâtel
1.
Serbu, Sabina.
Load management in peer-to-peer systems: structures and
algorithms.
Degree: 2010, Université de Neuchâtel
URL: http://doc.rero.ch/record/18097 
► 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 »
Record Details
Similar Records
Cite
« Share
❌
APA ·
Chicago ·
MLA ·
Vancouver ·
CSE |
Export
to Zotero / EndNote / Reference
Manager
APA (6th 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 (16th Edition):
Serbu, Sabina. “Load management in peer-to-peer systems: structures and
algorithms.” 2010. Thesis, Université de Neuchâtel. Accessed February 27, 2020.
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 (7th Edition):
Serbu, Sabina. “Load management in peer-to-peer systems: structures and
algorithms.” 2010. Web. 27 Feb 2020.
Vancouver:
Serbu S. Load management in peer-to-peer systems: structures and
algorithms. [Internet] [Thesis]. Université de Neuchâtel; 2010. [cited 2020 Feb 27].
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)
▼ 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 changes so fast that conventional
routing protocols, especially those designed for quasi-static network topologies, do not work well in a VANET. Since vehicles with GPS receivers and Digital Map devices are now widespread,
routing protocols based on real-time traffic conditions emerge. In the
routing protocols, road intersections form the virtual backbone. In particular, there is a connection between two road intersections if packets were successfully delivered from one road intersection to the other in the recent past. To combat against high mobility, in this thesis, we propose a
routing protocol based on real-time information on vehicular traffic. We use backup paths for improving the packet delivery ratio in VANETs.
Advisors/Committee Members: Rung-Hung Gau (chair), CHUN-HUNG LIN (committee member), Wei Kuang Lai (chair).
Subjects/Keywords: Vanet; Routing
Record Details
Similar Records
Cite
Share »
Record Details
Similar Records
Cite
« Share
❌
APA ·
Chicago ·
MLA ·
Vancouver ·
CSE |
Export
to Zotero / EndNote / Reference
Manager
APA (6th 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 (16th Edition):
Tsai, Ming-jia. “Multipath Routing Based on Real-Time Traffic Information in VANET.” 2010. Thesis, NSYSU. Accessed February 27, 2020.
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 (7th Edition):
Tsai, Ming-jia. “Multipath Routing Based on Real-Time Traffic Information in VANET.” 2010. Web. 27 Feb 2020.
Vancouver:
Tsai M. Multipath Routing Based on Real-Time Traffic Information in VANET. [Internet] [Thesis]. NSYSU; 2010. [cited 2020 Feb 27].
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
Vanderbilt University
3.
Srikrishnan Kashyap, Anand.
Broadcast and multicast routing in ad-hoc networks with predetermined clustering.
Degree: MS, Computer Science, 2010, Vanderbilt University
URL: http://etd.library.vanderbilt.edu/available/etd-07092010-143013/
;
► 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)
▼ 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 move independently in any direction. An ad-hoc
routing protocol is a convention that controls how nodes decide which way to route packets between computing devices in a mobile ad-hoc network. Efficient
routing mechanisms in MANETs are a
subject of long and deep research and are governed by factors such as network density, node mobility and type of application.
This work proposes an efficient
routing algorithm for MANETs that primarily broadcast messages to all the nodes or to specific groups of nodes in the network. Nodes in such networks move in groups and this property is effectively utilized to design a
routing protocol for MANETs which primarily execute applications of such kind. The
routing protocol is implemented and tested on a discrete event simulator and its results are compared with other generic MANET
routing protocols. The thesis also discusses the strengths of this design approach and areas of improvement that can be addressed in future work.
Advisors/Committee Members: Dr. Yuan Xue (chair), Dr. Gabor Karsai (chair).
Subjects/Keywords: MANET Routing
Record Details
Similar Records
Cite
Share »
Record Details
Similar Records
Cite
« Share
❌
APA ·
Chicago ·
MLA ·
Vancouver ·
CSE |
Export
to Zotero / EndNote / Reference
Manager
APA (6th Edition):
Srikrishnan Kashyap, A. (2010). Broadcast and multicast routing in ad-hoc networks with predetermined clustering. (Masters Thesis). Vanderbilt University. Retrieved from http://etd.library.vanderbilt.edu/available/etd-07092010-143013/ ;
Chicago Manual of Style (16th Edition):
Srikrishnan Kashyap, Anand. “Broadcast and multicast routing in ad-hoc networks with predetermined clustering.” 2010. Masters Thesis, Vanderbilt University. Accessed February 27, 2020.
http://etd.library.vanderbilt.edu/available/etd-07092010-143013/ ;.
MLA Handbook (7th Edition):
Srikrishnan Kashyap, Anand. “Broadcast and multicast routing in ad-hoc networks with predetermined clustering.” 2010. Web. 27 Feb 2020.
Vancouver:
Srikrishnan Kashyap A. Broadcast and multicast routing in ad-hoc networks with predetermined clustering. [Internet] [Masters thesis]. Vanderbilt University; 2010. [cited 2020 Feb 27].
Available from: http://etd.library.vanderbilt.edu/available/etd-07092010-143013/ ;.
Council of Science Editors:
Srikrishnan Kashyap A. Broadcast and multicast routing in ad-hoc networks with predetermined clustering. [Masters Thesis]. Vanderbilt University; 2010. Available from: http://etd.library.vanderbilt.edu/available/etd-07092010-143013/ ;
Victoria University of Wellington
4.
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)
▼ 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 purpose, to connect internal clients with a
high speed external link. Such a network is likely to consist of a backbone with the clients
on one ‘side’ and one or more external links on the other. Most traffic on the network
moves between an internal client and the external world via the backbone.
But what about traffic between two clients of the ISP? Typical
routing protocols will find
the ‘best’ path between the two gateway routers at the edge of the client stub networks.
As these routers connect the stubs to the ISP core, this route should be entirely within the
ISP network. Ideally, from the ISP point of view, this traffic will go up to the backbone and
down again but it is possible that it may find another route along a redundant backup path.
Don Stokes of Knossos Networks has developed a protocol to sit on the client fringes of
this ISP style of network. It is based on the distance vector algorithm and is intended to
be subordinate to the existing interior gateway protocol running on the ISPs backbone. It
manipulates the route cost calculation so that paths towards the backbone become very
cheap and paths away from the backbone become expensive. This forces traffic in the
preferred direction unless the backup path ‘shortcut’ is very attractive or the backbone link
has disappeared.
It is the analysis and development of the fringe
routing protocol that forms the content of
this ME thesis.
Advisors/Committee Members: Linton, Andy, Welch, Ian.
Subjects/Keywords: Computer networking; Routing; Fringe routing protocol
Record Details
Similar Records
Cite
Share »
Record Details
Similar Records
Cite
« Share
❌
APA ·
Chicago ·
MLA ·
Vancouver ·
CSE |
Export
to Zotero / EndNote / Reference
Manager
APA (6th 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 (16th Edition):
Shepherd, Deb. “Developing the Fringe Routing Protocol.” 2011. Masters Thesis, Victoria University of Wellington. Accessed February 27, 2020.
http://hdl.handle.net/10063/1981.
MLA Handbook (7th Edition):
Shepherd, Deb. “Developing the Fringe Routing Protocol.” 2011. Web. 27 Feb 2020.
Vancouver:
Shepherd D. Developing the Fringe Routing Protocol. [Internet] [Masters thesis]. Victoria University of Wellington; 2011. [cited 2020 Feb 27].
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
University of New South Wales
5.
Bilh, Abdoulmenim Ahmed.
The design and evaluation of an opportunistic multicast routing protocol.
Degree: Computer Science & Engineering, 2010, University of New South Wales
URL: http://handle.unsw.edu.au/1959.4/51502
;
https://unsworks.unsw.edu.au/fapi/datastream/unsworks:10189/SOURCE02?view=true
► This thesis aims to examine the efficiency of opportunistic multicast routing in Wireless Mesh Network (WMN). Specifically, an opportunistic multicast routing protocol has been developed…
(more)
▼ This thesis aims to examine the efficiency of opportunistic multicast
routing in Wireless Mesh Network (WMN). Specifically, an opportunistic multicast
routing protocol has been developed in this work in order to gain better performance in WMNs compared to traditional multicast
routing protocols. The number of transmissions in the network to deliver a packet from a source to group of destinations has been taken as measure for the performance of the protocol. Less number of transmissions in the network to deliver a packet to group of destinations is an indicator for a better performance.The work has been divided into two parts. In the first part, a proposal of the first version of opportunistic multicast
routing protocol (OMRPv1) will be explained. By calculating the expected number of transmissions in the network, the efficiency of the protocol will be examined. OMRPv1 will be compared against a traditional protocol, non-opportunistic protocol, to confirm its better performance in the network. Then, a second version of our protocol will be introduced, OMRPv2, as a solution for some problems encountered in the first version. The comparison between OMRPv1 and OMRPv2 will show the better performance achieved with the newer version.In the second part, QualNet simulator will be used to simulate the protocol OMRPv2. In this part, not only the number of transmissions in the network will be considered, but also other metrics like end to end delay and delivery rate will be taken into account. The overhead of the protocol will be examined as well. Observation of the results from the simulation will lead to the third version of the protocol (OMRPv3). OMRPv3 will be simulated as well to show the improvement in the performance over the previous version OMRPv2.Finally, OMRPv3 will be compared to the best opportunistic multicast
routing protocol in the literature, Beacon-less Geographic
Routing for Multicast Applications (BRUMA). For that reason, BRUMA will be simulated in QualNet as well. For fair comparison, few modifications will be added to BRUMA. Then, the two protocols will be compared to each other using many metrics. Delivery rate, end to end delay, and number of transmissions in the network to serve the multicast groups are some of the metrics that will be used to compare the two protocols. Results show that our protocol, OMRPv3, outperforms BRUMA in many of these metrics.
Advisors/Committee Members: Chou, Chun Tung, Computer Science & Engineering, Faculty of Engineering, UNSW.
Subjects/Keywords: Routing; Opportunistic routing; Multicast in wireless networks
Record Details
Similar Records
Cite
Share »
Record Details
Similar Records
Cite
« Share
❌
APA ·
Chicago ·
MLA ·
Vancouver ·
CSE |
Export
to Zotero / EndNote / Reference
Manager
APA (6th Edition):
Bilh, A. A. (2010). The design and evaluation of an opportunistic multicast routing protocol. (Masters Thesis). University of New South Wales. Retrieved from http://handle.unsw.edu.au/1959.4/51502 ; https://unsworks.unsw.edu.au/fapi/datastream/unsworks:10189/SOURCE02?view=true
Chicago Manual of Style (16th Edition):
Bilh, Abdoulmenim Ahmed. “The design and evaluation of an opportunistic multicast routing protocol.” 2010. Masters Thesis, University of New South Wales. Accessed February 27, 2020.
http://handle.unsw.edu.au/1959.4/51502 ; https://unsworks.unsw.edu.au/fapi/datastream/unsworks:10189/SOURCE02?view=true.
MLA Handbook (7th Edition):
Bilh, Abdoulmenim Ahmed. “The design and evaluation of an opportunistic multicast routing protocol.” 2010. Web. 27 Feb 2020.
Vancouver:
Bilh AA. The design and evaluation of an opportunistic multicast routing protocol. [Internet] [Masters thesis]. University of New South Wales; 2010. [cited 2020 Feb 27].
Available from: http://handle.unsw.edu.au/1959.4/51502 ; https://unsworks.unsw.edu.au/fapi/datastream/unsworks:10189/SOURCE02?view=true.
Council of Science Editors:
Bilh AA. The design and evaluation of an opportunistic multicast routing protocol. [Masters Thesis]. University of New South Wales; 2010. Available from: http://handle.unsw.edu.au/1959.4/51502 ; https://unsworks.unsw.edu.au/fapi/datastream/unsworks:10189/SOURCE02?view=true
Victoria University of Wellington
6.
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)
▼ 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 the international links because there are no national links between the two networks. To avoid this, a peering relationship should be established between these two local networks to allow them to directly exchange traffic. Peering relationships are implemented at Internet Exchange Points (IXPs).
There has been a significant increase in the number of IXPs in developed countries but take up in developing countries has been slow despite these countries having the most to gain due to the high prices that they pay for international bandwidth. Research has identified that lack of technical skills is a key barrier to the deployment of IXPs in these countries. In particular, although skills exist to maintain an IXP there is a lack of technical expertise to integrate individual tools together to implement an IXP.
The goal of this thesis is to develop an integrated IXP solution that could be easily deployed in developing countries. This content of this thesis includes analysis of the requirements for such a solution, development of a design, description of implementation trade-offs and evaluation of a final solution
Advisors/Committee Members: Welch, Ian, Linton, Andy.
Subjects/Keywords: Peering; Exchange; Routing
Record Details
Similar Records
Cite
Share »
Record Details
Similar Records
Cite
« Share
❌
APA ·
Chicago ·
MLA ·
Vancouver ·
CSE |
Export
to Zotero / EndNote / Reference
Manager
APA (6th 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 (16th Edition):
Iqbal, Aun Haji. “Development of Osix - A Peering Point in a Box.” 2013. Masters Thesis, Victoria University of Wellington. Accessed February 27, 2020.
http://hdl.handle.net/10063/2699.
MLA Handbook (7th Edition):
Iqbal, Aun Haji. “Development of Osix - A Peering Point in a Box.” 2013. Web. 27 Feb 2020.
Vancouver:
Iqbal AH. Development of Osix - A Peering Point in a Box. [Internet] [Masters thesis]. Victoria University of Wellington; 2013. [cited 2020 Feb 27].
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
7.
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)
▼ 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 newlineinformation across the internet
from source to destination Routing newlinecomponents perform two
basic activities one is that of determining optimal newlinerouting
paths and the other of transporting information packets through the
newlineinternet In optimal routing path determination routing
protocols use metrics newlineto evaluate what path will be the best
for a packet to travel A metric is a newlinestandard of measurement
used by routing algorithms to determine optimal newlinepath to
destination To aid the process of path determination routing
newlinealgorithms initialize and maintain routing tables which
contain route newlineinformation newline
appendix p122-127.
Advisors/Committee Members: Wahidabanu R S D.
Subjects/Keywords: Data network Routing
Record Details
Similar Records
Cite
Share »
Record Details
Similar Records
Cite
« Share
❌
APA ·
Chicago ·
MLA ·
Vancouver ·
CSE |
Export
to Zotero / EndNote / Reference
Manager
APA (6th 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 (16th Edition):
I, Gnanambal. “Optimization of traffic routing and Handling of network
congestion;.” 2014. Thesis, Anna University. Accessed February 27, 2020.
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 (7th Edition):
I, Gnanambal. “Optimization of traffic routing and Handling of network
congestion;.” 2014. Web. 27 Feb 2020.
Vancouver:
I G. Optimization of traffic routing and Handling of network
congestion;. [Internet] [Thesis]. Anna University; 2014. [cited 2020 Feb 27].
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 New Mexico
8.
Arora, Tamanna.
Using ant colony optimization for routing in microprocesors.
Degree: Department of Computer Science, 2009, University of New Mexico
URL: http://hdl.handle.net/1928/10258
► Power consumption is an important constraint on VLSI systems. With the advancement in technology, it is now possible to pack a large range of functionalities…
(more)
▼ Power consumption is an important constraint on VLSI systems. With the advancement in technology, it is now possible to pack a large range of functionalities into VLSI devices. Hence it is important to find out ways to utilize these functionalities with optimized power consumption. This work focuses on curbing power consumption at the design stage. This work emphasizes minimizing active power consumption by minimizing the load capacitance of the chip. Capacitance of wires and vias can be minimized using Ant Colony Optimization (ACO) algorithms. ACO provides a multi agent framework for combinatorial optimization problems and hence is used to handle multiple constraints of minimizing wire-length and vias to achieve the goal of minimizing capacitance and hence power consumption. The ACO developed here is able to achieve an 8% reduction of wire-length and 7% reduction in vias thereby providing a 7% reduction in total capacitance, compared to other state of the art routers.
Advisors/Committee Members: Moses, Melanie, Luger, George F., Zarkesh-Ha, Payman.
Subjects/Keywords: VLSI; Routing; ACO
Record Details
Similar Records
Cite
Share »
Record Details
Similar Records
Cite
« Share
❌
APA ·
Chicago ·
MLA ·
Vancouver ·
CSE |
Export
to Zotero / EndNote / Reference
Manager
APA (6th Edition):
Arora, T. (2009). Using ant colony optimization for routing in microprocesors. (Masters Thesis). University of New Mexico. Retrieved from http://hdl.handle.net/1928/10258
Chicago Manual of Style (16th Edition):
Arora, Tamanna. “Using ant colony optimization for routing in microprocesors.” 2009. Masters Thesis, University of New Mexico. Accessed February 27, 2020.
http://hdl.handle.net/1928/10258.
MLA Handbook (7th Edition):
Arora, Tamanna. “Using ant colony optimization for routing in microprocesors.” 2009. Web. 27 Feb 2020.
Vancouver:
Arora T. Using ant colony optimization for routing in microprocesors. [Internet] [Masters thesis]. University of New Mexico; 2009. [cited 2020 Feb 27].
Available from: http://hdl.handle.net/1928/10258.
Council of Science Editors:
Arora T. Using ant colony optimization for routing in microprocesors. [Masters Thesis]. University of New Mexico; 2009. Available from: http://hdl.handle.net/1928/10258
University of Ottawa
9.
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)
▼ 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.
Subjects/Keywords: Multipath Routing;
Wireless Sensor Networks;
WSN;
Source Routing;
Diffusion Routing;
Hybrid Routing
Record Details
Similar Records
Cite
Share »
Record Details
Similar Records
Cite
« Share
❌
APA ·
Chicago ·
MLA ·
Vancouver ·
CSE |
Export
to Zotero / EndNote / Reference
Manager
APA (6th 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 (16th Edition):
Ebada, Mohamed. “Multipath Routing for Wireless Sensor Networks: A Hybrid Between Source Routing and Diffusion Techniques
.” 2011. Thesis, University of Ottawa. Accessed February 27, 2020.
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 (7th Edition):
Ebada, Mohamed. “Multipath Routing for Wireless Sensor Networks: A Hybrid Between Source Routing and Diffusion Techniques
.” 2011. Web. 27 Feb 2020.
Vancouver:
Ebada M. Multipath Routing for Wireless Sensor Networks: A Hybrid Between Source Routing and Diffusion Techniques
. [Internet] [Thesis]. University of Ottawa; 2011. [cited 2020 Feb 27].
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
University of Kentucky
10.
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 »
Record Details
Similar Records
Cite
« Share
❌
APA ·
Chicago ·
MLA ·
Vancouver ·
CSE |
Export
to Zotero / EndNote / Reference
Manager
APA (6th 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 (16th Edition):
Mahmood, Baban A. “Routing and Security in Mobile Ad Hoc Networks.” 2016. Doctoral Dissertation, University of Kentucky. Accessed February 27, 2020.
https://uknowledge.uky.edu/cs_etds/53.
MLA Handbook (7th Edition):
Mahmood, Baban A. “Routing and Security in Mobile Ad Hoc Networks.” 2016. Web. 27 Feb 2020.
Vancouver:
Mahmood BA. Routing and Security in Mobile Ad Hoc Networks. [Internet] [Doctoral dissertation]. University of Kentucky; 2016. [cited 2020 Feb 27].
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
University of Southern California
11.
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/5655
► 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 »
Record Details
Similar Records
Cite
« Share
❌
APA ·
Chicago ·
MLA ·
Vancouver ·
CSE |
Export
to Zotero / EndNote / Reference
Manager
APA (6th 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/5655
Chicago Manual of Style (16th 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 27, 2020.
http://digitallibrary.usc.edu/cdm/compoundobject/collection/p15799coll3/id/208853/rec/5655.
MLA Handbook (7th Edition):
Train, Joshua D. “Routing fountains: leveraging broadcast channels to improve
the dissemination of control information for large inter-domain
networks.” 2014. Web. 27 Feb 2020.
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 2020 Feb 27].
Available from: http://digitallibrary.usc.edu/cdm/compoundobject/collection/p15799coll3/id/208853/rec/5655.
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/5655
Universidade Nova
12.
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)
▼ 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, the continuous operations of large networks, under multiple ownerships, are of
tremendous importance and as a result, routing protocols have gained numerous extensions and accumulated complexity. Policy-based routing can be of signi cance for common networks when the cost of transporting a bit is no longer the biggest pressure point.
The best path problem is a generalization of the shortest path problem that suits policy
based routing. This means that preferences for the paths depend on semantically rich characteristics, in which two di erent paths may have the same preference. However, current policy-based routing models cannot take full advantage of the multiplicity of connections to a given destination and are single path in nature. Therefore multipath can bring several advantages in policy based routing.
Designing multipath routing protocols based on policies seem to be a problem of interest.
To model routing problems, algebraic structures and graph theory are used. Through
variants of classical methods of linear algebra routing problems can be solved.
The objective of this dissertation is to devise a multipath policy-based routing protocol using a simple destination-based hop-by-hop protocol with independent forwarding decisions.
Networks featuring these characteristics can be more resilient to failures, provide
better tra c distribution and maintain a simple forwarding paradigm. The dissertation
concludes with the trade-o 's between the
exibility of the proposed solution, the amount of multiple paths that can be used simultaneously and the network restrictions that must be applied.
Advisors/Committee Members: Pinto, Paulo, Amaral, Pedro.
Subjects/Keywords: Multipath routing; Policy routing; Algebraic models; Routing problem
Record Details
Similar Records
Cite
Share »
Record Details
Similar Records
Cite
« Share
❌
APA ·
Chicago ·
MLA ·
Vancouver ·
CSE |
Export
to Zotero / EndNote / Reference
Manager
APA (6th 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 (16th Edition):
Chalaça, João Pedro Gonçalves. “Multipath policy routing in packet switched networks.” 2013. Thesis, Universidade Nova. Accessed February 27, 2020.
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 (7th Edition):
Chalaça, João Pedro Gonçalves. “Multipath policy routing in packet switched networks.” 2013. Web. 27 Feb 2020.
Vancouver:
Chalaça JPG. Multipath policy routing in packet switched networks. [Internet] [Thesis]. Universidade Nova; 2013. [cited 2020 Feb 27].
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
13.
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 »
Record Details
Similar Records
Cite
« Share
❌
APA ·
Chicago ·
MLA ·
Vancouver ·
CSE |
Export
to Zotero / EndNote / Reference
Manager
APA (6th 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 (16th Edition):
Vitorino, Tiago Miguel Mendes Ferreira. “Planning and verification of multipath routing protocols.” 2015. Thesis, Universidade Nova. Accessed February 27, 2020.
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 (7th Edition):
Vitorino, Tiago Miguel Mendes Ferreira. “Planning and verification of multipath routing protocols.” 2015. Web. 27 Feb 2020.
Vancouver:
Vitorino TMMF. Planning and verification of multipath routing protocols. [Internet] [Thesis]. Universidade Nova; 2015. [cited 2020 Feb 27].
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
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 »
Record Details
Similar Records
Cite
« Share
❌
APA ·
Chicago ·
MLA ·
Vancouver ·
CSE |
Export
to Zotero / EndNote / Reference
Manager
APA (6th 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 (16th Edition):
Amaral, Pedro Miguel Figueiredo. “Multipath inter-domain policy routing.” 2012. Thesis, Universidade Nova. Accessed February 27, 2020.
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 (7th Edition):
Amaral, Pedro Miguel Figueiredo. “Multipath inter-domain policy routing.” 2012. Web. 27 Feb 2020.
Vancouver:
Amaral PMF. Multipath inter-domain policy routing. [Internet] [Thesis]. Universidade Nova; 2012. [cited 2020 Feb 27].
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 »
Record Details
Similar Records
Cite
« Share
❌
APA ·
Chicago ·
MLA ·
Vancouver ·
CSE |
Export
to Zotero / EndNote / Reference
Manager
APA (6th 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 (16th 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 27, 2020.
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 (7th Edition):
Antić, Marija D 1980-. “Optimizacija neblokirajućih paketskih mreža upotrebom
praktičnog protokola za rutiranje sa balansiranjem
saobraćaja.” 2016. Web. 27 Feb 2020.
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 2020 Feb 27].
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
Delft University of Technology
16.
Sondak, R.C.
Dynamic Intelligent Algorithm for Navigation (DIANa): A Route Finding System using Historical Traffic Data
:.
Degree: 2010, Delft University of Technology
URL: http://resolver.tudelft.nl/uuid:b2f56e5e-face-4335-bc9a-1bf00a11ae7e
► Traffic congestion has been one of the major problems in our everyday life. It has caused billions and billions of dollars including loss of productivity…
(more)
▼ Traffic congestion has been one of the major problems in our everyday life. It has caused billions and billions of dollars including loss of productivity in our everyday life. Many institutions, governmental organizations, and academics have tried to come up with many initiatives and solutions to minimize congestion.
Our research on dynamic
routing is meant to help minimizing this problem from individual perspective since we believe that traffic congestion is also directly related and can be influenced by individual’s decision making behavior.
We focused on finding a solution that can be integrated to an existing system by using a
routing algorithm that can forecast traffic congestion and finding the fastest route to get to the end point. The forecast will be based on the historical traffic information. Deriving on the notion that most traffic congestions happen almost at the same time during the day and the same hours daily, we have combined the historical real traffic data to be used in an algorithm to help an effective Dynamic Intelligent Algorithm for Navigation (DIANa) to avoid congestion or other road blockage.
Advisors/Committee Members: Rothkrantz, L.J.M..
Subjects/Keywords: dynamic routing; dynamic; routing; dijkstra; routing algorithm; traffic; intelligent; intelligent algorithm; historical
Record Details
Similar Records
Cite
Share »
Record Details
Similar Records
Cite
« Share
❌
APA ·
Chicago ·
MLA ·
Vancouver ·
CSE |
Export
to Zotero / EndNote / Reference
Manager
APA (6th Edition):
Sondak, R. C. (2010). Dynamic Intelligent Algorithm for Navigation (DIANa): A Route Finding System using Historical Traffic Data
:. (Masters Thesis). Delft University of Technology. Retrieved from http://resolver.tudelft.nl/uuid:b2f56e5e-face-4335-bc9a-1bf00a11ae7e
Chicago Manual of Style (16th Edition):
Sondak, R C. “Dynamic Intelligent Algorithm for Navigation (DIANa): A Route Finding System using Historical Traffic Data
:.” 2010. Masters Thesis, Delft University of Technology. Accessed February 27, 2020.
http://resolver.tudelft.nl/uuid:b2f56e5e-face-4335-bc9a-1bf00a11ae7e.
MLA Handbook (7th Edition):
Sondak, R C. “Dynamic Intelligent Algorithm for Navigation (DIANa): A Route Finding System using Historical Traffic Data
:.” 2010. Web. 27 Feb 2020.
Vancouver:
Sondak RC. Dynamic Intelligent Algorithm for Navigation (DIANa): A Route Finding System using Historical Traffic Data
:. [Internet] [Masters thesis]. Delft University of Technology; 2010. [cited 2020 Feb 27].
Available from: http://resolver.tudelft.nl/uuid:b2f56e5e-face-4335-bc9a-1bf00a11ae7e.
Council of Science Editors:
Sondak RC. Dynamic Intelligent Algorithm for Navigation (DIANa): A Route Finding System using Historical Traffic Data
:. [Masters Thesis]. Delft University of Technology; 2010. Available from: http://resolver.tudelft.nl/uuid:b2f56e5e-face-4335-bc9a-1bf00a11ae7e
University of Alberta
17.
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)
▼ 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 and outdoor
environments in cold climates. We use real measurements to evaluate
the use of the temperature difference as a proxy to heat flow
through walls, and the feasibility of creating a network of in-wall
thermoelectric harvesting sensors. We also discuss the seasonal
availability of thermoelectric energy and get in depth to the
issues and advantages this presents. We formulate the corresponding
multi-commodity routing flow problem, where each commodity is data
from every node, and using the indoor/outdoor temperature as a
proxy we investigate the effect of fairness in routing. We also
present a low overhead method of constructing a seasonally-aware
routing scheme and study its performance. Finally we talk about
techniques for predicting the incoming available energy in the
future.
Subjects/Keywords: Seasonal Routing; Thermoelectric Harvesting
Record Details
Similar Records
Cite
Share »
Record Details
Similar Records
Cite
« Share
❌
APA ·
Chicago ·
MLA ·
Vancouver ·
CSE |
Export
to Zotero / EndNote / Reference
Manager
APA (6th 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 (16th Edition):
Kollias, Aristotelis. “Thermoelectric Harvesting and Seasonal Routing in Wireless
Sensor Networks.” 2016. Masters Thesis, University of Alberta. Accessed February 27, 2020.
https://era.library.ualberta.ca/files/c2v23vt42k.
MLA Handbook (7th Edition):
Kollias, Aristotelis. “Thermoelectric Harvesting and Seasonal Routing in Wireless
Sensor Networks.” 2016. Web. 27 Feb 2020.
Vancouver:
Kollias A. Thermoelectric Harvesting and Seasonal Routing in Wireless
Sensor Networks. [Internet] [Masters thesis]. University of Alberta; 2016. [cited 2020 Feb 27].
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
18.
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 »
Record Details
Similar Records
Cite
« Share
❌
APA ·
Chicago ·
MLA ·
Vancouver ·
CSE |
Export
to Zotero / EndNote / Reference
Manager
APA (6th 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 (16th Edition):
Mahmood, Abdullah-Al. “Non-bifurcated routing and scheduling in wireless mesh
networks.” 2010. Doctoral Dissertation, University of Alberta. Accessed February 27, 2020.
https://era.library.ualberta.ca/files/qz20st52j.
MLA Handbook (7th Edition):
Mahmood, Abdullah-Al. “Non-bifurcated routing and scheduling in wireless mesh
networks.” 2010. Web. 27 Feb 2020.
Vancouver:
Mahmood A. Non-bifurcated routing and scheduling in wireless mesh
networks. [Internet] [Doctoral dissertation]. University of Alberta; 2010. [cited 2020 Feb 27].
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
19.
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)
▼ 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. One of the
issues concerning IP address lookups is the average lookup time. In
previous works, caching was shown to be an effective method to
minimize the average lookup time. Caching involves storing
information on recent IP lookup results in order to decrease
average lookup times. In this thesis, we present two architectures
that contain a prefix cache and a dynamic substride cache. The
dynamic substride cache stores longest possible substrides from
previous lookups, and is used in conjunction with a prefix cache.
Successful hits in both the caches help reduce the number of
worst-case lookups in the low level memory containing the IP
routing table in a trie data structure. From simulations, we show
that the two architectures show up to 99.9%global hit rate.
Furthermore we present analytical models to find optimal designs
for the two architectures. We also show that the architectures can
support incremental updates once appropriate modifications are made
to the trie data structure.
Subjects/Keywords: IP lookups, Routing, Switching, Caching
Record Details
Similar Records
Cite
Share »
Record Details
Similar Records
Cite
« Share
❌
APA ·
Chicago ·
MLA ·
Vancouver ·
CSE |
Export
to Zotero / EndNote / Reference
Manager
APA (6th 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 (16th Edition):
Ravinder, Sunil. “Cache architectures to improve IP lookups.” 2009. Masters Thesis, University of Alberta. Accessed February 27, 2020.
https://era.library.ualberta.ca/files/bv73c126f.
MLA Handbook (7th Edition):
Ravinder, Sunil. “Cache architectures to improve IP lookups.” 2009. Web. 27 Feb 2020.
Vancouver:
Ravinder S. Cache architectures to improve IP lookups. [Internet] [Masters thesis]. University of Alberta; 2009. [cited 2020 Feb 27].
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
Texas A&M University
20.
Wu, Chia-Yu.
A Pre-Search Assisted ILP Approach to Analog Integrated Circuit Routing.
Degree: 2015, Texas A&M University
URL: http://hdl.handle.net/1969.1/155476
► The routing of analog integrated circuits (IC) has long been a challenge due to numerous constraints (such as symmetry and topology-matching) that matter for overall…
(more)
▼ The
routing of analog integrated circuits (IC) has long been a challenge due to numerous constraints (such as symmetry and topology-matching) that matter for overall circuit performance. Existing automatic analog IC
routing algorithms can be broadly categorized into two approaches: sequential approach that heuristically routes one net after another and constructive ILP (Integer Linear Programming). The former approach is usually fast but may miss opportunities of finding good solutions. The constructive ILP provides optimal solutions but can be very time consuming. We propose a simple yet efficient method that combines the advantages of both existing approaches. First, sequential
routing is performed to obtain a set of candidate
routing paths for each net. Then, an ILP is applied to commit each net to only one of its candidate routes. Experiments on two op-amp designs show that the post-layout performance (such as gain and phase margin) from our method is close to that of manual design. Our method also outperforms a previous work of automated analog IC
routing.
Advisors/Committee Members: Hu, Jiang (advisor), Li, Peng (committee member), Jiang, Anxiao (committee member).
Subjects/Keywords: Physical Design; Routing; Analog ICs
Record Details
Similar Records
Cite
Share »
Record Details
Similar Records
Cite
« Share
❌
APA ·
Chicago ·
MLA ·
Vancouver ·
CSE |
Export
to Zotero / EndNote / Reference
Manager
APA (6th Edition):
Wu, C. (2015). A Pre-Search Assisted ILP Approach to Analog Integrated Circuit Routing. (Thesis). Texas A&M University. Retrieved from http://hdl.handle.net/1969.1/155476
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
Chicago Manual of Style (16th Edition):
Wu, Chia-Yu. “A Pre-Search Assisted ILP Approach to Analog Integrated Circuit Routing.” 2015. Thesis, Texas A&M University. Accessed February 27, 2020.
http://hdl.handle.net/1969.1/155476.
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
MLA Handbook (7th Edition):
Wu, Chia-Yu. “A Pre-Search Assisted ILP Approach to Analog Integrated Circuit Routing.” 2015. Web. 27 Feb 2020.
Vancouver:
Wu C. A Pre-Search Assisted ILP Approach to Analog Integrated Circuit Routing. [Internet] [Thesis]. Texas A&M University; 2015. [cited 2020 Feb 27].
Available from: http://hdl.handle.net/1969.1/155476.
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
Council of Science Editors:
Wu C. A Pre-Search Assisted ILP Approach to Analog Integrated Circuit Routing. [Thesis]. Texas A&M University; 2015. Available from: http://hdl.handle.net/1969.1/155476
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
Texas A&M University
21.
Kim, Min-seok.
Associative skew clock routing for difficult instances.
Degree: 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)
▼ 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 of sinks. Although
the number of constraints is reduced, the problem becomes more difficult to solve
due to the enlarged solution space. Perhaps, the only previous study used a very primitive
delay model which could not handle difficult instances when sink groups are intermingled.
We reuse existing techniques to solve this problem including difficult instances based on an
improved delay model. Experimental results show that our algorithm can reduce the total
clock
routing wirelength by 9%??15% compared to greedy-DME, which is one of the best
zero skew
routing algorithms.
Advisors/Committee Members: Hu, Jiang (advisor), Kim, Eun Jung (committee member), Shi, Weiping (committee member).
Subjects/Keywords: clock routing
Record Details
Similar Records
Cite
Share »
Record Details
Similar Records
Cite
« Share
❌
APA ·
Chicago ·
MLA ·
Vancouver ·
CSE |
Export
to Zotero / EndNote / Reference
Manager
APA (6th Edition):
Kim, M. (2006). Associative skew clock routing for difficult instances. (Thesis). Texas A&M University. Retrieved from http://hdl.handle.net/1969.1/3856
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
Chicago Manual of Style (16th Edition):
Kim, Min-seok. “Associative skew clock routing for difficult instances.” 2006. Thesis, Texas A&M University. Accessed February 27, 2020.
http://hdl.handle.net/1969.1/3856.
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
MLA Handbook (7th Edition):
Kim, Min-seok. “Associative skew clock routing for difficult instances.” 2006. Web. 27 Feb 2020.
Vancouver:
Kim M. Associative skew clock routing for difficult instances. [Internet] [Thesis]. Texas A&M University; 2006. [cited 2020 Feb 27].
Available from: http://hdl.handle.net/1969.1/3856.
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
Council of Science Editors:
Kim M. Associative skew clock routing for difficult instances. [Thesis]. Texas A&M University; 2006. Available from: http://hdl.handle.net/1969.1/3856
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
Texas A&M University
22.
Nemade, Nikhil Pandit.
Application of network coding for VLSI routing.
Degree: 2009, Texas A&M University
URL: http://hdl.handle.net/1969.1/ETD-TAMU-2670
► This thesis studies the applications of the network coding technique for intercon- nect optimization and improving the routability of Very-large-scale integration (VLSI) designs. The goal…
(more)
▼ This thesis studies the applications of the network coding technique for intercon-
nect optimization and improving the routability of Very-large-scale integration (VLSI)
designs. The goal of the
routing process is to connect the required sets of sources
and sinks while minimizing the total wirelength and reducing congestion. Typically,
chip interconnects include multiple sinks and are routed through intermediate nodes.
The main idea of the network coding technique is to enable the intermediate nodes
to generate new signals by combining the signals received over their incoming wires.
This is in contrast to the traditional approaches, in which an intermediate node can
only forward the incoming signals. This thesis attempts to explore the possible ben-
efits of the network coding technique for reducing the total wirelengh and mitigating
congestion in VLSI designs.
The contribution of the thesis is three-fold. First, we extend the Hanan?s theo-
rem for multi-net rectilinear coding networks. Second, we propose several exact and
heuristic solutions for finding near-optimal
routing topologies that utilize network
coding techniques. Next, we perform extensive simulation study to evaluate the ad-
vantage of network coding over the traditional approaches. The simulations help to
identify
routing instances where the network coding techniques are expected to be
beneficial. Finally, we evaluate the potential benefits from network coding in practical
settings by analyzing its performance on the International Symposium on Physical
Design (ISPD) benchmarks. Our results show that while network coding shows upto 2.43% improvement on
unconstrained rectilinear grids, it shows upto 4.34% improvement in cases with con-
straints along the grid. In addition, it shows an improvement upto 8.4% in cases
involving congestion reduction and also improves
routing performance on ISPD rout-
ing benchmarks.
Advisors/Committee Members: Sprintson, Alex (advisor), Bettati, Riccardo (committee member), Hu, Jiang (committee member), Reddy, Narsimha (committee member).
Subjects/Keywords: Network Coding; Global Routing
Record Details
Similar Records
Cite
Share »
Record Details
Similar Records
Cite
« Share
❌
APA ·
Chicago ·
MLA ·
Vancouver ·
CSE |
Export
to Zotero / EndNote / Reference
Manager
APA (6th Edition):
Nemade, N. P. (2009). Application of network coding for VLSI routing. (Thesis). Texas A&M University. Retrieved from http://hdl.handle.net/1969.1/ETD-TAMU-2670
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
Chicago Manual of Style (16th Edition):
Nemade, Nikhil Pandit. “Application of network coding for VLSI routing.” 2009. Thesis, Texas A&M University. Accessed February 27, 2020.
http://hdl.handle.net/1969.1/ETD-TAMU-2670.
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
MLA Handbook (7th Edition):
Nemade, Nikhil Pandit. “Application of network coding for VLSI routing.” 2009. Web. 27 Feb 2020.
Vancouver:
Nemade NP. Application of network coding for VLSI routing. [Internet] [Thesis]. Texas A&M University; 2009. [cited 2020 Feb 27].
Available from: http://hdl.handle.net/1969.1/ETD-TAMU-2670.
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
Council of Science Editors:
Nemade NP. Application of network coding for VLSI routing. [Thesis]. Texas A&M University; 2009. Available from: http://hdl.handle.net/1969.1/ETD-TAMU-2670
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
Texas A&M University
23.
Liu, Yong.
Improving network routing performance in dynamic environments.
Degree: 2007, Texas A&M University
URL: http://hdl.handle.net/1969.1/4745
► In this dissertation, we study methods for improving the routing performance of computer communication networks in dynamic environments. The dynamic environments we considered in this…
(more)
▼ In this dissertation, we study methods for improving the
routing performance
of computer communication networks in dynamic environments. The dynamic environments
we considered in this work include both network topology changes and
traffic demand changes.
In the first part, We propose a novel fast rerouting scheme for link state
routing
protocols. Link state
routing protocols are widely used by today??????s ISPs on their
backbone networks. The global update based rerouting of link state protocols usually
takes seconds to complete which affects real time applications like Voice over IP.
In our scheme, usually, only routers directly connected to failed links are involved
in rerouting. For other cases, only a small number of neighboring routers are also
involved. Since our scheme calculates rerouting paths in advance, rerouting can be
done faster than previous reactive approaches. The computation complexity of our
scheme is less than previous proactive approaches.
In the second part, we study Multihoming Route Control (MRC) that is a technology
used by multihomed stub networks recently. By selecting ISPs with better
quality, MRC can improve
routing performance of stub networks significantly.
We first study the stability issue of distributed MRC and propose two methods
to avoid possible oscillations of traditional MRC. The first MRC method is based on ??????optimal
routing??????. The idea is to let the stub networks belonging to a same
organization coordinate their MRC and thus avoid oscillations. The second method
is based on ??????user-optimal
routing??????. The idea is to allow MRC devices to use multiple
paths for traffic to one destination network and switch traffic between paths smoothly
when path quality or the traffic matrix changes.
A third MRC method we propose is for MRC of traffic consisting of TCP flows
of different sizes on paths with bottlenecks of limited capacity. Based on analysis of
quality characteristics of bottleneck links, we propose a greedy MRC approach that
works in small timescales. Simulation results show that the proposed MRC method
can greatly improve
routing performance for the MRC sites as well as the overall
routing performance of all sites in the network.
Advisors/Committee Members: Reddy, A. L. Narasimha (advisor), Bettati, Riccardo (committee member), Cantrell, Pierce E. (committee member), Vannucci, Marina (committee member).
Subjects/Keywords: network; routing
Record Details
Similar Records
Cite
Share »
Record Details
Similar Records
Cite
« Share
❌
APA ·
Chicago ·
MLA ·
Vancouver ·
CSE |
Export
to Zotero / EndNote / Reference
Manager
APA (6th Edition):
Liu, Y. (2007). Improving network routing performance in dynamic environments. (Thesis). Texas A&M University. Retrieved from http://hdl.handle.net/1969.1/4745
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
Chicago Manual of Style (16th Edition):
Liu, Yong. “Improving network routing performance in dynamic environments.” 2007. Thesis, Texas A&M University. Accessed February 27, 2020.
http://hdl.handle.net/1969.1/4745.
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
MLA Handbook (7th Edition):
Liu, Yong. “Improving network routing performance in dynamic environments.” 2007. Web. 27 Feb 2020.
Vancouver:
Liu Y. Improving network routing performance in dynamic environments. [Internet] [Thesis]. Texas A&M University; 2007. [cited 2020 Feb 27].
Available from: http://hdl.handle.net/1969.1/4745.
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
Council of Science Editors:
Liu Y. Improving network routing performance in dynamic environments. [Thesis]. Texas A&M University; 2007. Available from: http://hdl.handle.net/1969.1/4745
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
Loughborough University
24.
Ali, Awos K.
Previous hop routing : exploiting opportunism in VANETs.
Degree: PhD, 2018, Loughborough University
URL: https://dspace.lboro.ac.uk/2134/27991
;
http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.734165
► Routing in highly dynamic wireless networks such as Vehicular Ad-hoc Networks (VANETs) is a challenging task due to frequent topology changes. Sustaining a transmission path…
(more)
▼ Routing in highly dynamic wireless networks such as Vehicular Ad-hoc Networks (VANETs) is a challenging task due to frequent topology changes. Sustaining a transmission path between peers in such network environment is difficult. In this thesis, Previous Hop Routing (PHR) is poposed; an opportunistic forwarding protocol exploiting previous hop information and distance to destination to make the forwarding decision on a packet-by-packet basis. It is intended for use in highly dynamic network where the life time of a hop-by-hop path between source and destination nodes is short. Exploiting the broadcast nature of wireless communication avoids the need to copy packets, and enables redundant paths to be formed. To save network resources, especially under high network loads, PHR employs probabilistic forwarding. The forwarding probability is calculated based on the perceived network load as measured by the arrival rate at the network interface. We evaluate PHR in an urban VANET environment using NS2 (for network traffic) and SUMO (for vehicular movement) simulators, with scenarios configured to re ect real-world conditions. The simulation scenarios are configured to use two velocity profiles i.e. Low and high velocity. The results show that the PHR networks able to achieve best performance as measured by Packet Delivery Ratio (PDR) and Drop Burst Length (DBL) compared to conventional routing protocols in high velocity scenarios.
Subjects/Keywords: PHR; VANETs; Routing; Opportunistic
Record Details
Similar Records
Cite
Share »
Record Details
Similar Records
Cite
« Share
❌
APA ·
Chicago ·
MLA ·
Vancouver ·
CSE |
Export
to Zotero / EndNote / Reference
Manager
APA (6th Edition):
Ali, A. K. (2018). Previous hop routing : exploiting opportunism in VANETs. (Doctoral Dissertation). Loughborough University. Retrieved from https://dspace.lboro.ac.uk/2134/27991 ; http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.734165
Chicago Manual of Style (16th Edition):
Ali, Awos K. “Previous hop routing : exploiting opportunism in VANETs.” 2018. Doctoral Dissertation, Loughborough University. Accessed February 27, 2020.
https://dspace.lboro.ac.uk/2134/27991 ; http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.734165.
MLA Handbook (7th Edition):
Ali, Awos K. “Previous hop routing : exploiting opportunism in VANETs.” 2018. Web. 27 Feb 2020.
Vancouver:
Ali AK. Previous hop routing : exploiting opportunism in VANETs. [Internet] [Doctoral dissertation]. Loughborough University; 2018. [cited 2020 Feb 27].
Available from: https://dspace.lboro.ac.uk/2134/27991 ; http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.734165.
Council of Science Editors:
Ali AK. Previous hop routing : exploiting opportunism in VANETs. [Doctoral Dissertation]. Loughborough University; 2018. Available from: https://dspace.lboro.ac.uk/2134/27991 ; http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.734165
25.
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)
▼ 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
routed optical network involves selecting a newlinewavelength and a
route for that connection with the constraint that the route
newlineconnects the source of the connection to the destination of
the connection and newlinethe same wavelength is available on all
fiber links of the route A connection newlineestablished in the
above manner is called a lightpath The requirement that the
newlinesame wavelength must be used on all the links of the
selected route is known newlineas wavelength continuity constraint
An algorithm used for selecting routes newlineand wavelengths to
establish lightpaths is known as Routing and Wavelength
newlineAssignment RWA algorithm The RWA problem is termed as
dynamic newlineRWA if the connection requests arrive or leave
randomly newline newline
reference p203-215.
Advisors/Committee Members: Meenakshi M.
Subjects/Keywords: Routing and Wavelength Assignment
Record Details
Similar Records
Cite
Share »
Record Details
Similar Records
Cite
« Share
❌
APA ·
Chicago ·
MLA ·
Vancouver ·
CSE |
Export
to Zotero / EndNote / Reference
Manager
APA (6th 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 (16th Edition):
V, Saminadan. “A study on signal quality based Dynamic RWA in all
optical WDM Networks;.” 2014. Thesis, Anna University. Accessed February 27, 2020.
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 (7th Edition):
V, Saminadan. “A study on signal quality based Dynamic RWA in all
optical WDM Networks;.” 2014. Web. 27 Feb 2020.
Vancouver:
V S. A study on signal quality based Dynamic RWA in all
optical WDM Networks;. [Internet] [Thesis]. Anna University; 2014. [cited 2020 Feb 27].
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
26.
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)
▼ 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 or intermediate
nodes in this environment The size or area newlineof the router
design is very important while considering the device it is
newlinepossible to integrate hundreds of billions of transistors on
a single chip newlinewhich will allow for the integration of
hundreds or even thousands of newlineprocessor cores a multi many
core architecture on a single die along with newlinethe
interconnect infrastructure and memory In a multi many core
newlinearchitecture the interconnect occupies a large amount of the
on chip area newlinea large amount of gates that otherwise might
have been deployed for newlineincreasing the number and the
complexity of the computational resources now newlineneed to be
deployed for designing the communication infrastructure NoCs
newlinehave been studied on chip communication architectures for
design time newlineparameterized application specific static multi
many core systems An newlineapplication specific NoC defined as a
design time parameterized architecture newlinewith a fixed routing
scheme a fixed number of allowed virtual connections at newlineeach
output port or a fixed application mapping instance NoCs as a
systemon newlinechip communication architecture, its different
design methodologies and newlinekey research problems were
discussed in literature survey newline newline
newline
reference p152-161.
Advisors/Committee Members: Renuga P.
Subjects/Keywords: Fixed routing scheme; Interconnect infrastructure
Record Details
Similar Records
Cite
Share »
Record Details
Similar Records
Cite
« Share
❌
APA ·
Chicago ·
MLA ·
Vancouver ·
CSE |
Export
to Zotero / EndNote / Reference
Manager
APA (6th 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 (16th Edition):
Anithar. “Design implementation and Performance evaluation of
network On chip communication link router;.” 2015. Thesis, Anna University. Accessed February 27, 2020.
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 (7th Edition):
Anithar. “Design implementation and Performance evaluation of
network On chip communication link router;.” 2015. Web. 27 Feb 2020.
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 2020 Feb 27].
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
University of Illinois – Urbana-Champaign
27.
Chen, Xi.
Integrated planning of multi-type railroad service facilities under location, routing and inventory considerations.
Degree: MS, Industrial Engineering, 2015, University of Illinois – Urbana-Champaign
URL: http://hdl.handle.net/2142/78683
► In the North America railroad network, thousands of locomotives are running everyday and they are in need of receiving various types of mechanical work that…
(more)
▼ In the North America railroad network, thousands of locomotives are running everyday and they are in need of receiving various types of mechanical work that can be random, periodic, or on-demand. Each type of work can be performed either at fixed facilities or via movable facilities. It is an important and difficult problem to make planning of the whole railroad system, including facilities locations, locomotives assignment, fuel inventory strategy, and movable facility routing trips.
This paper formulates a large-scale linear mixed-integer mathematical model for the railroad system that integrates decisions about (i) locations, capacities, and types of facilities, (ii) assignments of locomotive work to facilities, (iii) fuel strategy of trains, and (iv) routes of movable facilities. We also propose a framework consisting of several solution algorithms, including network consolidation, network generation, reduce candidate location number, free move, and trip merge. The solution framework is designed to solve large-scale problem efficiently. Empirical case studies using field data show that the proposed model and algorithms are capable of providing near-optimum solutions effectively.
Subjects/Keywords: MIP; Location; Inventory; Routing
Record Details
Similar Records
Cite
Share »
Record Details
Similar Records
Cite
« Share
❌
APA ·
Chicago ·
MLA ·
Vancouver ·
CSE |
Export
to Zotero / EndNote / Reference
Manager
APA (6th Edition):
Chen, X. (2015). Integrated planning of multi-type railroad service facilities under location, routing and inventory considerations. (Thesis). University of Illinois – Urbana-Champaign. Retrieved from http://hdl.handle.net/2142/78683
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
Chicago Manual of Style (16th Edition):
Chen, Xi. “Integrated planning of multi-type railroad service facilities under location, routing and inventory considerations.” 2015. Thesis, University of Illinois – Urbana-Champaign. Accessed February 27, 2020.
http://hdl.handle.net/2142/78683.
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
MLA Handbook (7th Edition):
Chen, Xi. “Integrated planning of multi-type railroad service facilities under location, routing and inventory considerations.” 2015. Web. 27 Feb 2020.
Vancouver:
Chen X. Integrated planning of multi-type railroad service facilities under location, routing and inventory considerations. [Internet] [Thesis]. University of Illinois – Urbana-Champaign; 2015. [cited 2020 Feb 27].
Available from: http://hdl.handle.net/2142/78683.
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
Council of Science Editors:
Chen X. Integrated planning of multi-type railroad service facilities under location, routing and inventory considerations. [Thesis]. University of Illinois – Urbana-Champaign; 2015. Available from: http://hdl.handle.net/2142/78683
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
University of Illinois – Urbana-Champaign
28.
Liu, Xinlu.
Optimal patrol routing and scheduling for parking enforcement considering drivers' parking behavior.
Degree: MS, Civil Engineering, 2015, University of Illinois – Urbana-Champaign
URL: http://hdl.handle.net/2142/78687
► Logistics costs constitute a considerable proportion of overall daily expenses for many public sectors, among which parking enforcement agencies are some of the most prominent…
(more)
▼ Logistics costs constitute a considerable proportion of overall daily expenses for many public sectors, among which parking enforcement agencies are some of the most prominent examples. While currently there is little research about the planning of efficient parking enforcement patrol operations, this work presents several models to generate patrol schemes that help parking departments achieve low operational costs and effective enforcement. This thesis considers two levels of problems: i) parking behavior of drivers based on given patrol frequency (but not schedule), and ii) parking enforcement patrol routing and scheduling based on the parking behavior of drivers. Driver determines optimal payment based on the distribution of parking duration, parking prices, citation fines, and patrol frequencies via a newsvendor model. As the intensity of parking enforcement increases, illegal parking is expected to occur less frequently. However, improving parking enforcement sometimes requires more frequent patrols that lead to higher agency costs. In order to find the optimal trade-off point, the problem is further formulated into a Vehicle Routing Problem (VRP). Solving this bi-level optimization problem means that the cost is reduced while anticipated parking offenses are limited to a certain level. We present a traditional discrete mixed-integer programming model, and a continuous approximation model based on the method of continuum approximation. Numerical tests are performed in order to examine the performance of these two models using randomly-generated datasets. Sensitivity analyses show that as parking price or demand increases, or citation fine decreases, more frequent patrols are required to maintain the healthy operation of the parking lots. The results also validate that the method of continuum approximation can offer good estimation of the agency cost for the parking patrol problem with comparatively minimal runtime.
Subjects/Keywords: continuum approximation; patrol routing
Record Details
Similar Records
Cite
Share »
Record Details
Similar Records
Cite
« Share
❌
APA ·
Chicago ·
MLA ·
Vancouver ·
CSE |
Export
to Zotero / EndNote / Reference
Manager
APA (6th Edition):
Liu, X. (2015). Optimal patrol routing and scheduling for parking enforcement considering drivers' parking behavior. (Thesis). University of Illinois – Urbana-Champaign. Retrieved from http://hdl.handle.net/2142/78687
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
Chicago Manual of Style (16th Edition):
Liu, Xinlu. “Optimal patrol routing and scheduling for parking enforcement considering drivers' parking behavior.” 2015. Thesis, University of Illinois – Urbana-Champaign. Accessed February 27, 2020.
http://hdl.handle.net/2142/78687.
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
MLA Handbook (7th Edition):
Liu, Xinlu. “Optimal patrol routing and scheduling for parking enforcement considering drivers' parking behavior.” 2015. Web. 27 Feb 2020.
Vancouver:
Liu X. Optimal patrol routing and scheduling for parking enforcement considering drivers' parking behavior. [Internet] [Thesis]. University of Illinois – Urbana-Champaign; 2015. [cited 2020 Feb 27].
Available from: http://hdl.handle.net/2142/78687.
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
Council of Science Editors:
Liu X. Optimal patrol routing and scheduling for parking enforcement considering drivers' parking behavior. [Thesis]. University of Illinois – Urbana-Champaign; 2015. Available from: http://hdl.handle.net/2142/78687
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
University of Illinois – Urbana-Champaign
29.
Ma, Qiang.
Routing algorithms for electronic design automation.
Degree: PhD, 1200, 2013, University of Illinois – Urbana-Champaign
URL: http://hdl.handle.net/2142/42184
► In electronic design automation (EDA), routing is one of the most important tasks for both printed circuit boards (PCB) and integration circuits (IC). After placement,…
(more)
▼ In electronic design automation (EDA),
routing is one of the most important tasks for both printed circuit boards (PCB) and integration circuits (IC). After
placement, which determines the location of each component on a PCB or element of an IC, the
routing step adds wires needed to properly connect the placed components/elements while obeying all the design rules. The quality
of
routing has a great impact on the performance of the board/chip. In this dissertation, we study modern PCB
routing and the emerging problems in IC
routing.
The high pin density and large net count of modern PCBs make manual
design the board an extremely time-consuming and error-prone task. In
addition, the bus structure
routing style and the planar
routing constraint further increase the design complexity. The number of layers used also needs to be minimized in order to reduce the fabrication cost. To the best of our knowledge, no mature commercial automated router can handle these problems well. In this dissertation, both bus-based and net-based PCB
routing problems are addressed. We first introduce the Rectangle Escape Problem (REP), which is motivated by bus-based escape
routing within one component
on a PCB. This problem is basically to determine an escape direction
for each bus within the component such that the resultant maximum density (a good indicator of the number of layers needed) is minimized. We prove that REP is NP-complete, and show that it can be formulated as an integer linear program (ILP). A provably good approximation algorithm for the REP is developed by applying linear programming (LP) relaxation and
a special rounding technique to the ILP. We further study the optimal layer assignment of a set of buses connecting two components on a PCB. This is a theoretically hard problem and we propose a branch-and-bound based algorithm that optimally solves it. Our algorithm is guaranteed to produce
a feasible layer assignment of the buses with a minimum number of layers. We apply our algorithms on industrial data and the experimental results validate our approach. Net-based PCB
routing is also studied. We propose an underlying
routing graph which correctly models the
routing resources of the pin grids on board. We then build a Negotiated Congestion based Escape Router (NCER) by applying the negotiated congestion
routing scheme on the constructed
routing graph. We compare the performance of NCER
with that of the Cadence PCB router Allegro on industrial test cases, and experimental results show that the two routers have comparable routability but complementary behaviors. Therefore, by using NCER as a supplement to Allegro, we can solve a broader range of net-based PCB
routing problems. The emerging problems in IC
routing are also studied. Conventional CMOS devices face an increasing number of challenges as their feature sizes
scale down. Graphene nanoribbon (GNR) based devices are shown to be
a promising replacement of traditional CMOS at future technology nodes. However, all previous works on GNRs focus at the device…
Advisors/Committee Members: Wong, Martin D.F. (advisor), Wong, Martin D.F. (Committee Chair), Chen, Deming (committee member), Rutenbar, Robin A. (committee member), Vasudevan, Shobha (committee member).
Subjects/Keywords: Routing; Algorithm; Electronic Design Automation
Record Details
Similar Records
Cite
Share »
Record Details
Similar Records
Cite
« Share
❌
APA ·
Chicago ·
MLA ·
Vancouver ·
CSE |
Export
to Zotero / EndNote / Reference
Manager
APA (6th Edition):
Ma, Q. (2013). Routing algorithms for electronic design automation. (Doctoral Dissertation). University of Illinois – Urbana-Champaign. Retrieved from http://hdl.handle.net/2142/42184
Chicago Manual of Style (16th Edition):
Ma, Qiang. “Routing algorithms for electronic design automation.” 2013. Doctoral Dissertation, University of Illinois – Urbana-Champaign. Accessed February 27, 2020.
http://hdl.handle.net/2142/42184.
MLA Handbook (7th Edition):
Ma, Qiang. “Routing algorithms for electronic design automation.” 2013. Web. 27 Feb 2020.
Vancouver:
Ma Q. Routing algorithms for electronic design automation. [Internet] [Doctoral dissertation]. University of Illinois – Urbana-Champaign; 2013. [cited 2020 Feb 27].
Available from: http://hdl.handle.net/2142/42184.
Council of Science Editors:
Ma Q. Routing algorithms for electronic design automation. [Doctoral Dissertation]. University of Illinois – Urbana-Champaign; 2013. Available from: http://hdl.handle.net/2142/42184
Université Catholique de Louvain
30.
Hartert, Renaud.
Fast and scalable optimization for segment routing.
Degree: 2018, Université Catholique de Louvain
URL: http://hdl.handle.net/2078.1/207460
► Nowadays, the Internet delivers more than 1 zettabyte (or 1,000,000,000,000,000,000,000 bytes) of data to more than 3.2 billions of users every year. As a consequence,…
(more)
▼ Nowadays, the Internet delivers more than 1 zettabyte (or 1,000,000,000,000,000,000,000 bytes) of data to more than 3.2 billions of users every year. As a consequence, network operators face difficult challenges due to the impressive (and continuously growing) quantity of data to handle. Upgrading a network infrastructure with better hardware, to accommodate such a growth, has a significant cost (in terms of money and time) that network operators are trying to reduce by improving the efficiency (and thus the lifespan) of their network infrastructures. Traffic Engineering is a domain of networking that specifically aims at providing network operators with tools to optimize their networks. This thesis focuses on the problem of increasing the efficiency of a network by controlling the paths on which the traffic is sent using a new network framework called Segment Routing. In particular, we present various algorithms based on Mixed Integer Programming, Local Search, and Constraint Programming techniques to solve this traffic engineering problem on large networks like the ones of major Internet service providers.
(FSA - Sciences de l'ingénieur) – UCL, 2018
Advisors/Committee Members: UCL - SST/ICTM/INGI - Pôle en ingénierie informatique, UCL - Ecole Polytechnique de Louvain, Schaus, Pierre, Bonaventure, Olivier, Pecheur, Charles, Fortz, Bernard, Simonis, Helmut, Vissicchio, Stefano.
Subjects/Keywords: Segment Routing; Traffic Engineering
Record Details
Similar Records
Cite
Share »
Record Details
Similar Records
Cite
« Share
❌
APA ·
Chicago ·
MLA ·
Vancouver ·
CSE |
Export
to Zotero / EndNote / Reference
Manager
APA (6th Edition):
Hartert, R. (2018). Fast and scalable optimization for segment routing. (Thesis). Université Catholique de Louvain. Retrieved from http://hdl.handle.net/2078.1/207460
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
Chicago Manual of Style (16th Edition):
Hartert, Renaud. “Fast and scalable optimization for segment routing.” 2018. Thesis, Université Catholique de Louvain. Accessed February 27, 2020.
http://hdl.handle.net/2078.1/207460.
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
MLA Handbook (7th Edition):
Hartert, Renaud. “Fast and scalable optimization for segment routing.” 2018. Web. 27 Feb 2020.
Vancouver:
Hartert R. Fast and scalable optimization for segment routing. [Internet] [Thesis]. Université Catholique de Louvain; 2018. [cited 2020 Feb 27].
Available from: http://hdl.handle.net/2078.1/207460.
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
Council of Science Editors:
Hartert R. Fast and scalable optimization for segment routing. [Thesis]. Université Catholique de Louvain; 2018. Available from: http://hdl.handle.net/2078.1/207460
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
◁ [1] [2] [3] [4] [5] … [81] ▶
. 
Open Access Theses and Dissertations
