Multiple constraints-based QoS multicast routing: model and algorithms

Journal of Systems Engineering and Electronics

Volumn 16, Issue 1, 2005, Pages 187-193

  Sun, Baolin ^a,b   Li, Layuan ^a  

^a WUHAN UNIVERSITY OF TECHNOLOGY   (China)

^b WUHAN UNIVERSITY OF SCIENCE AND TECHNOLOGY   (China)

Author keywords

Algorithm; Multicast routing; Multiple constraints; NP complete; QoS routing

Indexed keywords

DQMRP PROTOCOL; MULTICAST ROUTING; MULTIPLE CONSTRAINTS; NP-COMPLETE; SAMCRA; TAMCRA;

COMPUTER SIMULATION; CONSTRAINT THEORY; DISTRIBUTED COMPUTER SYSTEMS; HEURISTIC PROGRAMMING; OPTIMIZATION; QUALITY OF SERVICE;

MULTICASTING;

EID: 18344385568     PISSN: 16711793     EISSN: None     Source Type: Journal    
DOI: None     Document Type: Article

References (16)

1. Li Layuan, Li Chunlin. A multicast routing protocol with multiple QpS constraints. Proc of WCC, 2002.
2. Li Layuan, Li Chunlin. A dynamic QoS multicast routing protocol. ACTA Electronica Sinica, 2003, 31(9): 1345-1350.
3. Sun Baolin, Yin Xianhong, Li Layuan. Optimizing fuzzy controllers for QoS improvement in diffServ networks. Proceedings of the 7th Joint Conference on Information Sciences (JCIS 2003), Cary, North Carolina, USA, 2003: 521-525.
4. Li Layuan. A QoS based multicast routing protocol in Ad Hoc networks. Chinese Journal of Computers, 2004, 27(10): 1402-1407.
5. Braden R, Clark D, Shenker S. Integrated services in the internet architecture: An Overview. RFC 1633, 1994.
6. Blake S, Black D, Carlson M, et al. An Architecture for differentiated services. RFC 2475, 1998.
7. Rosen E, Viswanathan A, Gallon R. Multiprotocol label switching architecture. RFC 3031, 2001.
8. De Neve H, Van Mieghem P. TAMCRA: a tunable accuracy multiple constraints routing algorithm. Computer Communications, 2000, 23: 667-679.
9. Van Mieghem P, De Neve H, Kuipers F A. Hop-by-hop quality of service routing. Computer Networks, 2001, 37(3-4): 407-423.
10. Chen S, Nahrstedt K. On finding multi-constrained paths. In Proceedings of the ICC' 98 Conference, IEEE, 1998, 2: 874-879.
11. Korkmaz T, Krunz M. Multi-constrained optimal path selection. In Proceedings of the INFOCOM 2001 Conference, Anchorage, Alaska, 2001, 2: 834-843.
12. Yuan X. Heuristic algorithms for multiconstrained quality-of-service routing. IEEE/ACM Trans. on Networking, 2002, 10(2): 244-256.
13. Liu G, Ramakrishnan K G. A* Prune: an algorithm for finding k shortest paths subject to multiple constraints. In Proceedings of the INFOCOM 2001 Conference, Anchor-Age, Alaska, 2001. 743-749.
14. Jaffe J M. Algorithms for finding paths with multiple constraints. Networks, 1984, 14: 95-116.
15. Waxman B. Routing of multipoint connections. IEEE Journal on Selected Areas in Communications, 1988(6): 1617-1622.
16. Van Meghem P. Paths in the simple random graph and the Waxman graph, probability in the engineering and Informational Sciences (PEIS), 2001, 15: 535-555.