Engineering Commons^™

Inference In Networking Systems With Designed Measurements, Chang Liu

Doctoral Dissertations

Networking systems consist of network infrastructures and the end-hosts have been essential in supporting our daily communication, delivering huge amount of content and large number of services, and providing large scale distributed computing. To monitor and optimize the performance of such networking systems, or to provide flexible functionalities for the applications running on top of them, it is important to know the internal metrics of the networking systems such as link loss rates or path delays. The internal metrics are often not directly available due to the scale and complexity of the networking systems. This motivates the techniques of inference …

A Holistic Approach To Lowering Latency In Geo-Distributed Web Applications, Shankaranarayanan Puzhavakath Narayanan

Open Access Dissertations

User perceived end-to-end latency of web applications have a huge impact on the revenue for many businesses. The end-to-end latency of web applications is impacted by: (i) User to Application server (front-end) latency which includes downloading and parsing web pages, retrieving further objects requested by javascript executions; and (ii) Application and storage server(back-end) latency which includes retrieving meta-data required for an initial rendering, and subsequent content based on user actions.

Improving the user-perceived performance of web applications is challenging, given their complex operating environments involving user-facing web servers, content distribution network (CDN) servers, multi-tiered application servers, and storage servers. Further, …

Synchronous Subgraphs In Networks, Navita Jain

Legacy Theses & Dissertations (2009 - 2024)

Community detection is a central problem in network analysis. The majority of existing work defines communities as subsets of nodes that are structurally well-connected and isolated from the rest of the network. Apart from their underlying connectivity, nodes in real-world networks exhibit temporal activity: user posts in social networks, browsing activity on web pages and neuron activations in brain networks to name a few. While edges encode potential for community interactions, participation in the community can be quantified by synchronized member activity. Given both the network structure and individual node activity, how can we detect communities that are both well-connected …

An Energy-Efficient, Time-Constrained Scheduling Scheme In Local Mobile Cloud, Ting Shi

UNLV Theses, Dissertations, Professional Papers, and Capstones

Mobile devices have limited resource, such as computation performance and battery life. Mobile cloud computing is gaining popularity as a solution to overcome these resource limitations by sending heavy computation to resourceful servers and receiving the results from these servers. Local mobile clouds comprised of nearby mobile devices are proposed as a better solution to support real-time applications. Since network bandwidth and computational resource is shared among all the mobile devices, a scheduling scheme is needed to ensure that multiple mobile devices can efficiently offload tasks to local mobile clouds, satisfying the tasks' time constraint while keeping low-energy consumption. Two …

Snail Algorithm For Task Allocation In Mesh Networks, Bartosz Duszel

UNLV Theses, Dissertations, Professional Papers, and Capstones

Topic of this master's thesis is connected with task allocation algorithms and mesh networks. Author of this work has already graduated from Wroclaw, University of Technology (Poland) where during his studies he created software simulation environment for two different task allocation algorithms for mesh networks:Adaptive ScanandFrame Sliding. Those algorithms were compared by two, main parame- ters: simulation time and average mesh fulfillment (utilization level). All simulations were done in software environment which was developed specially for that research. This application was based on few, different types of objects: task (width, height, processing time), task queue (different number of tasks), task …

An Efficient Algorithm To Solve High-Dimensional Data Clustering: Candidate Subspace Clustering Algorithm, Chin-Chieh Kao

Theses Digitization Project

For this project, a comprehensive literature review on high dimensional data clustering is conducted and a novel density-algorithm to perform high dimensional data clustering is developed.

A Distributed Network Logging Topology, Nicholas E. Fritts

Theses and Dissertations

Network logging is used to monitor computer systems for potential problems and threats by network administrators. Research has found that the more logging enabled, the more potential threats can be detected in the logs (Levoy, 2006). However, generally it is considered too costly to dedicate the manpower required to analyze the amount of logging data that it is possible to generate. Current research is working on different correlation and parsing techniques to help filter the data, but these methods function by having all of the data dumped in to a central repository. Central repositories are limited in the amount of …

Route Recovery Schemes For Link And Node Failure And Link Congestion, Ibrahim Takouna

Theses

Link/Node failure occurs frequently causing service disruption in computer networks. Hardware techniques have been developed to protect the network from Link/Node failure. These techniques work in physical layer, therefore their convergence time is very small. On the other hand, many schemes have been proposed to mitigate the failure influence on the network. These schemes work in upper layers such as the network layer. However, hardware solutions faster than other schemes, but they are expensive. Link/Node failure causes all flows which were using the failed link/node are temporarily interrupted till a new path reestablished.

Three recovery algorithms have been proposed that …

Securing The Aodv Protocol Using Specification-Based Intrusion Detection, Hoda Mamdouh Hassan

Archived Theses and Dissertations

[Abstract not provided]

Adaptive Turn-Prohibition Routing Algorithm For The Networks Of Workstations, Amey Bhaskar Shevtekar

Theses

Deadlock occurrence is a critical problem for any computer network. Various solutions have been proposed over last two decades to solve problem of deadlocks in networks using different routing schemes, like up/down routing algorithm used in Myrinet switches. However, most of existing approaches for deadlock-free routing either try to eliminate any possibility of deadlock occurrence, which can result in putting extra restrictions on the routing in the networks or put no restrictions on routing, which leads to other approach namely deadlock recovery. In this thesis emphasis is on developing hybrid approach for routing in wormhole networks, wherein some prohibition is …

Soft Fault Detection Using Mibs In Computer Networks, Sachin Arora

