面向点对点计算网格的可伸缩qos感知服务聚合模型

Xiaohui Gu, K. Nahrstedt
{"title":"面向点对点计算网格的可伸缩qos感知服务聚合模型","authors":"Xiaohui Gu, K. Nahrstedt","doi":"10.1109/HPDC.2002.1029905","DOIUrl":null,"url":null,"abstract":"Peer-to-peer (P2P) computing grids consist of peer nodes that communicate directly among themselves through wide-area networks and can act as both clients and servers. These systems have drawn much research attention since they promote Internet-scale resource and service sharing without any administration cost or centralized infrastructure support. However aggregating different application services into a high-performance distributed application delivery in such systems is challenging due to the presence of dynamic performance information, arbitrary peer arrivals/departures, and systems' scalability requirement. In this paper we propose a scalable QoS-aware service aggregation model to address the challenges. The model includes two tiers: (1) on-demand service composition tier which is responsible for choosing and composing different application services into a service path satisfying the user's quality requirements; and (2) dynamic peer selection tier, which decides the specific peers where the chosen services are actually instantiated based on the dynamic, composite and distributed performance information. The model is designed and implemented in a fully distributed and self-organizing fashion. Conducting extensive simulations of a large-scale P2P system (10/sup 4/ peers), we show that our proposed model and algorithms achieve better performance than several common heuristic algorithms.","PeriodicalId":279053,"journal":{"name":"Proceedings 11th IEEE International Symposium on High Performance Distributed Computing","volume":"48 2 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2002-07-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"67","resultStr":"{\"title\":\"A scalable QoS-aware service aggregation model for peer-to-peer computing grids\",\"authors\":\"Xiaohui Gu, K. Nahrstedt\",\"doi\":\"10.1109/HPDC.2002.1029905\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Peer-to-peer (P2P) computing grids consist of peer nodes that communicate directly among themselves through wide-area networks and can act as both clients and servers. These systems have drawn much research attention since they promote Internet-scale resource and service sharing without any administration cost or centralized infrastructure support. However aggregating different application services into a high-performance distributed application delivery in such systems is challenging due to the presence of dynamic performance information, arbitrary peer arrivals/departures, and systems' scalability requirement. In this paper we propose a scalable QoS-aware service aggregation model to address the challenges. The model includes two tiers: (1) on-demand service composition tier which is responsible for choosing and composing different application services into a service path satisfying the user's quality requirements; and (2) dynamic peer selection tier, which decides the specific peers where the chosen services are actually instantiated based on the dynamic, composite and distributed performance information. The model is designed and implemented in a fully distributed and self-organizing fashion. Conducting extensive simulations of a large-scale P2P system (10/sup 4/ peers), we show that our proposed model and algorithms achieve better performance than several common heuristic algorithms.\",\"PeriodicalId\":279053,\"journal\":{\"name\":\"Proceedings 11th IEEE International Symposium on High Performance Distributed Computing\",\"volume\":\"48 2 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2002-07-24\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"67\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Proceedings 11th IEEE International Symposium on High Performance Distributed Computing\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/HPDC.2002.1029905\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings 11th IEEE International Symposium on High Performance Distributed Computing","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/HPDC.2002.1029905","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 67

摘要

点对点(P2P)计算网格由通过广域网直接相互通信的对等节点组成,这些节点既可以充当客户端,也可以充当服务器。这些系统在没有任何管理成本或集中基础设施支持的情况下促进了互联网规模的资源和服务共享,因此引起了广泛的研究关注。然而,由于存在动态性能信息、任意对等点到达/离开以及系统的可伸缩性需求,将不同的应用程序服务聚合到这样的系统中的高性能分布式应用程序交付中是具有挑战性的。在本文中,我们提出了一个可扩展的qos感知服务聚合模型来解决这些挑战。该模型包括两个层次:(1)按需服务组合层,负责选择不同的应用服务并将其组合成满足用户质量需求的服务路径;(2)动态对等选择层,根据动态、复合和分布式的性能信息,决定所选服务实际实例化的具体对等层。该模型以完全分布式和自组织的方式设计和实现。通过对大规模P2P系统(10/sup 4/ peers)的广泛模拟,我们表明我们提出的模型和算法比几种常见的启发式算法具有更好的性能。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
A scalable QoS-aware service aggregation model for peer-to-peer computing grids
Peer-to-peer (P2P) computing grids consist of peer nodes that communicate directly among themselves through wide-area networks and can act as both clients and servers. These systems have drawn much research attention since they promote Internet-scale resource and service sharing without any administration cost or centralized infrastructure support. However aggregating different application services into a high-performance distributed application delivery in such systems is challenging due to the presence of dynamic performance information, arbitrary peer arrivals/departures, and systems' scalability requirement. In this paper we propose a scalable QoS-aware service aggregation model to address the challenges. The model includes two tiers: (1) on-demand service composition tier which is responsible for choosing and composing different application services into a service path satisfying the user's quality requirements; and (2) dynamic peer selection tier, which decides the specific peers where the chosen services are actually instantiated based on the dynamic, composite and distributed performance information. The model is designed and implemented in a fully distributed and self-organizing fashion. Conducting extensive simulations of a large-scale P2P system (10/sup 4/ peers), we show that our proposed model and algorithms achieve better performance than several common heuristic algorithms.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
MySRB and SRB - components of a Data Grid Distributed computing with load-managed active storage Using kernel couplings to predict parallel application performance BioGRID - An European grid for molecular biology Grid services in action: grid enabled optimisation and design search
×
引用
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