Resource allocation decisions under various demands and cost requirements in an unreliable flow network

Hsieh, Chung-Chi; Chen, Yi-Ting

doi:10.1016/j.cor.2004.04.003

Cited by 25 publications

(13 citation statements)

References 17 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Constraint (12) says the total assignment cost that is the total cost of the assigned components can not exceed budget C. All feasible components assignments can be obtained through constraints (10)- (12). Note that SR d (B) = 0 as there is no X e X B .…”

Section: Problem Formulationmentioning

confidence: 99%

“…Hsieh and Lin [13] focused on finding the optimal multi-commodity allocation on a set of source nodes to maximize multistate multi-terminal network reliability, and then Hsieh and Chen [11] extended Hsieh and Lin's research [13] to take the transmission budget into consideration. Accordingly, Hsieh and Chen [12] developed an updating schema to determine the optimal multistate multi-terminal network reliability under a range of demand under the demand-dependent and demand-independent cost constraints. Liu et al [25] adopted genetic algorithm (GA) to evaluate the optimal multistate multi-terminal network reliability under flow assignments of multi-commodity.…”

Section: Introductionmentioning

confidence: 99%

“…In addition to evaluating the network reliability, several issues about the network reliability optimization have been explored recently [3,5,[11][12][13]17,24,25,29]. Hsieh and Lin [13] focused on finding the optimal multi-commodity allocation on a set of source nodes to maximize multistate multi-terminal network reliability, and then Hsieh and Chen [11] extended Hsieh and Lin's research [13] to take the transmission budget into consideration.…”

Section: Introductionmentioning

confidence: 99%

See 2 more Smart Citations

Multistate components assignment problem with optimal network reliability subject to assignment budget

Lin

Yeh

2011

Applied Mathematics and Computation

View full text Add to dashboard Cite

Section: Problem Formulationmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

Multistate components assignment problem with optimal network reliability subject to assignment budget

Lin

Yeh

2011

Applied Mathematics and Computation

View full text Add to dashboard Cite

“…Prior research of binary systems has mainly focused on the development of lower and upper flow bounds for single-commodity maximum flow references [1,12,15] extended their work to encompass multi commodity networks, but the focus was to develop an algorithm to compute the expected maximum flow. Concentrating on minimum-cost flow, our research adds complexity by requiring that all O-D demands be satisfied [25].…”

Section: Stochastic Network Modelsmentioning

confidence: 99%

Detecting a Security Disturbance in Multi Commodity Stochastic Networks

Robinson¹,

Chan

Dietz³

2006

Telecommun Syst

View full text Add to dashboard Cite

Here is a multi-criteria approach to identify and evaluate network-flow monitoring strategies in a stochastic environment. We propose an analytical approach for assessing flow disturbance, based on limited sampling of arc-flow information in multi commodity, or multiple origin-destination (O-D), networks. A disturbance is defined here as abnormal network traffic beyond routine fluctuations. The network is characterized by arcs that are available with certain probabilities, suggesting a busy packet-switching/circuit-switching network, or simply network with failing components. Given the huge state space of such stochastic networks, our first objective is to bound the expected flow for computational efficiency. This is accomplished by extending available single-commodity-network results to the multi commodity case. The second objective is to determine the best placement of flow monitors to obtain the most accurate estimates of traffic flow, as represented by O-D pair traffic volumes in order to detect a disturbance. We followed a multi-criteria approach in A. R. Robinson defining and evaluating all possible monitor-placement strategies satisfying monitor availability. To assess a traffic pattern, O-D volumes are estimated using the l p -metric for p = 1, 2 and ∞, representing a decisionmaker's risk-preference structure. The final objective is to define a disturbance metric providing confident assessments on the occurrence of a flow disturbance. In this regard, we use linear-regression to generate confidence intervals around the expected flow for each O-D pair. This is supplemented by the Fisher Method of Randomization, a non-parametric test, for small networks. Unlike the Fisher-test results, it appears the linear-regression "disturbance metric" is very sensitive to detecting "disturbance." Preliminary results suggest that among the three l p metrics in O-D estimation, it appears that the best is the l 2 -metric, which provides the appropriate sensitivity and accuracy. Counter to intuition, it is also observed that the "disturbance" estimation error generally decreases as the number of sampled arcs decreases.

show abstract

“…For binary-state networks, several literatures [19][20][21] related to network reliability optimization considered how to determine the optimal network topology. For stochastic-flow networks, most research involves issues of commodity allocation [9][10][11], flow allocation [12,13], stochastic network interdiction strategy [14] and network structure [15][16][17][18].…”

mentioning

confidence: 99%

Using minimal cuts to optimize network reliability for a stochastic computer network subject to assignment budget

Lin

Yeh

2011

Computers & Operations Research

View full text Add to dashboard Cite

Resource allocation decisions under various demands and cost requirements in an unreliable flow network

Cited by 25 publications

References 17 publications

Multistate components assignment problem with optimal network reliability subject to assignment budget

Multistate components assignment problem with optimal network reliability subject to assignment budget

Detecting a Security Disturbance in Multi Commodity Stochastic Networks

Using minimal cuts to optimize network reliability for a stochastic computer network subject to assignment budget

Contact Info

Product

Resources

About