Finding a Path Subject to Many Additive QoS Constraints

Xue, Guoliang; Sen, Arunabha; Zhang, Weiyi; Tang, Jian; Thulasiraman, K.

doi:10.1109/tnet.2006.890089

Cited by 106 publications

(82 citation statements)

References 21 publications

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…We used the pseudocut problems to formulate a vulnerability assessment TCVA with respect to an arbitrary additive QoS metric on a communications network. Future work would include extending this assessment to incorporate more than one QoS metric; however, this is likely to be difficult as the problem of finding a routing path satisfying two or more QoS constraints is NP-hard; however, approximation algorithms do exist for this problem [29]. In addition, the computational complexity of the uniform edge length version of our simplest problem, T-PCUT, is left open; our NPhardness proof required nonuniform edge lengths and we provided polynomial-time algorithms only for special cases.…”

Section: Discussionmentioning

confidence: 99%

“…We also used topologies generated according to Erdos-Renyi (ER) random graphs. To simulate a QoS metric, edges were weighted uniformly in the interval [1,10], following [29], [14]. The dataset statistics are as follows: ER1, an ER graph with n = 1000, m = 49995; RL1, router-level graph with n = 5000, m = 250000, generated by BRITE with default parameters and Waxman model; RL2, same as RL1 except n = 1000, m = 2000; RL3, same as RL1 except n = 100, m = 200; AS1, an AS-level graph generated by BRITE with default parameters and n = 10000, m = 498725; and finally, H1, a hierarchical BRITE top-down graph with 200 autonomous systems and 100 routers per AS, with n = 20000, m = 660604.…”

Section: A Datasets and Methodologymentioning

confidence: 99%

See 1 more Smart Citation

Pseudo-Separation for Assessment of Structural Vulnerability of a Network

Kuhnle

Pan

Crawford

et al. 2017

SIGMETRICS Perform. Eval. Rev.

View full text Add to dashboard Cite

Abstract-Based upon the idea that network functionality is impaired if two nodes in a network are sufficiently separated in terms of a given metric, we introduce two combinatorial pseudocut problems generalizing the classical min-cut and multicut problems. We expect the pseudocut problems will find broad relevance to the study of network reliability. We comprehensively analyze the computational complexity of the pseudocut problems and provide three approximation algorithms for these problems.Motivated by applications in communication networks with strict Quality-of-Service (QoS) requirements, we demonstrate the utility of the pseudocut problems by proposing a targeted vulnerability assessment for the structure of communication networks using QoS metrics; we perform experimental evaluations of our proposed approximation algorithms in this context.

show abstract

Section: Discussionmentioning

confidence: 99%

Section: A Datasets and Methodologymentioning

confidence: 99%

Pseudo-Separation for Assessment of Structural Vulnerability of a Network

Kuhnle

Pan

Crawford

et al. 2017

SIGMETRICS Perform. Eval. Rev.

View full text Add to dashboard Cite

show abstract

“…This was published in 1973 by Liu and Layland [5]. The algorithm was based on static task priorities.…”

Section: Rate Monotonic Scheduling Algorithm (Rms)mentioning

confidence: 99%

“…In order to prove this, one has to calculate for each task the time when its execution end. If the execution end time of each task is shorter than its time deadline, it means that the set of tasks is schedulable [5].…”

Section: Basic Properties Of Rate Monotonic Schedulingmentioning

confidence: 99%

QoS Driven Task Scheduling in Cloud Computing

Dubey¹,

Agrawal²

2013

IJCATR

View full text Add to dashboard Cite

Cloud computing systems promise to offer pay per use, on demand computing services to users worldwide. Recently, there has been a dramatic increase in the demand for delivering services to a large number of users, so they need to offer differentiate d services to users and meet their expected quality requirements. Most of scheduling schemes proceeding nowadays have no QoS (Quality of Service) differentiation, which is necessary for Cloud Computing service operation. As a cloud must provide services to many users at the same time and different users have different QoS requirements, the scheduling schemes should be developed having different QoS requirements. So, this paper explores various methods of task scheduling done in cloud computing. Real-time applications play a significant role in cloud environment. We have examine the particular scheduling algorithms for real -time tasks, that is, priority-based strategies.The purpose of this paper is to discuss the fixed priority preemptive task scheduling algorithms in cloud computing for improving the QoS parameters.

show abstract

“…For other applications, variants of the problem are needed. QoS requirements may set one or more constraints to be satisfied along the path [1]. In general, QoS constraints can be classified into additive, multiplicative, and concave.…”

Section: Introductionmentioning

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

Finding a Path Subject to Many Additive QoS Constraints

Cited by 106 publications

References 21 publications

Pseudo-Separation for Assessment of Structural Vulnerability of a Network

Pseudo-Separation for Assessment of Structural Vulnerability of a Network

QoS Driven Task Scheduling in Cloud Computing

Maximum-Bandwidth Node-Disjoint Paths

Contact Info

Product

Resources

About