Many peer-to-peer file sharing systems have been proposed to take the locality and heterogeneity into account. The two-layered architecture is one of the most widespread systems with abilities by classifying peers into groups and serving some powerful peers as the super peers. In order to communicate with other sets of super peers, each super peer has to connect with all the other super peers within its neighboring group or other groups by some gateway-like super peers. However, it may be the problem of the single-point-of-failure if using peers as the gateway-like peers. In this paper, we propose a distributed, self-organized and load-balanced communication method - M-Ring. In this method, each super peer connects with other sets of super peers within its neighboring group by constructing its link table. Also, each super peer in the different groups has a unique identity within the same identity space. Besides, we notice a "overlap handle scope" feature while all super peers who are in the different groups are in the same identity space. We use this feature to enhance the efficiency of query of super peers. Our method can reduce the total requirements of storage space and bandwidth by storing different portion of metadata. The simulation results show that our approach efficiently reduces the overhead of connections among super peers within their neighboring groups.
{"title":"M-Ring: A Distributed, Self-Organized, Load-Balanced Communication Method on Super Peer Network","authors":"Tsung-Han Lin, Tsung-Hsuan Ho, Yu-Wei Chan, Yeh-Ching Chung","doi":"10.1109/I-SPAN.2008.30","DOIUrl":"https://doi.org/10.1109/I-SPAN.2008.30","url":null,"abstract":"Many peer-to-peer file sharing systems have been proposed to take the locality and heterogeneity into account. The two-layered architecture is one of the most widespread systems with abilities by classifying peers into groups and serving some powerful peers as the super peers. In order to communicate with other sets of super peers, each super peer has to connect with all the other super peers within its neighboring group or other groups by some gateway-like super peers. However, it may be the problem of the single-point-of-failure if using peers as the gateway-like peers. In this paper, we propose a distributed, self-organized and load-balanced communication method - M-Ring. In this method, each super peer connects with other sets of super peers within its neighboring group by constructing its link table. Also, each super peer in the different groups has a unique identity within the same identity space. Besides, we notice a \"overlap handle scope\" feature while all super peers who are in the different groups are in the same identity space. We use this feature to enhance the efficiency of query of super peers. Our method can reduce the total requirements of storage space and bandwidth by storing different portion of metadata. The simulation results show that our approach efficiently reduces the overhead of connections among super peers within their neighboring groups.","PeriodicalId":305776,"journal":{"name":"2008 International Symposium on Parallel Architectures, Algorithms, and Networks (i-span 2008)","volume":"30 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-05-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121492873","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
The interconnection network plays a critical role in the cost and performance of a high performance parallel computer and it is closely related with signaling technology. Electrical signaling is inexpensive but limited in range by the frequency dependent attenuation. Emerging optical technology enables new topologies by allowing links to cover large distances but at a significant premium in cost. In addition, parallel transmission presents low latency but its frequency limited by the timing skew. Serial transmission greatly improves the signaling rate but it needs added latency to re-synchronize data. This paper describes the reliable opto-electronic hybrid interconnection network (ROEHIN). ROEHIN exploits emerging high-speed optical and electrical links, parallel and serial transmission to provide cost effective scalability. The ROEHIN router is an 8 times 8 ASIC, which supports adaptive source-base routing and multicast communication. The ROEHIN topology and packaging takes advantage of signaling technology and provides graceful degradation in the presence of faults.
{"title":"Reliable Opto-Electronic Hybrid Interconnection Network","authors":"Liquan Xiao, Kefei Wang","doi":"10.1109/I-SPAN.2008.16","DOIUrl":"https://doi.org/10.1109/I-SPAN.2008.16","url":null,"abstract":"The interconnection network plays a critical role in the cost and performance of a high performance parallel computer and it is closely related with signaling technology. Electrical signaling is inexpensive but limited in range by the frequency dependent attenuation. Emerging optical technology enables new topologies by allowing links to cover large distances but at a significant premium in cost. In addition, parallel transmission presents low latency but its frequency limited by the timing skew. Serial transmission greatly improves the signaling rate but it needs added latency to re-synchronize data. This paper describes the reliable opto-electronic hybrid interconnection network (ROEHIN). ROEHIN exploits emerging high-speed optical and electrical links, parallel and serial transmission to provide cost effective scalability. The ROEHIN router is an 8 times 8 ASIC, which supports adaptive source-base routing and multicast communication. The ROEHIN topology and packaging takes advantage of signaling technology and provides graceful degradation in the presence of faults.","PeriodicalId":305776,"journal":{"name":"2008 International Symposium on Parallel Architectures, Algorithms, and Networks (i-span 2008)","volume":"15 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-05-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116898918","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Due to the increasing need for service personalization in pervasive environments, the management of user's contextual media preferences becomes an important issue. In this paper, we present a framework for managing ambient preferences, which is a continuously updated set of attributes reflecting user's need and expectations for different media services in different contexts. These attributes are dynamically collected and updated based on the interactions of the users in distributed environments. The proposed framework provides mechanisms to store and share these preferences in order to provide personalized services to the user according to the different contextual situations. We demonstrate the development of the framework, its implementation and usage in distributed environment settings.
{"title":"Management of Ambient Media Preferences in Distributed Environments for Service Personalization","authors":"M. A. Hossain, P. Atrey, Abdulmotaleb El Saddik","doi":"10.1109/I-SPAN.2008.33","DOIUrl":"https://doi.org/10.1109/I-SPAN.2008.33","url":null,"abstract":"Due to the increasing need for service personalization in pervasive environments, the management of user's contextual media preferences becomes an important issue. In this paper, we present a framework for managing ambient preferences, which is a continuously updated set of attributes reflecting user's need and expectations for different media services in different contexts. These attributes are dynamically collected and updated based on the interactions of the users in distributed environments. The proposed framework provides mechanisms to store and share these preferences in order to provide personalized services to the user according to the different contextual situations. We demonstrate the development of the framework, its implementation and usage in distributed environment settings.","PeriodicalId":305776,"journal":{"name":"2008 International Symposium on Parallel Architectures, Algorithms, and Networks (i-span 2008)","volume":"160 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-05-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121261031","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
京公网安备 11010802042870号
京ICP备2023020795号-1
扫码关注我们
求助内容：
应助结果提醒方式：