抄録
Routing with multiple QoS constraints is known to be a NP-complete problem. In our previous work (QoSRBF algorithm), we have shown that, for a number of specific QoS constraints, it can be solved in polynomial time, when Weighted Fair Queueing (WFQ) service discipline is employed. QoSRBF is an on-demand algorithm. In this paper we propose a number of QoS routing algorithms for pre-computed paths, when all or some of the flow specification parameters and the amount of bandwidth that has to be reserved are not known a priori. We also have shown that the size of routing table could be reduced, as paths satisfying some conditions could be neglected.
| 本文言語 | English |
|---|---|
| ホスト出版物のタイトル | Proceedings of the International Conference on Computer Communications and Networks, ICCCN |
| Place of Publication | Piscataway, NJ, United States |
| 出版社 | IEEE |
| ページ | 248-251 |
| ページ数 | 4 |
| 出版ステータス | Published - 1997 |
| イベント | Proceedings of the 1997 6th International Conference on Computer Communications and Networks, ICCCN'97 - Las Vegas, NV, USA 継続期間: 1997 9 22 → 1997 9 25 |
Other
| Other | Proceedings of the 1997 6th International Conference on Computer Communications and Networks, ICCCN'97 |
|---|---|
| City | Las Vegas, NV, USA |
| Period | 97/9/22 → 97/9/25 |
ASJC Scopus subject areas
- Computer Science(all)