Document Type



In general, several types of information data are transmitted through an E-Commerce network simultaneously. Each type of information data is set to one type of commodity. Under the budget constraint, this paper studies the probability that a given amount of multicommodity can be transmitted through an E-Commerce network, where each node and each arc has several possible capacities. We may take this probability as a performance index for this network. Based on the properties of minimal paths, a simple algorithm is proposed to generate all lower boundary points for (d1 ,d2 ,…,dp ;C) where di is the demand of commodity i and C is the budget. The probability can then be calculated in terms of such points.