By Topic

State aggregation using network flows for stochastic networks

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)

QoS routing is the process of routing a connection based on the connection's resource requirements. The overhead involved in QoS routing increases with the network size. State aggregation is an important technique that makes QoS routing scalable. We propose a new domain state aggregation technique based on "network-flows", for stochastic networks. We propose a new fast heuristic algorithm to estimate the PMF of "maximum-flow" through a probabilistic flow network. Using this algorithm, we aggregate the bandwidth information in a domain and use it along with the path aggregate for routing. Through simulations, we show that stochastic estimation of traffic capacity is better than deterministic estimation and gives a better bandwidth admission ratio when compared with existing state aggregation techniques.

Published in:

Global Telecommunications Conference, 2002. GLOBECOM '02. IEEE  (Volume:3 )

Date of Conference:

17-21 Nov. 2002