2012 Seventh International Conference on P2P, Parallel, Grid, Cloud and Internet Computing最新文献_第5页

Using of Machine Learning into Cloud Environment (A Survey): Managing and Scheduling of Resources in Cloud Systems 机器学习在云环境中的应用(综述):云系统中资源的管理和调度

2012 Seventh International Conference on P2P, Parallel, Grid, Cloud and Internet Computing Pub Date : 2012-11-12 DOI: 10.1109/3PGCIC.2012.69

Elham Hormozi, H. Hormozi, M. Akbari, M. S. Javan

引用次数: 17

WiFiTag: Direct Link from the Real World to Online Digital Contents WiFiTag:从现实世界到在线数字内容的直接链接

2012 Seventh International Conference on P2P, Parallel, Grid, Cloud and Internet Computing Pub Date : 2012-11-12 DOI: 10.1109/3PGCIC.2012.70

Y. Arakawa, Yuki Sonoda, S. Tagashira, Akira Fukuda

{"title":"WiFiTag: Direct Link from the Real World to Online Digital Contents","authors":"Y. Arakawa, Yuki Sonoda, S. Tagashira, Akira Fukuda","doi":"10.1109/3PGCIC.2012.70","DOIUrl":"https://doi.org/10.1109/3PGCIC.2012.70","url":null,"abstract":"WiFiTag is a simple and low cost solution for associating the real world to the online media such as web sites and YouTube. Our idea is to redirect a user's access based on the information of surrounding WiFi access points. Compared with WiFi-based indoor positioning system, our system requires no calculation and no much access points. This is because our system associates the digital content not with the location but with the AP itself. as the information of AP, we use ESSID, BSSID, and RSSI. by uploading a scanned WiFi information to the WiFiTag server, a terminal can get the proper URL as a response. Relationship between the WiFiTag and the URL have been defined ahead. WiFiTag realize \"real to virtual\" connection easily. for example, by associating lab's SSID to lab's HP, a visitor can access a lab's HP easily and directly, when the visitor comes to our lab. a camera required for QR code don't need for our system. in addition, a special card reader and touch action required for NFC are also unnecessary. If WiFi has already exist, no additional cost is necessary for our system. in this paper, we describe a overall concept of WiFiTag and show the availability and feasibility of our proposed system through some experimental evaluation results.","PeriodicalId":364233,"journal":{"name":"2012 Seventh International Conference on P2P, Parallel, Grid, Cloud and Internet Computing","volume":"115 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-11-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122032300","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}

引用次数: 4

A Data Reception Method to Reduce Interruption Time for Model and Motion Separated Data in P2P Streaming Environments 一种减少P2P流环境中模型和运动分离数据中断时间的数据接收方法

2012 Seventh International Conference on P2P, Parallel, Grid, Cloud and Internet Computing Pub Date : 2012-11-12 DOI: 10.1109/3PGCIC.2012.1

Masahiro Yokoyama, T. Yoshihisa, T. Hara, S. Nishio

引用次数: 0

Analysis of the BitTorrent Protocol Modified with Multicast 基于组播的bt协议改进分析

2012 Seventh International Conference on P2P, Parallel, Grid, Cloud and Internet Computing Pub Date : 2012-11-12 DOI: 10.1109/3PGCIC.2012.11

E. Costa-Montenegro, C. López-Bravo, P. Rodríguez-Hernández, Ana Belén Barragáns-Martínez

{"title":"Analysis of the BitTorrent Protocol Modified with Multicast","authors":"E. Costa-Montenegro, C. López-Bravo, P. Rodríguez-Hernández, Ana Belén Barragáns-Martínez","doi":"10.1109/3PGCIC.2012.11","DOIUrl":"https://doi.org/10.1109/3PGCIC.2012.11","url":null,"abstract":"Peer to Peer (P2P) computer networks rely on direct connections between participants instead of conventional centralized resources. These networks are useful for many purposes, but the killer application nowadays is file sharing. BitTorrent is a very popular protocol for this matter. In this paper, we use a multi-agent model of a BitTorrent network. In it, each BitTorrent client is an agent that interacts with other agents and reacts autonomously, following the same decision algorithms as a real client. Their goals are downloading contents in the shortest possible time and sharing them with other agents. The use of this multi-agent model allows us to introduce modifications to the protocol. We have modified this model to use multicast. A multicast transmission consists in sending information in a network to multiple destinations simultaneously, using a more efficient strategy: to send the message on each link of the network only once and to create copies when the links to the destinations are divided. We have evaluated how BitTorrent performs using multicast and compared to its normal behavior.","PeriodicalId":364233,"journal":{"name":"2012 Seventh International Conference on P2P, Parallel, Grid, Cloud and Internet Computing","volume":"9 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-11-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124301044","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}

引用次数: 0

Complementary Piece-Based Buffer Map for P2P VoDs Supporting VCR Operations 支持VCR操作的基于互补块的P2P VoDs缓冲映射

2012 Seventh International Conference on P2P, Parallel, Grid, Cloud and Internet Computing Pub Date : 2012-11-12 DOI: 10.1109/3PGCIC.2012.21

Ryusuke Uedera, S. Fujita

引用次数: 1

BPEX: Localizing BitTorrent Traffic via Biased Peer Exchange BPEX:通过有偏差的对等交换本地化BitTorrent流量

2012 Seventh International Conference on P2P, Parallel, Grid, Cloud and Internet Computing Pub Date : 2012-11-12 DOI: 10.1109/3PGCIC.2012.15

Masahiro Yoshida, A. Nakao

引用次数: 0

MIP Model Scheduling for BSP Parallel Applications on Multi-cluster Environments 多集群环境下BSP并行应用的MIP模型调度

2012 Seventh International Conference on P2P, Parallel, Grid, Cloud and Internet Computing Pub Date : 2012-11-12 DOI: 10.1109/3PGCIC.2012.43

H. Blanco, F. Guirado, J. L. Lerida, V. M. Albornoz

引用次数: 2

P2P Botnet Detection through Malicious Fast Flux Network Identification 基于恶意快速通量网络识别的P2P僵尸网络检测

2012 Seventh International Conference on P2P, Parallel, Grid, Cloud and Internet Computing Pub Date : 2012-11-12 DOI: 10.1109/3PGCIC.2012.48

David Zhao, I. Traoré

引用次数: 17

Large-Scale Mining of Co-occurrences: Challenges and Solutions 共现矿的大规模开采:挑战与解决方案

2012 Seventh International Conference on P2P, Parallel, Grid, Cloud and Internet Computing Pub Date : 2012-11-12 DOI: 10.1109/3PGCIC.2012.38

Ian Sandler, Alex Thomo

{"title":"Large-Scale Mining of Co-occurrences: Challenges and Solutions","authors":"Ian Sandler, Alex Thomo","doi":"10.1109/3PGCIC.2012.38","DOIUrl":"https://doi.org/10.1109/3PGCIC.2012.38","url":null,"abstract":"The ability to extract frequent pairs from a set of baskets (or frequent word co-occurrences from a set of documents) is one of the fundamental building blocks of data mining. When the number of items in a given basket is relatively small the problem is trivial. Even when dealing with millions of baskets it is still trivial providing that the number of unique items in the basket set is small. The problem becomes much more challenging when we deal with millions of baskets, each containing hundreds of items that are part of a set of millions of potential items. Especially when we are looking for highly correlated results at extremely low support levels. A particularly difficult case is when \"items\" are words and \"baskets\" are long documents in a very large text corpus. For 17 years the Direct Hashing and Pruning Park Chen Yu (PCY) Algorithm has been the principal technique used when there are billions of potential pairs that need to be counted. In this paper we show new approaches that allow us to take full advantage of both multi-core and multi-CPU setups for cases where PCY fails and Map-Reduce struggles, offering excellent performance scaling when the number of processors, unique items and items per transaction are at their highest. We believe that our approaches have much broader applicability in the field of co-occurrence counting, and can be used to generate much more interesting results when mining very large data sets.","PeriodicalId":364233,"journal":{"name":"2012 Seventh International Conference on P2P, Parallel, Grid, Cloud and Internet Computing","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-11-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131345170","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}

引用次数: 2

P2P Live Streaming Distribution System with Fast Content Switching and Category-Based Recommendation Function 具有快速内容切换和分类推荐功能的P2P直播分发系统

2012 Seventh International Conference on P2P, Parallel, Grid, Cloud and Internet Computing Pub Date : 2012-11-12 DOI: 10.1109/3PGCIC.2012.49

Daishi Kondo, Akihiro Fujimoto, Y. Hirota, H. Tode, K. Murakami

{"title":"P2P Live Streaming Distribution System with Fast Content Switching and Category-Based Recommendation Function","authors":"Daishi Kondo, Akihiro Fujimoto, Y. Hirota, H. Tode, K. Murakami","doi":"10.1109/3PGCIC.2012.49","DOIUrl":"https://doi.org/10.1109/3PGCIC.2012.49","url":null,"abstract":"Live streaming distribution services have spread as one of the most popular services. The technique of creating contents has been developed, and users can use it easily. Accordingly, the number of contents rapidly increased. In the existing content distribution system, users must select an interesting content from a large amount of contents in the Internet. It takes long time to find out the most interesting content. Moreover, when they switch to other content, it takes long delay because they need a procedure of joining another distribution network anew. Thus, the system which helps users view satisfied contents and provides fast content switching service is needed. In this paper, we introduce a dedicated server to help users switch to another desired content. We also propose the system which recommends real-time contents on the basis of category information and provides fast content switching service by maintaining reserved peers in advance. Our simulation results show that the proposed system can provide satisfying contents to all users with short delay.","PeriodicalId":364233,"journal":{"name":"2012 Seventh International Conference on P2P, Parallel, Grid, Cloud and Internet Computing","volume":"4 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-11-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132524274","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}

引用次数: 2