Show simple item record

dc.contributor.authorLoh, R.
dc.contributor.authorSoh, Sieteng
dc.contributor.authorLazarescu, Mihai
dc.contributor.editorW. Rahayu
dc.contributor.editorF. Xhafa
dc.contributor.editorM. Denko
dc.date.accessioned2017-01-30T15:33:38Z
dc.date.available2017-01-30T15:33:38Z
dc.date.created2010-12-16T20:02:54Z
dc.date.issued2010
dc.identifier.citationLoh, R. and Soh, Sieteng and Lazarescu, Mihai. 2010. Maximizing bandwidth using disjoint paths, in Rahayu, W., Xhafa, F. & Denko, M. (ed), 2010 24th IEEE International Conference on Advanced Information Networking and Applications, Apr 20 2010, pp. 304-311. Perth, Western Australia: IEEE Computer Society.
dc.identifier.urihttp://hdl.handle.net/20.500.11937/47475
dc.description.abstract

Recently, multi-paths solutions have been proposed to improve the quality-of-service (QoS) in communication networks (CNs). This paper addresses the problem to obtain the λ-edge-disjoint-path-set (λDP/B) with maximum bandwidth (λDPB), for λ>/=1. λDP/B is useful for applications that require maximum bandwidth for data transmission, such as video conferencing, video-on-demand, large file downloads and FTP. We propose a polynomial time heuristic algorithm, Maximum Bandwidth Algorithm (MBA), to solve the problem. We have implemented MBA and evaluated its performance against an optimal, but exponential time, brute force algorithm (BF) and three existing heuristicalgorithms: Algorithm-1, CBA-G', DPSP'. Simulations on seventy CNs show that MBA is able to produce the optimal λDPB for about 99% of the time while using only 0.005% CPU time of BF. Our simulations also show that MBA issignificantly more effective than these existing algorithms while using competitive CPU time.

dc.publisherIEEE Computer Society
dc.subjectnetwork QoS
dc.subjectmaximum bandwidth
dc.subjectnetwork bandwidth
dc.subjectedge-disjoint paths
dc.subjectpath bandwidth
dc.titleMaximizing bandwidth using disjoint paths
dc.typeConference Paper
dcterms.source.startPage304
dcterms.source.endPage311
dcterms.source.issn1550-445X
dcterms.source.titleProceedings of the 2010 24th IEEE International Conference on Advanced Information Networking and Applications
dcterms.source.seriesProceedings of the 2010 24th IEEE International Conference on Advanced Information Networking and Applications
dcterms.source.conference2010 24th IEEE International Conference on Advanced Information Networking and Applications
dcterms.source.conference-start-dateApr 20 2010
dcterms.source.conferencelocationPerth, Western Australia
dcterms.source.placeUSA
curtin.note

Copyright © 2010 IEEE This material is presented to ensure timely dissemination of scholarly and technical work. Copyright and all rights therein are retained by authors or by other copyright holders. All persons copying this information are expected to adhere to the terms and constraints invoked by each author's copyright. In most cases, these works may not be reposted without the explicit permission of the copyright holder.

curtin.accessStatusOpen access
curtin.facultySchool of Science and Computing
curtin.facultyDepartment of Computing
curtin.facultyFaculty of Science and Engineering


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record