A QoS-aware service selection algorithm for multimedia service overlay networks

Multimedia applications are becoming more and more popular on today's Internet. Given the enormous development costs and less flexibility, traditional monolithic based approaches are not suitable for building large-scale multimedia systems. By composing of distributed, autonomous services dynamically to provide more complex tasks, service composition provides an attractive way for building large-scale Internet applications. So, multimedia service composition provides a viable solution to large-scale complex multimedia systems. One of the challenging issues of multimedia service composition is how to find service paths to route the data flows through while meeting the applications' resource requirements and specific QoS constraints. However, QoS-aware service routing problem is typically NP-hard. In this paper, we propose a heuristic algorithm named greedy-EF to solve this problem more effectively. More specially, greedy-EF uses an aggregate function to evaluate the QoS conditions for each service instance, and a hop-by-hop service selection approach to explore the proper service path. Simulations show that greedy-EF algorithm can achieve desired QoS assurances as well as load balancing in multimedia service overlay networks.

[1]  Klara Nahrstedt,et al.  SpiderNet: an integrated peer-to-peer service composition framework , 2004, Proceedings. 13th IEEE International Symposium on High performance Distributed Computing, 2004..

[2]  Klara Nahrstedt,et al.  Finding service paths in a media service proxy network , 2001, IS&T/SPIE Electronic Imaging.

[3]  Quan Z. Sheng,et al.  Quality driven web services composition , 2003, WWW '03.

[4]  Klara Nahrstedt,et al.  An overview of quality of service routing for next-generation high-speed networks: problems and solutions , 1998, IEEE Netw..

[5]  Tilman Wolf,et al.  Configuring sessions in programmable networks , 2001, Proceedings IEEE INFOCOM 2001. Conference on Computer Communications. Twentieth Annual Joint Conference of the IEEE Computer and Communications Society (Cat. No.01CH37213).

[6]  Mike P. Papazoglou,et al.  Introduction: Service-oriented computing , 2003, CACM.

[7]  Carey L. Williamson,et al.  Internet Web servers: workload characterization and performance implications , 1997, TNET.

[8]  Wolf-Tilo Balke,et al.  Towards building large scale multimedia systems and applications: challenges and status , 2005, MSC '05.

[9]  Ellen W. Zegura,et al.  How to model an internetwork , 1996, Proceedings of IEEE INFOCOM '96. Conference on Computer Communications.

[10]  Wolf-Tilo Balke,et al.  A taxonomy for multimedia service composition , 2004, MULTIMEDIA '04.

[11]  Klara Nahrstedt,et al.  QoS-assured service composition in managed service overlay networks , 2003, 23rd International Conference on Distributed Computing Systems, 2003. Proceedings..

[12]  Li Fan,et al.  Web caching and Zipf-like distributions: evidence and implications , 1999, IEEE INFOCOM '99. Conference on Computer Communications. Proceedings. Eighteenth Annual Joint Conference of the IEEE Computer and Communications Societies. The Future is Now (Cat. No.99CH36320).

[13]  Klara Nahrstedt,et al.  Service composition for advanced multimedia applications , 2005, IS&T/SPIE Electronic Imaging.

[14]  Tao Yu,et al.  Service selection algorithms for Web services with end-to-end QoS constraints , 2004, Proceedings. IEEE International Conference on e-Commerce Technology, 2004. CEC 2004..

[15]  Randy H. Katz,et al.  Load balancing and stability issues in algorithms for service composition , 2003, IEEE INFOCOM 2003. Twenty-second Annual Joint Conference of the IEEE Computer and Communications Societies (IEEE Cat. No.03CH37428).