解耦空间网络中为特殊服务提供商提供资源竞标

K. Wongrujira, P. Sookavatana, A. Seneviratne
{"title":"解耦空间网络中为特殊服务提供商提供资源竞标","authors":"K. Wongrujira, P. Sookavatana, A. Seneviratne","doi":"10.1109/APCC.2003.1274376","DOIUrl":null,"url":null,"abstract":"In this paper we present the design and implementation of a framework that used JavaSpaces to support a bidding service over the decoupling network. There is a high expectation and demand for a network that could support various devices. With JavaSpaces technique, the user who requested services and the provider who provided services could read, write or take an entry task to/from the space. It was possible that one service provider could not support all client application needs. Therefore, the requirement of the chaining application and finding the lowest cost of the cascade sequence were in the interested area of middle ware network for the Internet application and adaptation. In addition, we also showed that the price and cost for support specific application could turn into the bidding concept. Hence, in this paper we focused on a research in finding an application and come out with bidding cost where we implemented JavaSpaces as a middle object pool. The result was shown by a comparison of consuming time between provision read the resource node and real time read the resource node. These ideas could extend to further perform in a recursive fashion for finding specific service applications.","PeriodicalId":277507,"journal":{"name":"9th Asia-Pacific Conference on Communications (IEEE Cat. No.03EX732)","volume":"29 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2003-09-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Provision resource bidding for special service provider in decoupling spaces network\",\"authors\":\"K. Wongrujira, P. Sookavatana, A. Seneviratne\",\"doi\":\"10.1109/APCC.2003.1274376\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In this paper we present the design and implementation of a framework that used JavaSpaces to support a bidding service over the decoupling network. There is a high expectation and demand for a network that could support various devices. With JavaSpaces technique, the user who requested services and the provider who provided services could read, write or take an entry task to/from the space. It was possible that one service provider could not support all client application needs. Therefore, the requirement of the chaining application and finding the lowest cost of the cascade sequence were in the interested area of middle ware network for the Internet application and adaptation. In addition, we also showed that the price and cost for support specific application could turn into the bidding concept. Hence, in this paper we focused on a research in finding an application and come out with bidding cost where we implemented JavaSpaces as a middle object pool. The result was shown by a comparison of consuming time between provision read the resource node and real time read the resource node. These ideas could extend to further perform in a recursive fashion for finding specific service applications.\",\"PeriodicalId\":277507,\"journal\":{\"name\":\"9th Asia-Pacific Conference on Communications (IEEE Cat. No.03EX732)\",\"volume\":\"29 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2003-09-21\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"9th Asia-Pacific Conference on Communications (IEEE Cat. No.03EX732)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/APCC.2003.1274376\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"9th Asia-Pacific Conference on Communications (IEEE Cat. No.03EX732)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/APCC.2003.1274376","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

摘要

在本文中,我们介绍了一个框架的设计和实现,该框架使用JavaSpaces来支持解耦网络上的投标服务。人们对能够支持各种设备的网络有着很高的期望和需求。使用JavaSpaces技术,请求服务的用户和提供服务的提供者可以在空间中读写或执行输入任务。一个服务提供者可能无法支持所有客户端应用程序需求。因此,在Internet的应用和适应中,对链应用的要求和寻找级联序列的最低代价是中间件网络感兴趣的领域。此外,我们还展示了支持特定应用的价格和成本可以转化为投标概念。因此,在本文中,我们将重点放在寻找应用程序的研究上,并得出我们将JavaSpaces实现为中间对象池的投标成本。通过对比预置读取资源节点和实时读取资源节点所消耗的时间,可以看出这一结果。这些思想可以进一步扩展,以递归方式查找特定的服务应用程序。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
Provision resource bidding for special service provider in decoupling spaces network
In this paper we present the design and implementation of a framework that used JavaSpaces to support a bidding service over the decoupling network. There is a high expectation and demand for a network that could support various devices. With JavaSpaces technique, the user who requested services and the provider who provided services could read, write or take an entry task to/from the space. It was possible that one service provider could not support all client application needs. Therefore, the requirement of the chaining application and finding the lowest cost of the cascade sequence were in the interested area of middle ware network for the Internet application and adaptation. In addition, we also showed that the price and cost for support specific application could turn into the bidding concept. Hence, in this paper we focused on a research in finding an application and come out with bidding cost where we implemented JavaSpaces as a middle object pool. The result was shown by a comparison of consuming time between provision read the resource node and real time read the resource node. These ideas could extend to further perform in a recursive fashion for finding specific service applications.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Effectiveness of information systems security in IT organizations in Malaysia Minimization of the PAPR of OFDM by linear systematic block coding Analysis of fiber Bragg gratings apodized with linearly approximated segmented Gaussian function Design and implementation of autonomous distributed secret sharing storage system Low power design of block FIR filtering for high throughput rate applications
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1