2012 IEEE 11th International Symposium on Network Computing and Applications最新文献_第4页

Dynamic Semantic Data Replication for K-Random Search in Peer-to-Peer Networks 对等网络中k -随机搜索的动态语义数据复制

2012 IEEE 11th International Symposium on Network Computing and Applications Pub Date : 2012-08-23 DOI: 10.1109/NCA.2012.18

Xiaoqi Cao, M. Klusch

引用次数: 9

WebCloud: Recruiting Social Network Users to Assist in Content Distribution WebCloud:招募社交网络用户协助内容分发

2012 IEEE 11th International Symposium on Network Computing and Applications Pub Date : 2012-08-23 DOI: 10.1109/NCA.2012.41

Fangfei Zhou, L. Zhang, Eric Franco, A. Mislove, Richard Revis, Ravi Sundaram

{"title":"WebCloud: Recruiting Social Network Users to Assist in Content Distribution","authors":"Fangfei Zhou, L. Zhang, Eric Franco, A. Mislove, Richard Revis, Ravi Sundaram","doi":"10.1109/NCA.2012.41","DOIUrl":"https://doi.org/10.1109/NCA.2012.41","url":null,"abstract":"Today, the data exchanged over online social networks (OSNs) represents a significant fraction of Internet traffic. However, OSN content is different from more traditional web content, as it is more likely to be generated at the edge of the network, to be exchanged within a local geographic region, and to possess a more even popularity distribution with fewer popular objects. Unfortunately, most OSNs still use largely centralized approaches to distribute content (e.g., CDNs and web caches), resulting in lower performance due to the different workload. In this paper, we take a first step towards addressing this situation by proposing Web Cloud, a content distribution system for OSNs that works by repurposing client web browsers to help serve content to others. When a user browses content, Web Cloud tries to serve the request from one of that user's friends' browsers, instead of from the OSN directly. Unlike other systems, Web Cloud works with existing browsers and does not require any plug-ins, and therefore can be directly applied to today's OSNs. We demonstrate the practicality of Web Cloud with micro benchmarks, simulations of a Facebook deployment, a real-world deployment, and evaluations of a proof-of-concept iOS app.","PeriodicalId":242424,"journal":{"name":"2012 IEEE 11th International Symposium on Network Computing and Applications","volume":"60 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-08-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132144225","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}

引用次数: 22

Deploying Virtual Clusters through P2P-based Content Distribution 通过基于p2p的内容分发部署虚拟集群

2012 IEEE 11th International Symposium on Network Computing and Applications Pub Date : 2012-08-23 DOI: 10.1109/NCA.2012.47

I. Chang-Yen, N. Tzeng

引用次数: 1

Modelling Web-server Flash Events 建模web服务器Flash事件

2012 IEEE 11th International Symposium on Network Computing and Applications Pub Date : 2012-08-23 DOI: 10.1109/NCA.2012.24

Sajal Bhatia, G. Mohay, D. Schmidt, Alan B. Tickle

{"title":"Modelling Web-server Flash Events","authors":"Sajal Bhatia, G. Mohay, D. Schmidt, Alan B. Tickle","doi":"10.1109/NCA.2012.24","DOIUrl":"https://doi.org/10.1109/NCA.2012.24","url":null,"abstract":"A Flash Event (FE) represents a period of time when a web-server experiences a dramatic increase in incoming traffic, either following a newsworthy event that has prompted users to locate and access it, or as a result of redirection from other popular web or social media sites. This usually leads to network congestion and Quality-of-Service (QoS) degradation. These events can be mistaken for Distributed Denial-of-Service (DDoS) attacks aimed at disrupting the server. Accurate detection of FEs and their distinction from DDoS attacks is important, since different actions need to be undertaken by network administrators in these two cases. However, lack of public domain FE datasets hinders research in this area. In this paper we present a detailed study of flash events and classify them into three broad categories. In addition, the paper describes FEs in terms of three key components: the volume of incoming traffic, the related source IP-addresses, and the resources being accessed. We present such a FE model with minimal parameters and use publicly available datasets to analyse and validate our proposed model. The model can be used to generate different types of FE traffic, closely approximating real-world scenarios, in order to facilitate research into distinguishing FEs from DDoS attacks.","PeriodicalId":242424,"journal":{"name":"2012 IEEE 11th International Symposium on Network Computing and Applications","volume":"31 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-08-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116289733","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}

引用次数: 18

A Pipelining Approach to Informed Prefetching in Distributed Multi-level Storage Systems 分布式多级存储系统中知情预取的流水线方法

2012 IEEE 11th International Symposium on Network Computing and Applications Pub Date : 2012-08-23 DOI: 10.1109/NCA.2012.26

M. A. Assaf, Mohammed I. Alghamdi, Xunfei Jiang, Ji Zhang, X. Qin

{"title":"A Pipelining Approach to Informed Prefetching in Distributed Multi-level Storage Systems","authors":"M. A. Assaf, Mohammed I. Alghamdi, Xunfei Jiang, Ji Zhang, X. Qin","doi":"10.1109/NCA.2012.26","DOIUrl":"https://doi.org/10.1109/NCA.2012.26","url":null,"abstract":"In this paper, we present an informed prefetching technique called IPODS that makes use of application-disclosed access patterns to prefetch hinted blocks in distributed multi-level storage systems. We develop a prefetching pipeline in IPODS, where an informed prefetching process is divided into a set of independent prefetching steps among multiple storage levels in a distributed system. In the IPODS system, while data blocks are prefetched from hard disks to memory buffers in remote storage servers, data blocks buffered in the servers are prefetched through networks to clients' local cache. We show that these two prefetching steps can be handled in a pipelining manner to improve I/O performance of distributed storage systems. Our IPODS technique differs itself from existing prefetching schemes in two ways. First, IPODS reduces applications' I/O stalls by keeping hinted data in clients' local caches and storage servers' fast buffers (e.g., solid state disks). Second, in a prefetching pipeline, multiple informed prefetching mechanisms semi-dependently coordinate to fetch blocks (1) from low-level (slow) to high-level (fast) storage devices in servers and (2) from high-level devices in servers to clients' local cache. The prefetching pipeline in IPODS judiciously hides network latencies in distributed storage systems, thereby reducing the overall I/O access time in distributed systems. Using a wide range of real-world I/O traces, our experiments show that IPODS can improve noticeably I/O performance of distributed storage systems.","PeriodicalId":242424,"journal":{"name":"2012 IEEE 11th International Symposium on Network Computing and Applications","volume":"8 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-08-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124475797","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}

引用次数: 10

Cluster-Based Fast Broadcast in Duty-Cycled Wireless Sensor Networks 无线传感器网络中基于集群的快速广播

2012 IEEE 11th International Symposium on Network Computing and Applications Pub Date : 2012-08-23 DOI: 10.1109/NCA.2012.21

Mustapha Khiati, D. Djenouri

引用次数: 6

Phoenix: A Protocol for Seamless Client Mobility in Publish/Subscribe Phoenix:发布/订阅中实现无缝客户端移动的协议

2012 IEEE 11th International Symposium on Network Computing and Applications Pub Date : 2012-08-23 DOI: 10.1109/NCA.2012.37

Zigor Salvador, M. Larrea, A. Lafuente

引用次数: 10

Protocol Proof Checking Simplified with SMT 用SMT简化协议证明检查

2012 IEEE 11th International Symposium on Network Computing and Applications Pub Date : 2012-08-23 DOI: 10.1109/NCA.2012.46

M. Tuttle, A. Goel

引用次数: 7

Performance Aspects of Data Transfer in a New Networked I/O Architecture 新型网络化I/O体系结构中数据传输的性能方面

2012 IEEE 11th International Symposium on Network Computing and Applications Pub Date : 2012-08-23 DOI: 10.1109/NCA.2012.23

C. Taylor, J. Pasquale

{"title":"Performance Aspects of Data Transfer in a New Networked I/O Architecture","authors":"C. Taylor, J. Pasquale","doi":"10.1109/NCA.2012.23","DOIUrl":"https://doi.org/10.1109/NCA.2012.23","url":null,"abstract":"We present performance results of a new distributed I/O software architecture to support remote applications interacting with local I/O devices. The architecture emphasizes network transparency and ease of customization/extensibility in support of the vastly different needs of various applications and devices that can benefit from remote I/O. Networked I/O is achieved via a networked device driver that is split into two parts, one on each side of the network. An I/O stream that is sourced at one end and sinked at the other may be modified by a set of pipelined transformation modules. Each module comes in a pair, one on each side of the network, with one side typically applying some operation and the other side applying a corresponding one, such as encoding and decoding the format of the data or pausing and resuming the sending of messages. Because of the paired nature of transformation modules, the system is capable of supporting the modification of the I/O stream in a variety of ways to compensate for network issues, one of the key problems of remote I/O, while remaining transparent to the application. We show that even with an implementation that operates almost entirely at user level (i.e., outside the operating system), good levels of performance that are adequate for even high intensity I/O, both in terms of efficiency and throughput, can be achieved.","PeriodicalId":242424,"journal":{"name":"2012 IEEE 11th International Symposium on Network Computing and Applications","volume":"99 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-08-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134078934","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}

引用次数: 1

ASAP: An Aggressive SpeculAtive Protocol for Actively Replicated Transactional Systems 主动复制事务系统的主动推测协议

2012 IEEE 11th International Symposium on Network Computing and Applications Pub Date : 2012-08-23 DOI: 10.1109/NCA.2012.45

R. Palmieri, F. Quaglia, P. Romano

{"title":"ASAP: An Aggressive SpeculAtive Protocol for Actively Replicated Transactional Systems","authors":"R. Palmieri, F. Quaglia, P. Romano","doi":"10.1109/NCA.2012.45","DOIUrl":"https://doi.org/10.1109/NCA.2012.45","url":null,"abstract":"Recent advances in the field of replicated, fault tolerant transactional systems make systematic use of Optimistic Atomic Broadcast (OAB) group communication primitives in order to coordinate the replicas. According to this scheme, the replicas gain information on the existence of transactional requests before a final and global agreement is reached on the transaction serialization order. Hence, speculative processing schemes can be exploited in order to maximize the overlap between local computation and distributed coordination activities. In this article we present ASAP, an innovative Aggressive SpeculAtive Protocol, which exhibits the following two peculiarities: (A) it allows speculating along different transaction serialization orders, thus increasing the likelihood of successful overlap between local processing and coordination in case of mismatches between the optimistic and the final delivery sequence of incoming requests, (B) it speculates along chains of conflicting transactions, tracking data dependencies among transactions via an innovative concurrency control mechanism, which allows determining in a timely fashion the alternative serialization orders to be speculatively explored. Via a simulation study in the context of Software Transactional Memory systems we show ASAP can achieve robust performance independently of the likelihood of reorder between optimistic and final deliveries, providing remarkable performance improvements (enhancing the maximum sustainable throughput up to a 2x factor) with respect to state of the art speculative replication protocols.","PeriodicalId":242424,"journal":{"name":"2012 IEEE 11th International Symposium on Network Computing and Applications","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-08-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126174058","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}

引用次数: 5