KO
|
EN
gitlite — search
Search
#javascript
#python
#hacktoberfest
#react
#ai
#typescript
#llm
#go
#golang
#android
#machine-learning
#rust
#deep-learning
#linux
rl-routing
★ 11
Open GitHub ↗
No description available.
Download README (.md)
Explore Similar Repositories
NekoC
:
Become the neko you always wanted to be
Tecto
:
N64Brew Game Jam Project
MicrosoftActivators
:
These scripts are for people who can't pay for a microsoft windows or office license and for those who are affraid of using cracking softwares.
NordVPNChecker
:
Check multiple accounts validity on NordVPN.
LMAS
:
LMAS - Last (Meta)Genomic Assembler Standing
// repository documentation
Was this content helpful?
★ 0
(0 ratings)
Select Rating:
★
★
★
★
★
Submit Feedback
Recent Feedback
×
Download README
Do you want to download the
README.md
file for
rl-routing
?
Download (.md)
# RL Routing Env [](http://colab.research.google.com/github/LukeWood/rl-routing/blob/master/notebooks/shortest-path-agent.ipynb) <p align="center"> <kbd> <img width="312" height="auto" src="./media/routing.gif"> </kbd> </p> RL-routing provides a bandit style environment for routing problems. The environment relies on an underlying [networkx](https://networkx.org) graph. This is passed to the environment during construction under the keyword argument `graph`. It is recommended to set `pos` for the nodes to ensure consistent rendering. `spring_layout` provides a simple api to do this. e.x. ``` G=nx.random_internet_as_graph(100) pos = nx.spring_layout(G) nx.set_node_attributes(G, pos, "pos") env = NetworkEnv(graph=G) ``` The environment follows a simple set of rules: - reward is the number of packets to reach their destination during a setp - edges are treated as wires - one packet may occupy a wire per step The environment renders to an rgb array. This allows it to be rendered to a matplotlib.pyplot plot, an output gif, or any other format desired. The visualization uses `red` to indicate that a node or edge is occupied by a packet, `blue` to show that an edge or node is vacant, or `green` to show that a packet was successfully routed. ## Roadmap - implement preprocessing for multi-agent - notebook for simple bayesian model on tiny hand crafted network - implement preprocessing for SDN routing ## Quickstart The easiest way to get started using rl-routing is to open up the [Shortest Path Base Case in Colab](http://colab.research.google.com/github/LukeWood/rl-routing/blob/master/notebooks/shortest-path-agent.ipynb). This base case runs you through processing observations, setting up the environment, and creating a shortest path agent. ## Citation Please cite any usage of this repo in research. bibtex entry: ```bibtex @misc{lukewood_2020, title={RL Routing}, url={https://github.com/lukewood/rl-routing}, publisher={Github}, author={LukeWood}, year={2020}, month={Oct} } ```