You searched for +publisher:"University of Houston" +contributor:("Gurkan, Deniz").
Showing records 1 – 18 of
18 total matches.
No search limiters apply to these results.
University of Houston
1.
Visitsathapong, Chanpol.
Path Switching Delay Measurements in Software-Defined Networks.
Degree: MS, Engineering Technology, 2014, University of Houston
URL: http://hdl.handle.net/10657/883 
► The research fundamentally focuses on a study of the multipath switching in software-defined networks. On the one hand, the thesis aims to measure and determine…
(more)
▼ The research fundamentally focuses on a study of the multipath switching in software-defined networks. On the one hand, the thesis aims to measure and determine the latency cost in the process of traffic engineering of the multipath software-defined networks. On the other hand, the thesis intends to enhance link utilization in the software-defined networks with dynamic path switching. To experiment and collect measurement data, a northbound application for multipath switching was programmed and implemented in the virtual network environment. The application was capable of exchanging related information with a network controller in order to dynamically manage the traffic between network end points. The research investigated all necessary parts of the executing process including traffic characteristics before and after path switching, time for message exchanging in control plane, and reaction time between control plane and data plane network elements.
Advisors/Committee Members: Gurkan, Deniz (advisor), Benhaddou, Driss (committee member), Pollonini, Luca (committee member).
Subjects/Keywords: SDN; Dynamic Path Switching; OVS; SFlow-RT; Floodlight; 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):
Visitsathapong, C. (2014). Path Switching Delay Measurements in Software-Defined Networks. (Masters Thesis). University of Houston. Retrieved from http://hdl.handle.net/10657/883
Chicago Manual of Style (16th Edition):
Visitsathapong, Chanpol. “Path Switching Delay Measurements in Software-Defined Networks.” 2014. Masters Thesis, University of Houston. Accessed January 24, 2021.
http://hdl.handle.net/10657/883.
MLA Handbook (7th Edition):
Visitsathapong, Chanpol. “Path Switching Delay Measurements in Software-Defined Networks.” 2014. Web. 24 Jan 2021.
Vancouver:
Visitsathapong C. Path Switching Delay Measurements in Software-Defined Networks. [Internet] [Masters thesis]. University of Houston; 2014. [cited 2021 Jan 24].
Available from: http://hdl.handle.net/10657/883.
Council of Science Editors:
Visitsathapong C. Path Switching Delay Measurements in Software-Defined Networks. [Masters Thesis]. University of Houston; 2014. Available from: http://hdl.handle.net/10657/883
University of Houston
2.
Daga, Anand Arun 1989-.
ACCELERATING DATA-INTENSIVE COMPUTATIONS THROUGH DYNAMIC NETWORK TRAFFIC OPTIMIZATION.
Degree: MS, Computer Science, 2012, University of Houston
URL: http://hdl.handle.net/10657/791
► Hadoop has been emerging as a popular distributed framework for data intensive computing in clustered environments. The main usage has been in parallel computing problems…
(more)
▼ Hadoop has been emerging as a popular distributed framework for data intensive
computing in clustered environments. The main usage has been in parallel computing
problems where interconnected clusters would transfer parts of the data between
individual compute nodes to accomplish one job. The clusters are usually connected
with shared network infrastructure where other applications also access and transfer
on the same bandwidth. Specifi cally, Hadoop MapReduce jobs su ffer when running
in parallel with other tra ffic in the underlying network due to their sensitivity to
delay between compute phases. We propose a dynamic priority mechanism realized
by OpenFlow protocol on such an infrastructure with a preferred QoS policy over
all other tra ffic. Moreover, our proposed priority mechanism can be enhanced if
additional network information on traffi c in the underlying network is provided. We
propose to use the emerging ALTO (Application Layer Tra ffic Optimization) server
to provide network tra ffic information to Hadoop. The ALTO server will be based
on the industry standard, IF-MAP (interface to metadata access points protocol),
to leverage publish/subscribe capabilities and the
flexible schema defi nitions.
Advisors/Committee Members: Subhlok, Jaspal (advisor), Gurkan, Deniz (committee member), Johnsson, Lennart (committee member).
Subjects/Keywords: Hadoop; Computer science
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):
Daga, A. A. 1. (2012). ACCELERATING DATA-INTENSIVE COMPUTATIONS THROUGH DYNAMIC NETWORK TRAFFIC OPTIMIZATION. (Masters Thesis). University of Houston. Retrieved from http://hdl.handle.net/10657/791
Chicago Manual of Style (16th Edition):
Daga, Anand Arun 1989-. “ACCELERATING DATA-INTENSIVE COMPUTATIONS THROUGH DYNAMIC NETWORK TRAFFIC OPTIMIZATION.” 2012. Masters Thesis, University of Houston. Accessed January 24, 2021.
http://hdl.handle.net/10657/791.
MLA Handbook (7th Edition):
Daga, Anand Arun 1989-. “ACCELERATING DATA-INTENSIVE COMPUTATIONS THROUGH DYNAMIC NETWORK TRAFFIC OPTIMIZATION.” 2012. Web. 24 Jan 2021.
Vancouver:
Daga AA1. ACCELERATING DATA-INTENSIVE COMPUTATIONS THROUGH DYNAMIC NETWORK TRAFFIC OPTIMIZATION. [Internet] [Masters thesis]. University of Houston; 2012. [cited 2021 Jan 24].
Available from: http://hdl.handle.net/10657/791.
Council of Science Editors:
Daga AA1. ACCELERATING DATA-INTENSIVE COMPUTATIONS THROUGH DYNAMIC NETWORK TRAFFIC OPTIMIZATION. [Masters Thesis]. University of Houston; 2012. Available from: http://hdl.handle.net/10657/791
University of Houston
3.
Yang, Jinxin 1989-.
A Validation Suite For High-level Directive-based Programming Model For Accelerators.
Degree: MS, Computer Science, 2015, University of Houston
URL: http://hdl.handle.net/10657/1696
► The broad adoption of accelerators boosts the interest in accelerator programming models. OpenACC is an emerging and directive-based programming model for accelerators that typically enables…
(more)
▼ The broad adoption of accelerators boosts the interest in accelerator programming models. OpenACC is an emerging and directive-based programming model for accelerators that typically enables non-expert programmers to achieve portable and
productive performance of their applications. The model is gaining popularity and being used for accelerating many types of applications, ranging from molecular dynamics codes to particle physics models. However, in order to ensure correctness of OpenACC’s compiler implementation and determine its conformance to the specification, there is a critical requirement of an up-to-date validation suite.
In this thesis, we present a portable and robust validation suite execution environment to serve this purpose. The validation suite consists of a scalable testing infrastructure and more than 140 test cases for the most recent OpenACC 2.0 programming model, both for C and FORTRAN languages. The test cases aim to identify and resolve ambiguities within the OpenACC 2.0 specification. The framework of this testsuite is also robust enough to create test cases for the future releases.
We evaluate three commercial OpenACC compilers that are being widely used for porting applications to accelerators and assist them in identifying and resolving compiler bugs helping them improve the quality of their compilers. We test their five
stable compiler versions and collect the pass rate for tracking the validating status. The results show that the number of bugs decrease with every newer version of the compiler released demonstrating improved compiler quality. Based on the interesting
observations during the development of the validation suite, we also give suggestions on improving the future specification, which are good feedback to the OpenACC community.
Advisors/Committee Members: Chapman, Barbara M. (advisor), Chen, Guoning (committee member), Gurkan, Deniz (committee member).
Subjects/Keywords: OpenACC; Validation suite
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):
Yang, J. 1. (2015). A Validation Suite For High-level Directive-based Programming Model For Accelerators. (Masters Thesis). University of Houston. Retrieved from http://hdl.handle.net/10657/1696
Chicago Manual of Style (16th Edition):
Yang, Jinxin 1989-. “A Validation Suite For High-level Directive-based Programming Model For Accelerators.” 2015. Masters Thesis, University of Houston. Accessed January 24, 2021.
http://hdl.handle.net/10657/1696.
MLA Handbook (7th Edition):
Yang, Jinxin 1989-. “A Validation Suite For High-level Directive-based Programming Model For Accelerators.” 2015. Web. 24 Jan 2021.
Vancouver:
Yang J1. A Validation Suite For High-level Directive-based Programming Model For Accelerators. [Internet] [Masters thesis]. University of Houston; 2015. [cited 2021 Jan 24].
Available from: http://hdl.handle.net/10657/1696.
Council of Science Editors:
Yang J1. A Validation Suite For High-level Directive-based Programming Model For Accelerators. [Masters Thesis]. University of Houston; 2015. Available from: http://hdl.handle.net/10657/1696
University of Houston
4.
Jha, Shweta 1986-.
Performance Tuning and Modeling of Communication in Parallel Applications.
Degree: PhD, Computer Science, 2017, University of Houston
URL: http://hdl.handle.net/10657/4509
► The goal of high performance computing is executing very large problems in the least amount of time, typically by deploying parallelization techniques. However, in- troducing…
(more)
▼ The goal of high performance computing is executing very large problems in the least amount of time, typically by deploying parallelization techniques. However, in- troducing parallelization to an application also introduces synchronization and com- munication overhead, which in turn creates a performance bottleneck. Performance modeling and tuning can be used to predict and ease this bottleneck to improve the overall performance of the application.
There are two aspects of an application which can be improved from performance point of view, namely, the computational section and the communication section. The time spent in communication operations is a major factor in determining the scalability of parallel applications. Tuning the parameters of a communication library can be used to adapt its characteristics to a particular platform, minimizing the communication time of an application. On the other hand performance modeling can be used to predict the performance using the network and application attributes.
The goal of this dissertation is to improve the performance of a parallel applica- tion by performance tuning and performance modeling. Specifically, we introduce the notion of a personalized MPI library, highlighting the necessity and the methodology each application needs to have a communication library tuned for the particular plat- form. Secondly, this dissertation contributes towards the theoretical understanding of impact and limitations of point-to-point communication performance on collective communication and the overall application. This study has been further extended to develop performance models for communication aspect of collective I/O for one and two dimensional data decomposition, and for two file partitioning strategies, namely even and static partitioning.
Advisors/Committee Members: Gabriel, Edgar (advisor), Subhlok, Jaspal (committee member), Shi, Weidong (committee member), Gurkan, Deniz (committee member).
Subjects/Keywords: Performance tuning; Performance models; Collective communication; Point-to-point communication
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):
Jha, S. 1. (2017). Performance Tuning and Modeling of Communication in Parallel Applications. (Doctoral Dissertation). University of Houston. Retrieved from http://hdl.handle.net/10657/4509
Chicago Manual of Style (16th Edition):
Jha, Shweta 1986-. “Performance Tuning and Modeling of Communication in Parallel Applications.” 2017. Doctoral Dissertation, University of Houston. Accessed January 24, 2021.
http://hdl.handle.net/10657/4509.
MLA Handbook (7th Edition):
Jha, Shweta 1986-. “Performance Tuning and Modeling of Communication in Parallel Applications.” 2017. Web. 24 Jan 2021.
Vancouver:
Jha S1. Performance Tuning and Modeling of Communication in Parallel Applications. [Internet] [Doctoral dissertation]. University of Houston; 2017. [cited 2021 Jan 24].
Available from: http://hdl.handle.net/10657/4509.
Council of Science Editors:
Jha S1. Performance Tuning and Modeling of Communication in Parallel Applications. [Doctoral Dissertation]. University of Houston; 2017. Available from: http://hdl.handle.net/10657/4509
University of Houston
5.
Chitral, Pooja 1986-.
Accelerator Benchmark Suite Using OpenACC Directives.
Degree: MS, Computer Science, 2014, University of Houston
URL: http://hdl.handle.net/10657/1686
► In recent years, GPU computing has been very popular for scientific applications, especially after the release of programming languages like CUDA, OpenCL, and OpenACC. The…
(more)
▼ In recent years, GPU computing has been very popular for scientific applications, especially after the release of programming languages like CUDA, OpenCL, and OpenACC. The growing popularity of GPU computation in commercial and scientific fields is attributed to the high computational power of GPU cores. The accelerator benchmark suite using OpenACC 2.0 is a combination of very popular benchmarks – the Parboil and NAS Parallel benchmarks. These benchmarks contain a wide range of throughput computing applications, which are useful for studying the performance of computing architectures and compilers. The Parboil benchmark includes applications from different scientific and commercial fields including image processing, biomolecular simulation, and astronomy. The NAS Parallel benchmark has a set of applications that target different areas of computational fluid dynamics.
The accelerator benchmark suite that has been designed exploits the computational power of GPU architecture by using the emerging directives and clauses provided by OpenACC 2.0. This benchmark can act as a reference point for new programmers in GPU computing, reducing the time taken to understand one of the most powerful parallel programming paradigms.
Finally, the goal of the accelerator benchmark is to evaluate the applicability of one of the high-level programming models OpenACC for accelerators. This benchmark will help provide the OpenACC community with valuable feedback to improve the model further.
Advisors/Committee Members: Chapman, Barbara M. (advisor), Gnawali, Omprakash (committee member), Gurkan, Deniz (committee member).
Subjects/Keywords: GPU computing; OpenACC; Parboil; NAS parallel Benchmarks
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):
Chitral, P. 1. (2014). Accelerator Benchmark Suite Using OpenACC Directives. (Masters Thesis). University of Houston. Retrieved from http://hdl.handle.net/10657/1686
Chicago Manual of Style (16th Edition):
Chitral, Pooja 1986-. “Accelerator Benchmark Suite Using OpenACC Directives.” 2014. Masters Thesis, University of Houston. Accessed January 24, 2021.
http://hdl.handle.net/10657/1686.
MLA Handbook (7th Edition):
Chitral, Pooja 1986-. “Accelerator Benchmark Suite Using OpenACC Directives.” 2014. Web. 24 Jan 2021.
Vancouver:
Chitral P1. Accelerator Benchmark Suite Using OpenACC Directives. [Internet] [Masters thesis]. University of Houston; 2014. [cited 2021 Jan 24].
Available from: http://hdl.handle.net/10657/1686.
Council of Science Editors:
Chitral P1. Accelerator Benchmark Suite Using OpenACC Directives. [Masters Thesis]. University of Houston; 2014. Available from: http://hdl.handle.net/10657/1686
University of Houston
6.
Araji, Bahaa.
Embedding Location-Based Network Connectivity within IPv6 Address.
Degree: MS, Engineering Technology, 2014, University of Houston
URL: http://hdl.handle.net/10657/1100
► IPv4 (Internet Protocol Version 4) the famous 32-bit address, has been used in networks for many decades [1] and would not have sustained its usability…
(more)
▼ IPv4 (Internet Protocol Version 4) the famous 32-bit address, has been used in networks for many decades [1] and would not have sustained its usability without NAT(Network Address Translation). IPv6 (Internet Protocol version 6) with its 128-bit address, provides slight routing information [2]. In this thesis, we present ESPM (Embedding Switch ID, Port number, MAC address), Embedding Switch Identification number, Port number and MAC (Media Access Control) Address within IPv6 protocol and SDN technology, imposing a device connectivity hierarchy upon the address space. We amend the IPv6 global addressing scheme for hosts to include their MAC address as well as the switch and port numbers that they are connected to. This scheme encodes information that would ordinarily require a lookup or query packets and decrease CAM (Content Addressable Memory) table entries on the switch by forwarding the packets using the ESPM algorithm. After processing ESPM algorithm to check for OF (Open Flow) controller ID, OF switch ID, and the Port ID, the amount of total packets transferred on the network to fulfill an ICMP (Internet Control Message Protocol) request-reply process decreased by 28.1% in 1-switch-2 host. In order to demonstrate the feasibility of such an addressing scheme, we use POF (Protocol Oblivious Forwarding) controller and POF switch [3] to implement ESPM and then measure the impact on the number of network management packets transferred between hosts during connectivity tests.
Advisors/Committee Members: Gurkan, Deniz (advisor), Merchant, Fatima Aziz (committee member), Lent, Ricardo (committee member).
Subjects/Keywords: IPv6; SDN; OpenFlow; IP address; MAC address; DHCP; Network addressing; Technology
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):
Araji, B. (2014). Embedding Location-Based Network Connectivity within IPv6 Address. (Masters Thesis). University of Houston. Retrieved from http://hdl.handle.net/10657/1100
Chicago Manual of Style (16th Edition):
Araji, Bahaa. “Embedding Location-Based Network Connectivity within IPv6 Address.” 2014. Masters Thesis, University of Houston. Accessed January 24, 2021.
http://hdl.handle.net/10657/1100.
MLA Handbook (7th Edition):
Araji, Bahaa. “Embedding Location-Based Network Connectivity within IPv6 Address.” 2014. Web. 24 Jan 2021.
Vancouver:
Araji B. Embedding Location-Based Network Connectivity within IPv6 Address. [Internet] [Masters thesis]. University of Houston; 2014. [cited 2021 Jan 24].
Available from: http://hdl.handle.net/10657/1100.
Council of Science Editors:
Araji B. Embedding Location-Based Network Connectivity within IPv6 Address. [Masters Thesis]. University of Houston; 2014. Available from: http://hdl.handle.net/10657/1100
University of Houston
7.
Vemuri, Kiran Kameswari.
Policy Carry-Over for Mobility in Software Defined Networks.
Degree: MS, Engineering Technology, 2014, University of Houston
URL: http://hdl.handle.net/10657/884
► Due to increase in the number of mobile devices that are connected to a network, it is getting harder by the day to manage these…
(more)
▼ Due to increase in the number of mobile devices that are connected to a network, it is getting harder by the day to manage these devices while they hop between different networks. Network management often involves implementation of policies that are generic to all the devices connected to the network as well as the ones that are specific to individual devices. In order to support this type of network management, static policies have to be set up across the networks using middle box technologies like firewalls, network policy servers, authentication servers etc. These middle boxes control the activity of the devices connected to the network using the policies but are often home for a huge number policies that complicate the network setup and make policy management a herculean task.
In recent years, the development of Software Defined Networking practices has made it simple and intuitive to instantiate programmable networks and automate different network functions. We propose a solution to automate the process of network policy management for mobility in a Software Defined Network. Using this approach, we can implement a solution that can dynamically carry the policies across the network as a host or device moves from one place to another in a network, without any action from the network administrator. Also, with the help of this implementation, we can automate the process of policy repair in the case of network changes or errors
Advisors/Committee Members: Gurkan, Deniz (advisor), Merchant, Fatima Aziz (committee member), Lent, Ricardo (committee member).
Subjects/Keywords: Software Defined Networks; Mobility; Automation; Policies; Network Policies; OpenFlow; SDN; Networks; 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):
Vemuri, K. K. (2014). Policy Carry-Over for Mobility in Software Defined Networks. (Masters Thesis). University of Houston. Retrieved from http://hdl.handle.net/10657/884
Chicago Manual of Style (16th Edition):
Vemuri, Kiran Kameswari. “Policy Carry-Over for Mobility in Software Defined Networks.” 2014. Masters Thesis, University of Houston. Accessed January 24, 2021.
http://hdl.handle.net/10657/884.
MLA Handbook (7th Edition):
Vemuri, Kiran Kameswari. “Policy Carry-Over for Mobility in Software Defined Networks.” 2014. Web. 24 Jan 2021.
Vancouver:
Vemuri KK. Policy Carry-Over for Mobility in Software Defined Networks. [Internet] [Masters thesis]. University of Houston; 2014. [cited 2021 Jan 24].
Available from: http://hdl.handle.net/10657/884.
Council of Science Editors:
Vemuri KK. Policy Carry-Over for Mobility in Software Defined Networks. [Masters Thesis]. University of Houston; 2014. Available from: http://hdl.handle.net/10657/884
University of Houston
8.
Dane, Levent.
An Investigation on Data Plane Programmability and Acceleration Methods.
Degree: MS, Engineering Technology, 2014, University of Houston
URL: http://hdl.handle.net/10657/1908
► Programmability in networking may span multiple layers of the protocol stack. As cloud networking with resource management (orchestration of workloads), and automation evolved, hardware in…
(more)
▼ Programmability in networking may span multiple layers of the protocol stack. As cloud networking with resource management (orchestration of workloads), and automation evolved, hardware in computer networks also has also adapted to support better isolation principles while supporting forwarding functions. In this thesis, generic hardware such as servers was assumed to take on the role of legacy switching functions. In order to perform at the line rate, many data plane acceleration methods have been explored. We provided integration of one such data plane acceleration method, namely netmap, to the modular software switch initiative, xDPd (eXtensible Data Plane daemon). We present the measurement results with achieved improvements at levels of about 20% or more. We also present future directions in this paradigm shift.
Advisors/Committee Members: Gurkan, Deniz (advisor), Merchant, Fatima Aziz (committee member), Pollonini, Luca (committee member).
Subjects/Keywords: SDN; Netmap; XDPd; Dataplane acceleration; Middlebox
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):
Dane, L. (2014). An Investigation on Data Plane Programmability and Acceleration Methods. (Masters Thesis). University of Houston. Retrieved from http://hdl.handle.net/10657/1908
Chicago Manual of Style (16th Edition):
Dane, Levent. “An Investigation on Data Plane Programmability and Acceleration Methods.” 2014. Masters Thesis, University of Houston. Accessed January 24, 2021.
http://hdl.handle.net/10657/1908.
MLA Handbook (7th Edition):
Dane, Levent. “An Investigation on Data Plane Programmability and Acceleration Methods.” 2014. Web. 24 Jan 2021.
Vancouver:
Dane L. An Investigation on Data Plane Programmability and Acceleration Methods. [Internet] [Masters thesis]. University of Houston; 2014. [cited 2021 Jan 24].
Available from: http://hdl.handle.net/10657/1908.
Council of Science Editors:
Dane L. An Investigation on Data Plane Programmability and Acceleration Methods. [Masters Thesis]. University of Houston; 2014. Available from: http://hdl.handle.net/10657/1908
University of Houston
9.
Kundooru, Shyam Sunder Reddy 1991-.
Generalized Framework for Time-Sensitive Decision Support Systems.
Degree: MS, Computer Science, 2015, University of Houston
URL: http://hdl.handle.net/10657/1739
► The University of Houston has various monitoring systems that feed information to Emergency Operations Centers for emergency decisions. Emergency decisions must be made utilizing the…
(more)
▼ The
University of
Houston has various monitoring systems that feed information to Emergency Operations Centers for emergency decisions. Emergency decisions must be made utilizing the information available to Emergency Operations Center which is received from different sensors feeding the information. The information systems in the
University are disparate and do not communicate with each other. These enterprise systems are independent with no integrated view. Most of the systems operate on and store the same information about the campus and people while using various models appropriate to operational needs. As the monitoring systems are not integrated with each other, it becomes difficult to estimate the level of emergency by considering the incidents identified by the individual systems.
In this Thesis, we realized a data model design to enable an aggregation framework in time-sensitive decision support systems. We propose a framework for aggregating the data available through the information sources towards achieving an integrated view. The standard used for integrating the various systems is IF-MAP (Interface for Metadata Access Point) Standard. Using the Publish – Subscribe communication paradigm and aggregating the data based on time window and location, disparate data sources can be integrated and effective communication between the systems can be achieved, which helps in making the emergency decisions. The decision can now be based on effective utilization of all the systems involved in the particular incident. Aggregation has been performed on various sources of information like Police Dispatch system, card access system, video feeds and general facilities system at
University of
Houston.
Advisors/Committee Members: Subhlok, Jaspal (advisor), Subhlok, Jaspal (committee member), Gurkan, Deniz (committee member), Chapman, Barbara M. (committee member).
Subjects/Keywords: Data Integration; Data Aggregation
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):
Kundooru, S. S. R. 1. (2015). Generalized Framework for Time-Sensitive Decision Support Systems. (Masters Thesis). University of Houston. Retrieved from http://hdl.handle.net/10657/1739
Chicago Manual of Style (16th Edition):
Kundooru, Shyam Sunder Reddy 1991-. “Generalized Framework for Time-Sensitive Decision Support Systems.” 2015. Masters Thesis, University of Houston. Accessed January 24, 2021.
http://hdl.handle.net/10657/1739.
MLA Handbook (7th Edition):
Kundooru, Shyam Sunder Reddy 1991-. “Generalized Framework for Time-Sensitive Decision Support Systems.” 2015. Web. 24 Jan 2021.
Vancouver:
Kundooru SSR1. Generalized Framework for Time-Sensitive Decision Support Systems. [Internet] [Masters thesis]. University of Houston; 2015. [cited 2021 Jan 24].
Available from: http://hdl.handle.net/10657/1739.
Council of Science Editors:
Kundooru SSR1. Generalized Framework for Time-Sensitive Decision Support Systems. [Masters Thesis]. University of Houston; 2015. Available from: http://hdl.handle.net/10657/1739
10.
-5315-9037.
Novel Infrastructure Quantification for Utility of Virtualized Network Debugging using OpenFlow as Visualization of Packets and Software Defined Networking.
Degree: MSin Electrical Engineering, Electrical Engineering, 2015, University of Houston
URL: http://hdl.handle.net/10657/1749
► Network debugging is time and resource consuming due to limited access and monitoring mechanisms. Such mechanisms may involve polling and/or active notification methods, where a…
(more)
▼ Network debugging is time and resource consuming due to limited access and monitoring mechanisms. Such mechanisms may involve polling and/or active notification methods, where a failed network device may obscure the flow of poll responses in the network. We developed a network debugging mechanism facilitating the virtualization of a monitoring system through implementation of an extension to Wireshark, while leveraging the software-defined network principles of control and data plane separation. We provide translation mechanism though wireshark entries for filtering and zooming into flows of interest on specific ports with a global view of the network using OpenFlow protocol as the filtering switch for span traffic. Furthermore, we also created a utility of deployment function for a network debugging scheme to evaluate the usability of locations and numbers of flow-separation based analysis nodes. We applied our evaluation method on a typical enterprise network such as
University of
Houston. Our utility function can provide a usability and effectiveness metric for such debugging features around the network to better realize visualization of most relevant traffic.
Advisors/Committee Members: Han, Zhu (advisor), Gurkan, Deniz (committee member), Wolfe, John C. (committee member).
Subjects/Keywords: Software Defined Networks (SDN); OpenFlow; Network Troubleshooting; Programmable Networks; Utility
…Preliminary Data Sources: Traffic Statistics from University of Houston 23
4 Implementation… …access switches,
departments, and buildings at the University of Houston production network… …Achieved at 73%. 36
Figure 5.5 University of Houston CORE / BGP Router Weathermap (Source… …University of Houston, it becomes
increasingly difficult to handle monitoring of specific flows of… …respect, while University of Houston is building an SDN overlay, network troubleshooting…
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):
-5315-9037. (2015). Novel Infrastructure Quantification for Utility of Virtualized Network Debugging using OpenFlow as Visualization of Packets and Software Defined Networking. (Masters Thesis). University of Houston. Retrieved from http://hdl.handle.net/10657/1749
Note: this citation may be lacking information needed for this citation format:
Author name may be incomplete
Chicago Manual of Style (16th Edition):
-5315-9037. “Novel Infrastructure Quantification for Utility of Virtualized Network Debugging using OpenFlow as Visualization of Packets and Software Defined Networking.” 2015. Masters Thesis, University of Houston. Accessed January 24, 2021.
http://hdl.handle.net/10657/1749.
Note: this citation may be lacking information needed for this citation format:
Author name may be incomplete
MLA Handbook (7th Edition):
-5315-9037. “Novel Infrastructure Quantification for Utility of Virtualized Network Debugging using OpenFlow as Visualization of Packets and Software Defined Networking.” 2015. Web. 24 Jan 2021.
Note: this citation may be lacking information needed for this citation format:
Author name may be incomplete
Vancouver:
-5315-9037. Novel Infrastructure Quantification for Utility of Virtualized Network Debugging using OpenFlow as Visualization of Packets and Software Defined Networking. [Internet] [Masters thesis]. University of Houston; 2015. [cited 2021 Jan 24].
Available from: http://hdl.handle.net/10657/1749.
Note: this citation may be lacking information needed for this citation format:
Author name may be incomplete
Council of Science Editors:
-5315-9037. Novel Infrastructure Quantification for Utility of Virtualized Network Debugging using OpenFlow as Visualization of Packets and Software Defined Networking. [Masters Thesis]. University of Houston; 2015. Available from: http://hdl.handle.net/10657/1749
Note: this citation may be lacking information needed for this citation format:
Author name may be incomplete
11.
Bastarrika, Ainhoa.
UNSUPERVISED CLUSTERING OF SCHIZOPHRENIA PATIENTS, COCAINE USERS, AND NORMAL CONTROLS BASED ON AUDITORY EVOKED POTENTIALS.
Degree: MS, Engineering Technology, 2012, University of Houston
URL: http://hdl.handle.net/10657/457
► Objective: In this Master Thesis, we employed auditory evoked responses to identify features from the time domain signals, Granger Causality matrixes and graph theory that…
(more)
▼ Objective: In this Master Thesis, we employed auditory evoked responses to identify
features from the time domain signals, Granger Causality matrixes and graph
theory that provide maximum separation among schizophrenic patients, cocaine addicts
and normal controls.
Methods: We analyzed data from 12 schizophrenia, 12 cocaine addicts and 12
normal control subjects. Responses were obtained in a paired-stimulus paradigm, in
which auditory stimulus S1 is followed by an identical S2. Amplitude and latency
of the N100 component were measured from the averaged evoked potential, Granger
Causality matrixes were computed and a graph was constructed from there. Amplitude,
latency, Granger Causality values and a group of characteristics form the graph
were used as features to cluster responses in three groups. Several methods were used
for clustering, while their performance was quantified in a 10-fold cross validation
approach.
Results: We found that the most important features come from Granger Causality
matrix values, amplitude and latency coming from the average evoked responses appear
as insignificant features for the clustering. Influence of electrode C3 to Pz appear
as the most significant feature, separating schizophrenic patients from normal controls
and cocaine addicts with a 100% accuracy. In order to separate cocaine addicts
from normal controls at least 31 features coming from Granger Causality matrixes
were needed.
Conclusions: Our results demonstrate that Granger Causality values can accurately
separate schizophrenia patients, cocaine addicts and normal controls and suggest
that the Pz-C3 region plays a significant role in information processing in human
brain.
i
Significance: The proposed technique may have a significant impact as a clinical
tool in the quest for identifying physiological markers of schizophrenia.
ii
Advisors/Committee Members: Zouridakis, George (advisor), Gurkan, Deniz (committee member), Yuan, Xiaojing (committee member).
Subjects/Keywords: AEP; Schizophrenia; Cocaine; Granger causality; Clustering; Schizophrenia
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):
Bastarrika, A. (2012). UNSUPERVISED CLUSTERING OF SCHIZOPHRENIA PATIENTS, COCAINE USERS, AND NORMAL CONTROLS BASED ON AUDITORY EVOKED POTENTIALS. (Masters Thesis). University of Houston. Retrieved from http://hdl.handle.net/10657/457
Chicago Manual of Style (16th Edition):
Bastarrika, Ainhoa. “UNSUPERVISED CLUSTERING OF SCHIZOPHRENIA PATIENTS, COCAINE USERS, AND NORMAL CONTROLS BASED ON AUDITORY EVOKED POTENTIALS.” 2012. Masters Thesis, University of Houston. Accessed January 24, 2021.
http://hdl.handle.net/10657/457.
MLA Handbook (7th Edition):
Bastarrika, Ainhoa. “UNSUPERVISED CLUSTERING OF SCHIZOPHRENIA PATIENTS, COCAINE USERS, AND NORMAL CONTROLS BASED ON AUDITORY EVOKED POTENTIALS.” 2012. Web. 24 Jan 2021.
Vancouver:
Bastarrika A. UNSUPERVISED CLUSTERING OF SCHIZOPHRENIA PATIENTS, COCAINE USERS, AND NORMAL CONTROLS BASED ON AUDITORY EVOKED POTENTIALS. [Internet] [Masters thesis]. University of Houston; 2012. [cited 2021 Jan 24].
Available from: http://hdl.handle.net/10657/457.
Council of Science Editors:
Bastarrika A. UNSUPERVISED CLUSTERING OF SCHIZOPHRENIA PATIENTS, COCAINE USERS, AND NORMAL CONTROLS BASED ON AUDITORY EVOKED POTENTIALS. [Masters Thesis]. University of Houston; 2012. Available from: http://hdl.handle.net/10657/457
12.
Narisetty, Raja Revanth 1988-.
How long does it take to offload traffic from firewall?.
Degree: MS, Engineering Technology, 2013, University of Houston
URL: http://hdl.handle.net/10657/574
► Demonstration of how intelligent steering of classified application traffic with flows in OpenFlow protocol can alleviate firewall bottleneck issues. Irrespective of the available higher bandwidth…
(more)
▼ Demonstration of how intelligent steering of classified application traffic with flows in OpenFlow protocol can alleviate firewall bottleneck issues. Irrespective of the available higher bandwidth capabilities of the network, traffic passing through a firewall, where every packet is statefully inspected and/or deep packet inespected (DPI), causes bottlenecks. Isolation of the classified application traffic from all other traffic by means of VLANs and MPLS has been proposed, and is being implemented. Our demonstration leverages the SDN paradigm and flow isolation is achieved by programming the forwarding plane in conjunction with a dynamic utilization of a firewall’s application-aware DPI capabilities and other analytics. In this respect, as soon as classified application traffic session has been positively identified by the firewall, a flow rule can be written to offload the remainder of the data transfer from the firewall to a fast path on the switch. All sessions are inspected by the firewall, but not all packets of every session need to pass through the firewall. Thus the security is preserved and the throughput constraint is removed.
The demonstration utilizes a virtual distributed firewall product from vARMOUR Networks, Inc. to deliver software defined security, SDSec. Once an application is identified for a new session (occurs within a small number of packets, usually less than 10), and the session is to be permitted, the remainder of the session’s packets are steered to a fast path on an OpenFlow switch using as a flow definition that exists for the duration of the session. We present the research investigations on the trade-offs for such a fast path mechanism through the network, considering processing delays introduced by the mechanism. Namely, an optimal session length should be determined for such a fast path mechanism to be worthwhile in a campus network. The main delay components to be measured and presented include: a flow setup requires a controller to push flows respective to programmable, the flow redirection takes time as such a flow should be activated at the programmable switch, and the network delay associated with the setup process.
‘What Is The Ideal Length Of Session To Benefit From The Intelligent Application Steering Based Dpi Offload Solution?’
For the application traffic to benefit from this intelligent offload of deep packet inspection solution, determining the ideal length of the session on the firewall is the objective of this work. In other words, we determine ‘How Long Does It Take to Offload Traffic from the Firewall?’ which is the ideal length of the session on the firewall for this intelligent offload solution.
Advisors/Committee Members: Gurkan, Deniz (advisor), Shireen, Wajiha (committee member), Merchant, Fatima Aziz (committee member).
Subjects/Keywords: Firewall bottlenecks; Deep Packet Inspection; Application Steering; Flow Setup Time; Computer 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):
Narisetty, R. R. 1. (2013). How long does it take to offload traffic from firewall?. (Masters Thesis). University of Houston. Retrieved from http://hdl.handle.net/10657/574
Chicago Manual of Style (16th Edition):
Narisetty, Raja Revanth 1988-. “How long does it take to offload traffic from firewall?.” 2013. Masters Thesis, University of Houston. Accessed January 24, 2021.
http://hdl.handle.net/10657/574.
MLA Handbook (7th Edition):
Narisetty, Raja Revanth 1988-. “How long does it take to offload traffic from firewall?.” 2013. Web. 24 Jan 2021.
Vancouver:
Narisetty RR1. How long does it take to offload traffic from firewall?. [Internet] [Masters thesis]. University of Houston; 2013. [cited 2021 Jan 24].
Available from: http://hdl.handle.net/10657/574.
Council of Science Editors:
Narisetty RR1. How long does it take to offload traffic from firewall?. [Masters Thesis]. University of Houston; 2013. Available from: http://hdl.handle.net/10657/574
13.
Cheng, Wei.
Incremental Conductance Algorithm for Maximum Wind Power Extraction Using Permanent Magnet Synchronous Generator.
Degree: MS, Engineering Technology, 2013, University of Houston
URL: http://hdl.handle.net/10657/417
► Wind energy is by far the fastest growing renewable energy due to its free availability and environmental benefits. Maximum power extraction is a way to…
(more)
▼ Wind energy is by far the fastest growing renewable energy due to its free availability and environmental benefits. Maximum power extraction is a way to realize high power efficiency for Wind Energy Conversion System (WECS). This thesis focuses on studying the feasibility of implementing the Incremental Conductance (INC) method that has been used till now for Maximum Power Point Tracking in photovoltaic (PV) systems. Direct Driven Permanent Magnet Synchronous Generator (PMSG) which has no gearbox is utilized in the proposed system to reduce the cost and increase the reliability of the wind turbine. A certain power conditioning topology which includes an Intermediate Boost Converter (IBC) is employed to facilitate the use of this control method. INC method is compared with the traditional Hill Climbing Search (HCS) method and the advantages of using the INC method in some operation conditions, is validated. A Matlab Simulink model is built to verify this approach.
Advisors/Committee Members: Shireen, Wajiha (advisor), Gurkan, Deniz (committee member), Provence, Robert S. (committee member).
Subjects/Keywords: Maximum Wind Power Extraction; PMSG; Wind Energy Conversion System
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):
Cheng, W. (2013). Incremental Conductance Algorithm for Maximum Wind Power Extraction Using Permanent Magnet Synchronous Generator. (Masters Thesis). University of Houston. Retrieved from http://hdl.handle.net/10657/417
Chicago Manual of Style (16th Edition):
Cheng, Wei. “Incremental Conductance Algorithm for Maximum Wind Power Extraction Using Permanent Magnet Synchronous Generator.” 2013. Masters Thesis, University of Houston. Accessed January 24, 2021.
http://hdl.handle.net/10657/417.
MLA Handbook (7th Edition):
Cheng, Wei. “Incremental Conductance Algorithm for Maximum Wind Power Extraction Using Permanent Magnet Synchronous Generator.” 2013. Web. 24 Jan 2021.
Vancouver:
Cheng W. Incremental Conductance Algorithm for Maximum Wind Power Extraction Using Permanent Magnet Synchronous Generator. [Internet] [Masters thesis]. University of Houston; 2013. [cited 2021 Jan 24].
Available from: http://hdl.handle.net/10657/417.
Council of Science Editors:
Cheng W. Incremental Conductance Algorithm for Maximum Wind Power Extraction Using Permanent Magnet Synchronous Generator. [Masters Thesis]. University of Houston; 2013. Available from: http://hdl.handle.net/10657/417
14.
Mala, Praveen 1987-.
APPLICATION DEVELOPMENT FOR THE NETWORK NODES OF SOFTWARE-DEFINED NETWORKS.
Degree: MS, Computer Science, 2012, University of Houston
URL: http://hdl.handle.net/10657/566
► Open Flow is a protocol that enables software-defined networking towards scalable, and programmable network architectures. In classical switches the control plane and the data plane…
(more)
▼ Open Flow is a protocol that enables software-defined networking towards scalable, and programmable network architectures. In classical switches the control
plane and the data plane are built into the operating system and the implementation
is vendor specific with no opportunity for programmability. Open Flow protocol enables the separation of the control plane from the switch and moves it to a centralserver called controller where all the routing decisions are made. The controller is
a programmable unit with a centralized visibility of the network. This architecture
opens new opportunities for application development on the controller according to
the user needs such as security and quality of service (QoS).One bottleneck observed
in this approach is the communication between the switch and the controller due to
slow processing central processing units (CPUs) of the switch. The other problem is
the rigidity observed in the TCAMs (ternary content addressable memory elements)due to ASIC (application-specic integrated circuit) limitations which cannot perform flexible match functions such as Layer5 and Layer7 match. A split data plane
(SDP) architecture has been proposed to address this problem by introducing programmable data plane. A multicore network processing unit (NPU) is housed in the same switch platform together with traditional TCAM-matching section. SDP unit can support flexible match functions and programming. By introducing the programming at the switch level we are opening the network nodes for building applications which will change the way network programming has been realized. The
focus of the thesis is the development of applications on SDP towards more
and higher performance networks.
Advisors/Committee Members: Subhlok, Jaspal (advisor), Johnsson, Lennart (committee member), Gurkan, Deniz (committee member).
Subjects/Keywords: SDN; OpenFlow; Computer science
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):
Mala, P. 1. (2012). APPLICATION DEVELOPMENT FOR THE NETWORK NODES OF SOFTWARE-DEFINED NETWORKS. (Masters Thesis). University of Houston. Retrieved from http://hdl.handle.net/10657/566
Chicago Manual of Style (16th Edition):
Mala, Praveen 1987-. “APPLICATION DEVELOPMENT FOR THE NETWORK NODES OF SOFTWARE-DEFINED NETWORKS.” 2012. Masters Thesis, University of Houston. Accessed January 24, 2021.
http://hdl.handle.net/10657/566.
MLA Handbook (7th Edition):
Mala, Praveen 1987-. “APPLICATION DEVELOPMENT FOR THE NETWORK NODES OF SOFTWARE-DEFINED NETWORKS.” 2012. Web. 24 Jan 2021.
Vancouver:
Mala P1. APPLICATION DEVELOPMENT FOR THE NETWORK NODES OF SOFTWARE-DEFINED NETWORKS. [Internet] [Masters thesis]. University of Houston; 2012. [cited 2021 Jan 24].
Available from: http://hdl.handle.net/10657/566.
Council of Science Editors:
Mala P1. APPLICATION DEVELOPMENT FOR THE NETWORK NODES OF SOFTWARE-DEFINED NETWORKS. [Masters Thesis]. University of Houston; 2012. Available from: http://hdl.handle.net/10657/566
15.
Velusamy, Gandhimathi.
OpenFlow-based Distributed and Fault-Tolerant Software Switch Architecture.
Degree: MS, Engineering Technology, 2014, University of Houston
URL: http://hdl.handle.net/10657/693
► We are living in the era where each of us is connected with each other virtually across the globe. We are sharing the information electronically…
(more)
▼ We are living in the era where each of us is connected with each other virtually across the globe. We are sharing the information electronically over the internet every second of our day. There are many networking devices involved in sending the information over the internet. They are routers, gateways, switches, PCs, laptops, handheld devices, etc. The switches are very crucial elements in delivering packets to the intended recipients. Now the networking field is moving towards Software Defined Networking and the network elements are being slowly replaced by the software applications run by OpenFlow protocols. For example the switching functionality in local area networks could be achieved with software switches like OpenvSwitch (OVS), LINC-Switch, etc. Now a days the organizations depend on the datacenters to run their services. The application servers are being run from virtual machines on the hosts to better utilize the computing resources and make the system more scalable. The application servers need to be continuously available to run the business for which they are deployed for. Software switches are used to connect virtual machines as an alternative to Top of Rack switches. If such software switch fails then the application servers will not be able to connect to its clients. This may severely impact the business serviced by the application servers, deployed on the virtual machines. For reliable data connectivity, the switching elements need to be continuously functional. There is a need for reliable and robust switches to cater the today's networking infrastructure. In this study, the software switch LINC-Switch is implemented as distributed application on multiple nodes to make it resilient to failure. The fault-tolerance is achieved by using the distribution properties of the programming language Erlang. By implementing the switch on three redundant nodes and starting the application as a distributed application, the switch will be serving its purpose very promptly by restarting it on other node in case it fails on the current node by using failover/takeover mechanisms of Erlang. The tolerance to failure of the LINC-Switch is verified with Ping based experiment on the GENI test bed and on the Xen-cluster in our Lab.
Advisors/Committee Members: Gurkan, Deniz (advisor), Merchant, Fatima Aziz (committee member), Lent, Ricardo (committee member).
Subjects/Keywords: OpenFlow; Distributed; Fault-Tolerant; Software switch; Failover; Takeover; Computer 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):
Velusamy, G. (2014). OpenFlow-based Distributed and Fault-Tolerant Software Switch Architecture. (Masters Thesis). University of Houston. Retrieved from http://hdl.handle.net/10657/693
Chicago Manual of Style (16th Edition):
Velusamy, Gandhimathi. “OpenFlow-based Distributed and Fault-Tolerant Software Switch Architecture.” 2014. Masters Thesis, University of Houston. Accessed January 24, 2021.
http://hdl.handle.net/10657/693.
MLA Handbook (7th Edition):
Velusamy, Gandhimathi. “OpenFlow-based Distributed and Fault-Tolerant Software Switch Architecture.” 2014. Web. 24 Jan 2021.
Vancouver:
Velusamy G. OpenFlow-based Distributed and Fault-Tolerant Software Switch Architecture. [Internet] [Masters thesis]. University of Houston; 2014. [cited 2021 Jan 24].
Available from: http://hdl.handle.net/10657/693.
Council of Science Editors:
Velusamy G. OpenFlow-based Distributed and Fault-Tolerant Software Switch Architecture. [Masters Thesis]. University of Houston; 2014. Available from: http://hdl.handle.net/10657/693
University of Houston
16.
-0470-5457.
Creation of Flexible Data Structure for an Emerging Network Control Protocol.
Degree: MS, Engineering Technology, University of Houston
URL: http://hdl.handle.net/10657/3635
► Due to increasing number of versions of OpenFlow protocol, it is getting harder day by day to use isolated data structure support of OpenFlow protocol.…
(more)
▼ Due to increasing number of versions of OpenFlow protocol, it is getting harder day by day to use isolated data structure support of OpenFlow protocol. There is high degree of variability between each versions of OpenFlow protocol. Each version of OpenFlow specifies an interface and the collection of abstractions present in a switch that can be manipulated. So our focus of this thesis is to use the data structure (Avro) which supports OpenFlow protocol through software infrastructure proposed by Warp development group. Using this we have developed the OpenFlow version 1.2 support to Warp controller. Warp architecture uses Avro data structure which has advantages like easy integration of new version, update existing version and apply run time changes, version control, data exchange and easy schema processing which heavily impact on performance and flexibility of OpenFlow controller. These mentioned factors are compared against other OpenFlow controller architectures such as Floodlight, Ryu etc. Comparing obtained observations with different architectures conclude that Warp is more flexible architecture as compared to Floodlight and Ryu.
Advisors/Committee Members: Gurkan, Deniz (advisor), Lent, Ricardo (committee member), Moges, Mequanint A. (committee member).
Subjects/Keywords: OpenFlow; Warp; Data structures; Avro
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):
-0470-5457. (n.d.). Creation of Flexible Data Structure for an Emerging Network Control Protocol. (Masters Thesis). University of Houston. Retrieved from http://hdl.handle.net/10657/3635
Note: this citation may be lacking information needed for this citation format:
Author name may be incomplete
No year of publication.
Chicago Manual of Style (16th Edition):
-0470-5457. “Creation of Flexible Data Structure for an Emerging Network Control Protocol.” Masters Thesis, University of Houston. Accessed January 24, 2021.
http://hdl.handle.net/10657/3635.
Note: this citation may be lacking information needed for this citation format:
Author name may be incomplete
No year of publication.
MLA Handbook (7th Edition):
-0470-5457. “Creation of Flexible Data Structure for an Emerging Network Control Protocol.” Web. 24 Jan 2021.
Note: this citation may be lacking information needed for this citation format:
Author name may be incomplete
No year of publication.
Vancouver:
-0470-5457. Creation of Flexible Data Structure for an Emerging Network Control Protocol. [Internet] [Masters thesis]. University of Houston; [cited 2021 Jan 24].
Available from: http://hdl.handle.net/10657/3635.
Note: this citation may be lacking information needed for this citation format:
Author name may be incomplete
No year of publication.
Council of Science Editors:
-0470-5457. Creation of Flexible Data Structure for an Emerging Network Control Protocol. [Masters Thesis]. University of Houston; Available from: http://hdl.handle.net/10657/3635
Note: this citation may be lacking information needed for this citation format:
Author name may be incomplete
No year of publication.
University of Houston
17.
Zhu, Suyang 1988-.
A Task-based Programming Methodology Using MCA Standards for Multicore Systems.
Degree: MS, Computer Science, University of Houston
URL: http://hdl.handle.net/10657/2118
► Current trends in embedded platform design indicate that heterogeneous systems are here to stay. Thus, processors configured on the same platform may have different instruction-set…
(more)
▼ Current trends in embedded platform design indicate that heterogeneous systems are here to stay. Thus, processors configured on the same platform may have different instruction-set architectures, different operating systems, and discrete memory space. These features increase the adaptability of the platforms for different applications. However, the development of such applications becomes difficult due to the system’s heterogeneity. Task parallelism is a classic approach to schedule work in parallel at the application level for symmetric or even asymmetric multicore processors (that may be heterogeneous in nature). A robust and efficient task-programming model to tackle parallelism for heterogeneous embedded systems is needed.
In this thesis, we present a task-based programming model that deploys the Multicore Association’s (MCA) Task Management API, a robust, cross-platform and efficient API that targets both homogeneous and heterogeneous multicore systems. MTAPI provides an API to develop applications with task parallelism on multicore systems in a straightforward manner. The API supports different processor architectures and can be implemented on top of multiple operating systems or even bare metal. MTAPI can also work as a translation layer for higher-level programming models.
We follow the MTAPI specification and design and implement an MTAPI Runtime Library (RTL). Our evaluation platforms are a multicore x86-64 computing node and an NVIDIA Jetson TK1 board with a CPU and a GPU on the same chip. We evaluate our MTAPI RTL implementation using applications from Rodinia and BOTS. We compare our MTAPI implementation with the Siemens MTAPI and with GCC-OpenMP, and observe that our MTAPI outperforms Siemens MTAPI significantly on the embedded board and competes favorably with GCC-OpenMP on both testbeds.
Advisors/Committee Members: Chapman, Barbara M. (advisor), Chen, Guoning (committee member), Gurkan, Deniz (committee member).
Subjects/Keywords: MTAPI; Heterogeneity; Embedded systems
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):
Zhu, S. 1. (n.d.). A Task-based Programming Methodology Using MCA Standards for Multicore Systems. (Masters Thesis). University of Houston. Retrieved from http://hdl.handle.net/10657/2118
Note: this citation may be lacking information needed for this citation format:
No year of publication.
Chicago Manual of Style (16th Edition):
Zhu, Suyang 1988-. “A Task-based Programming Methodology Using MCA Standards for Multicore Systems.” Masters Thesis, University of Houston. Accessed January 24, 2021.
http://hdl.handle.net/10657/2118.
Note: this citation may be lacking information needed for this citation format:
No year of publication.
MLA Handbook (7th Edition):
Zhu, Suyang 1988-. “A Task-based Programming Methodology Using MCA Standards for Multicore Systems.” Web. 24 Jan 2021.
Note: this citation may be lacking information needed for this citation format:
No year of publication.
Vancouver:
Zhu S1. A Task-based Programming Methodology Using MCA Standards for Multicore Systems. [Internet] [Masters thesis]. University of Houston; [cited 2021 Jan 24].
Available from: http://hdl.handle.net/10657/2118.
Note: this citation may be lacking information needed for this citation format:
No year of publication.
Council of Science Editors:
Zhu S1. A Task-based Programming Methodology Using MCA Standards for Multicore Systems. [Masters Thesis]. University of Houston; Available from: http://hdl.handle.net/10657/2118
Note: this citation may be lacking information needed for this citation format:
No year of publication.
University of Houston
18.
Dalibalta, Dina.
SNMP MIB for OpenFlow-Capable Switch.
Degree: MS, Engineering Technology, University of Houston
URL: http://hdl.handle.net/10657/2641
► Network Management Systems (NMSs) rely heavily on Simple Network Management Protocol (SNMP) for exchanging information between managed devices. In this thesis, we thought of introducing…
(more)
▼ Network Management Systems (NMSs) rely heavily on Simple Network Management Protocol (SNMP) for exchanging information between managed devices. In this thesis, we thought of introducing SNMP to Software Defined Network (SDN); the new promising paradigm in the world of networking.
While MIBs (Management Information Bases) are central to SNMP functionality, we focused on investigating and designing effective MIBs for SDN managed entities such as switches and routers. In the designing stages, we emphasized our analysis and investigation on the requirements and specifications of the standard configuration and management protocol (OF-CONFIG) of all SDN operational contexts and its companion OpenFlow protocol. The outcome of our design is a data model of OF-CONFIG MIB mapped to SNMP. This data model is considered as a specific framework of SDN switch MIBs. Therefore, this thesis briefly explains a road map of MIB development in an SDN environment. As a result, the information in this thesis can be used as a guide for further design extensions, testing and implementation of SDN effective MIBs.
Advisors/Committee Members: Gurkan, Deniz (advisor), Merchant, Fatima Aziz (committee member), Lent, Ricardo (committee member).
Subjects/Keywords: SDN; OpenFlow; OF-CONGIF; OF-Capable Switch; SNMP; MIB
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):
Dalibalta, D. (n.d.). SNMP MIB for OpenFlow-Capable Switch. (Masters Thesis). University of Houston. Retrieved from http://hdl.handle.net/10657/2641
Note: this citation may be lacking information needed for this citation format:
No year of publication.
Chicago Manual of Style (16th Edition):
Dalibalta, Dina. “SNMP MIB for OpenFlow-Capable Switch.” Masters Thesis, University of Houston. Accessed January 24, 2021.
http://hdl.handle.net/10657/2641.
Note: this citation may be lacking information needed for this citation format:
No year of publication.
MLA Handbook (7th Edition):
Dalibalta, Dina. “SNMP MIB for OpenFlow-Capable Switch.” Web. 24 Jan 2021.
Note: this citation may be lacking information needed for this citation format:
No year of publication.
Vancouver:
Dalibalta D. SNMP MIB for OpenFlow-Capable Switch. [Internet] [Masters thesis]. University of Houston; [cited 2021 Jan 24].
Available from: http://hdl.handle.net/10657/2641.
Note: this citation may be lacking information needed for this citation format:
No year of publication.
Council of Science Editors:
Dalibalta D. SNMP MIB for OpenFlow-Capable Switch. [Masters Thesis]. University of Houston; Available from: http://hdl.handle.net/10657/2641
Note: this citation may be lacking information needed for this citation format:
No year of publication.
. 
Open Access Theses and Dissertations
