The most reliable data path transmission

1999 IEEE International Performance, Computing and Communications Conference, IPCCC 1999

Volumn , Issue , 1999, Pages 15-19

  Tragoudas, S ^a  

^a University of Arizona   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

GRAPH THEORY;

ACYCLIC NETWORKS; OPTIMAL PATHS; POLYNOMIAL-TIME ALGORITHMS; PRE-COMPUTATION; RELIABILITY PROBABILITY; RELIABILITY VALUES; ROUTING PROBLEMS; SHORTEST PATH PROBLEM;

POLYNOMIAL APPROXIMATION;

EID: 0001801825     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/PCCC.1999.749415     Document Type: Conference Paper

References (18)

1. R.K. Ahuja, Minimum Cost Reliability Ratio problem, Computers Opns Res., 16, 83-89, 1988.
2. R.K. Ahuja, J.L. Batra and S.K. Gupta, Combinatorial Optimization with Rational Objective Functions: A Communication, Mathematics . Opns Res., 8, 314, 1983.
3. D. Bulka, J. Bechta Dugan, Network s-t Reliability Bounds Using a 2 Dimensional Reliability Polynomial, IEEE Transactions on Reliability, 43, 1, 39-45, 1994.
4. S. Chen and K. Nahrstedt, On Finding Multi- Constrained Paths, Proceedings of ICC'98, 874-879.
5. T.H. Cormen, C.E. Leiserson and R.L. Rivest, Introduction to Algorithms, McGraw-Hill, 1990.
6. L.D. Bodin, B.L. Golden, A.A. Assad and M.O. Ball, Routing and Scheduling of Vehicles and Crews. The State of the Art, Computers Opns Res., 10, 63-211, 1982.
7. N. Deo and C-Y. Pang, Shortest Path Algorithms: Taxonomy and Annotation, Networks, 14, 275-323, 1984.
8. A. Iwata et al, ATM Routing Algorithms with Multiple QOS Requirements for Multimedia Internetworking, IEICE Trans. Commun., E79- B(8), 999-1006, 8, 1996.
9. J.M. Jaffe, Algorithms for Finding Paths with Multiple Constraints, Networks, 14, 95-116, 1984.
10. W.C. Lee, M.G. Hluchyi and P.A. Humblet, Routing Subject to Quality of Service Constraints in Integrated Communication Networks, IEEE Network, 46-55, July / August 1995.
11. Q. Ma and P. Steenkiste, Quality of Service Routing for Traffic with Performance Guarantees, Proceedings of the 4rth International IFIP Workshop on Quality of Service, 1997.
12. L.B. Page and J.E. Perry, Reliability Polynomials and Link Importance in Networks, IEEE Transactions on Reliability, 43, 1, 51-58, 1994.
13. A.R. Pierce, Bibliography on Algorithms for Shortest path, Shortest Spanning Tree, and Related Circuit Routing Problems, Networks, 5, 129-149, 1975.
14. C. Pornavalai, G. Chakraborty and N. Shiratori, QoS based Routing Algorithm in Integrated Services Packet Networks, Proceedings of the International Conference on Network Protocols, 167-174, 1997.
15. R. Vogel et. al., QoS based Routing of Multimedia Streams in Computer Networks, IEEE Journal on Selected Areas in Communications, 14, 7, 1235-1244, 1996.
16. F-S. P. Tsen, T-Y. Sung, M-Y Lin, L-H. Hsu and W. Myrvold, Finding the Most Vital Edges with Respect to the Number of Spanning Trees, IEEE Transactions on Reliability, 43, 4, 600-602, 1994.
17. Z. Wang and J. Crowcroft, Bandwidth-Delay based Routing Algorithms, Proceedings of the GLOBECOM'95, vol. 3, 21-2133, 1995.
18. Z. Wang and J. Crowcroft, Quality of Service Routing for Supporting Multimedia Applications, IEEE Journal on Selected Areas in Communications, 14, 7, 1228-1234, 1996.