Service level agreements: a main challenge for next generation networks

Marilly, Emmanuel; Martinot, Olivier; Papini, H.; Goderis, D.

doi:10.1109/ecumn.2002.1002118

Cited by 50 publications

(22 citation statements)

References 3 publications

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…, and a red bar indicates a response time after service migration of S 7 2 from a source node SNode 1 to a target node SNode 2 . A red line indicates a threshold value of response time which is defined in SLA (Service Level Agreement) [14]. Therefore, the service S 7 2 has to provide its functionality to its consumers within the threshold value.…”

Section: Experiments Results and Interpretationmentioning

confidence: 99%

Dynamic Deployment of Services for Service-Based Mobile Ecosystem

Lee

Tran

et al. 2011

2011 IEEE 8th International Conference on E-Business Engineering

View full text Add to dashboard Cite

Mobile devices are widely accepted as a convergence machine which provides both cell phone capability and a lightweight computing capability. However, mobile devices have a major drawback of limited computing power and resources such as main memory and battery life. Service-based mobile applications are emerged as an efficient solution to overcome this limitation of mobile devices. On the other hand, with the advent of more powerful mobile devices, mobile devices are actively participating as computer nodes and performing enterprise functionality. In this paper, we present a practical framework for dynamically deploying services. With the ever increasing computing power of mobile devices, we project that mobile devices can also be used as computer nodes deploying services. A number of benefits for deploying services on mobile devices existed. In this paper, we define an ecosystem for service-based mobile computing, and present techniques for deploying services on station nodes and mobile nodes, which are challenging problems. By applying dynamical deployment of services on both station and mobile nodes, the overall quality of the ecosystem can be consistently maintained.

show abstract

Section: Experiments Results and Interpretationmentioning

confidence: 99%

Dynamic Deployment of Services for Service-Based Mobile Ecosystem

Lee

Tran

et al. 2011

2011 IEEE 8th International Conference on E-Business Engineering

View full text Add to dashboard Cite

show abstract

“…In many practical situations, this is unproblematic. It is common to use experienced requirements engineers for critical tasks such as the development of service level agreements of software-based services [40].…”

Section: Discussionmentioning

confidence: 99%

Quality requirements elicitation based on inquiry of quality-impact relationships

Fotrousi

Fricker

Fiedler

2014

2014 IEEE 22nd International Requirements Engineering Conference (RE)

View full text Add to dashboard Cite

“…Routing algorithms play an essential role in meeting these constraints as they provide the required QoS by considering the QoS metrics in the path selection process when routing incoming flows to the desired destination. The QoS term in the networking context specifies a guaranteed level of service constraints which should not be exceeded [2]. QoS routing refers to the routing algorithms that select paths with sufficient residual resources to meet the QoS constraints.…”

Section: Introductionmentioning

confidence: 99%

“…However, as the network topology and the availability of resources keep changing, maintaining an accurate global network view is impractical and adds considerable traffic and processing overheads to the network [1]. Another problem is that routing decisions are taken without considering the most recent state of resources which may result in forwarding flows over paths which are unable to support their requirements [2]. Consequently, this may lead to a considerable deterioration in performance as other paths with sufficient resources are left unutilized.…”

Section: Introductionmentioning

confidence: 99%

Localized QoS Routing Based on Links Blocking Probability

Aldosari

2014

2014 11th International Conference on Information Technology: New Generations

View full text Add to dashboard Cite

Localized Quality of Service (QoS) routing has recently been proposed as a promising alternative to the currently deployed global routing algorithms. In localized routing schemes, routing decisions are taken solely based on locally collected statistical information rather than global state information [1]. This approach significantly reduces the overheads associated with maintaining global state information at each node, which in turn improves the overall routing performance. In this paper we introduce a Localized QoS routing algorithm based on Link Blocking Probability (LBP). We compare the performance of the proposed algorithm against the most efficient localized routing algorithm, namely Credit Based Routing (CBR); and against the contemporary global routing algorithm, the Widest Shortest Path (WSP). With the aid of simulations, we show that the introduced algorithm outperforms the others in terms of the overall network blocking probability.

show abstract

Service level agreements: a main challenge for next generation networks

Cited by 50 publications

References 3 publications

Dynamic Deployment of Services for Service-Based Mobile Ecosystem

Dynamic Deployment of Services for Service-Based Mobile Ecosystem

Quality requirements elicitation based on inquiry of quality-impact relationships

Localized QoS Routing Based on Links Blocking Probability

Contact Info

Product

Resources

About