On minimizing unused bandwidths in series parallel networks
Auteur(s):
Chaourar Brahim Fretwell Rod J Mahlous Ahmed Redha
Date de publication:
2009
Référence bibliographique:
On minimizing unused bandwidths in series parallel networks Brahim Chaourar Ahmed Redha Mahlous and Rod J Fretwellمجلة جامعة الملك سعود مجلة العلوم عمادة شؤون المكتبات، جامعة الملك سعودVol 21 (2009 1430 H) p p 2124Chaourar BrahimMahlous Ahmed RedhaFretwell Rod J
Résumé:
Given a computers network G (V E) and a bandwidth vector on its links the minimizing unused bandwidths problem (MUB) is to find a minimum number of spanning trees subnetwork workings as parallel services and a maximum possible bandwidth for each one such that the remaining total unused bandwidth is minimum MUB is an open problem In this paper a polynomial algorithm is presented to solve MUB problem in a special kind of network topology called series parallel networks A comparison between the presented algorithm MBSTP and two other algorithms PLSP and MSTP is presented towards the end of the paper to show the effectiveness of the presented algorithm in designing a computer network
