Hard-Real-Time Routing in Probabilistic Graphs to Minimize Expected Delay.
Kunal AgrawalSanjoy K. BaruahZhishan GuoJing LiSudharsan VaidhunPublished in: RTSS (2020)
Keyphrases
- qos routing
- packet transmission
- probabilistic model
- routing algorithm
- uncertain data
- routing problem
- graph theoretic
- graph theory
- graph databases
- bayesian networks
- dynamic routing
- network reliability
- wireless ad hoc networks
- generative model
- network topology
- graph structure
- bipartite graph
- weighted graph
- graph mining
- spanning tree
- sufficient conditions
- ad hoc networks
- routing protocol
- inter domain
- response time
- transmission delay
- route discovery
- routing overhead
- quality of service