Fairness of optimal routing in virtual circuit data networks Conference Paper uri icon

abstract

  • Fairness in multiple path optimal routing algorithms in virtual circuit data networks is investigated. Fairness measures are developed to evaluate optimal routings. Several objective functions are considered to be possible replacements of the average packet delay objective function widely used in optimal routing algorithms. These objective functions are evaluated for various network and traffic configurations. Using the fairness measures developed, our numerical study shows that the objective function which is in the "integral form" of the avarage packet delay achieves perfect fairness while sacrificing only a nominal increase in the average packet delay. The current ARPANET routing algorithm can be shown to equivalently performing an on-line optimization using this "integral form" of objective function. Our numerical study also confirms the conjecture by Bertsekas and Gallager that the form of objevtive function does not affect the average packet delay in any significant way. © 1989 IEEE.

author list (cited authors)

  • Tsai, W. K., Cantrell, P. E., & Goos, J.

citation count

  • 6

publication date

  • January 1989

publisher