Physical Sciences and Mathematics Commons^™

Keynote: Emerging Era Of Cooperative Empowerment: Grid, Peer-To-Peer, And Community Computing, Dr. Javed I. Khan

International Conference on Information and Communication Technologies

In this paper we discuss an emerging trend in high performance computing-the social or community computing. The emergence of screensaver computing, grid computing, peer-to-peer systems, and their demonstrated ability to garner computing power as potent as the supercomputers seems to be auspicious. In this paper we discuss the new phenomenon of community computing-including their potential applications in solving a new set of grand challenge problems. We also discuss the previously uncharted technological challenges architects of these new paradigms are addressing.

Secured Network Model For Management Information System Based On Ip Security (Ipsec) Encryption Using Multilayered Approach Of Network Security, Dr. Amir Hassan Pathan, Muniza Irshad

International Conference on Information and Communication Technologies

Secured flow of information through the network and play important role in the management information systems. In this paper I describe Secured Network Model For Corporate & Business Organization In Based On Network Level IP Security (IPSec) Encryption & Its Physical Layout Using Multilayered Approach. I have four important considerations for adoption of secured network model as secured network model for management information system.

A Survey On Intrusion Detection Approaches, A Murali M. Rao

International Conference on Information and Communication Technologies

Intrusion detection plays one of the key roles in computer security techniques and is one of the prime areas of research. Usages of computer network services are tremendously increasing day by day and at the same time intruders are also playing a major role to deny network services, compromising the crucial services for Email, FTP and Web. Realizing the importance of the problem due to intrusions, many researchers have taken up research in this area and have proposed several solutions. It has come to a stage to take a stock of the research results and project a comprehensive view so …

Latency-Driven Distribution: Infrastructure Needs Of Participatory Entertainment Applications, Farzad Safaei, P. Boustead, C. D. Nguyen, J. Brun, M. Dowlatshahi

Faculty of Informatics - Papers (Archive)

This article evaluates network and server infrastructure requirements to support real-time flows associated with networked entertainment applications. These include the state information flow to update the status of the virtual environment and immersive communication flows such as voice, video, gesture, and haptics communication. The article demonstrates that scaling these applications to large geographical spreads of participants requires distribution of computation to meet the latency constraints of the applications. This latency-driven distribution of computation is essential even when there are no limitations on the availability of computational resources in one location. The article provides detailed results on distributed server architectures for …

A Novel Distributed Denial-Of-Service Detection Algorithm, Brett Tsudama

Master's Theses

The applicability of implementing Ratio-based SYN Flood Detection (RSD) on a network processor is explored, and initial results are presented.

Discovering The Potential For Advancements In Intrusion Detection Systems, Kenneth J. Buonforte

Honors Theses

An intrusion detection system (IDS) is a collection of monitors strategically placed on a network or individual host in order to detect anomalous behavior. Since James Anderson introduced one of the first frameworks for an intrusion detection system in [1]. researchers have extended the capabilities of these systems. IDSs take many forms, from systems as basic as command line audit logs to those that emulate the defense mechanisms of the human immune system. However, as intrusion detection has evolved, scientists and administrators alike are beginning to question the need for this technology due to its lack of quantifiable performance and …

An Analysis Of The Performance And Security Of J2sdk 1.4 Jsse Implementation Of Ssl/Tls, Danny R. Bias

Theses and Dissertations

The Java SSL/TLS package distributed with the J2SE 1.4.2 runtime is a Java implementation of the SSLv3 and TLSv1 protocols. Java-based web services and other systems deployed by the DoD will depend on this implementation to provide confidentiality, integrity, and authentication. Security and performance assessment of this implementation is critical given the proliferation of web services within DoD channels. This research assessed the performance of the J2SE 1.4.2 SSL and TLS implementations, paying particular attention to identifying performance limitations given a very secure configuration. The performance metrics of this research were CPU utilization, network bandwidth, memory, and maximum number of …

A Heuristic On The Rearrangeability Of Shuffle-Exchange Networks, Katherine Yvette Alston

Theses Digitization Project

