By Topic

Routing guaranteed quality of service connections in integrated services packet 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
$31 $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

2 Author(s)
Wei Zhao ; Dept. of Comput. Sci., Maryland Univ., College Park, MD, USA ; Tripathi, S.K.

A critical functional component of quality-of-service (QoS) deployment in packet-switched networks is QoS-based routing. In this paper, we present a routing solution for guaranteed quality-of-service connections in integrated services packet networks (ISPN)-the future QoS-capable Internet proposed by the IETF. The problem is in essence a path finding problem with both end-to-end delay and per-node buffer constraints, in networks with heterogeneous intermediate switching nodes. We present a polynomial time algorithm using a capacity plane decomposition technique combined with a per-node constrained shortest path algorithm. We further propose an efficient route computation architecture, based on a novel metric-separation approach, to a slightly restricted version of the problem. The strategy is somewhat similar to “route caching”, but in a new and broader sense

Published in:

Network Protocols, 1997. Proceedings., 1997 International Conference on

Date of Conference:

28-31 Oct 1997