2010 IEEE/IFIP Network Operations and Management Symposium Workshops 2010
DOI: 10.1109/nomsw.2010.5486578
|View full text |Cite
|
Sign up to set email alerts
|

End-to-end QoS negotiation in network federations

Abstract: 1 The Future Internet will see the emergence of value-added applications (e.g. telepresence, etc.) requiring Quality of Service (QoS) guarantees across multiple managed networks. Deploying mechanisms to solve technical questions entails a minimal cooperation between network operators (aka. carriers). But, this cooperation is subject to economic constraints (e.g. confidentiality on resources, pricing, risk avoidance, etc.). To overcome them, an interesting direction lies in the creation of operator federations,… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
12
0

Year Published

2011
2011
2015
2015

Publication Types

Select...
4
1
1

Relationship

0
6

Authors

Journals

citations
Cited by 18 publications
(12 citation statements)
references
References 10 publications
0
12
0
Order By: Relevance
“…2.1 Multi-constrained optimal path problem Finding QoS-constrained cheapest paths through a network is equivalent to the multi-constrained optimal path (MCOP) graph problem [10]. This problem has long been known to be NPcomplete [11].…”
Section: Related Workmentioning
confidence: 99%
See 2 more Smart Citations
“…2.1 Multi-constrained optimal path problem Finding QoS-constrained cheapest paths through a network is equivalent to the multi-constrained optimal path (MCOP) graph problem [10]. This problem has long been known to be NPcomplete [11].…”
Section: Related Workmentioning
confidence: 99%
“…A coordinating agent makes sure the total offered QoS satisfies the requested amount. Pouyllau et al proposed a novel algorithm for setting up endto-end network federations for the delivery of QoS-constrained services [10]. They assume the set of candidate paths has already been found, using an existing MCOP algorithm.…”
Section: End-to-end Quality Of Servicementioning
confidence: 99%
See 1 more Smart Citation
“…Xiangjiang et al presented a similar approach, also based on BGP [4]. More closely related to the work presented in this paper, Pouyllau and Douville proposed an algorithm for negotiating a QoS-guaranteed path across the Internet through setting up network federations [5], [6]. They use a game theory approach combined with Q-learning in order to find paths that satisfy the QoS requirements, while maximizing long-term objectives.…”
Section: Related Workmentioning
confidence: 99%
“…The problem of finding a path between two edge domains and selecting suitable QoS levels in each intermediary domain along the path has been studied in the past, for example by Pouyllau and Douville [5]. They found the problem to be equivalent to the k-multi-constrained optimal path problem [15], which is NP-Hard.…”
Section: B Problem Formulationmentioning
confidence: 99%