The algorithms which control network routing are specific to the network because the algorithms are designed to take advantage of that network's topology. The "goodness" of a network includes such criteria as a simple routing algorithm and a simple routing algorithm would increase the use of the shuffle-exchange network.

An Experimental Study On Network Intrusion Detection Systems, Peng Fu

Theses

A signature database is the key component of an elaborate intrusion detection system. The efficiency of signature generation for an intrusion detection system is a crucial requirement because of the rapid appearance of new attacks on the World Wide Web. However, in the commercial applications, signature generation is still a manual process, which requires professional skills and heavy human effort. Knowledge Discovery and Data Mining methods may be a solution to this problem. Data Mining and Machine Learning algorithms can be applied to the network traffic databases, in order to automatically generate signatures.

The purpose of this thesis and the …

A Multi-Agent Architecture For Internet Distributed Computing System, Rodelyn Reyes Samson

Theses Digitization Project

This thesis presents the developed taxonomy of the agent-based distributed computing systems. Based on this taxonomy, a design, implementation, analysis and distribution protocol of a multi-agent architecture for internet-based distributed computing system was developed. A prototype of the designed architecture was implemented on Spider III using the IBM Aglets software development kit (ASDK 2.0) and the language Java.

A Deception Based Framework For The Application Of Deceptive Countermeasures In 802.11b Wireless Networks, Suen Yek

Theses : Honours

The advance of 802.11 b wireless networking has been beset by inherent and in-built security problems. Network security tools that are freely available may intercept network transmissions readily and stealthily, making organisations highly vulnerable to attack. Therefore, it is incumbent upon defending organisations to take initiative and implement proactive defences against common network attacks. Deception is an essential element of effective security that has been widely used in networks to understand attack methods and intrusions. However, little thought has been given to the type and the effectiveness of the deception. Deceptions deployed in nature, the military and in cyberspace were …

Multi-Level Modeling Of Software On Hardware In Concurrent Computation, Joann M. Paul, Arne Suppe, Henele I. Adams, Donald E. Thomas

Research Collection School Of Computing and Information Systems

The fundamental modeling differences between hardware and software modeling can be thought of as reasoning about connectedness vs. reasoning about interleaved (shared) access to resources. A natural design hierarchy for physical systems is component-based because of the existence of a consistent basis for interconnect between design levels. However, performance modeling and design of concurrent, programmable systems require new ways of thinking about what it means to abstract detail, add detail and partition a model of software executing on hardware. We motivate frequency interleaving (FI) as a common simulation foundation for these systems because it resolves flow and partitioning with software …

Self-Similarity In Network Traffic, Francisco Chinchilla

Honors Theses

It is critical to properly understand the nature of network traffic in order to effectively design models describing network behavior. These models are usually used to simulate network traffic, which in turn are used to construct congestion control techniques, perform capacity planning studies, and/or evaluate the behavior of new protocols. Using the wrong models could lead to potentially serious problems such as delayed packet transmissions or an increase in packet drop rates.

Traditionally, packet arrivals were assumed to follow a Poisson arrival process. Although Poisson processes have several properties that make them easy to work with, they do not accurately …

Categorizing Network Attacks Using Pattern Classification Algorithms, George E. Noel Iii

Theses and Dissertations

The United States Air Force relies heavily on computer networks for many day-to-day activities. Many of these networks are affected by various types of attacks that can be launched from anywhere on the globe. The rising prominence of organizations such as the AFCERT and the MAJCOM NOSCs is evidence of an increasing realization among the Air Force leadership that protecting our computer networks is vitally important. A critical requirement for protecting our networks is the ability to detect attacks and intrusion attempts. This research is an effort to refine a portion of an AFIT-developed intrusion detection system known as the …

Autoconfiguration, Registration And Mobility Management For Pervasive Computing, Archan Misra, Subir Das, Anthony Mcauley, Sajal K. Das

Research Collection School Of Computing and Information Systems

In the vision of pervasive computing, users will exchange information and control their environments from anywhere using various wireline/wireless networks and computing devices. We believe that current protocols, such as DHCP, PPP, and Mobile IP, must be enhanced to support pervasive network access. In particular, this article identifies three fundamental functions: autoconfiguration, registration, and mobility management, that need such enhancements. Realizing that the IP autoconfiguration capabilities must be extended to configure routers and large dynamic networks, we first describe our autoconfiguration solution based on the dynamic configuration and distribution protocol (DCDP). Second, we discuss why providing user-specific services over a …

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. …

