Probabilistic upper bounds for heterogeneous flows using a static priority queueing on an AFDX network.
Frédéric RidouardJean-Luc ScharbargChristian FraboulPublished in: ETFA (2008)
Keyphrases
- upper bound
- lower bound
- priority scheduling
- network structure
- origin destination
- tight bounds
- heterogeneous networks
- bayesian networks
- network model
- computer networks
- peer to peer
- probabilistic model
- long run
- upper and lower bounds
- differentiated services
- dynamic routing
- end to end
- communication networks
- network architecture
- sample complexity
- worst case
- scheduling problem
- traffic patterns
- social networks
- unstructured peer to peer