Abstract
In recent years, various QoS routing algorithms have been proposed to meet the QoS requirement of today's multimedia applications. These algorithms can be divided into two categories: source routing and distributed routing. In this paper, we propose a novel QoS routing algorithm, which is an integration of source routing and distributed routing. We Introduce the concept of "Domain" which is a set of neighboring nodes and links. Each node has its own "Domain" and has the accurate link-state information within its "Domain". When a QoS request probe arrives at a node, the node will use the link-state information within its "Domain" to calculate where the probe should be forwarded to and the probe forwarding path. By doing so, the message overhead induced by probe forwarding can be reduced significantly but the overhead induced by link-state information update may increase dramatically. However, if the size of the "Domain" is chosen properly according to the network topology, our algorithm can reduce the message overhead while maintaining high request admission ratio.
| Original language | English (US) |
|---|---|
| Pages (from-to) | 1733-1737 |
| Number of pages | 5 |
| Journal | IEEE International Conference on Communications |
| Volume | 3 |
| State | Published - 2003 |
| Event | 2003 International Conference on Communications (ICC 2003) - Anchorage, AK, United States Duration: May 11 2003 → May 15 2003 |
All Science Journal Classification (ASJC) codes
- Computer Networks and Communications
- Electrical and Electronic Engineering
Keywords
- Distributed routing
- Domain
- Message overhead
- Source routing