Spider Ii: A Component-Based Distributed Computing System, Koping Wang

Theses Digitization Project

Spider II system is the second version implementation of the Spider project. This system is the first distributed computation research project in the Department of Computer Science at CSUSB. Spider II is a distributed virtual machine on top of the UNIX or LINUX operating system. Spider II features multi-tasking, load balancing and fault tolerance, which optimize the performance and stability of the system.

Rate-Matching Packet Scheduler For Real-Rate Applications, Kang Li, Jonathan Walpole, Dylan Mcnamee, Calton Pu, David Steere

Computer Science Faculty Publications and Presentations

A packet scheduler is an operating system component that controls the allocation of network interface bandwidth to outgoing network flows. By deciding which packet to send next, packet schedulers not only determine how bandwidth is shared among flows, but also play a key role in determining the rate and timing behavior of individual flows. The recent explosion of rate and timing-sensitive flows, particularly in the context of multimedia applications, has focused new interest on packet schedulers. Next generation packet schedulers must not only ensure separation among flows and meet real-time performance constraints, they must also support dynamic fine-grain reallocation of …

3d Outside Cell Interference Factor For An Air-Ground Cdma ‘Cellular’ System, David W. Matolak

Faculty Publications

We compute the outside-cell interference factor of a code-division multiple-access (CDMA) system for a three-dimensional (3-D) air-to-ground (AG) "cellular-like" network consisting of a set of uniformly distributed ground base stations and airborne mobile users. The CDMA capacity is roughly inversely proportional to the outside-cell interference factor. It is shown that for the nearly free-space propagation environment of these systems, the outside-cell interference factor can be larger than that for terrestrial propagation models (as expected) and depends approximately logarithmically upon both the cell height and cell radius.

An Investigation On Sun Microsystems Jini Technology, Ferdina D. Soeyadi

Theses : Honours

Sun Microsystems introduced the Jini^TM Technology as its vision of the future in networking, where services can be registered dynamically and he used easily regardless of their location in the network. This is an investigation of feasibility on such claims made by Sun regarding Jini^TM and comparisons with the directly similar Universal Plug and Play from Microsoft. The aim is to implement a simple application of the Jini^TM Technology in order to demonstrate its capabilities as a contribution to the distributed computing research.

Protocols For Packet Switched Communication And Reliable Multicasting In Fully-Dynamic Multi-Hop Wireless Networks, James Pelech

Theses

Designing protocols for a fully dynamic wireless packet switched networks pose unique challenges due to the constantly changing topology of the network. A set of protocols is presented that are capable of handling a fully dynamic wireless network in which switching centers and base stations are mobile as well as the end users. The protocols provide basic message delivery, network routing information updates, and support for reliable multicasting.

There are four contributions of this work: (i) a hierarchical architecture for a fully dynamic wireless network, (ii) improved routing and update protocols with reduced control traffic, (iii) a method to provide …

Task Scheduling In Networks, Cynthia Phillips, Clifford Stein, Joel Wein

Dartmouth Scholarship

Scheduling a set of tasks on a set of machines so as to yield an efficient schedule is a basic problem in computer science and operations research. Most of the research on this problem incorporates the potentially unrealistic assumption that communication between the different machines is instantaneous. In this paper we remove this assumption and study the problem of network scheduling, where each job originates at some node of a network, and in order to be processed at another node must take the time to travel through the network to that node.

Our main contribution is to give approximation algorithms …

A Specific Network Link And Path Likelihood Prediction Tool, Gary K. Moy

Theses and Dissertations

Communications have always been a crucial part of any military operation. As the pace of warfare and the technological complexity of weaponry have increased, so has the need for rapid information to assess battlefield conditions. Message passing across a network of communication nodes allowed commanders to communicate with their forces. It is clear that an accurate prediction of communication usage through a network will provide commanders with useful intelligence of friendly and unfriendly activities. Providing a specific network link and path likelihood prediction tool gives strategic military commanders additional intelligence information and enables them to manage their limited resources more …

