Logo image
考慮統計相關性下之網路可靠度
Thesis

考慮統計相關性下之網路可靠度

郭鍵霖
Masters, 國立清華大學, 工業工程與工程管理學系
2011

Abstract

網路可靠度 最小路徑 路由政策
Traditionally, all analysis of network reliability assumes that times of transmission and consumption in regard to arcs and nodes are a fixed constant; however, in reality these transmission times are not fixed and are stochastic. Moreover, the parameters of these transmission times may or may not be statistically independent; it is possible that they may be correlated. Therefore, this study proposes a new mathematic model and algorithm by which to solve this problem when encountered. This model includes the following three points: 1. It treats both the capacity and transmission times as stochastic. 2. It allows for the possibility of more than 2 paths between each node. 3. It allows for the possibility that the transmission times in the network need not be statistically independent. Eventually, this new model can be utilized in regard to transportation logistics problems, as well as non-wireless, network communication problems.

Metrics

1 Record Views

Details

Logo image