Open Access. Powered by Scholars. Published by Universities.®

Digital Commons Network

Open Access. Powered by Scholars. Published by Universities.®

Theses

Theses/Dissertations

2006

Serverless systems

Articles 1 - 4 of 4

Full-Text Articles in Entire DC Network

Security In An Ad Hoc Network Using Many-To-Many Invocation, Jefferson Tuttle Jan 2006

Security In An Ad Hoc Network Using Many-To-Many Invocation, Jefferson Tuttle

Theses

There is an increasing need to secure electronic communication. This need is being met on workstations and servers, which have large amounts of memory, and a dedicated network connection. Securing communication in mobile devices is a relatively new research area, and has different requirements than workstations and servers. This project attempts to address these new requirements by incorporating security into the Many-to-Many Invocation (M2MI) library developed at the Rochester Institute of Technology (RIT). Specifically, this project addresses adding encryption and decryption of M2MI method invocations using session keys. It also addresses the methods of establishing and maintaining session keys based …


Tuple Board: A New Distributed Computing Paradigm For Mobile Ad Hoc Networks, Chaithanya Bondada Jan 2006

Tuple Board: A New Distributed Computing Paradigm For Mobile Ad Hoc Networks, Chaithanya Bondada

Theses

In this project, we introduce a new distributed computing paradigm called "tuple board" which is based on the tuple space abstraction originated by Gelernter and the blackboard architecture popular in distributed artificial intelligence. Most prominent implementations of tuple space systems including JavaSpaces and T-Spaces follow a centralized architecture where the space itself resides on a server, akin to a database server. Recently, researchers have attempted to develop decentralized architectures for tuple space systems. Some work includes LIME and PeerSpaces. In our opinion, the traditional implementation of tuple spaces is not well suited for ad hoc networks where devices frequently lose …


Mfs: M2mi File System, Ravi Bhatia Jan 2006

Mfs: M2mi File System, Ravi Bhatia

Theses

The M2MI File System is a Virtual File System designed for ad hoc networks. It uses M2MI/M2MP to perform ad hoc communication. The file system comprises of several file system instances spread across the network. Each file system instance furnishes a partial state, contributing to the complete structure of the file system. Hence MFS is a union of several file system instances collaborating with each other. The file system facilitates four file operations: ADD, REMOVE, LIST, and READ. The operation ADD allows a user to import a file from the local file system into MFS. It also permits the creation …


M2mimud, Robert Whitcomb Jan 2006

M2mimud, Robert Whitcomb

Theses

M2MIMud is a simple MUD (multi-user dungeon) type game that is designed to run on an ad hoc network of devices without the presence of any central server. It runs over Many-to-Many Invocation (M2MI), a distributed object system API that uses broadcasts and handles, rather than IP addresses, to communicate. Most existing multi-user computer games rely on a client-server architecture with a central server storing and maintaining the state of the game. In contrast, M2MIMud runs on an ad hoc network of devices with no central server. This paper describes M2MI and its use for serverless multi-user applications, discusses the …