Data

Tools

Indexes

Applications

Experiments

Open Source Science

https://github.com/0xjepsen/openflowsdn

Shortest path configurations for software defined networking in OpenFlow

https://github.com/0xjepsen/openflowsdn

Science Score: 13.0%

This score indicates how likely this project is to be science-related based on various indicators:

  • ○
    CITATION.cff file
  • ✓
    codemeta.json file
    Found codemeta.json file
  • ○
    .zenodo.json file
  • ○
    DOI references
  • ○
    Academic publication links
  • ○
    Academic email domains
  • ○
    Institutional organization owner
  • ○
    JOSS paper metadata
  • ○
    Scientific vocabulary similarity
    Low similarity (5.3%) to scientific vocabulary
Last synced: 9 months ago · JSON representation

Repository

Shortest path configurations for software defined networking in OpenFlow

Basic Info
  • Host: GitHub
  • Owner: 0xJepsen
  • Language: Java
  • Default Branch: master
  • Size: 14.6 KB
Statistics
  • Stars: 0
  • Watchers: 1
  • Forks: 0
  • Open Issues: 0
  • Releases: 0
Created over 4 years ago · Last pushed over 4 years ago
Metadata Files
Readme

README.md

OpenFlowSDN

How far I got

  • My program Compiles

  • I was able to get pingall working on a single,3 topology

  • After many excruciating hours, I was able to get my program working for all of the tested static topologies except the mesh,5 topology. The mesh five topology gives a null pointer error on a floodlight module operating outside of my code. I have been trying to figure out why but haven't located the error as it is referenced in a separate module.

  • I tested link s1 s2 down on the someloops topology with success. I also brought a host offline on the same topology and received expected behavior for dynamic configurations.

Changes I made

  • At the beginning of the file, I built four helper methods buildRules, destroyRules, buildAllRules, destroyAllRules to make my life easier these methods essentially erase and install rules by iterating through the relevant switches and hosts, they have comments explaining what they do.

  • I also wrote a shortest path method I call Dijkstra, which calls shortestPath, which calls BFS BFS is a Breadth-First Search algorithm, and shortest path calculates the shortest path from the pred and distance hashmaps populated in BFS. All of my methods of finding the shortest path are based off of this resource here

  • I then call the corresponding helper methods in each of the TODO sections.

Owner

  • Name: Jepsen ✨
  • Login: 0xJepsen
  • Kind: user
  • Location: Somewhere in meatspace

Creating Biodigital Jazz

GitHub Events

Total
Last Year

Issues and Pull Requests

Last synced: about 1 year ago

All Time
  • Total issues: 0
  • Total pull requests: 0
  • Average time to close issues: N/A
  • Average time to close pull requests: N/A
  • Total issue authors: 0
  • Total pull request authors: 0
  • Average comments per issue: 0
  • Average comments per pull request: 0
  • Merged pull requests: 0
  • Bot issues: 0
  • Bot pull requests: 0
Past Year
  • Issues: 0
  • Pull requests: 0
  • Average time to close issues: N/A
  • Average time to close pull requests: N/A
  • Issue authors: 0
  • Pull request authors: 0
  • Average comments per issue: 0
  • Average comments per pull request: 0
  • Merged pull requests: 0
  • Bot issues: 0
  • Bot pull requests: 0
View more stats
Top Authors
Issue Authors
Pull Request Authors
Top Labels
Issue Labels
Pull Request Labels