| URN |
etd-0722114-190140 |
Statistics |
This thesis had been viewed 456 times. Download 7 times.
|
| Author |
Hong-Jyun Yan |
| Author's Email Address |
No Public. |
| Department |
Institute of Industrial Management |
| Year |
2013 |
Semester |
2 |
| Degree |
Master |
Type of Document |
Master's Thesis |
| Language |
zh-TW.Big5 Chinese |
Page Count |
31 |
| Title |
Cascaded Star Computer Network Bandwidth Planning |
| Keyword |
Stochastic-flow network
andwidth Planning
Minimal path
Cascaded star computer network
Reliability evaluation
Reliability evaluation
Cascaded star computer network
Minimal path
andwidth Planning
Stochastic-flow network
|
| Abstract |
Star network in this study is done by linking HUB of each building in a higher order of star layout, forming a more complex structure.The main features are that each building can independently use network resources without influencing each other; they are easy to be managed and convenient in installation.This structure is common in every companyˇ¦s computer network system.However, the central node of the star structure is often a network bottleneck, so the impact on reliability is tremendous. Traditionally, the assessment of network reliability only focuses on point-to-point or multipoint-to-multipoint formats of network forms, and that the central node does not generate traffic; therefore, there is little literature conducting study on the reliability assessment of star network. This study proposes a new algorithm to solve this problem and provide a numerical example to explain the planning process of a whole bandwidth which can be used as a reference for the industry. |
| Advisor Committee |
Shin-Guang Chen - advisor
Cheng-DA Ye - co-chair
Liang-Ho Chen - co-chair
|
| Files |
indicate in-campus access at one year and off-campus not accessible |
| Date of Defense |
2014-06-24 |
Date of Submission |
2014-07-24 |
