A Routing Algorithm Based on Admission Fairness

In this paper, a method for enhancing the admission fairness between narrowband and broadband applications by means of routing algorithm is presented. The exponential growth of the Internet has placed heavy burdens on the network and congestion is becoming more and more serious. Traditionally, routing is done to avoid congestion by using the least-loaded concept, and thus results in balancing the load across the set of candidate routers. However, load balancing is not desirable as it will lead to bandwidth fragmentation, which adversely affects the likelihood of accepting new reservations when the bandwidth granularity of traffic requests is large. Probably this will arouse the unfairness of admittance for wideband traffic requests. Here we present a new routing scheme which takes the fairness of admittance into consideration and minimizes bandwidth fragmentation as well. Simulation results showed that it could offer better performance of admission fairness than balancing load algorithms.