Context and Location based Service Grouping and Group Notification

被引:0
作者
Desai, Amee [1 ]
Laliwala, Zakir [2 ]
Chaudhary, Sanjay [1 ]
机构
[1] Dhirubhai Ambani Inst Informat & Commun Technol, Gandhinagar 382007, India
[2] CIGNEX Technol, Ahmadabad 380054, Gujarat, India
来源
2009 IEEE ASIA-PACIFIC SERVICES COMPUTING CONFERENCE (APSCC 2009) | 2009年
关键词
D O I
暂无
中图分类号
TP301 [理论、方法];
学科分类号
081202 ;
摘要
Service-oriented computing enables service providers to publish their business functionalities in the form of abstract contracts, which can be discovered by service consumers based on open and standard protocols. Enterprise may be running a number of multiple business processes in parallel, which may require different services to fulfill the functionality. To provide better search, query, composition, and management, we need a mechanism to group these services based on the requirements of clients and business processes. In this paper, we have proposed context and location based approach for service grouping and group notification. Context and location provide powerful mechanism for better search, query, grouping and grouping notification to the services. It allows customization based on user preferences, role, and location to improve personalization. This paper proposes context and location driven grid business process to aggregate information from multiple sources according to the preferences of clients. We have used policy based service grouping approach to aggregate services.
引用
收藏
页码:197 / +
页数:2
相关论文
共 14 条
[1]  
AKRAM A, 2007, SECURING WEB SERVICE
[2]  
[Anonymous], 2004, DAT SYS APP
[3]  
Bussler C., 2003, B2B integration: Concepts and architecture
[4]  
DESAI A, 2007, WORKSH GRID UT COMP
[5]  
LALIWALA Z, 2006, INT WORKSH DISTR EV
[6]  
LALIWALA Z, 2006, 13 ASI PAC SOFTW ENG
[7]  
LALIWALA Z, 2006, IEEE INT C SERV COMP
[8]  
LALIWALA Z, 2006, 3 INT C INN INF TECH
[9]  
LALIWALA Z, 2006, 3 INT WORKSH SEM DYN
[10]   What can context do for Web services? [J].
Maamar, Zakaria ;
Benslimane, Djamal ;
Narendra, Nanjangud C. .
COMMUNICATIONS OF THE ACM, 2006, 49 (12) :98-103