Theses

To improve network reliability and management in today's high-speed communication system, a statistical anomaly network intrusion detection system (NIDS) has been investigated, for network soft faults using the Management Information Base (Mm) traffic parameters provided by Simple Network Management Protocol (SNMP), for both wired and wireless networks. The work done would be a contribution to a system to be designed MIB Anomaly Intrusion Detection, a hierarchical multi-tier and multiobservation-window Anomaly Intrusion Detection system. The data was derived from many experiments that had been carried out in the test bed that monitored 27 MIB traffic parameters simultaneously, focusing on the soft …

Reduction Of False Positives In Fault Detection System Using A Low Pass Data Filter, Ranjit Salunkhe

Theses

Network traffic is bursty in nature and exhibits the property of self-similarity, the degree of which is measured by the Hurst parameter. Now, in any network there is always the possibility of the occurrence of fault traffic that can be caused due to faults or malfunction of a network component. Fault Detection Systems that check for traffic anomalies can trigger off an alert on the detection of any traffic behavior that deviates from normal. Such deviation is usually caused when a fault occurs. But in network traffic sudden bursts may occur due to the inherent behavior of a network application. …

Wireless Local Area Network Security : An Investigation Into Security Tool Usage In Wireless Networks, Susan Webb

Theses : Honours

Many organisations and individuals installing wireless local area networks (WLANs), which are based on the IEEE 802.11 b standard, have little understanding of the security issues that surround this technology.

This study was initiated to determine how WLAN security issues affect organisations in Perth, Western Australia. The scope of the study was restricted to 802.llb WLANs operating in infrastructure mode, where all traffic is transmitted by wireless access points (APs). This study was conducted in two phases. The general aims of the first phase were to determine the number of detectable WLANs in the Perth Central Business District (CBD) and …

Determining The Effectiveness Of Deceptive Honeynets, Nirbhay Gupta

Theses: Doctorates and Masters

Over the last few years, incidents of network based intrusions have rapidly increased, due to the increase and popularity of various attack tools easily available for download from the Internet. Due to this increase in intrusions, the concept of a network defence known as Honeypots developed. These honeypots are designed to ensnare attackers and monitor their activities. Honeypots use the principles of deception such as masking, mimicry, decoying, inventing, repackaging and dazzling to deceive attackers. Deception exists in various forms. It is a tactic to survive and defeat the motives of attackers. Due to its presence in the nature, deception …

Multicast Algorithms For Mobile Satellite Communication Networks, Ryan W. Thomas

Theses and Dissertations

With the rise of mobile computing and an increasing need for ubiquitous high speed data connections, Internet-in-the-sky solutions are becoming increasingly viable. To reduce the network overhead of one-to-many transmissions, the multicast protocol has been devised. The implementation of multicast in these Low Earth Orbit (LEO) constellations is a critical component to achieving an omnipresent network environment. This research examines the system performance associated with two terrestrial-based multicast mobility solutions, Distance Vector Multicast Routing Protocol (DVMRP) with mobile IP and On Demand Multicast Routing Protocol (ODMRP). These protocols are implemented and simulated in a six plane, 66 satellite LEO constellation. …

Security In Mobile Agent Systems: An Approach To Protect Mobile Agents From Malicious Host Attacks, Dalia Fakhry

Archived Theses and Dissertations

Mobile agents are autonomous programs that roam the Internet from machine to machine under their own control on behalf of their users to perform specific pre-defined tasks. In addition to that, a mobile agent can suspend its execution at any point; transfer itself to another machine then resume execution at the new machine without any loss of state. Such a mobile model can perform many possible types of operations, and might carry critical data that has to be protected from possible attacks. The issue of agent security and specially agent protection from host attacks has been a hot topic and …

Bandwidth Management And Quality Of Service, Adalbert Engel

Theses: Doctorates and Masters

With the advent of bandwidth-hungry video and audio applications, demand for bandwidth is expected to exceed supply. Users will require more bandwidth and, as always, there are likely to be more users. As the Internet user base becomes more diverse, there is an increasing perception that Internet Service Providers (ISPs) should be able to differentiate between users, so that the specific needs of different types of users can be met. Differentiated services is seen as a possible solution to the bandwidth problem. Currently, however, the technology used on the Internet differentiates neither between users, nor between applications. The thesis focuses …

A Comparative Analysis Of Networks Of Workstations And Massively Parallel Processors For Signal Processing, David C. Gindhart

Theses and Dissertations

The traditional approach to parallel processing has been to use Massively Parallel Processors (MPPs). An alternative design is commercial-off-the-shelf (COTS) workstations connected to high-speed networks. These networks of workstations (NOWs) typically have faster processors, heterogeneous environments, and most importantly, offer a lower per node cost. This thesis compares the performance of MPPs and NOWs for the two-dimensional fast Fourier transform (2-D FFT). Three original, high-performance, portable 2-D FFTs have been implemented: the vector-radix, row-column and pipeline. The performance of these algorithms was measured on the Intel Paragon, IBM SP2 and the AFIT NOW, which consists of 6 Sun Ultra workstations …

Spider: An Overview Of An Object-Oriented Distributed Computing System, Han-Sheng Yuh

Theses Digitization Project

The Spider Project is an object-oriented distributed system which provides a testbed for researchers in the Department of Computer Science, CSUSB, to conduct research on distributed systems.

Computer Networks And The Teaching Of English As A Second Language: How Networks Affect Second Language Acquisition, Kirstin J. Reed-Perez

English Theses & Dissertations

No abstract provided.