Application of sampling methodologies to network traffic characterization
SIGCOMM '93 Conference proceedings on Communications architectures, protocols and applications
Routing and capacity assignment in backbone communication networks
Computers and Operations Research
Deriving traffic demands for operational IP networks: methodology and experience
IEEE/ACM Transactions on Networking (TON)
Joint QoS optimization for layered computational grid
Information Sciences: an International Journal
A probabilistic approach to modeling and estimating the QoS of web-services-based workflows
Information Sciences: an International Journal
A Measurement Center for the NBS Local Area Computer Network
IEEE Transactions on Computers - Lecture notes in computer science Vol. 174
Aggregation in sensor networks with a user-provided quality of service goal
Information Sciences: an International Journal
Availability guarantee in survivable WDM mesh networks: A time perspective
Information Sciences: an International Journal
Concave piecewise linear service curves and deadline calculations
Information Sciences: an International Journal
Time version of the shortest path problem in a stochastic-flow network
Journal of Computational and Applied Mathematics
Optimal routing policy of a stochastic-flow network
Computers and Industrial Engineering
An optimal QoS-based Web service selection scheme
Information Sciences: an International Journal
Information Sciences: an International Journal
Computers and Operations Research
Reliability Evaluation for an Information Network With Node Failure Under Cost Constraint
IEEE Transactions on Systems, Man, and Cybernetics, Part A: Systems and Humans
Packet Trains--Measurements and a New Model for Computer Network Traffic
IEEE Journal on Selected Areas in Communications
| Hi-index | 0.07 |
In the past, the main concerns for competitive enterprise environment of computer networks were data transmission delays and costs. However, from the viewpoint of quality of service (QoS), internet service providers and enterprise customers are increasingly focusing on data accuracy during transmission. This study extends a stochastic computer network (SCN) to evaluate the system reliability, where the system reliability is the probability that demand can be transmitted through the SCN under the total accuracy rate. In such an SCN, each arc has several capacities, and an accuracy rate. We can regard the system reliability as a measurable index for assessing the SCN performance. A lower boundary point for (d,K) is a minimal capacity vector, which allows the system to transmit demand d under the total accuracy rate K. Using the minimal paths, we propose an efficient algorithm to find all lower boundary points for (d,K). The system reliability can then be computed in terms of all lower boundary points for (d,K) by the recursive sum of disjoint products (RSDP) algorithm. Several numerical examples are demonstrated to illustrate the utility, efficiency, and effectiveness of the proposed algorithm.