5th International ICST Conference on Heterogeneous Networking for Quality, Reliability, Security and Robustness

Research Article

QoS-Guaranteed Path Selection Algorithm for Service Composition

Download580 downloads
  • @INPROCEEDINGS{10.4108/ICST.QSHINE2008.3959,
        author={Manish Jain and Puneet Sharma and Sujata Banerjee},
        title={QoS-Guaranteed Path Selection Algorithm for Service Composition},
        proceedings={5th International ICST Conference on Heterogeneous Networking for Quality, Reliability, Security and Robustness},
        publisher={ICST},
        proceedings_a={QSHINE},
        year={2010},
        month={5},
        keywords={Overlay network service composition},
        doi={10.4108/ICST.QSHINE2008.3959}
    }
    
  • Manish Jain
    Puneet Sharma
    Sujata Banerjee
    Year: 2010
    QoS-Guaranteed Path Selection Algorithm for Service Composition
    QSHINE
    ICST
    DOI: 10.4108/ICST.QSHINE2008.3959
Manish Jain1,*, Puneet Sharma2,*, Sujata Banerjee2,*
  • 1: Telchemy Inc. Duluth, USA
  • 2: Hewlett-Packard Labs Palo Alto, USA
*Contact email: manish.jain@telchemy.com, puneet.sharma@hp.com, sujata.banerjee@hp.com

Abstract

Service overlay networking is an emerging approach, which employs overlay nodes to provide advanced services by dynamically composing it from basic services available on overlay nodes. Advanced service request from users can have different and multiple quality-of-service (QoS) requirements and finding a service path that meets these multiple requirements is an open problem. Also, network operators have operating requirements such as load-balancing to minimize hotspots and/or minimizing the overall utilization of resources in their network. In this work, we describe a novel algorithm K-Closest Pruning (KCP), based on proximity based tree pruning, to efficiently determine a service path meeting all the QoS requirements. An additional novel feature in this algorithm is that it incorporates the minimal resource utilization or load-balancing constraints into the path selection process. KCP algorithm achieves a polynomial running time and is the first, in our knowledge, to take both the QoS requirements (user/application perspective) and resource utilization (operator perspective) into account. We show that the KCP algorithm performs significantly better than previous solutions in terms of meeting the QoS requirements of user requests.