Scalable Distributed-FDPS Algorithm for QoS Provisioning

With rapid growth of Internet traffic, much effort has been focused on possible QoS provisioning mechanisms for different types of services. Many mechanisms, such as MultiServ and Virtual Time Reference System, have been proposed to provide QoS guarantees but scalability remains a challenging problem. In this paper, a novel Distributed-FDPS algorithm is proposed to remove the flow state and its computation tasks from routers, thereby solving the scalability problem. In this mechanism, the complexity is pushed to user end-systems, leaving simple priority scheduling at all routers. We analyse the process of this mechanism to demonstrate its enhancement and use ns-2 simulation to validate our analytical results. Our ns-2 simulation results also demonstrate that out-of-order packets are eliminated.