Routing on Shortest Pair of Disjoint Paths with Bandwidth Guaranteed

Leng, Hongze; Liang, Meilian; Song, Jun; Xie, Zhiyong; Zhang, Jun

doi:10.1109/dasc.2009.81

Cited by 5 publications

(5 citation statements)

References 21 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…There are many attempts to solve the unicast routing problem with regards to multiple constraints (Leng et al, 2009;Esfahani & Analoui, 2008;Lee et al, 2009) but only a few papers have considered implementing multiple criteria decision making methods to solve this problem, which is one of the main aims in this paper. The closest work related to the work done in this paper is (Alkahtani et al, 2006), where the authors proposed a new approach for path selection based on multiple metrics, known as EBQRMPM (enhanced best effort QoS routing with multiple prioritized metrics).…”

Section: Related Workmentioning

confidence: 99%

Quality of Service for Multimedia and Real-Time Services

Albalas

Abu-Alhaija

Awajan

et al. 2010

International Journal of Information Technology and Web Engineering

View full text Add to dashboard Cite

New web technologies have encouraged the deployment of various network applications that are rich with multimedia and real-time services. These services demand stringent requirements are defined through Quality of Service (QoS) parameters such as delay, jitter, loss, etc. To guarantee the delivery of these services QoS routing algorithms that deal with multiple metrics are needed. Unfortunately, QoS routing with multiple metrics is considered an NP-complete problem that cannot be solved by a simple algorithm. This paper proposes three source based QoS routing algorithms that find the optimal path from the service provider to the user that best satisfies the QoS requirements for a particular service. The three algorithms use the same filtering technique to prune all the paths that do not meet the requirements which solves the complexity of NP-complete problem. Next, each of the three algorithms integrates a different Multiple Criteria Decision Making method to select one of the paths that have resulted from the route filtering technique. The three decision making methods used are the Analytic Hierarchy Process (AHP), Multi-Attribute Utility Theory (MAUT), and Kepner-Tregoe KT. Results show that the algorithms find a path using multiple constraints with a high ability to handle multimedia and real-time applications.

show abstract

Section: Related Workmentioning

confidence: 99%

Quality of Service for Multimedia and Real-Time Services

Albalas

Abu-Alhaija

Awajan

et al. 2010

International Journal of Information Technology and Web Engineering

View full text Add to dashboard Cite

show abstract

“…They designated this problem as finding the shortest pair of disjoint paths with bandwidth guarantee (SPDP-BG). This problem was shown to be NPComplete and a heuristic for solving it was also proposed [7].…”

Section: Introductionmentioning

confidence: 99%

“…The authors proved that the two problems are NP-Complete and proposed an integer linear programming (ILP) formulation for solving them; additionally they also proposed two heuristics. An interesting related problem is considered in [7]: given a network, a source-destination pair s and t, and a bandwidth guaranteed value b 0 , how to find a pair of disjoint paths such that the sum of the bandwidth in the path pair is larger than b 0 while minimizing the total additive cost of the path pair. They designated this problem as finding the shortest pair of disjoint paths with bandwidth guarantee (SPDP-BG).…”

Section: Introductionmentioning

confidence: 99%

A heuristic for widest edge-disjoint path pair lexicographic optimization

Cruz

Gomes

Medhi

2014

2014 6th International Workshop on Reliable Networks Design and Modeling (RNDM)

View full text Add to dashboard Cite

Telecommunication services are pervasive in today's human activity and are required to offer reliable and quality-ofservice(QoS)-aware guaranteed services. In global path protection, the working path between a source and a destination can be protected by a backup path, which ensures data transfer in the event of a failure that makes the working path to be unavailable. Multipath and disjoint routing may require the calculation of disjoint paths maximizing the total bandwidth of the path pair (or set of paths) or the calculation of maximum-bandwidth disjoint paths.In this paper, a lexicographic optimization problem for obtaining maximum-bandwidth disjoint paths, and then maximizing the bandwidth of the widest path in the pair, is formalized. An effective heuristic for addressing this problem is presented.

show abstract

“…Leng et al [15] have studied a different but related problem of finding shortest pair of disjoint paths with bandwidth guarantee (SPDP-BG). In this problem, it is required to find a pair of disjoint paths with minimum cost, while guaranteeing a minimum bandwidth of a defined value X.…”

Section: Related Workmentioning

confidence: 99%

“…First, the search function in the modified algorithm searches for the maximum-bandwidth rather than the minimum-cost node (14)(15)(16)(17)(18)(19). Second, the relaxation (neighbor update) phase chooses the largest between the bandwidth of the neighbor node and the minimum of the link bandwidth and the bandwidth of the current node (23-28).…”

Section: Related Workmentioning

confidence: 99%

Maximum-Bandwidth Node-Disjoint Paths

Dahshan¹

2012

IJACSA

View full text Add to dashboard Cite

Abstract-This paper presents a new method for finding the node-disjoint paths with maximum combined bandwidth in communication networks. This problem is an NP-complete problem which can be optimally solved in exponential time using integer linear programming (ILP). The presented method uses a maximum-cost variant of Dijkstra algorithm and a virtual-node representation to obtain the maximum-bandwidth node-disjoint path. Through several simulations, we compare the performance of our method to a modern heuristic technique and to the ILP solution. We show that, in a polynomial execution time, our proposed method produces results that are almost identical to ILP in a significantly lower execution time.

show abstract

Routing on Shortest Pair of Disjoint Paths with Bandwidth Guaranteed

Cited by 5 publications

References 21 publications

Quality of Service for Multimedia and Real-Time Services

Quality of Service for Multimedia and Real-Time Services

A heuristic for widest edge-disjoint path pair lexicographic optimization

Maximum-Bandwidth Node-Disjoint Paths

Contact Info

Product

Resources

About