You searched for +publisher:"Texas A&M University" +contributor:("Bettati, Riccardo").
Showing records 1 – 30 of
108 total matches.
◁ [1] [2] [3] [4] ▶
Texas A&M University
1.
Dunn, Marcus P.
A New I/O Scheduler for Solid State Devices.
Degree: 2010, Texas A&M University
URL: http://hdl.handle.net/1969.1/ETD-TAMU-2009-08-896 
► Since the emergence of solid state devices onto the storage scene, improvements in capacity and price have brought them to the point where they are…
(more)
▼ Since the emergence of solid state devices onto the storage scene, improvements in capacity and price have brought them to the point where they are becoming a viable alternative to traditional magnetic storage for some applications. Current file system and device level I/O scheduler design is optimized for rotational magnetic hard disk drives. Since solid state devices have drastically different properties and structure, we may need to rethink the design of some aspects of the file system and scheduler levels of the I/O subsystem. In this thesis, we consider the current approach to I/O scheduling and show that the current scheduler design may not be ideally suited to solid state devices. We also present a framework for extracting some device parameters of solid state drives. Using the information from the parameter extraction, we present a new I/O scheduler design which utilizes the structure of solid state devices to efficiently schedule writes. The new scheduler, implemented on a 2.6 Linux kernel, shows up to 25% improvement for common workloads.
Advisors/Committee Members: Annapareddy, Narasimha (advisor), Bettati, Riccardo (committee member), Khatri, Sunil (committee member).
Subjects/Keywords: I/O Schedulers; Solid State Devices; Storage; 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):
Dunn, M. P. (2010). A New I/O Scheduler for Solid State Devices. (Thesis). Texas A&M University. Retrieved from http://hdl.handle.net/1969.1/ETD-TAMU-2009-08-896
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
Chicago Manual of Style (16th Edition):
Dunn, Marcus P. “A New I/O Scheduler for Solid State Devices.” 2010. Thesis, Texas A&M University. Accessed March 29, 2020.
http://hdl.handle.net/1969.1/ETD-TAMU-2009-08-896.
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
MLA Handbook (7th Edition):
Dunn, Marcus P. “A New I/O Scheduler for Solid State Devices.” 2010. Web. 29 Mar 2020.
Vancouver:
Dunn MP. A New I/O Scheduler for Solid State Devices. [Internet] [Thesis]. Texas A&M University; 2010. [cited 2020 Mar 29].
Available from: http://hdl.handle.net/1969.1/ETD-TAMU-2009-08-896.
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
Council of Science Editors:
Dunn MP. A New I/O Scheduler for Solid State Devices. [Thesis]. Texas A&M University; 2010. Available from: http://hdl.handle.net/1969.1/ETD-TAMU-2009-08-896
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
Texas A&M University
2.
Mohanty, Saswat.
Using Secure Real-time Padding Protocol to Secure Voice-over-IP from Traffic Analysis Attacks.
Degree: 2012, Texas A&M University
URL: http://hdl.handle.net/1969.1/ETD-TAMU-2011-05-9116
► Voice Over IP (VoIP) systems and transmission technologies have now become the norm for many communications applications. However, whether they are used for personal communication…
(more)
▼ Voice Over IP (VoIP) systems and transmission technologies have now become the norm for many communications applications. However, whether they are used for personal communication or priority business conferences and talks, privacy and confidentiality of the communication is of utmost priority. The present industry standard is to encrypt VoIP calls using Secure Real-time Transport Protocol (SRTP), aided by ZRTP, but this methodology remains vulnerable to traffic analysis attacks, some of which utilize the length of the encrypted packets to infer the language and spoken phrases of the conversation.
Secure Real-time Padding Protocol (SRPP) is a new RTP profile which pads all VoIP sessions in a unique way to thwart traffic analysis attacks on encrypted calls. It pads every RTP or SRTP packet to a predefined packet size, adds dummy packets at the end of every burst in a controllable way, adds dummy bursts to hide silence spurts, and hides information about the packet inter-arrival timings. This thesis discusses a few practical approaches and a theoretical optimization approach to packet size padding. SRPP has been implemented in the form of a library, libSRPP, for VoIP application developers and as an application, SQRKal, for regular users. SQRKal also serves as an extensive platform for implementation and verification of new packet padding techniques.
Advisors/Committee Members: Bettati, Riccardo (advisor), Loguinov, Dmitri (committee member), Annapareddy, Narasimha (committee member).
Subjects/Keywords: Traffic Analysis; Padding; SRPP; VoIP; Security; Privacy and Anonymity
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):
Mohanty, S. (2012). Using Secure Real-time Padding Protocol to Secure Voice-over-IP from Traffic Analysis Attacks. (Thesis). Texas A&M University. Retrieved from http://hdl.handle.net/1969.1/ETD-TAMU-2011-05-9116
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
Chicago Manual of Style (16th Edition):
Mohanty, Saswat. “Using Secure Real-time Padding Protocol to Secure Voice-over-IP from Traffic Analysis Attacks.” 2012. Thesis, Texas A&M University. Accessed March 29, 2020.
http://hdl.handle.net/1969.1/ETD-TAMU-2011-05-9116.
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
MLA Handbook (7th Edition):
Mohanty, Saswat. “Using Secure Real-time Padding Protocol to Secure Voice-over-IP from Traffic Analysis Attacks.” 2012. Web. 29 Mar 2020.
Vancouver:
Mohanty S. Using Secure Real-time Padding Protocol to Secure Voice-over-IP from Traffic Analysis Attacks. [Internet] [Thesis]. Texas A&M University; 2012. [cited 2020 Mar 29].
Available from: http://hdl.handle.net/1969.1/ETD-TAMU-2011-05-9116.
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
Council of Science Editors:
Mohanty S. Using Secure Real-time Padding Protocol to Secure Voice-over-IP from Traffic Analysis Attacks. [Thesis]. Texas A&M University; 2012. Available from: http://hdl.handle.net/1969.1/ETD-TAMU-2011-05-9116
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
Texas A&M University
3.
Kotla, Kiran.
Adapting a delay-based protocol to heterogeneous environments.
Degree: 2008, Texas A&M University
URL: http://hdl.handle.net/1969.1/86000
► We investigate the issues in making a delay-based protocol adaptive to heterogeneous environments. We assess and address the problems a delay-based protocol faces when competing…
(more)
▼ We investigate the issues in making a delay-based protocol adaptive to heterogeneous
environments. We assess and address the problems a delay-based protocol
faces when competing with a loss-based protocol such as TCP. We investigate if noise
and variability in delay measurements in environments such as cable and ADSL access
networks impact the delay-based protocol behavior significantly. We investigate these
issues in the context of incremental deployment of a new delay-based protocol, PERT.
We propose design modifications to PERT to compete with the TCP flavor SACK.
We show through simulations and real network experiments that, with the proposed
changes, PERT experiences lower drop rates than SACK and leads to lower overall
drop rates with different mixes of PERT and SACK protocols. Delay-based protocols,
being less aggressive, have problems in fully utilizing a highspeed link while operating
alone. We show that a single PERT flow can fully utilize a high-speed, high-delay link.
We performed several experiments with diverse parameters and simulated numerous
scenarios using ns-2. The results from simulations indicate that PERT can adapt
to heterogeneous networks and can operate well in an environment of heterogeneous
protocols and other miscellaneous scenarios like wireless networks (in the presence of channel errors). We also show that proposed changes retain the desirable properties
of PERT such as low loss rates and fairness when operating alone.
To see how the protocol performs with the real-world traffic, the protocol has
also been implemented in the Linux kernel and tested through experiments on live
networks, by measuring the throughput and losses between nodes in our lab at TAMU
and different machines at diverse location across the globe on the planet-lab.
The results from simulations indicate that PERT can compete with TCP in
diverse environments and provides benefits as it is incrementally deployed. Results
from real-network experiments strengthen this claim as PERT shows similar behavior
with the real-world traffic.
Advisors/Committee Members: A.L, Narasimha Reddy (advisor), Bettati, Riccardo (advisor), Loguinov, Dmitri (committee member).
Subjects/Keywords: TCP; congestion control; protocols; delay based; PERT
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):
Kotla, K. (2008). Adapting a delay-based protocol to heterogeneous environments. (Thesis). Texas A&M University. Retrieved from http://hdl.handle.net/1969.1/86000
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
Chicago Manual of Style (16th Edition):
Kotla, Kiran. “Adapting a delay-based protocol to heterogeneous environments.” 2008. Thesis, Texas A&M University. Accessed March 29, 2020.
http://hdl.handle.net/1969.1/86000.
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
MLA Handbook (7th Edition):
Kotla, Kiran. “Adapting a delay-based protocol to heterogeneous environments.” 2008. Web. 29 Mar 2020.
Vancouver:
Kotla K. Adapting a delay-based protocol to heterogeneous environments. [Internet] [Thesis]. Texas A&M University; 2008. [cited 2020 Mar 29].
Available from: http://hdl.handle.net/1969.1/86000.
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
Council of Science Editors:
Kotla K. Adapting a delay-based protocol to heterogeneous environments. [Thesis]. Texas A&M University; 2008. Available from: http://hdl.handle.net/1969.1/86000
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
Texas A&M University
4.
Tadi, Krishna C.
A FRAMEWORK FOR DEFENDING AGAINST PREFIX HIJACK ATTACKS.
Degree: 2010, Texas A&M University
URL: http://hdl.handle.net/1969.1/ETD-TAMU-2009-05-285
► Border Gateway Protocol (BGP) prefix hijacking is a serious problem in the Internet today. Although there are several services being offered to detect a prefix…
(more)
▼ Border Gateway Protocol (BGP) prefix hijacking is a serious problem in the Internet today. Although there are several services being offered to detect a prefix hijack, there has been little work done to prevent a hijack or to continue providing network service during a prefix hijack attack. This thesis proposes a novel framework to provide defense against prefix hijacking which can be offered as a service by Content Distribution Networks and large Internet Service Providers. Our experiments revealed that the hijack success rate reduced from 90.36% to 30.53% at Tier 2, 84.65% to 10.98% at Tier 3 and 82.45% to 8.39% at Tier 4 using Autonomous Systems (ASs) of Akamai as Hijack Prevention Service Provider. We also observed that 70% of the data captured by Hijack Prevention Service Provider (HPSP) can be routed back to Victim. However if we use tunneling, i.e. trying to route data to neighbors of Victims which in turn sends the traffic to Victims, we observed that data can be routed to Victim 98.09% of the time. Also, the cost of such redirection is minimal, since the average increase in path length was observed to be 2.07 AS hops.
Advisors/Committee Members: Reddy, Narasimha (advisor), Bettati, Riccardo (committee member), Sprintson, Alexander (committee member).
Subjects/Keywords: Prefix Hijacking; Border Gateway Protocol
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):
Tadi, K. C. (2010). A FRAMEWORK FOR DEFENDING AGAINST PREFIX HIJACK ATTACKS. (Thesis). Texas A&M University. Retrieved from http://hdl.handle.net/1969.1/ETD-TAMU-2009-05-285
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
Chicago Manual of Style (16th Edition):
Tadi, Krishna C. “A FRAMEWORK FOR DEFENDING AGAINST PREFIX HIJACK ATTACKS.” 2010. Thesis, Texas A&M University. Accessed March 29, 2020.
http://hdl.handle.net/1969.1/ETD-TAMU-2009-05-285.
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
MLA Handbook (7th Edition):
Tadi, Krishna C. “A FRAMEWORK FOR DEFENDING AGAINST PREFIX HIJACK ATTACKS.” 2010. Web. 29 Mar 2020.
Vancouver:
Tadi KC. A FRAMEWORK FOR DEFENDING AGAINST PREFIX HIJACK ATTACKS. [Internet] [Thesis]. Texas A&M University; 2010. [cited 2020 Mar 29].
Available from: http://hdl.handle.net/1969.1/ETD-TAMU-2009-05-285.
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
Council of Science Editors:
Tadi KC. A FRAMEWORK FOR DEFENDING AGAINST PREFIX HIJACK ATTACKS. [Thesis]. Texas A&M University; 2010. Available from: http://hdl.handle.net/1969.1/ETD-TAMU-2009-05-285
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
Texas A&M University
5.
Zhuo, Yue.
IRLstack 3.0: High-Performance Windows Sockets.
Degree: 2014, Texas A&M University
URL: http://hdl.handle.net/1969.1/154001
► With the ever-growing volume and speed of Internet traffic, network applications place higher demand on packet I/O rates. Although 1-Gbps and even 10-Gbps Ethernet are…
(more)
▼ With the ever-growing volume and speed of Internet traffic, network applications place higher demand on packet I/O rates. Although 1-Gbps and even 10-Gbps Ethernet are widely adopted, achieving wire rate with small packets remains hindered by bottlenecks inside the TCP/IP stack. Improvements have been made for Linux, but there is still limited work in Windows. To bridge this gap, we build a new generation of our network driver IRLstack and show that it can achieve 10 Gbps wire rate (i.e. 14.88 Mpps), for both send and receive, with zero CPU utilization. This compares favorably to the fastest Linux versions, which typically saturate one or more CPU cores and often fail to achieve this rate in both directions.
Advisors/Committee Members: Loguinov, Dmitri (advisor), Bettati, Riccardo (committee member), Reddy, Narasimha (committee member).
Subjects/Keywords: network driver; socket; windows; high-performance
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):
Zhuo, Y. (2014). IRLstack 3.0: High-Performance Windows Sockets. (Thesis). Texas A&M University. Retrieved from http://hdl.handle.net/1969.1/154001
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
Chicago Manual of Style (16th Edition):
Zhuo, Yue. “IRLstack 3.0: High-Performance Windows Sockets.” 2014. Thesis, Texas A&M University. Accessed March 29, 2020.
http://hdl.handle.net/1969.1/154001.
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
MLA Handbook (7th Edition):
Zhuo, Yue. “IRLstack 3.0: High-Performance Windows Sockets.” 2014. Web. 29 Mar 2020.
Vancouver:
Zhuo Y. IRLstack 3.0: High-Performance Windows Sockets. [Internet] [Thesis]. Texas A&M University; 2014. [cited 2020 Mar 29].
Available from: http://hdl.handle.net/1969.1/154001.
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
Council of Science Editors:
Zhuo Y. IRLstack 3.0: High-Performance Windows Sockets. [Thesis]. Texas A&M University; 2014. Available from: http://hdl.handle.net/1969.1/154001
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
Texas A&M University
6.
Lin, Victor Hamilton.
PULS on WARP Platform - Detailed Investigation of Real-Time Scheduling Performance.
Degree: MS, Computer Engineering, 2018, Texas A&M University
URL: http://hdl.handle.net/1969.1/174375
► Software-defined Radio (SDR) platforms are popular tools to implement custom wireless network algorithms and architectures designs now-days. One of the most popular SDR platforms being…
(more)
▼ Software-defined Radio (SDR) platforms are popular tools to implement custom wireless network
algorithms and architectures designs now-days. One of the most popular SDR platforms
being used is the National Instrument USRP. In addition to having powerful hardware for supporting
various physical layer (PHY) protocols, the software is no less significant for its flexibility to
implement custom MAC layer algorithms.
When presenting various Wi-Fi experimental results based on the platform, often time we are
asked "What about WARP"? WARP is a wireless development platform developed by Mango
Communications, integrating a high performance field programmable grid array (FPGA) from
Xilinx, two flexible RF interfaces, and multiple peripherals to facilitate rapid prototyping of custom
wireless designs. In the past, we’ve been focusing only on the USRP for prototyping, but WARP
could be a potential candidate to outperform USRP under certain requirements.
PULS[1] presented a new scheduling experiment that executed on the USRP with realistic
packet arrival characteristics. The goal of this thesis is to perform a comprehensive comparison
between the WARP and USRP platforms based on the PULSE architecture. On the other hand, we
want to investigate the advantages and disadvantages of WARP compared to USRP under various
requirements. From the experimental result, we see that PULS can be successfully implemented
on the WARP platform, the throughput performance of PULS on the WARP platform is 146% of
the USRP platform.
Advisors/Committee Members: Hou, I-Hong (advisor), Shakkottai, Srinivas (advisor), Bettati, Riccardo (committee member).
Subjects/Keywords: MAC Scheduling; Ultra-low latency; Software Defined Radio; WARP
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):
Lin, V. H. (2018). PULS on WARP Platform - Detailed Investigation of Real-Time Scheduling Performance. (Masters Thesis). Texas A&M University. Retrieved from http://hdl.handle.net/1969.1/174375
Chicago Manual of Style (16th Edition):
Lin, Victor Hamilton. “PULS on WARP Platform - Detailed Investigation of Real-Time Scheduling Performance.” 2018. Masters Thesis, Texas A&M University. Accessed March 29, 2020.
http://hdl.handle.net/1969.1/174375.
MLA Handbook (7th Edition):
Lin, Victor Hamilton. “PULS on WARP Platform - Detailed Investigation of Real-Time Scheduling Performance.” 2018. Web. 29 Mar 2020.
Vancouver:
Lin VH. PULS on WARP Platform - Detailed Investigation of Real-Time Scheduling Performance. [Internet] [Masters thesis]. Texas A&M University; 2018. [cited 2020 Mar 29].
Available from: http://hdl.handle.net/1969.1/174375.
Council of Science Editors:
Lin VH. PULS on WARP Platform - Detailed Investigation of Real-Time Scheduling Performance. [Masters Thesis]. Texas A&M University; 2018. Available from: http://hdl.handle.net/1969.1/174375
Texas A&M University
7.
Eigenbrodt, Julia M.
Spent Fuel Measurements: Passive Neutron Albedo Reactivity (PNAR) and Photon Signatures.
Degree: PhD, Nuclear Engineering, 2016, Texas A&M University
URL: http://hdl.handle.net/1969.1/156845
► The International Atomic Energy Agency?s (IAEA) safeguards technical objective is the timely detection of a diversion of a significant quantity of nuclear material from peaceful…
(more)
▼ The International Atomic Energy Agency?s (IAEA) safeguards technical objective is the timely detection of a diversion of a significant quantity of nuclear material from peaceful activities to the manufacture of nuclear weapons or of other nuclear explosive devices or for purposes unknown, and deterrence of such diversion by the risk of early detection. An important IAEA task towards meeting this objective is the ability to accurately and reliably measure spent nuclear fuel (SNF) to verify reactor operating parameters and verify that the fuel has not been removed from reactors or SNF storage facilities. This dissertation analyzes a method to improve the state-of-the-art of nuclear material safeguards measurements using two combined measurement techniques: passive neutron albedo reactivity (PNAR) and passive spectral photon measurements.
PNAR was used for measurements of SNF in Japan as well as fresh fuel pins at Los Alamos National Laboratory (LANL). The measured PNAR signal was shown to trend well with neutron multiplication and fissile content of the SNF. The PNAR measurements showed a 73% change in signal for a fuel burnup range of 7.1 to 19.2 GWd/MTHM of spent mixed-oxide (MOX) fuel and a 40% change in signal over a range of initial
235U enrichment from 0.2% to 3.2% in UO2 fuel.
Photon measurements were performed on a wide range of SNF pins to determine which photon signatures are visible in different sets of fuels. These signatures were then investigated and tested using a sensitivity analysis to determine the spent fuel parameters to which each signal is most sensitive. These photon signatures can be used to determine SNF parameters that can support PNAR determination of SNF fissile content.
Based on the results from these measurements, we have concluded that spectral photon measurements can determine operating parameters to improve the implementation of PNAR. We also concluded that PNAR can accurately measure multiplication and fissile content in SNF with standard deviations of 1% and 4%, respectively. The PNAR and photon measurements can be used together as a powerful tool to support the IAEA safeguards technical objective.
Advisors/Committee Members: Charlton, William S (advisor), Chirayath, Sunil (committee member), Tsvetkov, Pavel (committee member), Bettati, Riccardo (committee member).
Subjects/Keywords: PNAR; NDA; safeguards; nuclear engineering; spent nuclear fuel; photon measurements; neutron measurements
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):
Eigenbrodt, J. M. (2016). Spent Fuel Measurements: Passive Neutron Albedo Reactivity (PNAR) and Photon Signatures. (Doctoral Dissertation). Texas A&M University. Retrieved from http://hdl.handle.net/1969.1/156845
Chicago Manual of Style (16th Edition):
Eigenbrodt, Julia M. “Spent Fuel Measurements: Passive Neutron Albedo Reactivity (PNAR) and Photon Signatures.” 2016. Doctoral Dissertation, Texas A&M University. Accessed March 29, 2020.
http://hdl.handle.net/1969.1/156845.
MLA Handbook (7th Edition):
Eigenbrodt, Julia M. “Spent Fuel Measurements: Passive Neutron Albedo Reactivity (PNAR) and Photon Signatures.” 2016. Web. 29 Mar 2020.
Vancouver:
Eigenbrodt JM. Spent Fuel Measurements: Passive Neutron Albedo Reactivity (PNAR) and Photon Signatures. [Internet] [Doctoral dissertation]. Texas A&M University; 2016. [cited 2020 Mar 29].
Available from: http://hdl.handle.net/1969.1/156845.
Council of Science Editors:
Eigenbrodt JM. Spent Fuel Measurements: Passive Neutron Albedo Reactivity (PNAR) and Photon Signatures. [Doctoral Dissertation]. Texas A&M University; 2016. Available from: http://hdl.handle.net/1969.1/156845
Texas A&M University
8.
Juturu, Amruth Kumar.
Distributed Device Bus.
Degree: 2015, Texas A&M University
URL: http://hdl.handle.net/1969.1/155660
► Peripheral devices are hardware components that are connected to a computer and they supplement the functionality of a computer. Over the years, a huge improvement…
(more)
▼ Peripheral devices are hardware components that are connected to a computer and they supplement the functionality of a computer. Over the years, a huge improvement has been observed both in variety and capabilities of peripheral devices. Starting from the input/output and storage devices of early days, today's peripheral devices support all aspects of a computer, with peripherals like Graphical Processing Units (GPUs) even supplementing the computational capabilities of a processor. At the same time, the support for peripheral devices in computers has vastly improved. While the earlier computers only supported static configuration of devices, the plug-and-play capabilities in present day computers allow devices to be added or removed at run time, thus reducing the complexity of managing peripheral devices. Today, it is not an exaggeration to state that, beyond the computational capability of a computer, it is the peripheral devices that define the user experience.
With the advancements in networking and distributed computing, the definition of what constitutes a computer has been blurred: Mainframes and Supercomputing clusters support batch processing, where processors/cores are treated as resources, and number of processors/cores available for a specific computation can be requested on demand. With cloud computing, users access services hosted across the Internet. However, usage models for peripheral devices have not caught up accordingly. For the most part, Peripheral devices are still limited to the computers they are physical attached to. Device virtualization solutions exist that can extend the device protocols over the network, enabling users to access devices connected to a different computer. However, these device virtualization solutions still need direct access to both the computer that has the device plugged in (Device Server) and to the computer that intends to use the device (Device Client) and they do not support remote plug-and-play. So, there is a need for a device consolidation framework that supports new device usage models that are in line with the evolving models of computation.
In this thesis, we propose a framework called "Distributed Device Bus", which extends the concept of a conventional peripheral bus to include in its scope, the ports of all the computers that are connected over a network. Like a peripheral bus, a Distributed Device Bus is also associated with a computer called Master node. A Distributed Device Bus supports dynamic addition/deletion of ports and each of these ports can physically belong to any computer in the network. Computers that contribute ports to a Distributed Device Bus are called Provider nodes. A device plugged into any port that is assigned to a Distributed Device Bus is immediately made accessible to applications on master node. This device consolidation framework treats devices as a resource and access to a device is configurable rather than being limited to the computer the device is physically attached to.
Advisors/Committee Members: Bettati, Riccardo (advisor), Reddy, A. L. Narasimha (committee member), Jarvi, Jaakko (committee member).
Subjects/Keywords: Distributed Device Bus; Device Virtualization; Device Consolidation
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):
Juturu, A. K. (2015). Distributed Device Bus. (Thesis). Texas A&M University. Retrieved from http://hdl.handle.net/1969.1/155660
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
Chicago Manual of Style (16th Edition):
Juturu, Amruth Kumar. “Distributed Device Bus.” 2015. Thesis, Texas A&M University. Accessed March 29, 2020.
http://hdl.handle.net/1969.1/155660.
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
MLA Handbook (7th Edition):
Juturu, Amruth Kumar. “Distributed Device Bus.” 2015. Web. 29 Mar 2020.
Vancouver:
Juturu AK. Distributed Device Bus. [Internet] [Thesis]. Texas A&M University; 2015. [cited 2020 Mar 29].
Available from: http://hdl.handle.net/1969.1/155660.
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
Council of Science Editors:
Juturu AK. Distributed Device Bus. [Thesis]. Texas A&M University; 2015. Available from: http://hdl.handle.net/1969.1/155660
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
Texas A&M University
9.
Pandey, Sanat Kumar.
Performance Comparison of Neighbor Discovery Protocols in Wireless Ad-Hoc Network.
Degree: 2015, Texas A&M University
URL: http://hdl.handle.net/1969.1/155754
► In this thesis we consider the problem of neighbor discovery in synchronous single hop wireless ad-hoc networks. The central problem is to establish a broadcasting…
(more)
▼ In this thesis we consider the problem of neighbor discovery in synchronous single hop wireless ad-hoc networks. The central problem is to establish a broadcasting sequence such that only one transmitter broadcasts at a time while all others listen and every transmitter in the network gets at least one chance to broadcast. We consider the question: how fast we can achieve neighbor discovery with k nodes in the network, each having a unique id assigned from an id space much larger than k in radio communication models with and without collision detection. We take the simulation route to answer this question. We implemented one randomized and two deterministic algorithms for neighbor discovery and compared their performance in terms of number of rounds required as a function of the number of nodes in the network and the size of the space from which ids are chosen. Our simulation results show that the randomized algorithm is most efficient and is easiest to implement. The deterministic algorithm for the no collision detection model has round complexity comparable to the size of the id space and is orders of magnitude less efficient than the randomized algorithm. The deterministic algorithm for the collision detection model is slower than the randomized algorithm by a factor of log(n), where n is the size of the id space. Our analysis would be useful for choosing optimal algorithms for field applications depending on the radio communication model and network topology. It will reveal any large constants or second order terms discarded in the asymptotic analysis of the algorithms, which reduces effectiveness of some algorithms in applications.
Advisors/Committee Members: Welch, Jennifer L (advisor), Sprintson, Alex (committee member), Bettati, Riccardo (committee member).
Subjects/Keywords: Neighbor discovery; ad-hoc radio network
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):
Pandey, S. K. (2015). Performance Comparison of Neighbor Discovery Protocols in Wireless Ad-Hoc Network. (Thesis). Texas A&M University. Retrieved from http://hdl.handle.net/1969.1/155754
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
Chicago Manual of Style (16th Edition):
Pandey, Sanat Kumar. “Performance Comparison of Neighbor Discovery Protocols in Wireless Ad-Hoc Network.” 2015. Thesis, Texas A&M University. Accessed March 29, 2020.
http://hdl.handle.net/1969.1/155754.
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
MLA Handbook (7th Edition):
Pandey, Sanat Kumar. “Performance Comparison of Neighbor Discovery Protocols in Wireless Ad-Hoc Network.” 2015. Web. 29 Mar 2020.
Vancouver:
Pandey SK. Performance Comparison of Neighbor Discovery Protocols in Wireless Ad-Hoc Network. [Internet] [Thesis]. Texas A&M University; 2015. [cited 2020 Mar 29].
Available from: http://hdl.handle.net/1969.1/155754.
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
Council of Science Editors:
Pandey SK. Performance Comparison of Neighbor Discovery Protocols in Wireless Ad-Hoc Network. [Thesis]. Texas A&M University; 2015. Available from: http://hdl.handle.net/1969.1/155754
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
Texas A&M University
10.
Wilcox, Eric Scott.
A Relay Prevention Technique for Near Field Communication.
Degree: 2015, Texas A&M University
URL: http://hdl.handle.net/1969.1/155758
► The use of near field communication (NFC) has expanded as rapidly as Bluetooth or similar technologies and shows no signs of slowing down. It is…
(more)
▼ The use of near field communication (NFC) has expanded as rapidly as Bluetooth or similar technologies and shows no signs of slowing down. It is used in many different systems such as contactless payment processing, movie posters, security access and passport identification. NFC enabled devices include cell phones, credit cards and key chains. With the spread of any new technology come security vulnerabilities that malicious users will try to exploit. NFC is particularly vulnerable to what is known as a relay attack. The relay attack is similar to the man-in-the-middle attack but the data need not be unencrypted to be vulnerable. The relay attack is currently undetectable and unstoppable. Many solutions have been proposed but no real-world solution has been found that does not require significant changes to the NFC protocol, or even the hardware. In this work we propose a technique that uses careful timing analysis of tag communication to identify a transaction as dangerous and thus set off an alert of the potential threat. This could be built into mobile devices and readers already deployed and provide a level of security to the market not currently available while maintaining the protocols set forth by the ISO. A proof of concept has been built and tested on custom hardware as well as on an Android Nexus 4 to detect and prevent the relay attack. In this thesis we give an overview of security issues in NFC communication, describe the relay attack in detail, present our timing based countermeasures and its implementation, and give results of our evaluation of timing based relay prevention.
Advisors/Committee Members: Bettati, Riccardo (advisor), Stoleru, Radu (advisor), Reddy, A. L. Narasimha (committee member).
Subjects/Keywords: NFC; Near Field Communication; Relay Attack; Relay Attack Prevention
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):
Wilcox, E. S. (2015). A Relay Prevention Technique for Near Field Communication. (Thesis). Texas A&M University. Retrieved from http://hdl.handle.net/1969.1/155758
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
Chicago Manual of Style (16th Edition):
Wilcox, Eric Scott. “A Relay Prevention Technique for Near Field Communication.” 2015. Thesis, Texas A&M University. Accessed March 29, 2020.
http://hdl.handle.net/1969.1/155758.
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
MLA Handbook (7th Edition):
Wilcox, Eric Scott. “A Relay Prevention Technique for Near Field Communication.” 2015. Web. 29 Mar 2020.
Vancouver:
Wilcox ES. A Relay Prevention Technique for Near Field Communication. [Internet] [Thesis]. Texas A&M University; 2015. [cited 2020 Mar 29].
Available from: http://hdl.handle.net/1969.1/155758.
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
Council of Science Editors:
Wilcox ES. A Relay Prevention Technique for Near Field Communication. [Thesis]. Texas A&M University; 2015. Available from: http://hdl.handle.net/1969.1/155758
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
Texas A&M University
11.
Li, Xiaoyong.
Distributed Synchronization Under Data Churn.
Degree: 2016, Texas A&M University
URL: http://hdl.handle.net/1969.1/157023
► Nowadays an increasing number of applications need to maintain local copies of remote data sources to provide services to their users. Because of the dynamic…
(more)
▼ Nowadays an increasing number of applications need to maintain local copies of remote data sources to provide services to their users. Because of the dynamic nature of the sources, an application has to synchronize its copies with remote sources constantly to provide reliable services. Instead of push-based synchronization, we focus on pull-based strategy because it doesn?t require source cooperation and has been widely adopted by existing systems.
The scalability of the pull-based synchronization comes at the expense of increased inconsistency of the copied content. We model this system under non-Poisson update/refresh processes and obtain sample-path averages of various metrics of staleness cost, generalizing previous results and studying its statistical properties.
Computing staleness requires knowledge of the inter-update distribution at the source, which can only be estimated through blind sampling ? periodic downloads and comparison against previous copies. We show that all previous approaches are biased unless the observation rate tends to infinity or the update process is Poisson. To overcome these issues, we propose four new algorithms that achieve various levels of consistency, which depend on the amount of temporal information revealed by the source and capabilities of the download process.
Then we focus on applying freshness to P2P replication systems. We extend our results to several more difficult algorithms ? cascaded replication, cooperative caching, and redundant querying from the clients. Surprisingly, we discover that optimal cooperation involves just a single peer and that redundant querying can hurt the ability of the system to handle load (i.e., may lead to lower scalability).
Advisors/Committee Members: Loguinov, Dmitri (advisor), Bettati, Riccardo (committee member), Caverlee, Jame (committee member), Reddy, Narasimha (committee member).
Subjects/Keywords: data synchronization; freshness
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):
Li, X. (2016). Distributed Synchronization Under Data Churn. (Thesis). Texas A&M University. Retrieved from http://hdl.handle.net/1969.1/157023
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
Chicago Manual of Style (16th Edition):
Li, Xiaoyong. “Distributed Synchronization Under Data Churn.” 2016. Thesis, Texas A&M University. Accessed March 29, 2020.
http://hdl.handle.net/1969.1/157023.
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
MLA Handbook (7th Edition):
Li, Xiaoyong. “Distributed Synchronization Under Data Churn.” 2016. Web. 29 Mar 2020.
Vancouver:
Li X. Distributed Synchronization Under Data Churn. [Internet] [Thesis]. Texas A&M University; 2016. [cited 2020 Mar 29].
Available from: http://hdl.handle.net/1969.1/157023.
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
Council of Science Editors:
Li X. Distributed Synchronization Under Data Churn. [Thesis]. Texas A&M University; 2016. Available from: http://hdl.handle.net/1969.1/157023
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
Texas A&M University
12.
Zhang, Jialong.
Understanding and Detecting Malicious Cyber Infrastructures.
Degree: 2016, Texas A&M University
URL: http://hdl.handle.net/1969.1/158989
► Malware (e.g., trojans, bots, and spyware) is still a pervasive threat on the Internet. It is able to infect computer systems to further launch a…
(more)
▼ Malware (e.g., trojans, bots, and spyware) is still a pervasive threat on the Internet. It is able to infect computer systems to further launch a variety of malicious activities such as sending spam, stealing sensitive information and launching distributed denial-of-service (DDoS) attacks. In order to continue malevolent activities without being detected and to improve the efficiency of malicious activities, cyber-criminals tend to build malicious cyber infrastructures to communicate with their malware and to exploit benign users. In these infrastructures, multiple servers are set to be efficient and anonymous in (i) malware distribution (using redirectors and exploit servers), (ii) control (using C&C servers), (iii) monetization (using payment servers), and (iv) robustness against server takedowns (using multiple backups for each type of server).
The most straightforward way to counteract the malware threat is to detect malware directly on infected hosts. However, it is difficult since packing and obfuscation techniques are frequently used by malware to evade state-of-the-art anti-virus tools. Therefore, an alternate solution is to detect and disrupt the malicious cyber infrastructures used by malware. In this dissertation, we take an important step in this direction and focus on identifying malicious servers behind those malicious cyber infrastructures. We present a comprehensive inferring framework to infer servers involved in malicious cyber infrastructure based on the three roles of those servers: compromised server, malicious server accessed through redirection and malicious server accessed through directly connecting. We characterize these three roles from four novel perspectives and demonstrate our detection technologies in four systems: PoisonAmplifier, SMASH, VisHunter and NeighbourWatcher. PoisonAmplifier focuses on compromised servers. It explores the fact that cybercriminals tend to use compromised servers to trick benign users during the attacking process. Therefore, it is designed to proactively find more compromised servers. SMASH focuses on malicious servers accessed through directly connecting. It explores the fact that multiple backups are usually used in malicious cyber infrastructures to avoid server takedowns. Therefore, it leverages the correlation among malicious servers to infer a group of malicious servers. VisHunter focuses on the redirections from compromised servers to malicious servers. It explores the fact that cybercriminals usually conceal their core malicious servers. Therefore, it is designed to detect those ?invisible? malicious servers. NeighbourWatcher focuses on all general malicious servers promoted by spammers. It explores the observation that spammers intend to promote some servers (e.g., phishing servers) on the special websites (e.g., forum and wikis) to trick benign users and to improve the reputation of their malicious servers. In short, we build a comprehensive inferring framework to identify servers involved in malicious cyber infrastructures from four novel…
Advisors/Committee Members: Gu, Guofei (advisor), Bettati, Riccardo (committee member), Caverlee, James (committee member), Reddy, Narasimha (committee member).
Subjects/Keywords: malicious cyber infrastructure; network security; malicious server detection
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):
Zhang, J. (2016). Understanding and Detecting Malicious Cyber Infrastructures. (Thesis). Texas A&M University. Retrieved from http://hdl.handle.net/1969.1/158989
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
Chicago Manual of Style (16th Edition):
Zhang, Jialong. “Understanding and Detecting Malicious Cyber Infrastructures.” 2016. Thesis, Texas A&M University. Accessed March 29, 2020.
http://hdl.handle.net/1969.1/158989.
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
MLA Handbook (7th Edition):
Zhang, Jialong. “Understanding and Detecting Malicious Cyber Infrastructures.” 2016. Web. 29 Mar 2020.
Vancouver:
Zhang J. Understanding and Detecting Malicious Cyber Infrastructures. [Internet] [Thesis]. Texas A&M University; 2016. [cited 2020 Mar 29].
Available from: http://hdl.handle.net/1969.1/158989.
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
Council of Science Editors:
Zhang J. Understanding and Detecting Malicious Cyber Infrastructures. [Thesis]. Texas A&M University; 2016. Available from: http://hdl.handle.net/1969.1/158989
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
Texas A&M University
13.
Shamsi, Zain Sarfaraz.
Scalable OS Fingerprinting: Classification Problems and Applications.
Degree: 2017, Texas A&M University
URL: http://hdl.handle.net/1969.1/161371
► The Internet has become ubiquitous in our lives today. With its rapid adoption and widespread growth across the planet, it has drawn many research efforts…
(more)
▼ The Internet has become ubiquitous in our lives today. With its rapid adoption and widespread growth across the planet, it has drawn many research efforts that attempt to understand and characterize this complex system. One such direction tries to discover the types of devices that compose the Internet, which is the topic of this dissertation.
To accomplish such a measurement, researchers have turned to a technique called OS fingerprinting, which is a method to determine the operating system (OS) of a remote host. However, because the Internet today has evolved into a massive public network, large-scale OS fingerprinting has become a challenging problem. Due to increasing security concerns, most networks today will block many of the probes used by traditional fingerprinting tools (e.g., Nmap), thus requiring a different approach. Consequently, this has given rise to single-probe techniques which offer low overhead and minimal intrusiveness, but in turn require more sophistication in their algorithms as they are limited in the amount of information that they receive and many parameters can inject noise in the measurement (e.g., network delay, packet loss).
This dissertation focuses on understanding the performance of single-probe algorithms. We study existing methods, formalize current problems in the field and devise new algorithms to improve classification accuracy and automate construction of fingerprint databases. We apply our work to multiple Internet-wide scans and discover that besides general purpose machines, the Internet today has grown to include large numbers of publicly accessible peripheral devices (e.g., routers, printers, cameras) and cyber-physical systems (e.g., lighting controllers, medical sensors). We go on to recover empirical distributions of network delays and loss, as well as likelihoods of users re-configuring their devices. With our developed techniques and results, we show that single-probe algorithms are an effective approach for accomplishing wide-scale network measurements.
Advisors/Committee Members: Loguinov, Dmitri (advisor), Bettati, Riccardo (committee member), Reddy, Narasimha (committee member), Stoleru, Radu (committee member).
Subjects/Keywords: OS fingerprinting; Internet measurement; network security; classification
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):
Shamsi, Z. S. (2017). Scalable OS Fingerprinting: Classification Problems and Applications. (Thesis). Texas A&M University. Retrieved from http://hdl.handle.net/1969.1/161371
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
Chicago Manual of Style (16th Edition):
Shamsi, Zain Sarfaraz. “Scalable OS Fingerprinting: Classification Problems and Applications.” 2017. Thesis, Texas A&M University. Accessed March 29, 2020.
http://hdl.handle.net/1969.1/161371.
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
MLA Handbook (7th Edition):
Shamsi, Zain Sarfaraz. “Scalable OS Fingerprinting: Classification Problems and Applications.” 2017. Web. 29 Mar 2020.
Vancouver:
Shamsi ZS. Scalable OS Fingerprinting: Classification Problems and Applications. [Internet] [Thesis]. Texas A&M University; 2017. [cited 2020 Mar 29].
Available from: http://hdl.handle.net/1969.1/161371.
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
Council of Science Editors:
Shamsi ZS. Scalable OS Fingerprinting: Classification Problems and Applications. [Thesis]. Texas A&M University; 2017. Available from: http://hdl.handle.net/1969.1/161371
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
Texas A&M University
14.
Nemade, Nikhil Pandit.
Application of network coding for VLSI routing.
Degree: 2009, Texas A&M University
URL: http://hdl.handle.net/1969.1/ETD-TAMU-2670
► This thesis studies the applications of the network coding technique for intercon- nect optimization and improving the routability of Very-large-scale integration (VLSI) designs. The goal…
(more)
▼ This thesis studies the applications of the network coding technique for intercon-
nect optimization and improving the routability of Very-large-scale integration (VLSI)
designs. The goal of the routing process is to connect the required sets of sources
and sinks while minimizing the total wirelength and reducing congestion. Typically,
chip interconnects include multiple sinks and are routed through intermediate nodes.
The main idea of the network coding technique is to enable the intermediate nodes
to generate new signals by combining the signals received over their incoming wires.
This is in contrast to the traditional approaches, in which an intermediate node can
only forward the incoming signals. This thesis attempts to explore the possible ben-
efits of the network coding technique for reducing the total wirelengh and mitigating
congestion in VLSI designs.
The contribution of the thesis is three-fold. First, we extend the Hanan?s theo-
rem for multi-net rectilinear coding networks. Second, we propose several exact and
heuristic solutions for finding near-optimal routing topologies that utilize network
coding techniques. Next, we perform extensive simulation study to evaluate the ad-
vantage of network coding over the traditional approaches. The simulations help to
identify routing instances where the network coding techniques are expected to be
beneficial. Finally, we evaluate the potential benefits from network coding in practical
settings by analyzing its performance on the International Symposium on Physical
Design (ISPD) benchmarks. Our results show that while network coding shows upto 2.43% improvement on
unconstrained rectilinear grids, it shows upto 4.34% improvement in cases with con-
straints along the grid. In addition, it shows an improvement upto 8.4% in cases
involving congestion reduction and also improves routing performance on ISPD rout-
ing benchmarks.
Advisors/Committee Members: Sprintson, Alex (advisor), Bettati, Riccardo (committee member), Hu, Jiang (committee member), Reddy, Narsimha (committee member).
Subjects/Keywords: Network Coding; Global Routing
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):
Nemade, N. P. (2009). Application of network coding for VLSI routing. (Thesis). Texas A&M University. Retrieved from http://hdl.handle.net/1969.1/ETD-TAMU-2670
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
Chicago Manual of Style (16th Edition):
Nemade, Nikhil Pandit. “Application of network coding for VLSI routing.” 2009. Thesis, Texas A&M University. Accessed March 29, 2020.
http://hdl.handle.net/1969.1/ETD-TAMU-2670.
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
MLA Handbook (7th Edition):
Nemade, Nikhil Pandit. “Application of network coding for VLSI routing.” 2009. Web. 29 Mar 2020.
Vancouver:
Nemade NP. Application of network coding for VLSI routing. [Internet] [Thesis]. Texas A&M University; 2009. [cited 2020 Mar 29].
Available from: http://hdl.handle.net/1969.1/ETD-TAMU-2670.
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
Council of Science Editors:
Nemade NP. Application of network coding for VLSI routing. [Thesis]. Texas A&M University; 2009. Available from: http://hdl.handle.net/1969.1/ETD-TAMU-2670
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
Texas A&M University
15.
Gunaseelan, Nirmal K.
Quality of service analysis for hybrid-ARQ.
Degree: 2009, Texas A&M University
URL: http://hdl.handle.net/1969.1/ETD-TAMU-2720
► Data intensive applications, requiring reliability and strict delay constraints, have emerged recently and they necessitate a different approach to analyzing system performance. In my work,…
(more)
▼ Data intensive applications, requiring reliability and strict delay constraints,
have emerged recently and they necessitate a different approach to analyzing system
performance. In my work, I establish a framework that relates physical channel parameters
to the queueing performance for a single-user wireless system. I then seek to
assess the potential benefits of multirate techniques, such as hybrid-ARQ (Automatic
Repeat reQuest), in the context of delay-sensitive communications. Present methods
of analysis in an information theoretic paradigm define capacity assuming that
long codewords can be used to take advantage of the ergodic properties of the fading
wireless channel. This definition provides only a limited characterization of the channel
in the light of delay constraints. The assumption of independent and identically
distributed channel realizations tends to over-estimate the system performance by
not considering the inherent time correlation. A finite-state continuous time Markov
channel model that I formulate enables me to partition the instantaneous data-rate
received at the destination into a finite number of states, representing layers in a
hybrid-ARQ scheme. The correlation of channel has been incorporated through level
crossing rates as transition rates in the Markov model.
The large deviation principle governing the buffer overflow of the Markov model,
is very sensitive to channel memory, is tractable, and gives a good estimate of the
system performance. Metrics such as effective capacity and probability of buffer
overflow, that are obtained through large deviations have been related to the wireless
physical layer parameters through the model. Using the above metrics under QoS constraints, I establish the quantitative performance advantage of using hybrid-ARQ
over traditional systems. I conduct this inquiry by restricting attention to the case
where the expected transmit power is fixed at the transmitter. The results show that
hybrid-ARQ helps us in obtaining higher effective capacity, but it is very difficult to
support delay sensitive communication over wireless channel in the absence of channel
knowledge and dynamic power allocation strategies.
Advisors/Committee Members: Chamberland, Jean-Francois (advisor), Bettati, Riccardo (committee member), Narayanan, Krishna (committee member), Sprintson, Alexander (committee member).
Subjects/Keywords: Hybrid-ARQ; effective capacity; delay constraints; quality of service (QoS); wireless 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):
Gunaseelan, N. K. (2009). Quality of service analysis for hybrid-ARQ. (Thesis). Texas A&M University. Retrieved from http://hdl.handle.net/1969.1/ETD-TAMU-2720
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
Chicago Manual of Style (16th Edition):
Gunaseelan, Nirmal K. “Quality of service analysis for hybrid-ARQ.” 2009. Thesis, Texas A&M University. Accessed March 29, 2020.
http://hdl.handle.net/1969.1/ETD-TAMU-2720.
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
MLA Handbook (7th Edition):
Gunaseelan, Nirmal K. “Quality of service analysis for hybrid-ARQ.” 2009. Web. 29 Mar 2020.
Vancouver:
Gunaseelan NK. Quality of service analysis for hybrid-ARQ. [Internet] [Thesis]. Texas A&M University; 2009. [cited 2020 Mar 29].
Available from: http://hdl.handle.net/1969.1/ETD-TAMU-2720.
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
Council of Science Editors:
Gunaseelan NK. Quality of service analysis for hybrid-ARQ. [Thesis]. Texas A&M University; 2009. Available from: http://hdl.handle.net/1969.1/ETD-TAMU-2720
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
Texas A&M University
16.
Zhu, Ye.
On traffic analysis in anonymous communication networks.
Degree: 2009, Texas A&M University
URL: http://hdl.handle.net/1969.1/ETD-TAMU-1758
► In this dissertation, we address issues related to traffic analysis attacks and the engineering in anonymous communication networks. Mixes have been used in many anonymous…
(more)
▼ In this dissertation, we address issues related to traffic analysis attacks and the engineering
in anonymous communication networks.
Mixes have been used in many anonymous communication systems and are supposed
to provide countermeasures that can defeat various traffic analysis attacks. In
this dissertation, we first focus on a particular class of traffic analysis attack, flow
correlation attacks, by which an adversary attempts to analyze the network traffic
and correlate the traffic of a flow over an input link at a mix with that over an output
link of the same mix. Two classes of correlation methods are considered, namely
time-domain methods and frequency-domain methods. We find that a mix with any
known batching strategy may fail against flow correlation attacks in the sense that,
for a given flow over an input link, the adversary can correctly determine which output
link is used by the same flow. We theoretically analyze the effectiveness of a mix
network under flow correlation attacks.
We extend flow correlation attack to perform flow separation: The flow separation
attack separates flow aggregates into either smaller aggregates or individual flows. We
apply blind source separation techniques from statistical signal processing to separate
the traffic in a mix network. Our experiments show that this attack is effective and
scalable. By combining flow separation and frequency spectrum matching method,
a passive attacker can get the traffic map of the mix network. We use a non-trivial network to show that the combined attack works.
The second part of the dissertation focuses on engineering anonymous communication
networks. Measures for anonymity in systems must be on one hand simple and
concise, and on the other hand reflect the realities of real systems. We propose a new
measure for the anonymity degree, which takes into account possible heterogeneity.
We model the effectiveness of single mixes or of mix networks in terms of information
leakage and measure it in terms of covert channel capacity. The relationship between
the anonymity degree and information leakage is described, and an example is shown.
Advisors/Committee Members: Bettati, Riccardo (advisor), Reddy, Narasimha A. L. (advisor), Longnecker, Michael (committee member), Zhao, Wei (committee member).
Subjects/Keywords: traffic analysis; anonymity
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, Y. (2009). On traffic analysis in anonymous communication networks. (Thesis). Texas A&M University. Retrieved from http://hdl.handle.net/1969.1/ETD-TAMU-1758
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
Chicago Manual of Style (16th Edition):
Zhu, Ye. “On traffic analysis in anonymous communication networks.” 2009. Thesis, Texas A&M University. Accessed March 29, 2020.
http://hdl.handle.net/1969.1/ETD-TAMU-1758.
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
MLA Handbook (7th Edition):
Zhu, Ye. “On traffic analysis in anonymous communication networks.” 2009. Web. 29 Mar 2020.
Vancouver:
Zhu Y. On traffic analysis in anonymous communication networks. [Internet] [Thesis]. Texas A&M University; 2009. [cited 2020 Mar 29].
Available from: http://hdl.handle.net/1969.1/ETD-TAMU-1758.
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
Council of Science Editors:
Zhu Y. On traffic analysis in anonymous communication networks. [Thesis]. Texas A&M University; 2009. Available from: http://hdl.handle.net/1969.1/ETD-TAMU-1758
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
Texas A&M University
17.
Wang, Shengquan.
Utilization-based delay guarantee techniques and their applications.
Degree: 2009, Texas A&M University
URL: http://hdl.handle.net/1969.1/ETD-TAMU-1078
► Many real-time systems demand effective and efficient delay-guaranteed services to meet timing requirements of their applications. We note that a system provides a delay-guaranteed service…
(more)
▼ Many real-time systems demand effective and efficient delay-guaranteed services
to meet timing requirements of their applications. We note that a system provides a
delay-guaranteed service if the system can ensure that each task will meet its predefined
end-to-end deadline. Admission control plays a critical role in providing delayguaranteed
services. The major function of admission control is to determine
admissibility of a new task. A new task will be admitted into the system if the deadline
of all existing tasks and the new task can be met. Admission control has to be efficient
and efficient, meaning that a decision should be made quickly while admitting the
maximum number of tasks.
In this dissertation, we study a utilization-based admission control mechanism.
Utilization-based admission control makes an admission decision based on a simple
resource utilization test: A task will be admitted if the resource utilization is lower than a
pre-derived safe resource utilization bound. The challenge of obtaining a safe resource
utilization bound is how to perform delay analysis offline, which is the main focus of this dissertation. For this, we develop utilization-based delay guarantee techniques to
render utilization-based admission control both efficient and effective, which is further
confirmed with our data.
We develop techniques for several systems that are of practical importance. We
first consider wired networks with the Differentiated Services model, which is wellknown
as its supporting scalable services in computer networks. We consider both cases
of providing deterministic and statistical delay-guaranteed services in wired networks
with the Differentiated Services model. We will then extend our work to wireless
networks, which have become popular for both civilian and mission critical applications.
The variable service capacity of a wireless link presents more of a challenge in providing
delay-guaranteed services in wireless networks. Finally, we study ways to provide delayguaranteed
services in component-based systems, which now serve as an important
platform for developing a new generation of computer software. We show that with our
utilization-based delay guarantee technique, component-based systems can provide
efficient and effective delay-guaranteed services while maintaining such advantages as
the reusability of components.
Advisors/Committee Members: Zhao, Wei (advisor), Bettati, Riccardo (committee member), Welch, Jennifer (committee member), Zhou, Jianxin (committee member).
Subjects/Keywords: real-time; utilization-based admission control; delay
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):
Wang, S. (2009). Utilization-based delay guarantee techniques and their applications. (Thesis). Texas A&M University. Retrieved from http://hdl.handle.net/1969.1/ETD-TAMU-1078
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
Chicago Manual of Style (16th Edition):
Wang, Shengquan. “Utilization-based delay guarantee techniques and their applications.” 2009. Thesis, Texas A&M University. Accessed March 29, 2020.
http://hdl.handle.net/1969.1/ETD-TAMU-1078.
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
MLA Handbook (7th Edition):
Wang, Shengquan. “Utilization-based delay guarantee techniques and their applications.” 2009. Web. 29 Mar 2020.
Vancouver:
Wang S. Utilization-based delay guarantee techniques and their applications. [Internet] [Thesis]. Texas A&M University; 2009. [cited 2020 Mar 29].
Available from: http://hdl.handle.net/1969.1/ETD-TAMU-1078.
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
Council of Science Editors:
Wang S. Utilization-based delay guarantee techniques and their applications. [Thesis]. Texas A&M University; 2009. Available from: http://hdl.handle.net/1969.1/ETD-TAMU-1078
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
Texas A&M University
18.
Grigoriu, Liliana.
Multiprocessor Scheduling with Availability Constraints.
Degree: 2010, Texas A&M University
URL: http://hdl.handle.net/1969.1/ETD-TAMU-2010-05-7694
► We consider the problem of scheduling a given set of tasks on multiple pro- cessors with predefined periods of unavailability, with the aim of minimizing…
(more)
▼ We consider the problem of scheduling a given set of tasks on multiple pro-
cessors with predefined periods of unavailability, with the aim of minimizing the
maximum completion time. Since this problem is strongly NP-hard, polynomial ap-
proximation algorithms are being studied for its solution. Among these, the best
known are LPT (largest processing time first) and Multifit with their variants.
We give a Multifit-based algorithm, FFDL Multifit, which has an optimal worst-
case performance in the class of polynomial algorithms for same-speed processors
with at most two downtimes on each machine, and for uniform processors with at
most one downtime on each machine, assuming that P 6= NP. Our algorithm finishes
within 3/2 the maximum between the end of the last downtime and the end of the
optimal schedule. This bound is asymptotically tight in the class of polynomial
algorithms assuming that P 6= NP. For same-speed processors with at most k
downtimes on each machine our algorithm finishes within ( 3
2 + 1
2k ) the end of the
last downtime or the end of the optimal schedule. For problems where the optimal
schedule ends after the last downtime, and when the downtimes represent fixed jobs,
the maximum completion time of FFDL Multifit is within 3
2 or ( 3
2+ 1
2k ) of the optimal
maximum completion time.
We also give an LPT-based algorithm, LPTX, which matches the performance
of FFDL Multifit for same-speed processors with at most one downtime on each
machine, and is thus optimal in the class of polynomial algorithms for this case.
LPTX differs from LPT in that it uses a specific order of processors to assign tasks if two processors become available at the same time.
For a similar problem, when there is at most one downtime on each machine
and no more than half of the machines are shut down at the same time, we show
that a bound of 2 obtained in a previous work for LPT is asymptotically tight in the
class of polynomial algorithms assuming that P 6= NP.
Advisors/Committee Members: Friesen, Donald (advisor), Bettati, Riccardo (committee member), Chen, Jianer (committee member), Rojas, Maurice (committee member).
Subjects/Keywords: multiprocessor scheduling; LPT; machine shutdowns; worst-case bounds; makespan; fixed jobs; Multifit; uniform processors
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):
Grigoriu, L. (2010). Multiprocessor Scheduling with Availability Constraints. (Thesis). Texas A&M University. Retrieved from http://hdl.handle.net/1969.1/ETD-TAMU-2010-05-7694
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
Chicago Manual of Style (16th Edition):
Grigoriu, Liliana. “Multiprocessor Scheduling with Availability Constraints.” 2010. Thesis, Texas A&M University. Accessed March 29, 2020.
http://hdl.handle.net/1969.1/ETD-TAMU-2010-05-7694.
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
MLA Handbook (7th Edition):
Grigoriu, Liliana. “Multiprocessor Scheduling with Availability Constraints.” 2010. Web. 29 Mar 2020.
Vancouver:
Grigoriu L. Multiprocessor Scheduling with Availability Constraints. [Internet] [Thesis]. Texas A&M University; 2010. [cited 2020 Mar 29].
Available from: http://hdl.handle.net/1969.1/ETD-TAMU-2010-05-7694.
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
Council of Science Editors:
Grigoriu L. Multiprocessor Scheduling with Availability Constraints. [Thesis]. Texas A&M University; 2010. Available from: http://hdl.handle.net/1969.1/ETD-TAMU-2010-05-7694
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
Texas A&M University
19.
Booker, Graham B.
Improving Network Reliability: Analysis, Methodology, and Algorithms.
Degree: 2010, Texas A&M University
URL: http://hdl.handle.net/1969.1/ETD-TAMU-2010-05-7892
► The reliability of networking and communication systems is vital for the nation's economy and security. Optical and cellular networks have become a critical infrastructure and…
(more)
▼ The reliability of networking and communication systems is vital for the nation's
economy and security. Optical and cellular networks have become a critical infrastructure
and are indispensable in emergency situations. This dissertation outlines
methods for analyzing such infrastructures in the presence of catastrophic failures,
such as a hurricane, as well as accidental failures of one or more components. Additionally,
it presents a method for protecting against the loss of a single link in a
multicast network along with a technique that enables wireless clients to efficiently
recover lost data sent by their source through collaborative information exchange.
Analysis of a network's reliability during a natural disaster can be assessed by
simulating the conditions in which it is expected to perform. This dissertation conducts
the analysis of a cellular infrastructure in the aftermath of a hurricane through
Monte-Carlo sampling and presents alternative topologies which reduce resulting loss
of calls. While previous research on restoration mechanisms for large-scale networks
has mostly focused on handling the failures of single network elements, this dissertation
examines the sampling methods used for simulating multiple failures. We present
a quick method of nding a lower bound on a network's data loss through enumeration
of possible cuts as well as an efficient method of nding a tighter lower bound
through genetic algorithms leveraging the niching technique.
Mitigation of data losses in a multicast network can be achieved by adding redundancy
and employing advanced coding techniques. By using Maximum Rank Distance (MRD) codes at the source, a provider can create a parity packet which is
e ectively linearly independent from the source packets such that all packets may be
transmitted through the network using the network coding technique. This allows
all sinks to recover all of the original data even with the failure of an edge within
the network. Furthermore, this dissertation presents a method that allows a group of
wireless clients to cooperatively recover from erasures (e.g., due to failures) by using
the index coding techniques.
Advisors/Committee Members: Sprintson, Alexander (advisor), Shakkottai, Srinivas (committee member), Georghiades, Costas (committee member), Bettati, Riccardo (committee member).
Subjects/Keywords: Compute Networking; Network Coding; Genetic Algorithms; Maximum Rank Distance Codes
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):
Booker, G. B. (2010). Improving Network Reliability: Analysis, Methodology, and Algorithms. (Thesis). Texas A&M University. Retrieved from http://hdl.handle.net/1969.1/ETD-TAMU-2010-05-7892
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
Chicago Manual of Style (16th Edition):
Booker, Graham B. “Improving Network Reliability: Analysis, Methodology, and Algorithms.” 2010. Thesis, Texas A&M University. Accessed March 29, 2020.
http://hdl.handle.net/1969.1/ETD-TAMU-2010-05-7892.
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
MLA Handbook (7th Edition):
Booker, Graham B. “Improving Network Reliability: Analysis, Methodology, and Algorithms.” 2010. Web. 29 Mar 2020.
Vancouver:
Booker GB. Improving Network Reliability: Analysis, Methodology, and Algorithms. [Internet] [Thesis]. Texas A&M University; 2010. [cited 2020 Mar 29].
Available from: http://hdl.handle.net/1969.1/ETD-TAMU-2010-05-7892.
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
Council of Science Editors:
Booker GB. Improving Network Reliability: Analysis, Methodology, and Algorithms. [Thesis]. Texas A&M University; 2010. Available from: http://hdl.handle.net/1969.1/ETD-TAMU-2010-05-7892
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
Texas A&M University
20.
Reddy, Chandan Rama.
Capacity Proportional Unstructured Peer-to-Peer Networks.
Degree: 2010, Texas A&M University
URL: http://hdl.handle.net/1969.1/ETD-TAMU-2009-08-878
► Existing methods to utilize capacity-heterogeneity in a P2P system either rely on constructing special overlays with capacity-proportional node degree or use topology adaptation to match…
(more)
▼ Existing methods to utilize capacity-heterogeneity in a P2P system either rely
on constructing special overlays with capacity-proportional node degree or use topology adaptation to match a node's capacity with that of its neighbors. In existing
P2P networks, which are often characterized by diverse node capacities and high
churn, these methods may require large node degree or continuous topology adaptation, potentially making them infeasible due to their high overhead. In this thesis,
we propose an unstructured P2P system that attempts to address these issues. We
first prove that the overall throughput of search queries in a heterogeneous network
is maximized if and only if traffic load through each node is proportional to its capacity. Our proposed system achieves this traffic distribution by biasing search walks
using the Metropolis-Hastings algorithm, without requiring any special underlying
topology. We then define two saturation metrics for measuring the performance of
overlay networks: one for quantifying their ability to support random walks and the
second for measuring their potential to handle the overhead caused by churn. Using
simulations, we finally compare our proposed method with Gia, an existing system
which uses topology adaptation, and find that the former performs better under all
studied conditions, both saturation metrics, and such end-to-end parameters as query
success rate, latency, and query-hits for various file replication schemes.
Advisors/Committee Members: Loguinov, Dmitri (advisor), Reddy, A. L. Narasimha (committee member), Bettati, Riccardo (committee member).
Subjects/Keywords: P2P; heterogeneous networks; random walks; Metropolis-Hastings algorithm
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):
Reddy, C. R. (2010). Capacity Proportional Unstructured Peer-to-Peer Networks. (Thesis). Texas A&M University. Retrieved from http://hdl.handle.net/1969.1/ETD-TAMU-2009-08-878
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
Chicago Manual of Style (16th Edition):
Reddy, Chandan Rama. “Capacity Proportional Unstructured Peer-to-Peer Networks.” 2010. Thesis, Texas A&M University. Accessed March 29, 2020.
http://hdl.handle.net/1969.1/ETD-TAMU-2009-08-878.
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
MLA Handbook (7th Edition):
Reddy, Chandan Rama. “Capacity Proportional Unstructured Peer-to-Peer Networks.” 2010. Web. 29 Mar 2020.
Vancouver:
Reddy CR. Capacity Proportional Unstructured Peer-to-Peer Networks. [Internet] [Thesis]. Texas A&M University; 2010. [cited 2020 Mar 29].
Available from: http://hdl.handle.net/1969.1/ETD-TAMU-2009-08-878.
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
Council of Science Editors:
Reddy CR. Capacity Proportional Unstructured Peer-to-Peer Networks. [Thesis]. Texas A&M University; 2010. Available from: http://hdl.handle.net/1969.1/ETD-TAMU-2009-08-878
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
Texas A&M University
21.
Wang, Xiaoming.
Robust and Scalable Sampling Algorithms for Network Measurement.
Degree: 2010, Texas A&M University
URL: http://hdl.handle.net/1969.1/ETD-TAMU-2009-08-2391
► Recent growth of the Internet in both scale and complexity has imposed a number of difficult challenges on existing measurement techniques and approaches, which are…
(more)
▼ Recent growth of the Internet in both scale and complexity has imposed a number of difficult challenges on existing measurement techniques and approaches, which
are essential for both network management and many ongoing research projects. For
any measurement algorithm, achieving both accuracy and scalability is very challenging given hard resource constraints (e.g., bandwidth, delay, physical memory, and
CPU speed). My dissertation research tackles this problem by first proposing a novel
mechanism called residual sampling, which intentionally introduces a predetermined
amount of bias into the measurement process. We show that such biased sampling
can be extremely scalable; moreover, we develop residual estimation algorithms that
can unbiasedly recover the original information from the sampled data. Utilizing
these results, we further develop two versions of the residual sampling mechanism:
a continuous version for characterizing the user lifetime distribution in large-scale
peer-to-peer networks and a discrete version for monitoring flow statistics (including
per-flow counts and the flow size distribution) in high-speed Internet routers. For the
former application in P2P networks, this work presents two methods: ResIDual-based
Estimator (RIDE), which takes single-point snapshots of the system and assumes
systems with stationary arrivals, and Uniform RIDE (U-RIDE), which takes multiple snapshots and adapts to systems with arbitrary (including non-stationary) arrival
processes. For the latter application in traffic monitoring, we introduce Discrete
RIDE (D-RIDE), which allows one to sample each flow with a geometric random variable. Our numerous simulations and experiments with P2P networks and real
Internet traces confirm that these algorithms are able to make accurate estimation
about the monitored metrics and simultaneously meet the requirements of hard resource constraints. These results show that residual sampling indeed provides an ideal
solution to balancing between accuracy and scalability.
Advisors/Committee Members: Loguinov, Dmitri (advisor), Bettati, Riccardo (committee member), Welch, Jennifer (committee member), Annapareddy, Narasimha (committee member).
Subjects/Keywords: Network measurement; sampling and estimation; peer-to-peer networks; lifetime distribution; traffic monitoring; flow size distribution
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):
Wang, X. (2010). Robust and Scalable Sampling Algorithms for Network Measurement. (Thesis). Texas A&M University. Retrieved from http://hdl.handle.net/1969.1/ETD-TAMU-2009-08-2391
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
Chicago Manual of Style (16th Edition):
Wang, Xiaoming. “Robust and Scalable Sampling Algorithms for Network Measurement.” 2010. Thesis, Texas A&M University. Accessed March 29, 2020.
http://hdl.handle.net/1969.1/ETD-TAMU-2009-08-2391.
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
MLA Handbook (7th Edition):
Wang, Xiaoming. “Robust and Scalable Sampling Algorithms for Network Measurement.” 2010. Web. 29 Mar 2020.
Vancouver:
Wang X. Robust and Scalable Sampling Algorithms for Network Measurement. [Internet] [Thesis]. Texas A&M University; 2010. [cited 2020 Mar 29].
Available from: http://hdl.handle.net/1969.1/ETD-TAMU-2009-08-2391.
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
Council of Science Editors:
Wang X. Robust and Scalable Sampling Algorithms for Network Measurement. [Thesis]. Texas A&M University; 2010. Available from: http://hdl.handle.net/1969.1/ETD-TAMU-2009-08-2391
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
Texas A&M University
22.
Ahn, Youngwoo.
Real-Time Task Scheduling under Thermal Constraints.
Degree: 2010, Texas A&M University
URL: http://hdl.handle.net/1969.1/ETD-TAMU-2010-08-8578
► As the speed of integrated circuits increases, so does their power consumption. Most of this power is turned into heat, which must be dissipated effectively…
(more)
▼ As the speed of integrated circuits increases, so does their power consumption.
Most of this power is turned into heat, which must be dissipated effectively in order
for the circuit to avoid thermal damage. Thermal control therefore has emerged as an
important issue in design and management of circuits and systems. Dynamic speed
scaling, where the input power is temporarily reduced by appropriately slowing down
the circuit, is one of the major techniques to manage power so as to maintain safe
temperature levels.
In this study, we focus on thermally-constrained hard real-time systems, where
timing guarantees must be met without exceeding safe temperature levels within the
microprocessor. Speed scaling mechanisms provided in many of today?s processors
provide opportunities to temporarily increase the processor speed beyond levels that
would be safe over extended time periods. This dissertation addresses the problem
of safely controlling the processor speed when scheduling mixed workloads with both
hard-real-time periodic tasks and non-real-time, but latency-sensitive, aperiodic jobs.
We first introduce the Transient Overclocking Server, which safely reduces the
response time of aperiodic jobs in the presence of hard real-time periodic tasks and
thermal constraints. We then propose a design-time (off-line) execution-budget allocation
scheme for the application of the Transient Overclocking Server. We show
that there is an optimal budget allocation which depends on the temporal character istics of the aperiodic workload. In order to provide a quantitative framework for the
allocation of budget during system design, we present a queuing model and validate
the model with results from a discrete-event simulator.
Next, we describe an on-line thermally-aware transient overclocking method to
reduce the response time of aperiodic jobs efficiently at run-time. We describe a modified
Slack-Stealing algorithm to consider the thermal constraints of systems together
with the deadline constraints of periodic tasks. With the thermal model and temperature
data provided by embedded thermal sensors, we compute slack for aperiodic
workload at run-time that satisfies both thermal and temporal constraints. We show
that the proposed Thermally-Aware Slack-Stealing algorithm minimizes the response
times of aperiodic jobs while guaranteeing both the thermal safety of the system and
the schedulability of the real-time tasks. The two proposed speed control algorithms
are examples of so-called proactive schemes, since they rely on a prediction of the
thermal trajectory to control the temperature before safe levels are exceeded.
In practice, the effectiveness of proactive speed control for the thermal management
of a system relies on the accuracy of the thermal model that underlies the
prediction of the effects of speed scaling and task execution on the temperature of
the processor. Due to variances in the manufacturing of the circuit and of the environment
it is to operate, an accurate thermal model can be gathered at deployment
time only. The…
Advisors/Committee Members: Annapareddy, Narasimha (advisor), Bettati, Riccardo (advisor), Shi, Weiping (committee member), Kundur, Deepa (committee member).
Subjects/Keywords: Real-Time; Task Scheduling; Thermal
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):
Ahn, Y. (2010). Real-Time Task Scheduling under Thermal Constraints. (Thesis). Texas A&M University. Retrieved from http://hdl.handle.net/1969.1/ETD-TAMU-2010-08-8578
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
Chicago Manual of Style (16th Edition):
Ahn, Youngwoo. “Real-Time Task Scheduling under Thermal Constraints.” 2010. Thesis, Texas A&M University. Accessed March 29, 2020.
http://hdl.handle.net/1969.1/ETD-TAMU-2010-08-8578.
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
MLA Handbook (7th Edition):
Ahn, Youngwoo. “Real-Time Task Scheduling under Thermal Constraints.” 2010. Web. 29 Mar 2020.
Vancouver:
Ahn Y. Real-Time Task Scheduling under Thermal Constraints. [Internet] [Thesis]. Texas A&M University; 2010. [cited 2020 Mar 29].
Available from: http://hdl.handle.net/1969.1/ETD-TAMU-2010-08-8578.
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
Council of Science Editors:
Ahn Y. Real-Time Task Scheduling under Thermal Constraints. [Thesis]. Texas A&M University; 2010. Available from: http://hdl.handle.net/1969.1/ETD-TAMU-2010-08-8578
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
Texas A&M University
23.
Deka, Sthiti.
A CPU-GPU Hybrid Approach for Accelerating Cross-correlation Based Strain Elastography.
Degree: 2011, Texas A&M University
URL: http://hdl.handle.net/1969.1/ETD-TAMU-2010-05-7908
► Elastography is a non-invasive imaging modality that uses ultrasound to estimate the elasticity of soft tissues. The resulting images are called 'elastograms'. Elastography techniques are…
(more)
▼ Elastography is a non-invasive imaging modality that uses ultrasound to estimate the elasticity of soft tissues. The resulting images are called 'elastograms'. Elastography techniques are promising as cost-effective tools in the early detection of pathological changes in soft tissues. The quality of elastographic images depends on the accuracy of the local displacement estimates. Cross-correlation based displacement estimators are precise and sensitive. However cross-correlation based techniques are computationally intense and may limit the use of elastography as a real-time diagnostic tool. This study investigates the use of parallel general purpose graphics processing unit (GPGPU) engines for speeding up generation of elastograms at real-time frame rates while preserving elastographic image quality. To achieve this goal, a cross-correlation based time-delay estimation algorithm was developed in C programming language and was profiled to locate performance blocks. The hotspots were addressed by employing software pipelining, read-ahead and eliminating redundant computations. The algorithm was then analyzed for parallelization on GPGPU and the stages that would map well to the GPGPU hardware were identified. By employing optimization principles for efficient memory access and efficient execution, a net improvement of 67x with respect to the original optimized C version of the estimator was achieved. For typical diagnostic depths of 3-4cm and elastographic processing parameters, this implementation can yield elastographic frame rates in the order of 50fps. It was also observed that all of the stages in elastography cannot be offloaded to the GPGPU for computation because some stages have sub-optimal memory access patterns. Additionally, data transfer from graphics card memory to system memory can be efficiently overlapped with concurrent CPU execution. Therefore a hybrid model of computation where computational load is optimally distributed between CPU and GPGPU was identified as an optimal approach to adequately tackle the speed-quality problem in real-time imaging. The results of this research suggest that use of GPGPU as a co-processor to CPU may allow generation of elastograms at real time frame rates without significant compromise in image quality, a scenario that could be very favorable in real-time clinical elastography.
Advisors/Committee Members: Righetti, Raffaella (advisor), Kundur, Deepa (committee member), Ji, Jim (committee member), Bettati, Riccardo (committee member).
Subjects/Keywords: elastography; GPGPU; accelerating; speedup; cross-correlation; ultrasound
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):
Deka, S. (2011). A CPU-GPU Hybrid Approach for Accelerating Cross-correlation Based Strain Elastography. (Thesis). Texas A&M University. Retrieved from http://hdl.handle.net/1969.1/ETD-TAMU-2010-05-7908
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
Chicago Manual of Style (16th Edition):
Deka, Sthiti. “A CPU-GPU Hybrid Approach for Accelerating Cross-correlation Based Strain Elastography.” 2011. Thesis, Texas A&M University. Accessed March 29, 2020.
http://hdl.handle.net/1969.1/ETD-TAMU-2010-05-7908.
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
MLA Handbook (7th Edition):
Deka, Sthiti. “A CPU-GPU Hybrid Approach for Accelerating Cross-correlation Based Strain Elastography.” 2011. Web. 29 Mar 2020.
Vancouver:
Deka S. A CPU-GPU Hybrid Approach for Accelerating Cross-correlation Based Strain Elastography. [Internet] [Thesis]. Texas A&M University; 2011. [cited 2020 Mar 29].
Available from: http://hdl.handle.net/1969.1/ETD-TAMU-2010-05-7908.
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
Council of Science Editors:
Deka S. A CPU-GPU Hybrid Approach for Accelerating Cross-correlation Based Strain Elastography. [Thesis]. Texas A&M University; 2011. Available from: http://hdl.handle.net/1969.1/ETD-TAMU-2010-05-7908
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
Texas A&M University
24.
Malave-Bonet, Javier.
A Benchmarking Platform For Network-On-Chip (NOC) Multiprocessor System-On- Chips.
Degree: 2012, Texas A&M University
URL: http://hdl.handle.net/1969.1/ETD-TAMU-2010-12-8662
► Network-on-Chip (NOC) based designs have garnered significant attention from both researchers and industry over the past several years. The analysis of these designs has focused…
(more)
▼ Network-on-Chip (NOC) based designs have garnered significant attention from both
researchers and industry over the past several years. The analysis of these designs has
focused on broad topics such as NOC component micro-architecture, fault-tolerant
communication, and system memory architecture. Nonetheless, the design of lowlatency,
high-bandwidth, low-power and area-efficient NOC is extremely complex due
to the conflicting nature of these design objectives. Benchmarks are an indispensable
tool in the design process; providing thorough measurement and fair comparison
between designs in order to achieve optimal results (i.e performance, cost, quality of
service).
This research proposes a benchmarking platform called NoCBench for evaluating
the performance of Network-on-chip. Although previous research has proposed standard
guidelines to develop benchmarks for Network-on-Chip, this work moves forward and
proposes a System-C based simulation platform for system-level design exploration. It
will provide an initial set of synthetic benchmarks for on-chip network interconnection
validation along with an initial set of standardized processing cores, NOC components,
and system-wide services.
The benchmarks were constructed using synthetic applications described by Task
Graphs For Free (TGFF) task graphs extracted from the E3S benchmark suite. Two
benchmarks were used for characterization: Consumer and Networking. They are
characterized based on throughput and latency. Case studies show how they can be used
to evaluate metrics beyond throughput and latency (i.e. traffic distribution).
The contribution of this work is two-fold: 1) This study provides a methodology
for benchmark creation and characterization using NoCBench that evaluates important
metrics in NOC design (i.e. end-to-end packet delay, throughput). 2) The developed
full-system simulation platform provides a complete environment for further benchmark
characterization on NOC based MpSoC as well as system-level design space
exploration.
Advisors/Committee Members: Mahapatra, Rabi N. (advisor), Bettati, Riccardo (committee member), Gratz, Paul (committee member).
Subjects/Keywords: Network-on-Chip; Benchmarking; System-on-Chip; Multicore; System C
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):
Malave-Bonet, J. (2012). A Benchmarking Platform For Network-On-Chip (NOC) Multiprocessor System-On- Chips. (Thesis). Texas A&M University. Retrieved from http://hdl.handle.net/1969.1/ETD-TAMU-2010-12-8662
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
Chicago Manual of Style (16th Edition):
Malave-Bonet, Javier. “A Benchmarking Platform For Network-On-Chip (NOC) Multiprocessor System-On- Chips.” 2012. Thesis, Texas A&M University. Accessed March 29, 2020.
http://hdl.handle.net/1969.1/ETD-TAMU-2010-12-8662.
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
MLA Handbook (7th Edition):
Malave-Bonet, Javier. “A Benchmarking Platform For Network-On-Chip (NOC) Multiprocessor System-On- Chips.” 2012. Web. 29 Mar 2020.
Vancouver:
Malave-Bonet J. A Benchmarking Platform For Network-On-Chip (NOC) Multiprocessor System-On- Chips. [Internet] [Thesis]. Texas A&M University; 2012. [cited 2020 Mar 29].
Available from: http://hdl.handle.net/1969.1/ETD-TAMU-2010-12-8662.
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
Council of Science Editors:
Malave-Bonet J. A Benchmarking Platform For Network-On-Chip (NOC) Multiprocessor System-On- Chips. [Thesis]. Texas A&M University; 2012. Available from: http://hdl.handle.net/1969.1/ETD-TAMU-2010-12-8662
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
Texas A&M University
25.
Liu, Sanmin.
Towards Privacy Preserving of Forensic DNA Databases.
Degree: 2012, Texas A&M University
URL: http://hdl.handle.net/1969.1/ETD-TAMU-2011-12-10337
► Protecting privacy of individuals is critical for forensic genetics. In a kinship/identity testing, related DNA profiles between user's query and the DNA database need to…
(more)
▼ Protecting privacy of individuals is critical for forensic genetics. In a kinship/identity testing, related DNA profiles between user's query and the DNA database need to be extracted. However, unrelated profiles cannot be revealed to each other. The challenge is today's DNA database usually contains millions of DNA profiles, which is too big to perform privacy-preserving query with current cryptosystem directly. In this thesis, we propose a scalable system to support privacy-preserving query in DNA Database. A two-phase strategy is designed: the first is a Short Tandem Repeat index tree for quick fetching candidate profiles from disk. It groups loci of DNA profiles by matching probability, so as to reduce I/O cost required to find a particular profile. The second is an Elliptic Curve Cryptosystem based privacy-preserving matching engine, which performs match between candidates and user's sample. In particular, a privacy-preserving DNA profile matching algorithm is designed, which achieves O(n) computing time and communication cost. Experimental results show that our system performs well at query latency, query hit rate, and communication cost. For a database of one billion profiles, it takes 80 seconds to return results to the user.
Advisors/Committee Members: Liu, Jyh-Charn (advisor), Bettati, Riccardo (committee member), Yuan, Shuhua (committee member).
Subjects/Keywords: Forensic DNA Database; Privacy Preserving
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):
Liu, S. (2012). Towards Privacy Preserving of Forensic DNA Databases. (Thesis). Texas A&M University. Retrieved from http://hdl.handle.net/1969.1/ETD-TAMU-2011-12-10337
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
Chicago Manual of Style (16th Edition):
Liu, Sanmin. “Towards Privacy Preserving of Forensic DNA Databases.” 2012. Thesis, Texas A&M University. Accessed March 29, 2020.
http://hdl.handle.net/1969.1/ETD-TAMU-2011-12-10337.
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
MLA Handbook (7th Edition):
Liu, Sanmin. “Towards Privacy Preserving of Forensic DNA Databases.” 2012. Web. 29 Mar 2020.
Vancouver:
Liu S. Towards Privacy Preserving of Forensic DNA Databases. [Internet] [Thesis]. Texas A&M University; 2012. [cited 2020 Mar 29].
Available from: http://hdl.handle.net/1969.1/ETD-TAMU-2011-12-10337.
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
Council of Science Editors:
Liu S. Towards Privacy Preserving of Forensic DNA Databases. [Thesis]. Texas A&M University; 2012. Available from: http://hdl.handle.net/1969.1/ETD-TAMU-2011-12-10337
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
Texas A&M University
26.
Mohan, Suneil.
Hardware Architecture for Semantic Comparison.
Degree: 2012, Texas A&M University
URL: http://hdl.handle.net/1969.1/ETD-TAMU-2012-05-10938
► Semantic Routed Networks provide a superior infrastructure for complex search engines. In a Semantic Routed Network (SRN), the routers are the critical component and they…
(more)
▼ Semantic Routed Networks provide a superior infrastructure for complex search engines. In a Semantic Routed Network (SRN), the routers are the critical component and they perform semantic comparison as their key computation. As the amount of information available on the Internet grows, the speed and efficiency with which information can be retrieved to the user becomes important. Most current search engines scale to meet the growing demand by deploying large data centers with general purpose computers that consume many megawatts of power. Reducing the power consumption of these data centers while providing better performance, will help reduce the costs of operation significantly.
Performing operations in parallel is a key optimization step for better performance on general purpose CPUs. Current techniques for parallelization include architectures that are multi-core and have multiple thread handling capabilities. These coarse grained approaches have considerable resource management overhead and provide only sub-linear speedup.
This dissertation proposes techniques towards a highly parallel, power efficient architecture that performs semantic comparisons as its core activity. Hardware-centric parallel algorithms have been developed to populate the required data structures followed by computation of semantic similarity. The performance of the proposed design is further enhanced using a pipelined architecture. The proposed algorithms were also implemented on two contemporary platforms such as the Nvidia CUDA and an FPGA for performance comparison. In order to validate the designs, a semantic benchmark was also been created. It has been shown that a dedicated semantic comparator delivers significantly better performance compared to other platforms.
Results show that the proposed hardware semantic comparison architecture delivers a speedup performance of up to 10
5 while reducing power consumption by 80% compared to traditional computing platforms. Future research directions including better power optimization, architecting the complete semantic router and using the semantic benchmark for SRN research are also discussed.
Advisors/Committee Members: Mahapatra, Rabi (advisor), Walker, Duncan M. (committee member), Bettati, Riccardo (committee member), Kundur, Deepa (committee member).
Subjects/Keywords: Semantic Comparison; Semantic Networks; Hardware Architecture; Parallel Algorithms
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):
Mohan, S. (2012). Hardware Architecture for Semantic Comparison. (Thesis). Texas A&M University. Retrieved from http://hdl.handle.net/1969.1/ETD-TAMU-2012-05-10938
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
Chicago Manual of Style (16th Edition):
Mohan, Suneil. “Hardware Architecture for Semantic Comparison.” 2012. Thesis, Texas A&M University. Accessed March 29, 2020.
http://hdl.handle.net/1969.1/ETD-TAMU-2012-05-10938.
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
MLA Handbook (7th Edition):
Mohan, Suneil. “Hardware Architecture for Semantic Comparison.” 2012. Web. 29 Mar 2020.
Vancouver:
Mohan S. Hardware Architecture for Semantic Comparison. [Internet] [Thesis]. Texas A&M University; 2012. [cited 2020 Mar 29].
Available from: http://hdl.handle.net/1969.1/ETD-TAMU-2012-05-10938.
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
Council of Science Editors:
Mohan S. Hardware Architecture for Semantic Comparison. [Thesis]. Texas A&M University; 2012. Available from: http://hdl.handle.net/1969.1/ETD-TAMU-2012-05-10938
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
Texas A&M University
27.
Sarma, Anurupa.
Quantum codes over Finite Frobenius Rings.
Degree: 2012, Texas A&M University
URL: http://hdl.handle.net/1969.1/ETD-TAMU-2012-08-11529
► It is believed that quantum computers would be able to solve complex problems more quickly than any other deterministic or probabilistic computer. Quantum computers basically…
(more)
▼ It is believed that quantum computers would be able to solve complex problems more quickly than any other deterministic or probabilistic computer. Quantum computers basically exploit the rules of quantum mechanics for speeding up computations. However, building a quantum computer remains a daunting task. A quantum computer, as in any quantum mechanical system, is susceptible to decohorence of quantum bits resulting from interaction of the stored information with the environment. Error correction is then required to restore a quantum bit, which has changed due to interaction with external state, to a previous non-erroneous state in the coding subspace. Until now the methods for quantum error correction were mostly based on stabilizer codes over finite fields. The aim of this thesis is to construct quantum error correcting codes over finite Frobenius rings. We introduce stabilizer codes over quadratic algebra, which allows one to use the hamming distance rather than some less known notion of distance. We also develop propagation rules to build new codes from existing codes. Non binary codes have been realized as a gray image of linear Z4 code, hence the most natural class of ring that is suitable for coding theory is given by finite Frobenius rings as it allow to formulate the dual code similar to finite fields. At the end we show some examples of code construction along with various results of quantum codes over finite Frobenius rings, especially codes over Zm.
Advisors/Committee Members: Klappenecker, Andreas (advisor), Bettati, Riccardo (committee member), Kish, Laszlo B. (committee member).
Subjects/Keywords: Quantum Computing; Frobenius Rings; Error correcting Codes; Codes over Rings; Stabilizer Codes; Non binary stabilizer codes
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):
Sarma, A. (2012). Quantum codes over Finite Frobenius Rings. (Thesis). Texas A&M University. Retrieved from http://hdl.handle.net/1969.1/ETD-TAMU-2012-08-11529
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
Chicago Manual of Style (16th Edition):
Sarma, Anurupa. “Quantum codes over Finite Frobenius Rings.” 2012. Thesis, Texas A&M University. Accessed March 29, 2020.
http://hdl.handle.net/1969.1/ETD-TAMU-2012-08-11529.
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
MLA Handbook (7th Edition):
Sarma, Anurupa. “Quantum codes over Finite Frobenius Rings.” 2012. Web. 29 Mar 2020.
Vancouver:
Sarma A. Quantum codes over Finite Frobenius Rings. [Internet] [Thesis]. Texas A&M University; 2012. [cited 2020 Mar 29].
Available from: http://hdl.handle.net/1969.1/ETD-TAMU-2012-08-11529.
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
Council of Science Editors:
Sarma A. Quantum codes over Finite Frobenius Rings. [Thesis]. Texas A&M University; 2012. Available from: http://hdl.handle.net/1969.1/ETD-TAMU-2012-08-11529
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
Texas A&M University
28.
Betts, Hutson.
Physical Resource Management and Access Mediation Within the Cloud Computing Paradigm.
Degree: 2012, Texas A&M University
URL: http://hdl.handle.net/1969.1/ETD-TAMU-2012-08-11819
► Cloud computing has seen a surge over the past decade as corporations and institutions have sought to leverage the economies-of-scale achievable through this new computing…
(more)
▼ Cloud computing has seen a surge over the past decade as corporations and institutions have sought to leverage the economies-of-scale achievable through this new computing paradigm. However, the rapid adoptions of cloud computing technologies that implement the existing cloud computing paradigm threaten to undermine the long-term utility of the cloud model of computing. In this thesis we address how to accommodate the variety of access requirements and diverse hardware platforms of cloud computing users by developing extensions to the existing cloud computing paradigm that afford consumer-driven access requirements and integration of new physical hardware platforms.
Advisors/Committee Members: Bettati, Riccardo (advisor), Stoleru, Radu (committee member), Reddy, A. L. Narasimha (committee member).
Subjects/Keywords: Cloud Computing; Access Mediation; Resource Management; Scaling
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):
Betts, H. (2012). Physical Resource Management and Access Mediation Within the Cloud Computing Paradigm. (Thesis). Texas A&M University. Retrieved from http://hdl.handle.net/1969.1/ETD-TAMU-2012-08-11819
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
Chicago Manual of Style (16th Edition):
Betts, Hutson. “Physical Resource Management and Access Mediation Within the Cloud Computing Paradigm.” 2012. Thesis, Texas A&M University. Accessed March 29, 2020.
http://hdl.handle.net/1969.1/ETD-TAMU-2012-08-11819.
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
MLA Handbook (7th Edition):
Betts, Hutson. “Physical Resource Management and Access Mediation Within the Cloud Computing Paradigm.” 2012. Web. 29 Mar 2020.
Vancouver:
Betts H. Physical Resource Management and Access Mediation Within the Cloud Computing Paradigm. [Internet] [Thesis]. Texas A&M University; 2012. [cited 2020 Mar 29].
Available from: http://hdl.handle.net/1969.1/ETD-TAMU-2012-08-11819.
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
Council of Science Editors:
Betts H. Physical Resource Management and Access Mediation Within the Cloud Computing Paradigm. [Thesis]. Texas A&M University; 2012. Available from: http://hdl.handle.net/1969.1/ETD-TAMU-2012-08-11819
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
Texas A&M University
29.
Kang, Seong-Ryong.
Performance analysis and network path characterization for scalable internet streaming.
Degree: 2008, Texas A&M University
URL: http://hdl.handle.net/1969.1/85912
► Delivering high-quality of video to end users over the best-effort Internet is a challenging task since quality of streaming video is highly subject to network…
(more)
▼ Delivering high-quality of video to end users over the best-effort Internet is a
challenging task since quality of streaming video is highly subject to network conditions. A fundamental issue in this area is how real-time applications cope with
network dynamics and adapt their operational behavior to offer a favorable streaming environment to end users.
As an effort towards providing such streaming environment, the first half of
this work focuses on analyzing the performance of video streaming in best-effort
networks and developing a new streaming framework that effectively utilizes unequal
importance of video packets in rate control and achieves a near-optimal performance
for a given network packet loss rate. In addition, we study error concealment methods
such as FEC (Forward-Error Correction) that is often used to protect multimedia
data over lossy network channels. We investigate the impact of FEC on the quality of
video and develop models that can provide insights into understanding how inclusion
of FEC affects streaming performance and its optimality and resilience characteristics
under dynamically changing network conditions.
In the second part of this thesis, we focus on measuring bandwidth of network
paths, which plays an important role in characterizing Internet paths and can benefit
many applications including multimedia streaming. We conduct a stochastic analysis of an end-to-end path and develop novel bandwidth sampling techniques that
can produce asymptotically accurate capacity and available bandwidth of the path
under non-trivial cross-traffic conditions. In addition, we conduct comparative performance study of existing bandwidth estimation tools in non-simulated networks
where various timing irregularities affect delay measurements. We find that when
high-precision packet timing is not available due to hardware interrupt moderation,
the majority of existing algorithms are not robust to measure end-to-end paths with
high accuracy. We overcome this problem by using signal de-noising techniques in
bandwidth measurement. We also develop a new measurement tool called PRC-MT
based on theoretical models that simultaneously measures the capacity and available
bandwidth of the tight link with asymptotic accuracy.
Advisors/Committee Members: Loguinov, Dmitri (advisor), Bettati, Riccardo (committee member), Choe, Yoonsuck (committee member), Reddy, Narasimha (committee member).
Subjects/Keywords: video streaming; bandwidth estimation; performance analysis; network
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):
Kang, S. (2008). Performance analysis and network path characterization for scalable internet streaming. (Thesis). Texas A&M University. Retrieved from http://hdl.handle.net/1969.1/85912
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
Chicago Manual of Style (16th Edition):
Kang, Seong-Ryong. “Performance analysis and network path characterization for scalable internet streaming.” 2008. Thesis, Texas A&M University. Accessed March 29, 2020.
http://hdl.handle.net/1969.1/85912.
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
MLA Handbook (7th Edition):
Kang, Seong-Ryong. “Performance analysis and network path characterization for scalable internet streaming.” 2008. Web. 29 Mar 2020.
Vancouver:
Kang S. Performance analysis and network path characterization for scalable internet streaming. [Internet] [Thesis]. Texas A&M University; 2008. [cited 2020 Mar 29].
Available from: http://hdl.handle.net/1969.1/85912.
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
Council of Science Editors:
Kang S. Performance analysis and network path characterization for scalable internet streaming. [Thesis]. Texas A&M University; 2008. Available from: http://hdl.handle.net/1969.1/85912
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
Texas A&M University
30.
Koo, Ja-Ryeong.
Global scheduling on temperature-constrained multiprocessor real-time systems.
Degree: 2008, Texas A&M University
URL: http://hdl.handle.net/1969.1/85913
► In this thesis, we study temperature-constrained multiprocessor real-time systems, where real-time guarantees must be met without exceeding safe temperature levels within the processors. We focus…
(more)
▼ In this thesis, we study temperature-constrained multiprocessor real-time systems,
where real-time guarantees must be met without exceeding safe temperature levels
within the processors. We focus on Pfair scheduling algorithms, especially ERfair
scheduling scheme (a work-conserving extension to Pfair scheduling) as our main
multiprocessor real-time scheduling methodology. Then, we study the benefits of
simple reactive speed scaling as described in the real-time multiprocessor systems.
In this thesis, in support of the temperature-awareness, we extend the applicability
of the reactive speed scaling to global scheduling schemes for multiprocessors. We
propose temperature-aware scheduling and processor selection schemes motivated by
existing (thermally non-optimal) ERfair scheduling in order to reduce thermal stress
and therefore increase the processor utilization. Then, we show that the proposed
algorithm and reactive scheme can enhance the processor utilization compared with
any constant speed scheme on real-time multiprocessor systems. Additionally, we
show how the maximum schedulable utilization (MSU) for partitioning heuristics can
be determined on the temperature-constrained multiprocessor real-time systems.
Advisors/Committee Members: Bettati, Riccardo (advisor), Mahapatra, Rabi N. (committee member), Sprintson, Alexander (committee member).
Subjects/Keywords: Temperature-constrained real-time system; multiprocessor real-time scheduling; reactive speed scaling; temperature-aware scheduling; schedulability analysis
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):
Koo, J. (2008). Global scheduling on temperature-constrained multiprocessor real-time systems. (Thesis). Texas A&M University. Retrieved from http://hdl.handle.net/1969.1/85913
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
Chicago Manual of Style (16th Edition):
Koo, Ja-Ryeong. “Global scheduling on temperature-constrained multiprocessor real-time systems.” 2008. Thesis, Texas A&M University. Accessed March 29, 2020.
http://hdl.handle.net/1969.1/85913.
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
MLA Handbook (7th Edition):
Koo, Ja-Ryeong. “Global scheduling on temperature-constrained multiprocessor real-time systems.” 2008. Web. 29 Mar 2020.
Vancouver:
Koo J. Global scheduling on temperature-constrained multiprocessor real-time systems. [Internet] [Thesis]. Texas A&M University; 2008. [cited 2020 Mar 29].
Available from: http://hdl.handle.net/1969.1/85913.
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
Council of Science Editors:
Koo J. Global scheduling on temperature-constrained multiprocessor real-time systems. [Thesis]. Texas A&M University; 2008. Available from: http://hdl.handle.net/1969.1/85913
Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation
◁ [1] [2] [3] [4] ▶
. 
Open Access Theses and Dissertations