A service path selection and adaptation algorithm for QoS assurance and load balancing in context-aware service overlay networks

Lee, Kwonyong; Park, Sung-Yong

doi:10.1504/ijwgs.2015.070963

Cited by 2 publications

(2 citation statements)

References 14 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…SpiderNet in [23] is a P2P service composition framework that can simultaneously guarantee QoS and load balancing in distributed environment. Authors in [24] propose an algorithm for QoS assurance and load balancing (QALB) on the basis of SpiderNet by changing the weights of cost function dynamically. In [23] and [24], the service requests and responses are generated in distributed nodes, but the selection of path is made centrally by sink node.…”

Section: Related Workmentioning

confidence: 99%

See 1 more Smart Citation

Central Control over Distributed Service Function Path

Li¹,

Lan²,

Hu³

2020

KSII TIIS

View full text Add to dashboard Cite

Service Function Chaining (SFC) supports services through linking an ordered list of functions. There may be multiple instances of the same function, which provides a challenge to select available instances for all the functions in an SFC and generate a specific Service Function Path (SFP). Aiming to solve the problem of SFP selection, we propose an architecture consisting of distributed SFP algorithm and central control mechanism. Nodes generate distributed routings based on the first function and destination node in each service request. Controller supervises all of the distributed routing tables and modifies paths as required. The architecture is scalable, robust and quickly reacts to failures because of distributed routings. Besides, it enables centralized and direct control of the forwarding behavior with the help of central control mechanism. Simulation results show that distributed routing tables can generate efficient SFP and the average cost is acceptable. Compared with other algorithms, our design has a good performance on average cost of paths and load balancing, and the response delay to service requests is much lower.

show abstract

Section: Related Workmentioning

confidence: 99%

“…In this section, we compare the performance of our design (CDSFP) with other existing algorithms in distributed environment, SpiderNet in [23] and QALB in [24]. Exhaustive method is also simulated to show the performance of best paths.…”

Section: Performance Of Central Control Mechanismmentioning

confidence: 99%