The heuristic route algorithm of multiple restrictions based on quality of service

Proceedings - 2008 4th International Conference on Intelligent Information Hiding and Multimedia Signal Processing, IIH-MSP 2008

Volumn , Issue , 2008, Pages 1441-1445

  Dai, Fu Sheng ^a   Shao, Xian He ^a  

^a NONE

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; BOOLEAN FUNCTIONS; HEURISTIC ALGORITHMS; HEURISTIC METHODS; ROUTING ALGORITHMS; SET THEORY; SIGNAL PROCESSING;

ADJACENT MATRIXES; BIDIRECTIONAL SEARCHES; HEURISTIC; HEURISTIC ROUTES; INTERMEDIATE NODES; LAYERED ALGORITHMS; NEW ALGORITHMS; NONLINEAR; OPTIMAL PATHS; OPTIMAL SELECTIONS; OTHER ALGORITHMS; REACHABILITY; REACHABILITY SETS; RESULT VALIDATES; SOURCE NODES; TARGET NODES;

QUALITY OF SERVICE;

EID: 54049118438     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/IIH-MSP.2008.178     Document Type: Conference Paper

References (6)

1. Neve H D, Mieghem P V. TAMCRA: A Tunable Accuracy Multiple Constraints Routing Algorithm[J]. Computer Communications. 2000, 23(11): 667-678
2. Korkmaz T, Krunz M. A Randomized Algorithm for Findinga Path Subject to Multiple QoS Requirements[J]. Computer Networks: The International Journalof Computer and Telecommunications Networking, 2001, 36(2): 251-268.
3. Korkmaz T, Krunz M. Multi-constrained Optimal Path Selection[A] Proceedings of the INFOCOM 2001 Conference, V2[C]. Anchorage, Alaska, 2001.834-843.
4. Zhenjiang L, Garcia-Luna-Aceves J J. Loop-free Constrained Path Computation for Hop-by-hop QoS Routing[J]. Computer Network. 2007, 51(11): 3278-3293
5. Guoliang X, Arunabha S, Weiyi Z, et al. Finding a Path Subject to Many Additive QoS Constraints[J].IEEE/ACM Transactions on Networking. 2007, 15(1): 201-211
6. Waxman B M. Routing of Multipoint Connections[J]. IEEE Journal on Selected Areas Communications. 1988, 6(9): 1617-1622