Matching Items (537)
Filtering by
- Creators: School of Mathematical and Statistical Sciences
- Resource Type: Text
Description
New OpenFlow switches support a wide range of network applications, such as firewalls, load balancers, routers, and traffic monitoring. While ternary content addressable memory (TCAM) allows switches to process packets at high speed based on multiple header fields, today's commodity switches support just thousands to tens of thousands of forwarding rules. To allow for finer-grained policies on this hardware, efficient ways to support the abstraction of a switch are needed with arbitrarily large rule tables. To do so, a hardware-software hybrid switch is designed that relies on rule caching to provide large rule tables at low cost. Unlike traditional caching solutions, neither individual rules are cached (to respect rule dependencies) nor compressed (to preserve the per-rule traffic counts). Instead long dependency chains are ``spliced'' to cache smaller groups of rules while preserving the semantics of the network policy. The proposed hybrid switch design satisfies three criteria: (1) responsiveness, to allow rapid changes to the cache with minimal effect on traffic throughput; (2) transparency, to faithfully support native OpenFlow semantics; (3) correctness, to cache rules while preserving the semantics of the original policy. The evaluation of the hybrid switch on large rule tables suggest that it can effectively expose the benefits of both hardware and software switches to the controller and to applications running on top of it.
ContributorsAlipourfard, Omid (Author) / Syrotiuk, Violet R. (Thesis advisor) / Richa, Andréa W. (Committee member) / Xue, Guoliang (Committee member) / Arizona State University (Publisher)
Created2014
Description
Interference constitutes a major challenge for communication networks operating over a shared medium where availability is imperative. This dissertation studies the problem of designing and analyzing efficient medium access protocols which are robust against strong adversarial jamming. More specifically, four medium access (MAC) protocols (i.e., JADE, ANTIJAM, COMAC, and SINRMAC) which aim to achieve high throughput despite jamming activities under a variety of network and adversary models are presented. We also propose a self-stabilizing leader election protocol, SELECT, that can effectively elect a leader in the network with the existence of a strong adversary. Our protocols can not only deal with internal interference without the exact knowledge on the number of participants in the network, but they are also robust to unintentional or intentional external interference, e.g., due to co-existing networks or jammers. We model the external interference by a powerful adaptive and/or reactive adversary which can jam a (1 − ε)-portion of the time steps, where 0 < ε ≤ 1 is an arbitrary constant. We allow the adversary to be adaptive and to have complete knowledge of the entire protocol history. Moreover, in case the adversary is also reactive, it uses carrier sensing to make informed decisions to disrupt communications. Among the proposed protocols, JADE, ANTIJAM and COMAC are able to achieve Θ(1)-competitive throughput with the presence of the strong adversary; while SINRMAC is the first attempt to apply SINR model (i.e., Signal to Interference plus Noise Ratio), in robust medium access protocols design; the derived principles are also useful to build applications on top of the MAC layer, and we present SELECT, which is an exemplary study for leader election, which is one of the most fundamental tasks in distributed computing.
ContributorsZhang, Jin (Author) / Richa, Andréa W. (Thesis advisor) / Scheideler, Christian (Committee member) / Sen, Arunabha (Committee member) / Xue, Guoliang (Committee member) / Arizona State University (Publisher)
Created2012
Description
Exhaustive testing is generally infeasible except in the smallest of systems. Research
has shown that testing the interactions among fewer (up to 6) components is generally
sufficient while retaining the capability to detect up to 99% of defects. This leads to a
substantial decrease in the number of tests. Covering arrays are combinatorial objects
that guarantee that every interaction is tested at least once.
In the absence of direct constructions, forming small covering arrays is generally
an expensive computational task. Algorithms to generate covering arrays have been
extensively studied yet no single algorithm provides the smallest solution. More
recently research has been directed towards a new technique called post-optimization.
These algorithms take an existing covering array and attempt to reduce its size.
This thesis presents a new idea for post-optimization by representing covering
arrays as graphs. Some properties of these graphs are established and the results are
contrasted with existing post-optimization algorithms. The idea is then generalized to
close variants of covering arrays with surprising results which in some cases reduce
the size by 30%. Applications of the method to generation and test prioritization are
studied and some interesting results are reported.
has shown that testing the interactions among fewer (up to 6) components is generally
sufficient while retaining the capability to detect up to 99% of defects. This leads to a
substantial decrease in the number of tests. Covering arrays are combinatorial objects
that guarantee that every interaction is tested at least once.
In the absence of direct constructions, forming small covering arrays is generally
an expensive computational task. Algorithms to generate covering arrays have been
extensively studied yet no single algorithm provides the smallest solution. More
recently research has been directed towards a new technique called post-optimization.
These algorithms take an existing covering array and attempt to reduce its size.
This thesis presents a new idea for post-optimization by representing covering
arrays as graphs. Some properties of these graphs are established and the results are
contrasted with existing post-optimization algorithms. The idea is then generalized to
close variants of covering arrays with surprising results which in some cases reduce
the size by 30%. Applications of the method to generation and test prioritization are
studied and some interesting results are reported.
ContributorsKaria, Rushang Vinod (Author) / Colbourn, Charles J (Thesis advisor) / Syrotiuk, Violet (Committee member) / Richa, Andréa W. (Committee member) / Arizona State University (Publisher)
Created2015
Description
Many applications require efficient data routing and dissemination in Delay Tolerant Networks (DTNs) in order to maximize the throughput of data in the network, such as providing healthcare to remote communities, and spreading related information in Mobile Social Networks (MSNs). In this thesis, the feasibility of using boats in the Amazon Delta Riverine region as data mule nodes is investigated and a robust data routing algorithm based on a fountain code approach is designed to ensure fast and timely data delivery considering unpredictable boat delays, break-downs, and high transmission failures. Then, the scenario of providing healthcare in Amazon Delta Region is extended to a general All-or-Nothing (Splittable) Multicommodity Flow (ANF) problem and a polynomial time constant approximation algorithm is designed for the maximum throughput routing problem based on a randomized rounding scheme with applications to DTNs. In an MSN, message content is closely related to users’ preferences, and can be used to significantly impact the performance of data dissemination. An interest- and content-based algorithm is developed where the contents of the messages, along with the network structural information are taken into consideration when making message relay decisions in order to maximize data throughput in an MSN. Extensive experiments show the effectiveness of the above proposed data dissemination algorithm by comparing it with state-of-the-art techniques.
ContributorsLiu, Mengxue (Author) / Richa, Andréa W. (Thesis advisor) / Johnson, Thienne (Committee member) / Syrotiuk, Violet R. (Committee member) / Xue, Guoliang (Committee member) / Arizona State University (Publisher)
Created2018
Description
This research compares shifts in a SuperSpec titanium nitride (TiN) kinetic inductance detector's (KID's) resonant frequency with accepted models for other KIDs. SuperSpec, which is being developed at the University of Colorado Boulder, is an on-chip spectrometer designed with a multiplexed readout with multiple KIDs that is set up for a broadband transmission of these measurements. It is useful for detecting radiation in the mm and sub mm wavelengths which is significant since absorption and reemission of photons by dust causes radiation from distant objects to reach us in infrared and far-infrared bands. In preparation for testing, our team installed stages designed previously by Paul Abers and his group into our cryostat and designed and installed other parts necessary for the cryostat to be able to test devices on the 250 mK stage. This work included the design and construction of additional parts, a new setup for the wiring in the cryostat, the assembly, testing, and installation of several stainless steel coaxial cables for the measurements through the devices, and other cryogenic and low pressure considerations. The SuperSpec KID was successfully tested on this 250 mK stage thus confirming that the new setup is functional. Our results are in agreement with existing models which suggest that the breaking of cooper pairs in the detector's superconductor which occurs in response to temperature, optical load, and readout power will decrease the resonant frequencies. A negative linear relationship in our results appears, as expected, since the parameters are varied only slightly so that a linear approximation is appropriate. We compared the rate at which the resonant frequency responded to temperature and found it to be close to the expected value.
ContributorsDiaz, Heriberto Chacon (Author) / Mauskopf, Philip (Thesis director) / McCartney, Martha (Committee member) / Department of Physics (Contributor) / School of Mathematical and Statistical Sciences (Contributor) / Barrett, The Honors College (Contributor)
Created2018-05
Description
This study estimates the capitalization effect of golf courses in Maricopa County using the hedonic pricing method. It draws upon a dataset of 574,989 residential transactions from 2000 to 2006 to examine how the aesthetic, non-golf benefits of golf courses capitalize across a gradient of proximity measures. The measures for amenity value extend beyond home adjacency and include considerations for homes within a range of discrete walkability buffers of golf courses. The models also distinguish between public and private golf courses as a proxy for the level of golf course access perceived by non-golfers. Unobserved spatial characteristics of the neighborhoods around golf courses are controlled for by increasing the extent of spatial fixed effects from city, to census tract, and finally to 2000 meter golf course ‘neighborhoods.’ The estimation results support two primary conclusions. First, golf course proximity is found to be highly valued for adjacent homes and homes up to 50 meters way from a course, still evident but minimal between 50 and 150 meters, and insignificant at all other distance ranges. Second, private golf courses do not command a higher proximity premia compared to public courses with the exception of homes within 25 to 50 meters of a course, indicating that the non-golf benefits of courses capitalize similarly, regardless of course type. The results of this study motivate further investigation into golf course features that signal access or add value to homes in the range of capitalization, particularly for near-adjacent homes between 50 and 150 meters thought previously not to capitalize.
ContributorsJoiner, Emily (Author) / Abbott, Joshua (Thesis director) / Smith, Kerry (Committee member) / Economics Program in CLAS (Contributor) / School of Sustainability (Contributor) / School of Mathematical and Statistical Sciences (Contributor) / Barrett, The Honors College (Contributor)
Created2018-05
Description
The objective of this paper is to provide an educational diagnostic into the technology of blockchain and its application for the supply chain. Education on the topic is important to prevent misinformation on the capabilities of blockchain. Blockchain as a new technology can be confusing to grasp given the wide possibilities it can provide. This can convolute the topic by being too broad when defined. Instead, the focus will be maintained on explaining the technical details about how and why this technology works in improving the supply chain. The scope of explanation will not be limited to the solutions, but will also detail current problems. Both public and private blockchain networks will be explained and solutions they provide in supply chains. In addition, other non-blockchain systems will be described that provide important pieces in supply chain operations that blockchain cannot provide. Blockchain when applied to the supply chain provides improved consumer transparency, management of resources, logistics, trade finance, and liquidity.
ContributorsKrukar, Joel Michael (Author) / Oke, Adegoke (Thesis director) / Duarte, Brett (Committee member) / Hahn, Richard (Committee member) / School of Mathematical and Statistical Sciences (Contributor) / Department of Economics (Contributor) / Barrett, The Honors College (Contributor)
Created2018-05
Description
The Super Catalan numbers are a known set of numbers which have so far eluded a combinatorial interpretation. Several weighted interpretations have appeared since their discovery, one of which was discovered by William Kuszmaul in 2017. In this paper, we connect the weighted Super Catalan structure created previously by Kuszmaul and a natural $q$-analogue of the Super Catalan numbers. We do this by creating a statistic $\sigma$ for which the $q$ Super Catalan numbers, $S_q(m,n)=\sum_X (-1)^{\mu(X)} q^{\sigma(X)}$. In doing so, we take a step towards finding a strict combinatorial interpretation for the Super Catalan numbers.
ContributorsHouse, John Douglas (Author) / Fishel, Susanna (Thesis director) / Childress, Nancy (Committee member) / School of Mathematical and Statistical Sciences (Contributor) / Barrett, The Honors College (Contributor)
Created2018-05
Description
Construction is a defining characteristic of geometry classes. In a traditional classroom, teachers and students use physical tools (i.e. a compass and straight-edge) in their constructions. However, with modern technology, construction is possible through the use of digital applications such as GeoGebra and Geometer’s SketchPad.
Many other studies have researched the benefits of digital manipulatives and digital environments through student completion of tasks and testing. This study intends to research students’ use of the digital tools and manipulatives, along with the students’ interactions with the digital environment. To this end, I conducted exploratory teaching experiments with two calculus I students.
In the exploratory teaching experiments, students were introduced to a GeoGebra application developed by Fischer (2019), which includes instructional videos and corresponding quizzes, as well as exercises and interactive notepads, where students could use digital tools to construct line segments and circles (corresponding to the physical straight-edge and compass). The application built up the students’ foundational knowledge, culminating in the construction and verbal proof of Euclid’s Elements, Proposition 1 (Euclid, 1733).
The central findings of this thesis are the students’ interactions with the digital environment, with observed changes in their conceptions of radii and circles, and in their use of tools. The students were observed to have conceptions of radii as a process, a geometric shape, and a geometric object. I observed the students’ conceptions of a circle change from a geometric shape to a geometric object, and with that change, observed the students’ use of tools change from a measuring focus to a property focus.
I report a summary of the students’ work and classify their reasoning and actions into the above categories, and an analysis of how the digital environment impacts the students’ conceptions. I also briefly discuss the impact of the findings on pedagogy and future research.
Many other studies have researched the benefits of digital manipulatives and digital environments through student completion of tasks and testing. This study intends to research students’ use of the digital tools and manipulatives, along with the students’ interactions with the digital environment. To this end, I conducted exploratory teaching experiments with two calculus I students.
In the exploratory teaching experiments, students were introduced to a GeoGebra application developed by Fischer (2019), which includes instructional videos and corresponding quizzes, as well as exercises and interactive notepads, where students could use digital tools to construct line segments and circles (corresponding to the physical straight-edge and compass). The application built up the students’ foundational knowledge, culminating in the construction and verbal proof of Euclid’s Elements, Proposition 1 (Euclid, 1733).
The central findings of this thesis are the students’ interactions with the digital environment, with observed changes in their conceptions of radii and circles, and in their use of tools. The students were observed to have conceptions of radii as a process, a geometric shape, and a geometric object. I observed the students’ conceptions of a circle change from a geometric shape to a geometric object, and with that change, observed the students’ use of tools change from a measuring focus to a property focus.
I report a summary of the students’ work and classify their reasoning and actions into the above categories, and an analysis of how the digital environment impacts the students’ conceptions. I also briefly discuss the impact of the findings on pedagogy and future research.
ContributorsSakauye, Noelle Marie (Author) / Roh, Kyeong Hah (Thesis director) / Zandieh, Michelle (Committee member) / School of Mathematical and Statistical Sciences (Contributor) / School of International Letters and Cultures (Contributor) / Barrett, The Honors College (Contributor)
Created2020-05
Description
The original version of Helix, the one I pitched when first deciding to make a video game
for my thesis, is an action-platformer, with the intent of metroidvania-style progression
and an interconnected world map.
The current version of Helix is a turn based role-playing game, with the intent of roguelike
gameplay and a dark fantasy theme. We will first be exploring the challenges that came
with programming my own game - not quite from scratch, but also without a prebuilt
engine - then transition into game design and how Helix has evolved from its original form
to what we see today.
for my thesis, is an action-platformer, with the intent of metroidvania-style progression
and an interconnected world map.
The current version of Helix is a turn based role-playing game, with the intent of roguelike
gameplay and a dark fantasy theme. We will first be exploring the challenges that came
with programming my own game - not quite from scratch, but also without a prebuilt
engine - then transition into game design and how Helix has evolved from its original form
to what we see today.
ContributorsDiscipulo, Isaiah K (Author) / Meuth, Ryan (Thesis director) / Kobayashi, Yoshihiro (Committee member) / School of Mathematical and Statistical Sciences (Contributor) / Computer Science and Engineering Program (Contributor) / Barrett, The Honors College (Contributor)
Created2020-05