Back to search

NJIT

Decomposing non-product form queueing lattices through autorouting with A* algorithm

Abstract

dc:description.abstract

Direct solution techniques are expensive for the state transition lattice of a class of non-product form queuing modes. In this thesis, Autorouting with A* algorithm is adapted to decompose it as solvable subsets which can be solved sequentially and independently. Autorouting with A* algorithm is heuristics in problem solving. It also is one of a class of global optimization problems that are difficult to solve. Some queuing modes of type A will be decomposed in this thesis through Autorouting with A* algorithm.

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
  • Yu, Chun-Chang
Contributors dc:contributor
  • Irving Y. Wang
  • Nirwan Ansari
  • Edwin Hou

Subjects

dc:subject × 4

Identifiers

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

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

Yu, Chun-Chang. Decomposing non-product form queueing lattices through autorouting with A* algorithm. https://digitalcommons.njit.edu/theses/1294