Master of Science (MS), Ohio University, 2013, Computer Science (Engineering and Technology)

Delay and Disruption Tolerant Networking (DTN) was developed to deliver network communications to so-called "challenged environments." These include space, military, and other networks that can be described as having extremely long link delay and frequent disconnections. The DTN paradigm implements a store-and-forward network of nodes to overcome these limited environments as well as delivering "bundles" of data instead of packets. The bundles nominally contain enough data to constitute an entire atomic unit of communication. DTN introduces the Endpoint Identifier (EID) to identify bundle Agents or groups. The EID can imply naming, addressing, routing and network topology, but these features and flexibility come at the cost of verbosity and a per-packet overhead introduced by large and descriptive EIDs. In this document, we apply lossless text compression to EIDs using Zlib's DEFLATE algorithm. We develop a novel method for generating a large sample of verbose EIDs based upon Apache access logs, allowing testing over a larger, more varied, and more realistic data set than would be possible with the current DTN testing networks. Analysis of the processing overhead and compression ratio lead us to the conclusion that Zlib reduces the overhead of EIDs substantially. By compressing the dictionary, more featureful EIDs can be used without increasing overhead in the form of larger bundle dictionaries due to syntactical verbosity.

Committee: Shawn Ostermann (Advisor) Subjects: Computer Science

MS, University of Cincinnati, 2011, Education, Criminal Justice, and Human Services: Health Education

The purpose of this study was to examine university students' perceived importance of knowledge of eating disorders, overall confidence in appropriately intervening with a friend who has an eating disorder and whether their perceived importance of knowledge and confidence levels differed based on sex, current involvement in disordered eating and extent of social connections. This study sought to fill current gaps in the literature regarding disordered eating. This information is important to strengthen future educational efforts related to the identification and acknowledgement of eating disorders with friends and family. A total of 421 participants were surveyed during the spring 2010 quarter at a Midwest university. The sample included students from a variety of courses. Valid and reliable subscales were developed for the 86-item questionnaire. Descriptive statistics, multivariate analysis of variance, Chi-square analysis, and Pearson correlations were used to analyze the data. Results indicated participants' confidence addressing disordered eating in their friends was moderate. Further, participants felt having knowledge about disordered eating was important and that disordered eating is a significant issue on college campuses. Both importance of having information and confidence addressing disordered eating differed significantly based on sex. Females felt this issue was of greater importance, in addition to expressing more confidence addressing the issue. Recommendations have been included for future studies.

Committee: Keith King PhD (Committee Chair); Rebecca Vidourek PhD (Committee Member) Subjects: Health Education

MS, Kent State University, 2009, College of Arts and Sciences / Department of Computer Science

There is still much research in the areas of routing and location updates in cellular communication networks. Given the limited amount of memory and power of these network devices it is desirable to find the most effective and resource conscious method for solving routing and location update problems. Recently, these problems have been addressed for simply connected cellular networks and significant results were achieved.  An effective method for addressing, location update and routing has been offered using a method of isometric embeddings into a set of three trees.  This method however does not fully work when a hole is present in the network.  To handle networks containing holes, a variation of the above method is required, where the cellular network will be decomposed into few sub-graphs that encompass the properties of the original network graph.  Proposed here is a method that will handle the above mentioned problems on cellular networks with holes, namely holes with disc structures and other shapes that have the convex property.  Also presented are two distinct methods for handling networks with multiple disc-structured holes.  These methods will also use sub-graphs to reduce the number of holes while preserving all shortest paths.

Committee: Feodor F. Dragan PhD (Advisor); Ruoming Jin PhD (Committee Member); Hassan Peyravi PhD (Committee Member) Subjects: Computer Science

Master of Sciences, Case Western Reserve University, 2012, EECS - Computer and Information Sciences

In the current Internet architecture, traffic is commonly routed to its destination using DNS names that are mapped to IP addresses, yet there are no inherent means for receivers to attribute sources of traffic to senders or for receivers to authorize senders. These deficiencies leave the Internet and its connected hosts vulnerable to a wide range of attacks including denial-of-service and misrepresentation (spoofing, phishing, etc.) which continue to cause material damage. Rabinovich and Spatscheck have proposed a mechanism to combat these vulnerabilities by introducing attribution and authorization into the network using a transient addressing scheme to establish attribution through DNS, establish authorization at the host, and enforce authorization and attribution in the network. In this work, we develop and characterize a system for effecting in-network enforcement at the router, and we demonstrate that enforcement is possible on current commodity hardware at sustained throughput rates well above common Internet connection rates.

Committee: Michael Rabinovich PhD (Committee Chair); Z. Meral Ozsoyoglu PhD (Committee Member); Vincenzo Liberatore PhD (Committee Member) Subjects: Computer Science