Cart (Loading....) | Create Account
Close category search window
 

Spare Routing Reliability for a Stochastic Flow Network Through Two Minimal Paths Under Budget Constraint

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

1 Author(s)
Yi-Kuei Lin ; Dept. of Ind. Manage., Nat. Taiwan Univ. of Sci. & Technol., Taipei, Taiwan

Reducing the transmission time is an imperative issue for many real-life systems such as computers, telecommunication networks, and transportation systems. For a deterministic flow network, the well-known quickest path problem is to find a path with minimum time for sending a specified amount of data through a single minimal path. A stochastic-flow network (SFN) composed by multistate arcs is more suitable to describe some real systems. The minimum transmission time through a SFN is thus not fixed. Allowing the data to be sent through two disjoint minimal paths simultaneously will shorten the transmission time. Hence, this paper is concerned with evaluating the reliability defined as when a SFN can transmit a given amount of data through a specified pair of minimal paths simultaneously under both time and budget constraints. In terms of subsets-union methods, a solution procedure is first proposed to calculate the reliability. Furthermore, a spare routing for boosting the reliability is established in advance to indicate the first pair, and the spare pairs of minimal paths. The corresponding reliability can be subsequently computed. An easy criterion is finally proposed to derive an ideal spare routing with higher reliability.

Published in:

Reliability, IEEE Transactions on  (Volume:59 ,  Issue: 1 )

Date of Publication:

March 2010

Need Help?


IEEE Advancing Technology for Humanity About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies

A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2014 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.