Tractability of Quality of Service Routing Problems in Computer Networks

碩士 === 國立臺灣大學 === 電機工程學系 === 86 === Quality of Service (QoS) routing has become an essential issue in modern networks. However, traditional single metric routing algorithms which concern primarily with connectivity are not sufficient to ensure...

Full description

Bibliographic Details
Main Authors: Lee, Shih-Kai, 李世凱
Other Authors: Yen Hsu-Chun
Format: Others
Language:en_US
Published: 1998
Online Access:http://ndltd.ncl.edu.tw/handle/56389660598947864849
Description
Summary:碩士 === 國立臺灣大學 === 電機工程學系 === 86 === Quality of Service (QoS) routing has become an essential issue in modern networks. However, traditional single metric routing algorithms which concern primarily with connectivity are not sufficient to ensure QoS requirements. New routing algorithms under more than one constraint is needed in order to meet the challenge of QoS-based routing. In this thesis, we investigate the tractability of routing (including unicast, multicast, and broadcast) problems under different types of constraints.