Reducing the scope of denial of service attacks in QoS routing

Existing routing algorithms treat quality of service (QoS) parameters and secure routing as completely separate entities requiring separate algorithms. In this paper we propose secure QoS distance vector and secure Bellman-Ford-Moore routing algorithms that meet QoS requirements and satisfy security concerns. Security is achieved by placing filters in the network. The routing algorithms generate routes through these filters to meet the specified QoS requirements. Simulation results indicate that secure QoS distance vector algorithm performs the better of the two algorithms. Moreover, the density of filters and the placement strategy of filters affect the length of the route generated.