The most reliable data path transmission
- 1 January 1999
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- No. 10972641,p. 15-19
- https://doi.org/10.1109/pccc.1999.749415
Abstract
We examine the problem of transmitting a units of data in the most reliable manner along an (s,t) path of a network N=(V,E,c,d,r,s,t). Each edge of a network is assigned a capacity, a delay and a reliability value. In contrast to the similarly defined shortest path problem, it is shown that for this more complex routing problem the subpaths of an optimal path are not necessarily optimal. However, an optimal polynomial is presented. On acyclic networks with interconnections that operate with the same reliability probability, we present a polynomial time algorithm that computes the best route for each value of /spl sigma/. This is a very useful precomputation when different amount of data need to be transmitted at different time periods.Keywords
This publication has 13 references indexed in Scilit:
- QoS based routing algorithm in integrated services packet networksPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- Bandwidth-delay based routing algorithmsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- Quality-of-Service Routing for Traffic with Performance GuaranteesPublished by Springer Nature ,1997
- Quality-of-service routing for supporting multimedia applicationsIEEE Journal on Selected Areas in Communications, 1996
- QoS-based routing of multimedia streams in computer networksIEEE Journal on Selected Areas in Communications, 1996
- Routing subject to quality of service constraints in integrated communication networksIEEE Network, 1995
- Reliability polynomials and link importance in networksIEEE Transactions on Reliability, 1994
- Network s-t reliability bounds using a 2-dimensional reliability polynomialIEEE Transactions on Reliability, 1994
- Finding the most vital edges with respect to the number of spanning treesIEEE Transactions on Reliability, 1994
- Shortest‐path algorithms: Taxonomy and annotationNetworks, 1984