QoS routing algorithms for pre-computed paths

Chotipat Pornavalai; Goutam Chakraborty; Norio Shiratori

QoS routing algorithms for pre-computed paths

Chotipat Pornavalai^*, Goutam Chakraborty, Norio Shiratori

^*Corresponding author for this work

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

4 Citations (Scopus)

Abstract

Routing with multiple QoS constraints is known to be a NP-complete problem. In our previous work (QoSR_BF 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. QoSR_BF 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.

Original language	English
Title of host publication	Proceedings of the International Conference on Computer Communications and Networks, ICCCN
Place of Publication	Piscataway, NJ, United States
Publisher	IEEE
Pages	248-251
Number of pages	4
Publication status	Published - 1997
Event	Proceedings of the 1997 6th International Conference on Computer Communications and Networks, ICCCN'97 - Las Vegas, NV, USA Duration: 1997 Sept 22 → 1997 Sept 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)

Cite this

Pornavalai, C, Chakraborty, G & Shiratori, N 1997, QoS routing algorithms for pre-computed paths. in Proceedings of the International Conference on Computer Communications and Networks, ICCCN. IEEE, Piscataway, NJ, United States, pp. 248-251, Proceedings of the 1997 6th International Conference on Computer Communications and Networks, ICCCN'97, Las Vegas, NV, USA, 97/9/22.

@inproceedings{2a45d12194394fce8a7fea2d44a26d54,

title = "QoS routing algorithms for pre-computed paths",

abstract = "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.",

author = "Chotipat Pornavalai and Goutam Chakraborty and Norio Shiratori",

year = "1997",

language = "English",

pages = "248--251",

booktitle = "Proceedings of the International Conference on Computer Communications and Networks, ICCCN",

publisher = "IEEE",

note = "Proceedings of the 1997 6th International Conference on Computer Communications and Networks, ICCCN'97 ; Conference date: 22-09-1997 Through 25-09-1997",

}

TY - GEN

T1 - QoS routing algorithms for pre-computed paths

AU - Pornavalai, Chotipat

AU - Chakraborty, Goutam

AU - Shiratori, Norio

PY - 1997

Y1 - 1997

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=0031361369&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0031361369&partnerID=8YFLogxK

M3 - Conference contribution

AN - SCOPUS:0031361369

SP - 248

EP - 251

BT - Proceedings of the International Conference on Computer Communications and Networks, ICCCN

PB - IEEE

CY - Piscataway, NJ, United States

T2 - Proceedings of the 1997 6th International Conference on Computer Communications and Networks, ICCCN'97

Y2 - 22 September 1997 through 25 September 1997

ER -

QoS routing algorithms for pre-computed paths

Abstract

Other

ASJC Scopus subject areas

Other files and links

Fingerprint

Cite this