#### Document Type

Article

#### Abstract

In the E-Commerce network, it is an important issue to reduce the transmission time. The quickest path problem is to find the path in the network to send a given amount of data from the source to the sink with minimum transmission time. This problem traditionally assumed that the capacity of each arc in the network is deterministic. However, the capacity of each arc is stochastic due to failure, maintenance, etc. in many real-life networks. This paper proposes a simple algorithm to evaluate the probability that d units of data can be sent through the E-Commerce network within T units of time. Such a probability is a performance index for E-Commerce networks.

#### Recommended Citation

Lin, Yi-Kuei, "Use Quickest Path to Evaluate the Performance for An E-Commerce Network" (2001). *ICEB 2001 Proceedings*. 124.

https://aisel.aisnet.org/iceb2001/124