Using Network Flows in Hierarchical QoS Routing

  • Authors:
  • Venkatesh Sarangan;Raj Acharya

  • Affiliations:
  • State University of New York at Buffalo;State University of New York at Buffalo

  • Venue:
  • ICON '01 Proceedings of the 9th IEEE International Conference on Networks
  • Year:
  • 2001

Quantified Score

Hi-index 0.00

Visualization

Abstract

Quality of Service (QoS) routing is the process ofrouting a connection through a network based on its resource requirements. In QoS routing a lot of overheadis generated either due to the state maintenance or during the call establishment. These overheads increasewith the network size. Hence to deploy QoS routing invery big networks, special techniques for reducing theseoverheads have to be developed. State Aggregation isan important technique for reducing the state maintenance overhead. In state aggregation, each domainconstructs an aggregated topology of itself, and sends itto other domains. Other domains make routing decisions based on this aggregated information. However, as the network resources change dynamically, the information sent by a domain quickly becomes out-of-date.This stale information leads to bad routing decisionsand hence the routing performance goes down. If adomain can update the aggregated information sent byother domains, better routing decisions can be madeand hence the routing performance can improve. Inthis paper, based on "network flows", we propose a newscheme for aggregating bandwidth. Our scheme enablesa domain to update the aggregate sent by another domain and thus keep track of resources available in otherdomains. We also give a distributed approach to dointer-domain routing based on our proposed aggregationscheme. Simulation results show that our method givesa better bandwidth admission ratio when compared toexisting aggregation techniques.