中国科学院软件研究所机构知识库
Advanced  
ISCAS OpenIR  > 软件工程技术研究开发中心  > 会议论文
题名:
a service discovery system analyzed with a queueing theory model
作者: Jin Beihong ; Weng Haibin ; Wen Yunfeng ; Zhang Faen
会议文集: Proceedings - International Computer Software and Applications Conference
会议名称: IEEE 33rd International Computer Software and Applications Conference
会议日期: JUL 20-24,
出版日期: 2009
会议地点: Seattle, WA
关键词: Grid ; Internet ; SCN4I ; distributed suffix tree ; open Jackson network ; queueing theory model ; resource sharing ; service discovery system ; service integration ; Internet ; Web services ; grid computing ; queueing theory
出版者: 2009 IEEE 33RD INTERNATIONAL COMPUTER SOFTWARE AND APPLICATIONS CONFERENCE, VOLS 1 AND 2
出版地: 345 E 47TH ST, NEW YORK, NY 10017 USA
ISSN: 0730-3157
ISBN: 978-1-4244-4525-7
部门归属: Jin, Beihong; Weng, Haibin; Wen, Yunfeng; Zhang, Faen Chinese Acad Sci, Inst Software, Beijing, Peoples R China.
主办者: IEEE
英文摘要: Service discovery is indispensable to both resource sharing and service integration in the Internet/Grid. In the face of enormous and various services which scatter in the Internet/Grid, the central issue needed to be addressed by a service discovery system is how to quickly shrink the search scope and exactly locate the desired services. Moreover, since simulation experiments are limited in the number of server nodes, the number and diversification of services etc., which are much less than the real ones in the Internet/Grid, it is necessary to predict the behaviors of service discovery systems and check whether these systems reach their design goals before deploying them by theoretical modeling. This paper develops a service discovery system named SCN4I, which builds an accurate index in the form of a distributed suffix tree to speed up the discovery procedure. Moreover, the paper employs open Jackson network to model SCN4I. Experiments are also conducted to verify the model. Furthermore the model is used to calculate SCN4Is performance bounds and help choose proper deployment policies. Our modeling approach can also be applied to the other service discovery systems for the Internet/Grid.
内容类型: 会议论文
URI标识: http://ir.iscas.ac.cn/handle/311060/8278
Appears in Collections:软件工程技术研究开发中心 _会议论文

Files in This Item:

There are no files associated with this item.


Recommended Citation:
Jin Beihong,Weng Haibin,Wen Yunfeng,et al. a service discovery system analyzed with a queueing theory model[C]. 见:IEEE 33rd International Computer Software and Applications Conference. Seattle, WA. JUL 20-24,.
Service
Recommend this item
Sava as my favorate item
Show this item's statistics
Export Endnote File
Google Scholar
Similar articles in Google Scholar
[Jin Beihong]'s Articles
[Weng Haibin]'s Articles
[Wen Yunfeng]'s Articles
CSDL cross search
Similar articles in CSDL Cross Search
[Jin Beihong]‘s Articles
[Weng Haibin]‘s Articles
[Wen Yunfeng]‘s Articles
Related Copyright Policies
Null
Social Bookmarking
Add to CiteULike Add to Connotea Add to Del.icio.us Add to Digg Add to Reddit
所有评论 (0)
暂无评论
 
评注功能仅针对注册用户开放,请您登录
您对该条目有什么异议,请填写以下表单,管理员会尽快联系您。
内 容:
Email:  *
单位:
验证码:   刷新
您在IR的使用过程中有什么好的想法或者建议可以反馈给我们。
标 题:
 *
内 容:
Email:  *
验证码:   刷新

Items in IR are protected by copyright, with all rights reserved, unless otherwise indicated.

 

 

Valid XHTML 1.0!
Copyright © 2007-2017  中国科学院软件研究所 - Feedback
Powered by CSpace