Mist: Pvm With Transparent Migration And Checkpointing, Jeremy Casas, Dan Clark, Phil Galbiati, Ravi Konuru, Steve Otto, Robert Prouty, Jonathan Walpole

Computer Science Faculty Publications and Presentations

We are currently involved in research to enable PVM to take advantage of shared networks of workstations (NOWs) more effectively. In such a computing environment, it is important to utilize workstations unobtrusively and recover from machine failures. Towards this goal, we have enhanced PVM with transparent task migration, checkpointing, and global scheduling. These enhancements are part of the MIST project which takes an open systems approach in developing a cohesive, distributed parallel computing environment. This open systems approach promotes plug-and-play integration of independently developed modules, such as Condor, DQS, A VS, Prospero, XPVM, PIOUS, Ptools, etc. Transparent task migration, in …

Mpvm: A Migration Transparent Version Of Pvm, Jeremy Casas, Dan Clark, Ravi Konuru, Steve Otto, Robert Prouty, Jonathan Walpole

Computer Science Faculty Publications and Presentations

Parallel Virtual Machine (PVM) is a widely-used software system that allows a heterogeneous set of parallel and serial UNIX-based computers to be programmed as a single message-passing parallel machine, In this paper, an extension to PVM to support dynamic process migration is presented. Support for migration is important in general-purpose workstation environments since it allows parallel computations to co-exist with other applications, using idle-cycles as they become available and off-loading from workstations when they are no longer free. A description and evaluation of the design and implementation of the prototype Migratable PVM system is presented together with some performance results.

Assessing The Vulnerability Of Multi-Commodity Networks With Failing Components, Alan R. Robinson

Theses and Dissertations

This research proposes an analytical approach for assessing flow disturbance, or compromise, based on limited sampling of arc flow information in multi-commodity, or multiple origin-destination O-D, networks with failing arcs. There were three objectives established for this research. The first objective was to bound the expected flow, given the arcs fail with certain probabilities, which was accomplished by reviewing current approaches for single-commodity networks and extending the results to the multi-commodity case. The second objective was to determine the best placement of flow monitors to obtain the most accurate estimates of O-D pair volumes. This was accomplished using a multi-criteria …

A Comparison Of Queueing, Cluster And Distributed Computing Systems, Joseph A. Kaplan, Michael L. Nelson

Computer Science Faculty Publications

Using workstation clusters for distributed computing has become popular with the proliferation of inexpensive, powerful workstations. Workstation clusters offer both a cost effective alternative to batch processing and an easy entry into parallel computing. However, a number of workstations on a network does not constitute a cluster. Cluster management software is necessary to harness the collective computing power. A variety of cluster management and queuing systems are compared: Distributed Queueing Systems (DQS), Condor, Load Leveler, Load Balancer, Load Sharing Facility (LSF - formerly Utopia), Distributed Job Manager (DJM), Computing in Distributed Networked Environments (CODINE), and NQS/Exec. The systems differ in …

Work-Preserving Real-Time Emulation Of Meshes On Butterfly Networks, Alf-Christian Achilles

Theses

The emulation of a guest network G on a host network H is work-preserving and real-time if the inefficiency, that is the ratio W_G/W_H of the amounts of work done in both networks, and the slowdown of the emulation are O(1).

In this thesis we show that an infinite number of meshes can be emulated on a butterfly in a work-preserving real-time manner, despite the fact that any emulation of an s x s-node mesh in a butterfly with load 1 has a dilation of Ω(logs).

The recursive embedding of a mesh in a butterfly presented by …

Air Force Rotc At The University Of Richmond, 1951-1957, Robert J. Dandridge

Honors Theses

In the summer of 1950, after the seriousness of the Korean conflict had become evident, a special committee appointed three years earlier by the Executive Committee of the Board of Trustees was reactivated for the purpose of considering "the feasibility of applying for a Reserve Office Training Corps unit" for the University of Richmond. This special committee, called the ROTC Committee, after thorough study, rendered a unanimous recommendation to the Board that a unit of Army ROTC be applied for. The application was completed and mailed to the Department of the Army. Approval of the application was not long in …