Maximizing bandwidth using disjoint paths
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 maxim...
| Main Authors: | , , |
|---|---|
| Other Authors: | |
| Format: | Conference Paper |
| Published: |
IEEE Computer Society
2010
|
| Subjects: | |
| Online Access: | http://hdl.handle.net/20.500.11937/47475 |
| _version_ | 1848757843458523136 |
|---|---|
| author | Loh, R. Soh, Sieteng Lazarescu, Mihai |
| author2 | W. Rahayu |
| author_facet | W. Rahayu Loh, R. Soh, Sieteng Lazarescu, Mihai |
| author_sort | Loh, R. |
| building | Curtin Institutional Repository |
| collection | Online Access |
| description | 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. |
| first_indexed | 2025-11-14T09:34:32Z |
| format | Conference Paper |
| id | curtin-20.500.11937-47475 |
| institution | Curtin University Malaysia |
| institution_category | Local University |
| last_indexed | 2025-11-14T09:34:32Z |
| publishDate | 2010 |
| publisher | IEEE Computer Society |
| recordtype | eprints |
| repository_type | Digital Repository |
| spelling | curtin-20.500.11937-474752023-01-18T08:46:45Z Maximizing bandwidth using disjoint paths Loh, R. Soh, Sieteng Lazarescu, Mihai W. Rahayu F. Xhafa M. Denko network QoS maximum bandwidth network bandwidth edge-disjoint paths path bandwidth 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. 2010 Conference Paper http://hdl.handle.net/20.500.11937/47475 IEEE Computer Society fulltext |
| spellingShingle | network QoS maximum bandwidth network bandwidth edge-disjoint paths path bandwidth Loh, R. Soh, Sieteng Lazarescu, Mihai Maximizing bandwidth using disjoint paths |
| title | Maximizing bandwidth using disjoint paths |
| title_full | Maximizing bandwidth using disjoint paths |
| title_fullStr | Maximizing bandwidth using disjoint paths |
| title_full_unstemmed | Maximizing bandwidth using disjoint paths |
| title_short | Maximizing bandwidth using disjoint paths |
| title_sort | maximizing bandwidth using disjoint paths |
| topic | network QoS maximum bandwidth network bandwidth edge-disjoint paths path bandwidth |
| url | http://hdl.handle.net/20.500.11937/47475 |