SpiderNet: An integrated peer-to-peer service composition framework

被引:59
作者
Gu, XH [1 ]
Nahrstedt, K [1 ]
Yu, B [1 ]
机构
[1] Univ Illinois, Dept Comp Sci, Urbana, IL 61801 USA
来源
13TH IEEE INTERNATIONAL SYMPOSIUM ON HIGH PERFORMANCE DISTRIBUTED COMPUTING, PROCEEDINGS | 2004年
关键词
D O I
10.1109/HPDC.2004.1323507
中图分类号
TP301 [理论、方法];
学科分类号
081202 ;
摘要
Service composition is highly desirable in peer-to-peer (P2P) systems where application services are naturally dispersed on distributed peers. However it is challenging to provide high quality and failure resilient service composition in P2P systems due to the decentralization requirement and dynamic peer arrivalsIdepartures. In this paper we present an integrated P2P service composition framework called SpiderNet to address the challenges. At service setup phase, SpiderNet performs a novel bounded composition probing protocol to provide scalable quality-aware and resource-efficient service composition in a fully, distributed fashion. Moreover SpiderNet supports directed acyclic graph composition topologies and explores exchangeable composition orders for enhanced service quality During service runtime, SpiderNet proivides proactive failure recovery to overcome dynamic changes (e.g., peer departures) in P2P systems. The proactive failure recovery scheme maintains a small number of dynamically selected backup compositions to achieve quick failure recovery for soft realtime streaming applications. We have implemented a prototype of SpiderNet and conducted extensive experiments using both large-scale simulations and wide-area network testbed. Experimental results show the feasibility and efficiency of the SpiderNet service composition solution for P2Psystems.
引用
收藏
页码:110 / 119
页数:10
相关论文
共 22 条
[1]  
[Anonymous], 1979, Computers and Intractablity: A Guide to the Theoryof NP-Completeness
[2]  
CHANDRA P, 2001, IEEE NETWORK MAGAZIN, V15
[3]   The Mobius framework and its implementation [J].
Deavours, DD ;
Clark, G ;
Courtney, T ;
Daly, D ;
Derisavi, S ;
Doyle, JM ;
Sanders, WH ;
Webster, PG .
IEEE TRANSACTIONS ON SOFTWARE ENGINEERING, 2002, 28 (10) :956-969
[4]  
Deelman E., 2003, J GRID COMPUT, V1, P25, DOI [DOI 10.1023/A:1024000426962, 10.1023/A:1024000426962]
[5]  
FOSTER I, 1997, INT J SUPERCOMPUTER, V11
[6]  
FU XD, 2001, P 3 USENIX S INT TEC
[7]  
GRIBBLE S, 2001, J COMPUTER NETWORKS, V35
[8]  
GU X, 2003, P IEEE 23 INT C DIST
[9]  
GU X, 2002, P 11 IEEE INT HIGH P
[10]  
GU X, 2002, P IEEE 22 INT C DIST