Reducing the scope of denial of service attacks in QoS routing

Munirul Islam*, Johnson Thomas, Vijay Varadharajan

*Corresponding author for this work

Research output: Chapter in Book/Report/Conference proceedingConference proceeding contribution

Abstract

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.

Original languageEnglish
Title of host publicationGlobal Telecommunications Conference, 2003. GLOBECOM '03. IEEE
Place of PublicationPiscataway, NJ
PublisherInstitute of Electrical and Electronics Engineers (IEEE)
Pages1368-1373
Number of pages6
Volume7
ISBN (Print)0780379748
DOIs
Publication statusPublished - Dec 2003
EventIEEE Global Telecommunications Conference GLOBECOM'03 - San Francisco, CA, United States
Duration: 1 Dec 20035 Dec 2003

Other

OtherIEEE Global Telecommunications Conference GLOBECOM'03
CountryUnited States
CitySan Francisco, CA
Period1/12/035/12/03

Keywords

  • Bellman-Ford
  • Distance Vector
  • QoS
  • Secure routing

Fingerprint Dive into the research topics of 'Reducing the scope of denial of service attacks in QoS routing'. Together they form a unique fingerprint.

Cite this