Realizing Proportional DiffServ through the Routing Function

This work studies the implementation of Proportional Differentiated Services (PDS) under a routing perspective. Network nodes are simply modeled as priority queuing systems so that there is no need to use special scheduling algorithms on routers to enforce PDS. Instead, the routing function is the one responsible to distribute trafic loads in such a way to achieve PDS goals. Our proposal is based on standard Dijkstra ´s algorithms and simulation results conJim a good peformance of our approach.