Economic and technical propositions for inter-domain services

Pouyllau, Helia; Douville, Richard; Djarallah, Nabil Bachir; Sauze, Nicolas Le

doi:10.1002/bltj.20362

Cited by 8 publications

(8 citation statements)

References 15 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…In such competitive scenarios (multi-domain negotiation), service composition also needs to consider the business characteristics [15] of each service (price, availability, warranties, penalties, etc. ), so the providers can take advantage of their strategies to reach their business goals.…”

Section: Specification Of Service Classesmentioning

confidence: 99%

A service composition approach for inter-domain provisioning

Matos

Simões

et al. 2010

2010 International Conference on Network and Service Management

View full text Add to dashboard Cite

Inter-domain QoS-aware service provisioning is still a complex task due to the Internet heterogeneity. It is necessary to overcome several obstacles in order to achieve a scenario where providers fully interact to satisfy all customer service requirements. Some of these obstacles are service class specification and service composition. This paper presents an integrated approach for service class specification and service composition that supports the provisioning of QoS-aware services in inter-domain environments. This approach makes use of QoS performance parameters, service-specific parameters and business parameters to compose services that fulfill customer requirements and comply with providers' business expectations.

show abstract

Section: Specification Of Service Classesmentioning

confidence: 99%

A service composition approach for inter-domain provisioning

Matos

Simões

et al. 2010

2010 International Conference on Network and Service Management

View full text Add to dashboard Cite

show abstract

“…In this paper our focus is on technical constraints and how we can compute multiple interdomain paths subject to these constraints, than economic and political constraints. In [15] we discussed in detail economic policies for inter-domain services.…”

Section: Business Impacts On Inter-domain Path Computationmentioning

confidence: 99%

Distributed E2E QoS-Based Path Computation Algorithm over Multiple Inter-domain Routes

Djarallah¹,

Sauze²,

Pouyllau³

et al. 2011

2011 International Conference on P2P, Parallel, Grid, Cloud and Internet Computing

View full text Add to dashboard Cite

Abstract-1 Internet usages have changed with the emergence of value added services relying on a higher interactivity and needs for a better quality of experience (QoE). Telecommunication operators have to face a continuing growth of new types of Internet traffic (video, games, telepresence, etc.) imposing not only a more efficient utilization of their network infrastructure resources, but also the generation of new revenues to pursue investments and sustain the increasing demand. Such services generally cross multiple domains, but inter-domain routing protocols still have some limitations in terms of service assurance. For example, BGP's single route announce for a destination limits potential traffic engineering features (e.g. no quality of service price/efficiency optimisation, inter-domain shared route protection, inter-domain load balancing, etc.). In order to provision endto-end inter-domain connections that obey to constraints such as bandwidth, delay, jitter, and packet loss for these services, an interesting approach is to compute end-to-end (e2e) paths over multiple inter-domain routes. This will allow establishing more efficiently the inter-domain connections with respect to requested QoS constraints and sharing these constraints (and associated revenues) among multiple operators to globally accept more demands in the system, while keep satisfying the customer QoE. To address these challenges, we propose an efficient distributed inter-domain algorithm that computes such constrained paths among a set of domains, exploring multiple inter-domain routes. We demonstrate that our algorithm not only increases success rate in delivering feasible paths, but also admits more connections and keeps a reasonable runtime.

show abstract

“…To fit within operator requirements for confidentiality, SLSs represent resources in an abstract manner through various attributes (e.g., QoS parameters, business criteria, or security levels). The publication of SLSs and the scenario we consider in this section could only hold in a frame of trust such as operator federations/alliances described in [17,21]. Building an endto-end QoS contract requires combining SLS thresholds over QoS parameters so that each of the combinations respects a corresponding QoS requirement (e.g., the sum of SLS thresholds on delays respects an end-to-end transmission delay).…”

Section: Problem 2: Inter-domain Sla Negotiationmentioning

confidence: 99%

“…The variables of the problems are binary integers, with , indicating whether or not an SLS is selected for a given set of QoS requirements, D. To represent the combination of QoS numerical values, equation 4 borrows the operator from [21] that combines parameter thresholds with respect to their mathematical type (e.g., delay is additive; availability is multiplicative), transforming them into additive ones. Complexity.…”

Section: Definition 1 Service Level Specification and Qos Profilesmentioning

confidence: 99%

Realizing self-management via self-optimization in dynamic networks: Two examples of dynamic resource allocation

Carofiglio¹,

Peloso²,

Pouyllau³

2010

Bell Labs Tech. J.

View full text Add to dashboard Cite

It is a shared belief that self-management is the right framework to address all these network operation issues. More precisely, the focus of this paper is on self-optimization, which is one of the four facets of self-x systems [15].Within the networking context, optimization problems share the objective of efficiency versus both dynamicity and scalability. Self-optimization algorithms appear to be an innovative solution for addressing and solving such concerns. Furthermore, self-optimization pleads for embedding algorithms, which push decisions as close as possible to the acting element. The closeness limit is often derived from the information required for decision making.This paper deals with the design of self-optimization modules and illustrates the advantages of this kind of

show abstract

Economic and technical propositions for inter-domain services

Abstract: The next challenge for carriers consists of proposing value-added services (e.g., videoconferencing)

Cited by 8 publications

References 15 publications

A service composition approach for inter-domain provisioning

A service composition approach for inter-domain provisioning

Distributed E2E QoS-Based Path Computation Algorithm over Multiple Inter-domain Routes

Realizing self-management via self-optimization in dynamic networks: Two examples of dynamic resource allocation

Contact Info

Product

Resources

About