https://github.com/skpro-glitch/circuitswitching
Simulation of Circuit Switching in Java to find optimal set of paths for multiple data transfers using Dynamic Programming. - Soham Kapur, VIT Chennai
https://github.com/skpro-glitch/circuitswitching
circuit-switching computer-network computer-network-basics computer-networking computer-networking-and-internet-technologies computer-networking-lab computer-networks computer-networks-course computer-networks-lab computer-networks-project computer-science
Last synced: 2 months ago
JSON representation
Simulation of Circuit Switching in Java to find optimal set of paths for multiple data transfers using Dynamic Programming. - Soham Kapur, VIT Chennai
- Host: GitHub
- URL: https://github.com/skpro-glitch/circuitswitching
- Owner: SKpro-glitch
- Created: 2023-08-20T05:24:03.000Z (over 1 year ago)
- Default Branch: main
- Last Pushed: 2025-02-16T06:52:40.000Z (3 months ago)
- Last Synced: 2025-02-16T07:25:32.084Z (3 months ago)
- Topics: circuit-switching, computer-network, computer-network-basics, computer-networking, computer-networking-and-internet-technologies, computer-networking-lab, computer-networks, computer-networks-course, computer-networks-lab, computer-networks-project, computer-science
- Language: Java
- Homepage:
- Size: 30.3 KB
- Stars: 0
- Watchers: 1
- Forks: 1
- Open Issues: 0
-
Metadata Files:
- Readme: README.md
Awesome Lists containing this project
README
# CircuitSwitching
**PROJECT DETAILS**
**Authors** : Soham Kapur, Koushiki Sinha
**Year** : 2023
**Title** : Circuit Switching using Dynamic Programming
**Purpose** : Undergraduate Graded Project
**Course** : Computer Networks
**Problem Statement:** Simulation of Circuit Switching in Java to find optimal set of paths for multiple data transfers using Dynamic Programming.
**Description:**
- The program begins with a graph represented by an adjacency matrix with edge weights.
- Pairs of Source-Destination nodes are taken as input.
- It iterates all possible paths between the required source and destination nodes.
- The combinations of paths between each source-destination pair are compared to find the one with least maximum time.