Date of Award

Fall 2001

Document Type

Thesis

Degree Name

Master of Science in Electrical Engineering - (M.S.)

Department

Electrical and Computer Engineering

First Advisor

Nirwan Ansari

Second Advisor

Lev A. Zakrevski

Third Advisor

Edwin Hou

Abstract

The notion of Quality-of-Service has been proposed to capture qualitatively or quantitatively defined performance contracts between the service provider and the user applications. Integrated network services are designed to support Quality-of-Service (QoS). One of the primary goals for the integrated network services is to find the paths that satisfy given QoS requirements, namely QoS routing. The challenging issue in this area is to route packets subjected to multiple uncorrelated constraints because the problem is inherently NP-complete. This thesis studies the source routing heuristic approaches that bring the time complexity down to the polynomial-time for the multi-constrained path (MCP) problem. A new source routing framework (SRDE) is further proposed to tackle this problem. The theoretical analysis and simulation results demonstrate that the proposed framework is capable of integrating existing source routing algorithms, resulting in better performance in terms of the time complexity and success ratio.

Share

COinS