Department: Computer Science (Engineering) ![[clear]](close-x.png "Remove this limiter")
39 matches in the database.
These are records: 1 - 30.
Did you mean instcode:ohio?
[1] [2]
1.
Alexander, David.
A Network Metadata Infrastructure for Locating Network Devices.
Degree: MS, Computer Science (Engineering), 2004, Ohio University
► Finding the physical location of a device given only its network address…
(more)
▼ Finding the physical location of a device given only its network address is a difficult network management problem which requires collecting and correlating large amounts of data from routers, switches, and other data sources. Routers store a mapping of IP addresses to havrdware addresses in an ARP table. Switches keep a mapping between MAC addresses and prots in a CAM table. This work studies the feasibility of collecting, processing, and archiving the contents of these tables. A graphical user interface provides the ability to search through the summarized ARP and CAM data to find the physical location of a device at a given point in time. Ohio University's newtwork, consisting of 15 routers and 600 switches, served as a testbed for the system. Router data collection and processing occurred once per hour and took six minutes to complete. Switch data collection and processing occurred fourt time per our and took five minutes per sample. ARP and CAM data for several years was stored in a databased using significantly less space than the raw data. Searches for an IP or MAC address made through the graphical interface took fourteen seconds. Historical views of ARP data are useful for IP address space management, while recent ARP data can be used for network security. Intrusion detection systems can identify and IP address involved in a network attack, and the graphical interface can trace the IP address to the switch port, building, room, and user of the device.
Advisors/Committee Members: Osterman, Shawn D.
More Like This
2.
Bachnak, Rafic A.
Development of a stereo-based multi-camera system for 3-D vision.
Degree: PhD, Computer Science (Engineering), 1989, Ohio University
► Many important applications of computer vision are found in manufacturing and defense…
(more)
▼ Many important applications of computer vision are found in manufacturing and defense industries. Such applications include inspection, measurements, robotic assembly and autonomous vehicle guidance. The area of three-dimensional vision presents great challenges and complex problems. It has attracted considerable research efforts in recent years. Although significant progress has been made, the transfer of fundamental ideas to concrete applications has not been successful at the practical implementation stage. This is due to the complexities involved in the process of emulating the human vision capability in a computer system. In this dissertation, a stereo-based multi-camera system for complete 3-D information extraction and object surface reconstruction in a robot workspace is developed. The system consists of N number of cameras arranged in an N/2 number of periodic stereo pair structure. The cameras sense the working area of a robot in the form of N images which are processed to obtain the 3-D data in the robot's environment. The extracted information is provided to a surface reconstruction algorithm for object description. The image reconstruction phase is performed in the scene domain on the combined data of adjacent camera pairs. The system advances the 3-D vision capability of industrial robots. Specific contributions include a camera calibration procedure that determines the system's parameters directly from the output digital image using only three known world points. This procedure uses a pinhole camera model and assumes a linear image transformation process between the image plane of the camera and the output digital image. The parameters of the system are computed by solving a set of linear equations. The number of cameras for entire coverage of the robot workspace is determined by defining the common area of a camera. This is essential because the 3-D information of any portion of the object that does not appear in both cameras can not be recovered. The working environment of the robot is described based on the knowledge of the common area and the number of camera pairs used. The shifting property of the Fourier transform is utilized for disparity estimation. The result reduces the cost and increases the accuracy of the matching procedure. This is true because the matching process is directly proportional to the search limits in the other image. In addition, the matching is only performed in the common area of a camera pair which is determined from the geometry of the set-up. Matching of stereo image pairs is also addressed. An image matching technique that makes use of the estimated disparity is developed. The method combines the advantages of both the area-based and feature-based approaches. The feature-based matching results guide a local window operation that identifies correct matches within a neighborhood. The local matching measure is based on the smoothness in disparity values in neighboring pixels on the surface of the object. Surface reconstruction for complete object representation is performed in the scene domain. In this regard, the Lagrangian polynomial is employed locally to approximate the object points based on the available data. Here, the known depth points retain their original values. This initialization process improves the convergence rate and the performance of the quadratic variations technique. Finally, an algorithm for corner detection on digital curves was developed and employed for object representation to test the efficiency and reliability of the developed system for 3-D measurements. First, the thinned image is scanned to assign candidate corners. Then, false corners are eliminated by operating locally at the initial assignments. The final result is a list of corners, each identified by its position, and the number and direction of the edges intersecting at its center. The algorithm is capable of finding two and multiple-side corners and is suitable for parallel implementation.
Advisors/Committee Members: Celenk, M.
Keywords: stereo-based; multi-camera system; 3-D vision; manufacturing computers; digital; robot
More Like This
3.
Bopanna, Sumanth M.
The Extended Quality-of-Service Resource Allocation Model.
Degree: MS, Computer Science (Engineering), 2005, Ohio University
► The existing Quality-of–Service Resource Allocation Model (QRAM) is a generic method of…
(more)
▼ The existing Quality-of–Service Resource Allocation Model (QRAM) is a generic method of allocating resources to applications while maximizing the utility of the system; it has been extended to the network domain to allocate applications with bandwidth on multiple links. When the utility of an application depends on response time, the QRAM network model is limited since it does not consider the impact of link load on response time. It further assumes that the network propagation delay is negligible, which also impacts application response. The thesis proposes an extension to the QRAM network model, (EQRAM), which addresses both these limitations. We also show that the response time achieved by assigning resources to an application using EQRAM is better than the response time achieved when using QRAM. This thesis also proposes a novel means of obtaining the resource-utility table for the applications quickly using OPNET.
Advisors/Committee Members: Bruggeman, Carl.
Subjects: Computer Science
Keywords: QRAM (QoS Resource Allocation Model); OPNET; Utility Functions; QoS (Quality of Service); Resource Allocation; Optimal Response Time
More Like This
4.
Bykova, Marina.
Statistical Analysis of Malformed Packets and Their Origins in the Modern Internet.
Degree: MS, Computer Science (Engineering), 2002, Ohio University
► With the tremendous growth of Internet resources, we observe a rapid increase…
(more)
▼ With the tremendous growth of Internet resources, we observe a rapid increase in the number of network applications and protocol implementations, which are not always thoroughly evaluated and tested. A growing number of network attacks attempt to disrupt legitimate communication or deny access to network resources to legitimate users. Both poor implementations and intentional abuse of network resources “pollute” a network with malformed packets and can become a threat to sound communication. In this work, we collect and analyze all of the IP and TCP headers of packets seen on a network that either violate existing standards or should not appear in modern internets. Our goal is to determine the reason that these packets appear on the network and evaluate what proportion of such packets could cause actual damage. Thus, we examine and divide the unusual packets obtained during our experiments into several categories based on their possible cause, which ranges from errors in network implementations to carefully constructed attack packets, and show the results. The traces analyzed were gathered at two different data sources at Ohio University’the university’s main Internet link connecting it to its ISP and a local network with student dormitory traffic – and provide a massive amount of statistical data.
Advisors/Committee Members: Ostermann, Shawn D.
Subjects: Computer Science
Keywords: malformed packets; TCP/IP; traffic analysis; intrusion detection; packet header
More Like This
5.
Chipitsyn, Vitali.
IMPROVEMENT OF OHIO UNIVERSITY COMPUTER NETWORKS WITH INTERNET PROTOCOL VERSION 6.
Degree: MS, Computer Science (Engineering), 2000, Ohio University
► This thesis demonstrates how Internet Protocol Version 6 (IPv6) may be used…
(more)
▼ This thesis demonstrates how Internet Protocol Version 6 (IPv6) may be used to improve certain operational parameters of a large Internet site. The computer network at Ohio University is used as the practical application of IPv6. The thesis outlines the weaknesses that exist in the university network and practical solutions to eliminate those weaknesses. Extension of IP address space is easily accomplished with IPv6. An addressing hierarchy different from the one that exists in the university is introduced to improve management of the computer network and make efficient use of route aggregation capability of IPv6. The Domain Name System (DNS) service is considered to be a very important network service; hence, IPv6 DNS service was integrated with the production environment of the university. The thesis provides de-tailed demonstration of configuration of a multi-level infrastructure of DNS service. Use of IPv6 DNS allows better utilization of host autoconfiguration capability provided by IPv6, and contributes to the ease of networks renumbering. In this paper, we also perform analysis of IPv6 functionality available to the end-users on a variety of platforms. Finally, this thesis considers how other operational parameters of the computer network may be improved by application of a wider functionality offered by IPv6 to the computer networks at Ohio University.
Advisors/Committee Members: Ostermann, Shawn D.
Subjects: Computer Science
Keywords: Ohio University; computer networks; Internet Protocol version 6
More Like This
6.
Chokkalingam, Selvameenal.
Database and Query Analysis Tools for MySQL: Exploiting Hypertree and Hypergraph Decompositions.
Degree: MS, Computer Science (Engineering), 2006, Ohio University
► A database is an organized collection of data. Database systems are widely…
(more)
▼ A database is an organized collection of data. Database systems are widely used and have a broad range of applications. It is thus essential to find efficient database query evaluation techniques. In the recent years, new theories and algorithms for database query optimization have been developed that exploit advanced graph theoretic concepts. In particular, the graph theoretic concepts of hypergraphs, hypergraph decompositions, and hypertree decompositions have played an important role in the recent research. This thesis studies algorithms that employ hypergraph decompositions in order to detect the cyclic or acyclic degree of database schema, and describes implementations of those algorithms. The main contribution of this thesis is a collection of software tools for MySQL that exploit hypergraph properties associated with database schema and query structures.
Advisors/Committee Members: Juedes, David W.
Subjects: Computer Science
Keywords: hypergraph; hypergraph decomposition; acyclic; acyclicity; SQL parser; cyclic; degrees of acyclicity
More Like This
7.
Dakhwe, Adnan B. A.
A DYNAMIC, COST-EFFECTIVE AND EFFICIENT INFORMATION PORTAL SOLUTION USING THE MAMBO CONTENT MANAGEMENT SYSTEM.
Degree: MS, Computer Science (Engineering), 2006, Ohio University
► The world has progressed immensely in the last decade, and so have…
(more)
▼ The world has progressed immensely in the last decade, and so have the common skills held by people. Nowadays most employees in an organization have skills to use the Internet and Microsoft Word. There has been an effort to harness these skills held by these people to develop web-applications by masking the technical details from them. This work investigates the techniques for facilitating rapid development of an information portal and evaluates the effectiveness of the technique chosen to develop and maintain an information portal. Our chosen technique involves using the Mambo content management system to develop an information portal architecture rapidly and delegating the responsibility of content management i.e. to add, change and delete content to novice users (who have no web-programming skills), by masking the technical details from the novice users. We have tested our approach in the development of the Centers for Osteopathic Research and Education (CORE) information portal. We have performed initial quantitative analysis to evaluate the applicability of Mambo CMS to the CORE information portal, which is a basic mid-size information portal.
Advisors/Committee Members: Liu, Chang.
Keywords: Information Portal; Content Management System; CMS; Mambo
More Like This
8.
Delaney, Matthew.
RMBench: A Benchmarking Suite for Distributed Real-Time Middleware.
Degree: MS, Computer Science (Engineering), 2005, Ohio University
► Numerous middleware packages for resource management and communications are emerging, however there…
(more)
▼ Numerous middleware packages for resource management and communications are emerging, however there is no toolkit available to systematically evaluate and compare them. In [8], Sharp performs experimental assessment of real-time Java middleware, and provides a list of important metrics that are useful in such evaluations. Tools to automate collecting of such metrics have been developed, but previous work in distributed real-time benchmarking has not fully addressed the problem domain. The Hartstone Distributed Benchmark (HDB) [2] [1] allows periodic and aperiodic work to be increased gradually, in order to find the limitations of hardware, operating systems and middleware. Dynbench [22] provides periodic, event-driven, and event-driven periodic workloads by simulating an air defense system. The Synthetic Workload Specification Language (SWSL) [14] provides a formal specification language for synthetic workloads in which real-time constraints can be specified, and Synthetic Workload Generator (SWG) [15] is used to implement SWSL specifications. HDB, Dynbench, and SWSL/SWG are all useful for finding the performance limits of real-time infrastructure components, however they do not support arbitrary workloads or QoS parameters. These deficiencies have been addressed in the RMBench system, a set of CORBA services for benchmarking the performance of distributed real-time middleware. Major features of RMBench include Sensor and Path Nodes. Users can create Sensor processes that periodically distribute dynamic workloads. These Nodes can simulate scenarios where the workloads in the system change during runtime by adjusting the amount of data coming from a Sensor. Specifically, a CORBA service is provided for changing the periods of Sensor processes and for changing the amount of outgoing data (workload) generated by Sensor processes. Users can also create Path Node processes, which receive messages, perform work, and pass on messages to other Path Node processes. To emulate dynamic real-time systems, the execution time of a Path Node can be defined to be a function of the node’s workload. Mathematical workload functions such as log n, n log n, and nm (where n is the size of the current message) can be defined and changed during run-time. A CORBA service allows resource management middleware to dynamically change Quality of Service (QoS) parameters of Path Node processes. Other features of RMBench include an Experiment Specification File which is used to create automated, repeatable experiments. A customizable display process which permits viewing of end-to-end performance, node performance, and workloads. And finally, Experiment Log Files are provided to facilitate offline analysis. RMBench has been used to validate an integration of the QARMA [9] resource management software and a distributed scheduling service. Extensive experiments are run and the benefit of this integration is show by using RMBench.
Advisors/Committee Members: Welch, Lonnie.
Subjects: Computer Science
Keywords: RMBench; Real-Time; Benchmarking; Distributed real-time; Distributed Middleware; Quality of service
More Like This
9.
Deshpande, Jayram A.
Satisfying End to End Quality of Service Requirements in DTN Environments.
Degree: MS, Computer Science (Engineering), 2006, Ohio University
► The Delay Tolerant Networking (DTN) environment is characterized by very long one-way-light…
(more)
▼ The Delay Tolerant Networking (DTN) environment is characterized by very long one-way-light delays, frequent partitioning, and error prone communication channels. In this thesis work, we address the problem of satisfying the end-to-end Quality of Service requirements for multiple hops. The research work focuses on exploring the approaches for estimating the current end-to-end immediacy – a measure of urgency – for a given bundle, and thus adjust the current next-hop transmission parameters, such as Forward Error Correction (FEC), packet size, etc., to fulfill this requirement. When a sender bundling application needs a bundle delivery in a given time frame, it becomes important to keep track of current end-to-end immediacy requirements at the intermediate nodes. This estimation contributes significantly to QoS related decisions and to the routing decisions. The problem becomes interesting especially in a knowledge based approach where intermediate nodes have an availability of the state information of links in the predicted path, because any such information is stale to some degree by the time it is used. We describe one forecasting based approach to estimating the end-to-end immediacy. This estimate is further used to decide the amount of FEC applied for the immediate next-hop transmission. We further show that our approach helps in mitigating the over-utilization of the immediate next-hop link due to excessive encoding. We also discuss our approach for treating the default bundling priority classes.
Advisors/Committee Members: Kruse, Hans.
Keywords: Delay Tolerant Networking (DTN); Bundle Protocol (BP); Quality Of Service (QoS); Forecasting; Algorithm; Bit Error Rate (BER); Multiple Hops
More Like This
10.
Eati, Kameswara R.
Web-Enabled Hierarchical Teleconferencing.
Degree: MS, Computer Science (Engineering), 2003, Ohio University
► With the advent of the Internet and high-performance computing technologies, real-time distributed…
(more)
▼ With the advent of the Internet and high-performance computing technologies, real-time distributed collaboration systems such as teleconferencing applications that enable the participants to communicate with each other over the Web are becoming popular. In this thesis, we develop a Web-Enabled Hierarchical Teleconference System (WHTS) that is built using open standards with the intent to meet different scalability and security needs for conducting text-based conferencing among geographically dispersed participants over the web. WHTS provides various teleconferencing features that include support for hosting open and closed-type multiple conferences simultaneously as well as supporting various administrative features such as creation/deletion of conference rooms, creation/deletion of users, and moderation of users. The underlying platform of WHTS is J2EE (Java 2 Enterprise Edition) and it adopts a four-tier architecture comprising of client-tier, presentation-tier, business-tier, and data-tier. The middle-layer (presentation-tier and business-tier) of WHTS is either hosted on a single web-server when serving small number of users or hosted on a multitude of web-servers and fan-out servers structured in a hierarchical manner when serving large number of users. WHTS uses web-browser for the client-tier, IBM’s Websphere and RMI objects for the middle-layer, and IBM’s DB2 database for the data-tier. We employ MVC (Model-View-Controller) framework for WHTS to structure the problem-domain classes into model, view and controller components, and decouple their respective responsibilities. The MVC framework is implemented using J2EE APIs – Servlets for Controller, JavaServer Pages (JSP) and Servlets for View, and JavaBeans for Model. The adoption of an open platform like J2EE coupled with the incorporation of MVC framework for WHTS provides a very flexible mechanism for extending the functionality of WHTS (e.g., adding support for graphics and other media types such as audio and video) in the future.
Advisors/Committee Members: Celenk, Mehmet.
Subjects: Computer Science
Keywords: WHTS; username; out.println; TD; servers; JSP; conference rooms
More Like This
11.
Eddy, Wesley M.
Improving Transport Control Protocol Performance With Path Error Rate Information.
Degree: MS, Computer Science (Engineering), 2004, Ohio University
► The Transmission Control Protocol (TCP)is designed to reliably transmit data over a…
(more)
▼ The Transmission Control Protocol (TCP)is designed to reliably transmit data over a wide range of network conditions while responding fairly to other traffic when given an indication of congestion. TCP's inability to distinguish between packet losses due to congestion and those due to corruption, however, makes it perform inefficiently on links with a high rate of packet errors. We describe methods for notifying TCP senders of a network path's packet error rate and ways for using this information to increase TCP's performance while still behaving reasonably in response to congestion signals.
Advisors/Committee Members: Ostermann, Shawn.
Keywords: Transport Control Protocol; Wireless and Satellite Networks; Network Congestion Control; Packet Corruption
More Like This
12.
Faria, Daniel C.
VERIFICATION AND VALIDATION OF A SAFETY SYSTEM FOR A FUEL-CELL RESEARCH FACILITY: A CASE STUDY.
Degree: MS, Computer Science (Engineering), 2007, Ohio University
► This thesis constitutes an effort of verifying and validating a safety system…
(more)
▼ This thesis constitutes an effort of verifying and validating a safety system designed for a specific research facility. An initial comprehensive review of the system design is presented, detailing all the relevant aspects of the system and investigating the way its design development interrelates to the formal "safety analysis" procedures proposed in the literature. The verification process includes the development of a complete formal specification for the system and the investigation of how well the original design follows its formal requirements. The validation process details the system’s hardware and software implementations, discusses the testing approach, and evaluates the final outcomes. In summary, this work can be considered as an effort to prove that the operation of the laboratory in question, within the designed safety system’s scope, is safe.
Advisors/Committee Members: Drews, Frank.
Keywords: system safety; critical systems; software engineering; system modeling; finite-state-machine; specification; verification; validation; safety; liveness; self-stabilization; real-time systems
More Like This
13.
Fleeman, David T.
Design of a Resource Management Service for the Quality-based Adaptive Resource Management Architecture.
Degree: MS, Computer Science (Engineering), 2006, Ohio University
► The Quality-based Adaptive Resource Management Architecture (QARMA) consists of a framework for…
(more)
▼ The Quality-based Adaptive Resource Management Architecture (QARMA) consists of a framework for describing resource management solutions and a collection of CORBA-based middleware services for the management of distributed, real-time systems. The framework can be used to: (1) characterize existing resource management architectures and tools and (2) assist in integrating existing tools into coherent resource management solutions. The middleware components are an instantiation of a resource management solution based directly on the framework. The main contributions of this thesis include an analysis of the information life-cycle in a resource management system, a collection of algorithmic models that serve as a basis for resource allocation algorithms in the QARMA middleware, and a description of the greedy algorithm used by the Resource Management Service. Experimental results demonstrate that QARMA can control existing application systems and can be integrated with existing management middleware.
Advisors/Committee Members: Welch, Lonnie R.
Subjects: Computer Science
Keywords: resource management; real-time systems; quality-of-service; qos; dynamic systems; adaptive systems; middleware; real-time; CORBA
More Like This
14.
Gu, Dazhang.
Resource Management for Dynamic, Distributed Real-time Systems.
Degree: PhD, Computer Science (Engineering), 2005, Ohio University
► A current challenge facing resource management is the need to deploy real-time…
(more)
▼ A current challenge facing resource management is the need to deploy real-time systems in dynamic operational environments. The systems are often affected by unpredictable environmental factors that cannot be known a priori and have no meaningful worst-case estimates. As a result, traditional resource allocation techniques do not apply. Current attempts to address these systems have been limited. This research addresses the resource management problem for dynamic, distributed real-time systems (DDRTSs). A resource allocation approach is developed for these systems that offers explicit real-time guarantees with maximized tolerance (robustness) of unpredictable environment changes. This work has developed (1) a real-time computing model that incorporates environmental factors, (2) metrics that characterize robustness, and (3) resource allocation algorithms that find feasible, robust allocations. The approach is validated by both theoretical analysis and experimentation. The main contribution of the work is a reliable resource management solution for DDRTSs, which allows real-time applications to be versatile in real world environments.
Advisors/Committee Members: Welch, Lonnie.
Subjects: Computer Science
Keywords: Real-time Systems; Distributed Systems; Resource Management
More Like This
15.
Kalidindi, Srinivas R.
Linux Operating System Configuration Management Framework: A Scalable and Efficient Approach Using Open Source Utilities.
Degree: MS, Computer Science (Engineering), 2007, Ohio University
► With the steady growth in Information Technology sector, managing complex infrastructure has…
(more)
▼ With the steady growth in Information Technology sector, managing complex infrastructure has proven to be a challenge for organizations, both big and small, in terms of maintaining a consistent environment across the board. In a product development industry, this consistency in the environment plays a key role in maintaining the overall productivity of the organization. Current Information Technology administrators have access to a wide array of open source and commercial tools for infrastructure management in terms of hardware as well as software configuration changes. As hardware support is provided by the appliance vendor, the complexity in managing the underlying operating system configuration changes poses a challenge. Although there is a wide array of open source tools available to achieve this objective, they may be far more complex than required, and may not be entirely portable within an existing environment. In many cases, the commercial solutions are not affordable depending on the size of the organization. This thesis investigates the currently available configuration management tools, and presents Linux operating system configuration management framework (LOSCMF) developed using open source tools and utilities. Linux operating system configuration management framework (LOSCMF) solution has been designed to perform complex operating system configuration changes by addressing the following three drawbacks found in the current configuration management solutions; usage of additional agents (system daemons), usage of complex configuration language, and usage of special scripting and programming languages. Each of the computer systems installed with the LOSCMF are grouped based on their current configuration level. A system administrator defines the necessary configuration changes that need to be applied either for a particular group or a logical combination of groups. These configuration changes are applied until a computer system confirms to a defined configuration state. The LOSCMF has both command line as well as web based reporting interfaces that can be used by the administrators to generate reports as per the requirement. The LOSCMF has been written using object oriented Perl, PHP and Bourne shell, and the underlying architecture is independent of the actual command or the scripting language, which would be performing the configuration change. The system administrators can choose to use any scripting or programming language of their choice to perform the configuration change. The LOSCMF solution can be used as a prototype within medium to large sized organizations for maintaining Linux operating system configuration changes. This thesis presents some of the benefits achieved using the LOSCMF approach such as a decrease in the administrative time, decrease in the support call volume, as well as a simple and effective mechanism for administrators to extract useful information on the fly.
Advisors/Committee Members: Liu, Chang.
Subjects: Computer Science
Keywords: Linux; Operating System; open source utilities
More Like This
16.
Karunanidhi, Karthikeyan.
ARROS: Distributed Adaptive Real-Time Network Intrusion Response.
Degree: MS, Computer Science (Engineering), 2006, Ohio University
► Research in Intrusion Response has shown that the success rate of an…
(more)
▼ Research in Intrusion Response has shown that the success rate of an attack increases with time. With attacks becoming sophisticated and automated, the response to these attacks still remains a time-consuming manual process. An active response system is a mechanism that can be used in conjunction with an intrusion detection system (IDS) to provide a network administrator with the capability to respond to an attack automatically when it has been detected. Active Real-time RespOnse System (ARROS) is an active, distributed, adaptive, and real-time Intrusion Response System (IRS) that provides Intrusion Response capabilities to INBOUNDS (Integrated Network Based Ohio University Network Detective Service), a network-based, real-time, hierarchical intrusion detection and response system being developed at Ohio University. ARROS consists of distributed autonomous agents that run at various different points on the network it protects. Agents communicate with each other to share information about the network, intrusions, and co-ordinate the response. Each ARROS agent is a fully functional autonomous unit capable of responding to intrusions in a distributed fashion. Coupled with priority queuing for ARROS traffic, distributed response capabilities, and time-bound response the ARROS system is able to provide real-time active Intrusion Response while minimizing adverse effects to the host network.
Advisors/Committee Members: Ostermann, Shawn D.
Subjects: Computer Science
Keywords: NETWORK INTRUSION RESPONSE; AUTOMATED, AUTOMATIC RESPONSE; COMPUTER SECURITY; NETWORK SECURITY; ACTIVE INTRUSION RESPONSE; ARROS, IRS, IR
More Like This
17.
Khasgiwala, Jitesh.
Analysis of Time-Based Approach for Detecting Anomalous Network Traffic.
Degree: MS, Computer Science (Engineering), 2005, Ohio University
► The Multiple Self-Organizing map based Intrusion Detection System (MSIDS) is a recent…
(more)
▼ The Multiple Self-Organizing map based Intrusion Detection System (MSIDS) is a recent approach for an anomaly-based IDS developed under the Integrated Network-Based Ohio University Network Detective Service (INBOUNDS). It enhanced the previous approach by introducing the time-based behavior of normal network connections. It analyzed the time-based behavior using a pattern and demonstrated the better characterization of network behavior. This thesis provides a detail analysis of this work by investigating various options for time-based approach. The analysis of a heuristic approach for automatic generation of patterns, and generation of two specific patterns is performed. The detailed false positive analysis for these patterns and MSIDS pattern is then accomplished using four training data sets. A methodology is devised for tuning the pattern generation algorithm that eliminates the false positives for the training data sets. The inherent false positive rate resulted from the threshold adopted from previous work is reduced by finding the new threshold value.
Advisors/Committee Members: Ostermann, Shawn D.
Keywords: Intrusion Detection System; Analysis, Time Based Approach; False Positive Analysis; Anomalous Network Traffic; Specific Patterns for Time-Based Behavior; Eliminative False Positives
More Like This
18.
Lenharth, Andrew.
Algorithms for Stable Allocations in Distributed Real-Time Resource Management Systems.
Degree: MS, Computer Science (Engineering), 2004, Ohio University
► Dynamic distributed real-time quality-based resource management systems must allocate tasks to hosts…
(more)
▼ Dynamic distributed real-time quality-based resource management systems must allocate tasks to hosts and choose quality settings such that the managed system operates in such a manner as to meet all real-time constraints. Since the migration of tasks between hosts is often expensive,it is desirable for allocation algorithms to make robust or stable allocations. Such allocations are feasable for a wide variation in the amount of work they can feasably handle. Several approaches and algorithms for the creation of stable allocations are presented.
Advisors/Committee Members: Welch, Lonnie R.
Keywords: Allocation Algorithms; Real-Time; Distributed; Resource Management; Stable; Robust
More Like This
19.
Liang, Ming.
Monitoring and Analyzing Communication Latency in Distributed Real-time Systems.
Degree: MS, Computer Science (Engineering), 2003, Ohio University
► This thesis presents mathematic models to compute communication latency in LAN across…
(more)
▼ This thesis presents mathematic models to compute communication latency in LAN across Ethernet technology and a latency monitoring tool for distributed real-time systems. The models contain two sets of formulas for both dedicated and contention network environment. In dedicated network environment, latency is computed by analyzing the host delay time and network delay time. In contention network environment, latency is computed used statistic method. The mean value of communication latency is obtained by analyzing host delay time, network delay time and traffic waiting time. Experiments in two typical LAN connected with hub or switch have been done to show the accuracy of the models.
Advisors/Committee Members: Dill, Jeffery.
Subjects: Computer Science
Keywords: Network Monitoring; Network Latency; Real-Time system; Ethernet
More Like This
20.
Li, Xiaodong.
RDSS: A Reliable and Efficient Distributed Storage System.
Degree: MS, Computer Science (Engineering), 2004, Ohio University
► This research work presents RDSS, a Resource Area Network (RAN)-based Distributed Storage…
(more)
▼ This research work presents RDSS, a Resource Area Network (RAN)-based Distributed Storage System. It is designed for operational efficiency. Using the RAN architectural pattern, RDSS works on the block level instead of the file level, which increases system flexibility. RDSS adopts directory model routing, lazy master-slave replication, and content hash verification. It uses a Multiple Token Control (MTC) scheme to provide consistent storage services while reducing response delay. It employs a Node Ranking System (NRS) to optimize node selections in terms of stability, integrity, and workload. SPIN (Simple Process/Protocol Modeling Language (PROMELA) Interpreter) simulation results show that RDSS can significantly suppress data transfer of misbehaving nodes. It yields only a slight deviation in terms of individual load share compared to the random selection scheme. Microbenchmarks show that RDSS retrieves 64KB data within 35ms and updates 64KB data within 40ms. The contribution of RDSS is that it provides reliable storage services while achieving high efficiency.
Advisors/Committee Members: Liu, Chang.
Keywords: RDSS; Distributed Storage System
More Like This
21.
Lydon, Andrew.
Compilation For Intrusion Detection Systems.
Degree: MS, Computer Science (Engineering), 2004, Ohio University
► Within computer security, intrusion detection systems (IDSs) are the subject of extensive…
(more)
▼ Within computer security, intrusion detection systems (IDSs) are the subject of extensive and varying research. Distributed IDSs have additional research problems. This thesis contributes a way of using compilation of a multi-layered language to simultaneously solve multiple issues confronting distributed IDSs. The target of the compilation is the configuration of existing IDSs with run time support. The language for compilation has two layers: a lower layer for signature and other computationally limited matching including anomaly based matching and a higher layer for general computations. This compiler is implemented and shown to be sufficient to produce arbitrary IDSs using existing IDSs for input rather than custom system software. Graceful degradation and reasonable performance during denial of service attacks have been added on top of existing IDSs using this framework.
Advisors/Committee Members: Bruggeman, Carl.
Subjects: Computer Science
Keywords: Security; Intrusion Detection; Computer Security; Distributed; Real-Time; Complier
More Like This
22.
Macenko, Marc D.
Eigenimage-based Robust Image Segmentation Using Level Sets.
Degree: MS, Computer Science (Engineering), 2006, Ohio University
► This thesis presents a novel way of integrating shape prior information into…
(more)
▼ This thesis presents a novel way of integrating shape prior information into a level set based segmentation scheme. It utilizes the eigenimages of the signed-distance functions of the training shapes and confines the segmentation to statistically allowable shapes while minimizing the Chan-Vese functional via gradient descent. Implemented under the level set framework, the resulting algorithm can handle topological changes very well and is robust to noise and initial contour location due to the prior shape information being integrated. Meanwhile, the compactness of the eigenimage representation overcomes the "curse of dimensionality problem" existing for one-dimensional principal component analysis. We demonstrate this technique by applying it to several synthetic and real images.
Advisors/Committee Members: Liu, Jundong.
Keywords: Eigenimage; level set; segmentation; prior information
More Like This
23.
Maimone, Anthony.
Data and Knowledge Acquisition in Case-based Reasoning for Diabetes Management.
Degree: MS, Computer Science (Engineering), 2006, Ohio University
► This thesis presents work in data and knowledge acquisition in case-based reasoning…
(more)
▼ This thesis presents work in data and knowledge acquisition in case-based reasoning for diabetes management. Contributions include designing and implementing a database, designing and implementing a website, and acquiring knowledge to build cases for a Case-Based Reasoning (CBR) system. This work is the initial phase of a project that will provide automated insulin therapy adjustments to Type 1 Diabetics on insulin pumps. An Ohio University Institutional Review Board approved study is under way which collects and analyzes data from patients with Type 1 Diabetes for use in knowledge engineering. Data is interpreted and analyzed by physicians to find problems, create solutions, and adjust insulin therapy accordingly. Knowledge acquired from physicians is used to create cases for the CBR system. The cases embody problem solving knowledge that will be used to help future patients.
Advisors/Committee Members: Marling, Cynthia R.
Keywords: Case-based Reasoning; Artificial Intelligence; Diabetes Management; Knowledge Acquisition
More Like This
24.
Marinucci, Toni.
Characterization and Development of Distributed, Adaptive Real-Time Systems.
Degree: MS, Computer Science (Engineering), 2005, Ohio University
► Development of real-time resource management system often entails utilizing similar software engineering…
(more)
▼ Development of real-time resource management system often entails utilizing similar software engineering solutions as other resource managers. However, the developers of these resource managers may reengineer solutions, not knowing that a solution already exists. First time developers of this type of software may not even know what types of problems they will encounter. Each of these situations slows the development process. This thesis examines the challenges in determining what software is needed to build a real-time resource management system. After working with several different types of resource management systems, real-time and otherwise, it is clear that many of these systems use similar approaches in managing their resources. Research in the field of real-time systems unveils that some such approaches are documented as patterns, but many of the existing patterns focus on in depth details about real-time system management, requiring that the reader already have an abundance of knowledge on the topic. The aim of this thesis is to step back and examine the higher-level components of these systems and the interaction of these components and document them as patterns. These patterns allow newcomers to real-time systems to understand the problems incidental the topic. Furthermore, these patterns may aid the expert by presenting the information in a different way. The common components of the systems researched that are found in a number of distributed and real-time systems are essential pieces in building such systems, due to the sheer number of systems in which they are found. Here, they are presented in pattern format.
Advisors/Committee Members: Welch, Lonnie R.
Keywords: Dynamic, adaptive real-time systems; Distributed systems; Design Patterns
More Like This
25.
Nedunchelliyan, Chitra.
Peer-to-Peer Directory Service in Resource Area Network.
Degree: MS, Computer Science (Engineering), 2007, Ohio University
► This research effort involves designing and implementing a resource directory (RD) for…
(more)
▼ This research effort involves designing and implementing a resource directory (RD) for a Resource Area Network (RAN). The resource directory is an application that performs resource and peer management in a RAN. This Java-based implementation enables the RAN to support disparate resource types such as memory, files, file chunks, and web services as shared resources. The RD also allows for dynamic definition and modification of the resource types actively supported in the RAN. In addition, the search efficiency is enhanced by implementing a balanced binary tree algorithm within the peer network structure in the RAN. The algorithm reduces the height of the tree hence reducing the hop number for the search messages. The experiments conducted demonstrate RAN’s ability to support and dynamically manage multiple resource types. The tests simulated on the sample networks demonstrate the reduction in hop number for search messages in RAN when compared with an unstructured network like Gnutella.
Advisors/Committee Members: Liu, Chang.
Subjects: Computer Science
Keywords: Resource Area Network; Resource Directory; Balanced Binary Tree; RAN; RAN RD
More Like This
26.
Ramadas, Manikantan.
STUDY OF A PROTOCOL AND A PRIORITY PARADIGM FOR DEEP SPACE DATA COMMUNICATION.
Degree: PhD, Computer Science (Engineering), 2007, Ohio University
► Communicating data in deep-space entails the following constraints: large signal propagation delays…
(more)
▼ Communicating data in deep-space entails the following constraints: large signal propagation delays - on the order of minutes or hours, coupled with the disruptions due to planetary orbital dynamics; high channel error characteristics; scarce and asymmetric data bandwidth availability, etc. Communication protocols developed for the terrestrial Internet perform poorly, or not at all, in this environment. We have co-designed a protocol, namely the Licklider Transmission Protocol (LTP), for reliable data communications in deep-space. We compare its performance to that of the well-known terrestrial Internet protocol - TCP - for various communication channel characteristics. Deep-space missions often generate much more data for communication to Earth than what is allowed by the channel data rate. Therefore, it becomes important to decide which data to send, and when; this is done largely as a manual process at present. To help address this problem, we propose a two-dimensional priority paradigm for applications, aimed at optimizing the overall data communication performance. The two dimensions are: Intrinsic Value, a measure of how innately valuable the application data is, and Immediacy, a measure of how urgently a unit of application data needs to be communicated. We integrate this priority paradigm with LTP, and study candidate Forward Error Correction (FEC) mechanisms for implementing the paradigm such as Convolutional codes, Reed-Solomon codes, and Digital Fountain codes, for various channel characteristics. Finally, we recommend appropriate FEC mechanisms for the priority requirements of applications under different channel characteristics to optimize the volume and value of the data received.
Advisors/Committee Members: Ostermann, Shawn D.
Keywords: Deep Space Communication; Licklider Transmission Protocol; Forward Error Correction Codes; Network Bandwidth Optimization; Priority Paradigm
More Like This
27.
Song, Yinglei.
Grammatical Study of Ribonucleic Acids Pseudo-Knot Structures: A Simulated Annealing Approach.
Degree: MS, Computer Science (Engineering), 2003, Ohio University
► Modeling the secondary and pseudo-knot structures in RNA sequences is an important…
(more)
▼ Modeling the secondary and pseudo-knot structures in RNA sequences is an important problem in computational biology. Stochastic Context Free Grammars (SCFG) provide a viable description of the secondary structures with nested and parallel helices. Based upon the SCFG, structure prediction can be performed with a dynamic programming algorithm. To precisely model the crossing patterns of double helices in a pseudo-knot structure, Cai et al. used the Parallel Communicating Grammar System (PCGS) and developed a dynamic programming that can predict the optimal structure for an RNA sequence containing pseudo-knots. Unfortunately, the algorithm requires a space consumption of O(N 4 ), which prevents its application to the prediction of long sequences. The main contribution of this thesis is the development of a new scheme. The scheme can be combined with the simulated annealing algorithm to predict RNA sequences containing pseudo-knots. Compared with the dynamic programming algorithm, this approach requires less computational resources and its resource requirements increase linearly when the pseudo-knot becomes structurally more complex.
Advisors/Committee Members: Juedes, David.
Subjects: Computer Science
Keywords: Secondary Structures; Pseudo-knot Structures; Stochastic Context-Free Grammer Systems; Generic Scheme; The Simulated Annealing Algorithm
More Like This
28.
Srinivasan, Pradeep Kumar.
Implementation and Evaluation of Proportional Share Scheduler on Linux Kernel 2.6.
Degree: MS, Computer Science (Engineering), 2008, Ohio University
► There is a steady proliferation of Time Sensitive applications, adding more diversity…
(more)
▼ There is a steady proliferation of Time Sensitive applications, adding more diversity to the regular workload on General Purpose Operating Systems (GPOS). Priority based Scheduling in GPOS are not designed to handle a mix of regular workload and Time Sensitive applications. An Alternative approach to handle this mixed workload is to use Proportional Share Scheduling (PSS). In PSS model, each task receives a share of the resource in proportion to the weight assigned to it. Most of the PSS schemes proposed in the literature assume the existence of an interface, that can translate application requirements in to weights. And some leave the onus of specifying weights to the application on the User/Application Developer. In this thesis, we describe our implementation of Earliest Eligible Virtual Deadline First (EEVDF) based PSS on Linux Kernel. We have designed and developed an Abstract Scheduling Interface (ASI) to our Proportional Share Scheduler. ASI provides an interface to translate resource requirements of tasks in the form of shares to weights for PSS Tasks.
Advisors/Committee Members: Drews, Frank.
Subjects: Computer science
Keywords: CPU Scheduler; Proportional Share Scheduling; Linux Kernel Scheduler
More Like This
29.
Srivastava, Mayank.
Implementation and Evaluation of a Multiple-Points Haptic Rendering Algorithm.
Degree: MS, Computer Science (Engineering), 2007, Ohio University
► This thesis presents implementation and evaluation of a multiple-points haptic rendering algorithm…
(more)
▼ This thesis presents implementation and evaluation of a multiple-points haptic rendering algorithm using the PHANToM haptic interface, in the context of our Virtual Haptic Back Project at Ohio University. This algorithm will increase realism in palpation with the Virtual Haptic Back and other virtual haptic palpation tasks when compared to the single point haptic rendering. The single-point haptic rendering cannot provide tool-object interactions in which more than one object is in contact simultaneously at different locations of the tool or finger. Since a single point does not represent the finger haptically well, this thesis uses a multiple-points probe. The multiple-points collision detection is computationally expensive and complicated than the single-point haptic rendering. This thesis constructs the volume object using a sphere. The center of this sphere is the original PHANToM position and the end-points consist of points on the sphere. The collision detection between these line segments and objects in the virtual scene is completed and a resultant force is displayed to the user. The multiple-points haptic rendering algorithm was integrated with simple haptic objects and with the complex Virtual Haptic Back. The multiple-points algorithm is made efficient using concepts such as rasterisation, hashing and spatial decomposition. Experiments have determined that multiple-points haptic rendering can improve the user’s experience with virtual reality applications based on this first step in implementation and evaluation.
Advisors/Committee Members: Williams II, Robert L.
Subjects: Computer Science
Keywords: Haptics; Virtual Reality; Haptics Rendering; Phantom; Virtual Haptic Back; Applications of Haptics
More Like This
30.
Taneja, Anshuman.
The Cost Element Builder – a Tool for Creating and Editing Specific Java Code through a Graphical User Interface.
Degree: MS, Computer Science (Engineering), 2004, Ohio University
► Ohio University, as one of the project members of an industrial project…
(more)
▼ Ohio University, as one of the project members of an industrial project called FIPER, has developed a software tool in Java called the ‘Cost Estimator’, which provides a powerful mechanism for estimating the cost of manufacturing any product. Information representing the product must be written in Java code and plugged into the Cost Estimator to deliver an estimate of the cost. This work – The Cost Element Builder – is an easy way for a user to be able to write and edit Java code representing his product, through a Graphical User Interface (GUI), without necessarily being adept at Java programming. The tool is integrated into JBuilder as an open tool. It provides a classical IDE based code generator interface, and provides two-way synchronization between the source code and its graphical representation. The tool aims to find utility for both, novice Java programmers, as well as experienced ones.
Advisors/Committee Members: Judd, Robert P.
Keywords: GUI; Java Code
More Like This
[1] [2]
