References

Aceves, J.J.G.L., 1993. Loop-Free routing using diffusing computations. IEEE/ACM. Trans. Networking, 1: 130-141.
CrossRef  |  Direct Link  |  

Chen, S. and K. Nahrstedt, 1998. Distributed QoS routing with imprecise state information. Proceedings of the 7th International Conference on Computer Communications and Networks, October 15-15, 1998, IEEE, New York, USA., ISBN: 0-8186-9014-3, pp: 614-621.

Chen, S. and K. Nahrstedt, 1998. On finding multi-constrained paths. Proceedings of the 1998 IEEE International Conference on Communications, June 7-11, 1998, IEEE, New York, USA., ISBN: 0-7803-4788-9, pp: 874-879.

Ghosh, D., V. Sarangan and R. Acharya, 2001. Quality-of-service routing in IP networks. IEEE. Trans. Multimedia, 3: 200-208.
CrossRef  |  Direct Link  |  

Hutson, K.R., T.L. Schlosser and D.R. Shier, 2007. On the distributed Bellman-Ford algorithm and the looping problem. Informs J. Comput., 19: 542-551.
Direct Link  |  

Jaffe, J.M., 1984. Algorithms for finding paths with multiple constraints. Netw., 14: 95-116.
CrossRef  |  Direct Link  |  

Korkmaz, T., M. Krunz and S. Tragoudas, 2000. An efficient algorithm for finding a path subject to two additive constraints. Proceeding of the ACM SIGMETRICS Conference on Performance Evaluation Review, June 18-21, 2000, ACM, New York, USA., ISBN:1-58113-194-1, pp: 318-327.

Mieghem, P.V. and F.A. Kuipers, 2004. Concepts of exact QoS routing algorithms. IEEE/ACM. Trans. Networking, 12: 851-864.
CrossRef  |  Direct Link  |  

Mieghem, P.V., H.D. Neve and F. Kuipers, 2001. Hop-by-hop quality of service routing. Comput. Netw., 37: 407-423.
Direct Link  |  

Neve, H.D. and P.V. Mieghem, 2000. TAMCRA: A tunable accuracy multiple constraints routing algorithm. Comput. Commun., 23: 667-679.
Direct Link  |  

Prakash, P.S. and S. Selvan, 2008. A feasible path selection QoS routing algorithm with two constraints in packet switched networks. Intl. J. Comput. Inf. Sci. Eng., 2: 129-135.

Smith, B.R. and J.J.G.L. Aceves, 2004. Efficient policy-bsed routing without virtual circuits. Proceedings of the 1st International Conference on Quality of Service in Heterogeneous Wired/Wireless Networks, October 18-20, 2004, IEEE, New York, USA., ISBN: 0-7695-2233-5, pp: 242-251.

Sobrinho, J.L., 2001. Algebra and algorithms for QoS path computation and hop-by-hop routing in the internet. Proceedings of the IEEE 20th Annual Joint Conference on Computer and Communications Societies, April 22-26, 2002, IEEE, New York, USA., ISBN: 0-7803-7016-3, pp: 727-735.

Wang, J. and K. Nahrstedt, 2002. Hop-by-hop routing algorithms for premium-class traffic in diffserv networks. Proceedings of the IEEE 21st Annual Joint Conference on Computer and Communications Societies, June 23-27, 2002, IEEE, New York, USA., ISBN: 0-7803-7476-2, pp: 705-714.

Wang, Z. and J. Crowcroft, 1996. Quality-of-service routing for supporting multimedia applications. IEEE J. Selected Areas Commun., 14: 1228-1234.
CrossRef  |  Direct Link  |  

Waxman, B.M., 1988. Routing of multipoint connections. IEEE J. Selected Areas Commun., 6: 1617-1622.
CrossRef  |  

Yuan, X., 2002. Heuristic algorithms for multiconstrained quality-of-service routing. IEEE/ACM. Transac. Networking, 10: 244-256.
Direct Link  |