harshdesa Goto Github PK

acn-project

In this project, you will implement an application layer multicast distribution system for a network environment as an extension to the system in Homework 1. The server (multicast-server) will be responsible for building and managing the multicast distribution tree structure.The server can support up to five multicast streams going toward proxies. Each proxy can support up to five streams going toward its local clients within their network and can support up to three multicast streams going to other proxies as their external children on the tree. When there is a sender (i.e., client) who want to send data to a multicast group, the sender will send its data to the proxy in its domain. The proxy then will forward this data to the multicast-server. The multicast server will then forward the data on the corresponding tree. All join and leave requests by the clients will be made to their proxies. When a proxy receives a join request from a client for a multicast group for which the proxy is not yet a member of, then the proxy will contact the server to graft on the corresponding multicast tree. If the proxy is already on the tree, then the proxy will include this new client into its children set as long as the proxy has extra bandwidth to support this child (remember the proxy can support up to five streams/children).

ai-homework-1

ai-homework1

This project is a C++ Project to draw a continuous line from A to other nodes( BFS and DFS implemented)

ai-project

Artificial Intelligence Project

aos-project-1

In this project, you have to design and implement a broadcast service in a distributed system. Assume a distributed system in which nodes are arranged in a c ertain topology (specified in a configuration file). Build a spanning tree using a distributed algorithm of your choice. (Feel free to design your own algorithm.) Once the spanning tree constr uction completes, each node should know which subset of its neighbors are also its tree neighbors . Use the spanning tree constructed above to implement a broad cast service that allows any node to send a message to all nodes in the system. The broadcast ser vice should inform the source node of the completion of the broadcast operation. For this proje ct, assume that only one broadcast operation can occur at any time

aos-project-2

Implement a mutual exclusion service using Raymond’s tree- based distributed mutual exclusion algorithm. You will need to use your spanning tree construct ion code of project 1 to build the initial tree used by the Raymond’s algorithm. Your service s hould provide two function calls to the application: cs-enter and cs-leave . The first function call cs-enter allows an application to request permission to start executing its critical section. The fun ction call is blocking and returns only when the invoking application can execute its critical sect ion. The second function call cs-leave allows an application to inform the service that it has finish ed executing its critical section.

blockchain

Adjudicating violations in data sharing agreements using Smart Contracts

blockchain2

blockchain2b

blockchain3

blockchain4

blockchain5

dbdesign

distributions

NodeSource Node.js Binary Distributions

march

project3

quorum-examples

Examples for Quorum

test

test-web-server-from-sgx

uid-project

uid-robot

Robot simulator