Efficient algorithms for computing disjoint QoS paths

Orda, Ariel; Sprintson, Alex

doi:10.1109/infcom.2004.1354543

Cited by 61 publications

(88 citation statements)

References 15 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Thus, DARC is now reduced to finding three linkdisjoint s−t paths in G * that fulfill the additional delay bounds formulated in Problems (i)-(iv). Although NP-completeness of finding three link-disjoint paths with additional delay bounds immediately follows from previous works [9], [11], [13], [15], owing to the correlation between the links and link parameters of G * they are not directly applicable to our problem. However, our conjecture is that DARC inherits the NP-completeness of these problems.…”

Section: Minmentioning

confidence: 95%

“…In order to extend this work to survivable routing, Orda and Sprintson investigated the problem of finding a constrained shortest link-disjoint path pair [11], and they proved that this problem is also NP-hard. In their 2-Restricted Link Disjoint Paths (2DP) problem they minimized the total cost of the paths while both paths have to obey a specific delay bound D. Several approximations were presented in [11] for the 2DP problem.…”

Section: A Qos Routingmentioning

confidence: 99%

“…In their 2-Restricted Link Disjoint Paths (2DP) problem they minimized the total cost of the paths while both paths have to obey a specific delay bound D. Several approximations were presented in [11] for the 2DP problem. To further generalize, Xiao et.…”

Section: A Qos Routingmentioning

confidence: 99%

“…introduced the problem of finding a set of k link-disjoint paths from s to t [12], such that the total cost of these paths is a minimum and that the delay for each path is not greater than a specified bound (T ). Of course this problem contains the problem of 2DP, thus, it is also NP-hard [11]. Besides obeying a delay bound for each individual path, in [12] a more general network programming based approach was presented for finding k constrained shortest link-disjoint paths, such that the overall delay of these paths should be lower than a specified bound (kT ).…”

Section: A Qos Routingmentioning

confidence: 99%

See 3 more Smart Citations

Delay aware survivable routing with network coding in Software Defined Networks

Pašić

Babarczi

2015

2015 7th International Workshop on Reliable Networks Design and Modeling (RNDM)

View full text Add to dashboard Cite

Abstract-It was demonstrated in transport networks that network (diversity) coding can provide sufficient redundancy to ensure instantaneous single link failure recovery, while nearoptimal bandwidth efficiency can be reached. However, in the resulting multi-path routing problem the end-to-end delays were not considered. On the other hand, even in a European-scale network the delay difference of the paths has severe effect on the Quality-of-Service of application scenarios, such as video streaming. Thus, in this paper we thoroughly investigate survivable routing in Software Defined Networks (SDNs) with several additional delay bounds to the bandwidth cost minimization problem. We build on the fact that, if the user data is split into at most two parts, then the minimum cost coding solution has a well-defined acyclic structure of subsequent paths and disjoint path-pairs between the communication end-points. Complexity analysis and integer linear programs are provided to solve these delay aware survivable routing problems in SDNs.

show abstract

Section: Minmentioning

confidence: 95%

Section: A Qos Routingmentioning

confidence: 99%

Section: A Qos Routingmentioning

confidence: 99%

Section: A Qos Routingmentioning

confidence: 99%

See 2 more Smart Citations

Delay aware survivable routing with network coding in Software Defined Networks

Pašić

Babarczi

2015

2015 7th International Workshop on Reliable Networks Design and Modeling (RNDM)

View full text Add to dashboard Cite

show abstract

“…We call this problem the Singly Constrained Shortest Pair of Disjoint Paths (SCSPD). There has been work trying to find the shortest pair of msjoint paths such that each path is constrained by the same parameter (25). The authors found that this doubly constrained problem, while NP-Hard, has an ,-approximation algorithm.…”

Section: Lemmamentioning

confidence: 99%

Network Protection with Multiple Availability Guarantees

Kuperman¹,

Modiano²,

Narula-Tam³

2011

View full text Add to dashboard Cite

Public reporting burden for this collection of information is estimated to average 1 hour per response, including the time for reviewing instructions, searching existing data sources, gathering and maintaining the data needed, and completing and reviewing this collection of information. Send comments regarding this burden estimate or any other aspect of this collection of information, including suggestions for reducing this burden to Department of Defense, Washington Headquarters Services, Directorate for Information We develop a novel network protection scheme that provides guarantees on the time a flow has full connectivity, and guarantees a quantifiable minimum grade of service during a downtime. In particular, a flow can be below the full demand for at most a maximum fraction of time; and then, it must still support at least a fraction q of the full demand. This is in contrast to current protection schemes that offer either full protection or availability-guarantees with no connectivity during the downtime. We develop algorithms for the single and multiple commodity cases for general networks, and show that significant capacity savings can be achieved as compared to full protection. For example, if a connection is allowed to drop to 50% of its bandwidth for 1 out of every 20 failures, then a 24% reduction in spare capacity can be achieved over traditional full protection schemes. For the case of q = 0, which is the standard protection constraint, an optimal pseudo-polynomial timed algorithm is presented. Abstract-We develop a novel network protection scheme that provides guarantees on the time a flow has full connectivity, and guarantees a quantifiable minimum grade of servke during • downtime. In particular, a Bow can be below tbe full demand for at most a maximum fraction of time; aDd then, it must still support at least a fraction q of the full demand. This is in contrast to current protection schemes that otTer either full protection or availability-guarantees with no connectivity during the downtime. PERFORMING ORGANIZATION NAME(S) AND ADDRESS(ES) 8. PERFORMING ORGANIZATION REPORT NUMBER SPONSORING / MONITORING AGENCY NAME(S) AND ADDRESS(ES) 10. SPONSOR/MONITOR'S ACRONYM(S) SPONSOR/MONITOR'S REPORT NUMBER(S)We develop algorithms for the single and multiple commodity cases for general networks, and show that significant capacity savings can be achieved as compared to full protection. For eJWllple, if. roonection is allowed to drop to 50% of its bandwidth for lout of every 20 failures, then a 24% reduction in spare capacity can be achieved over traditional full protection schemes. For the case of q = 0, which is the standard protection constraint, an optimal pseudo-polynomial timed algorithm is presented.

show abstract

Concurrent multipath traffic impersonating for enhancing communication privacy

Liu

Wang

Miao

2013

Int J Communication

View full text Add to dashboard Cite

Network communication traditionally only uses encryption techniques for privacy and a single path for routing, which makes the communication vulnerable to attackers. Attackers easily obtain much important information by eavesdropping on the path and analyzing the communication traffic. To overcome the problem, we propose concurrent multipath traffic impersonating (CMTI), which obscures traffic features by camouflaging the traffic flow and dividing it into multiple parts. We propose a traffic impersonating technique based on statistical simulation, which make the secret traffic look like another normal and inconspicuous class to deceive attackers. And we present the packet scheduling algorithm to transfer the impersonating flows on multipath, for enhancing the communication efficiency and further increasing significantly the cost inflicted on attackers who wish to eavesdrop communication sessions. The empirical analysis demonstrates that concurrent multipath traffic imitating can effectively thwart traffic analysis and enhance communication efficiency. Copyright © 2013 John Wiley & Sons, Ltd.

show abstract

Efficient algorithms for computing disjoint QoS paths

Cited by 61 publications

References 15 publications

Delay aware survivable routing with network coding in Software Defined Networks

Delay aware survivable routing with network coding in Software Defined Networks

Network Protection with Multiple Availability Guarantees

Concurrent multipath traffic impersonating for enhancing communication privacy

Contact Info

Product

Resources

About