Back to search

NJIT

Decomposing non-product form queuing lattices through simulated annealing

Abstract

dc:description.abstract

<p>A random, heuristic search called Simulated Annealing is adapted to decompose the state transition lattice of Non-Product Form Queuing Models. Simulated Annealing Algorithm has been successfully applied to a number of optimization problem such as The Traveling Salesman Problem, Graph Partionning, Physical Computer Design, VLSI Chip Design, Image Processing,... etc. It has the advantage over other gradient descent techniques to solve the combinatorial problems. The solution can escape from local minimum by adding Boltzmann Distribution Factor to the algorithm. Most lattice of non-product form queuing models can be decomposed into Solvable Subsets through this algorithm, and solvable subset is the key to save computational effort. Some Queueing models like Erlang Queue, ISDN Protocol, Priority Queue will be discussed in the document. The decomposition result tends to a global optimum if the Energy Function of a problem is carefully defined.</p>

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
  • Lin, Jr-Chin
Contributors dc:contributor
  • Irving Y. Wang
  • Edwin Hou
  • MengChu Zhou

Subjects

dc:subject × 5

Identifiers

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

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

Lin, Jr-Chin. Decomposing non-product form queuing lattices through simulated annealing. https://digitalcommons.njit.edu/theses/2840