Hop-by-hop quality of service routing

Citation
P. Van Mieghem et al., Hop-by-hop quality of service routing, COMPUT NET, 37(3-4), 2001, pp. 407-423
Citations number
26
Categorie Soggetti
Information Tecnology & Communication Systems
Journal title
COMPUTER NETWORKS-THE INTERNATIONAL JOURNAL OF COMPUTER AND TELECOMMUNICATIONS NETWORKING
ISSN journal
13891286 → ACNP
Volume
37
Issue
3-4
Year of publication
2001
Pages
407 - 423
Database
ISI
SICI code
1389-1286(20011105)37:3-4<407:HQOSR>2.0.ZU;2-8
Abstract
Based on the self-adaptive multiple constraints routing algorithm (SAMCRA), an improved and exact version of our QoS routing algorithm, the tunable ac curacy multiple constraints routing algorithm (TAMCRA) we have investigated QoS routing in a hop-by-hop manner because it forms the basis of IP networ king as e.g. in OSPF. In particular, we studied 'hop-by-hop destination bas ed only' (HbHDBO) QoS routing that ignores the source and previous path his tory (as in current IP routing). We demonstrate that an exact QoS algorithm assures the avoidance of routing loops in this HbHDBO setting. However, de spite the use of an exact QoS routing algorithm as SAMCRA, the exact soluti on cannot be guaranteed with HbHDBO routing. Fortunately, large simulation results on various sizes of random graphs show that the overall quality of the HbHDBO QoS routing is remarkably good. Finally, we show that, by using active networking as opposed to current IT routing, exact QoS routing in a hop-by-hop way can be guaranteed. (C) 2001 Elsevier Science B.V. Ail rights reserved.