Show simple item record

dc.contributor.authorAhmed, Mustaqen 14:23:34 (GMT) 14:23:34 (GMT)
dc.description.abstractAn <i>Interval Routing Scheme (IRS)</i> represents the routing tables in a network in a space-efficient way by labeling each vertex with an unique integer address and the outgoing edges at each vertex with disjoint subintervals of these addresses. An IRS that has at most <i>k</i> intervals per edge label is called a <i>k-IRS</i>. In this thesis, we propose a new type of interval routing scheme, called an <i>Ordered Interval Routing Scheme (OIRS)</i>, that uses an ordering of the outgoing edges at each vertex and allows nondisjoint intervals in the labels of those edges. Our results on a number of graphs show that using an OIRS instead of an IRS reduces the size of the routing tables in the case of <i>optimal</i> routing, i. e. , routing along shortest paths. We show that optimal routing in any <i>k</i>-tree is possible using an OIRS with at most 2<sup>k-1</sup> intervals per edge label, although the best known result for an IRS is 2<sup>k+1</sup> intervals per edge label. Any torus has an optimal 1-OIRS, although it may not have an optimal 1-IRS. We present similar results for the Petersen graph, <i>k</i>-garland graphs and a few other graphs.en
dc.format.extent624258 bytes
dc.publisherUniversity of Waterlooen
dc.rightsCopyright: 2004, Ahmed, Mustaq. All rights reserved.en
dc.subjectComputer Scienceen
dc.subjectInterval Routing Schemeen
dc.titleOrdered Interval Routing Schemesen
dc.typeMaster Thesisen
dc.pendingfalseen of Computer Scienceen
uws-etd.degreeMaster of Mathematicsen

Files in this item


This item appears in the following Collection(s)

Show simple item record


University of Waterloo Library
200 University Avenue West
Waterloo, Ontario, Canada N2L 3G1
519 888 4883

All items in UWSpace are protected by copyright, with all rights reserved.

DSpace software

Service outages