How to calculate the Jain’s fairness index in routing?

5 views (last 30 days)
I have network structure G = (V,E) with vertex set V, edge set E. The vertices are representing nodes and an edge connects two nodes. The edge values are positive and there is no self loops. I have differnt routing paths. how to calculate the each routing path jain index?

Answers (0)

Categories

Find more on Programming in Help Center and File Exchange

Community Treasure Hunt

Find the treasures in MATLAB Central and discover how the community can help you!

Start Hunting!