Back to search

NJIT

QOS routing source routing problems and solutions

Abstract

dc:description.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.

Degree

thesis:*
Name thesis:degree_name
Master of Science in Electrical Engineering - (M.S.)
Discipline thesis:degree_discipline
Electrical and Computer Engineering

Author and committee

dc:creator, dc:contributor.*
Author dc:creator
  • Tian, Ye
Contributors dc:contributor
  • Nirwan Ansari
  • Lev A. Zakrevski
  • Edwin Hou

Subjects

dc:subject × 4

Identifiers

dc:identifier.*
Repository record dc:identifier
https://digitalcommons.njit.edu/theses/670

Chain of custody

source
Harvested from
NJIT
Base URL
digitalcommons.njit.edu/do/oai/
Last updated
2026-11-19
Source record
OAI-PMH GetRecord
citation

Tian, Ye. QOS routing source routing problems and solutions. https://digitalcommons.njit.edu/theses/670